Karol Suchan

Cited by

	All	Since 2019
Citations	656	226
h-index	16	8
i10-index	21	6

200520062007200820092010201120122013201420152016201720182019202020212022202320245 22 14 22 32 20 31 27 47 51 32 40 39 37 34 35 39 35 54 28

Public access

View all

3 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Nicolas NisseInria, FranceVerified email at inria.fr
Ioan TodincaUniv. Orleans, FranceVerified email at univ-orleans.fr
Ivan RapaportDiscrete Mathematics, Universidad de ChileVerified email at dim.uchile.cl
Yngve VillangerUniversity of BergenVerified email at uib.no
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Petr GolovachUniversity of BergenVerified email at ii.uib.no
Gianlorenzo D'AngeloGran Sasso Science Institute (GSSI)Verified email at gssi.it
Gabriele Di StefanoProfessor of Computer Science, University of L'Aquila, ItalyVerified email at univaq.it
Alfredo Navarra, PhDDipartimento di Matematica e Informatica, Università degli Studi di PerugiaVerified email at unipg.it
Adrian KosowskiCo-founder, CPO at PathwayVerified email at pathway.com
Pinar HeggernesProfessor of computer science, University of BergenVerified email at ii.uib.no
Jan Kratochvilprofessor, Charles university in Prague, Univerzita KarlovaVerified email at kam.mff.cuni.cz
Hernán Lespay RebolledoUniversidad Católica del NorteVerified email at ucn.cl
Fatima Zahra MoatazDocteur en informatiqueVerified email at inria.fr
Sylwia CichaczFaculty of Applied Mathematics at AGH University of KrakowVerified email at agh.edu.pl
Martín MatamalaUniversidad de ChileVerified email at uchile.cl
Jacques VerstraeteUniversity of California, San DiegoVerified email at math.ucsd.edu
Serge GaspersProfessor, UNSW Sydney, AustraliaVerified email at cse.unsw.edu.au
Júlio César Silva AraujoUniversidade Federal do CearáVerified email at mat.ufc.br
Patricio RodríguezInstitute of Education, Universidad de ChileVerified email at ciae.uchile.cl

Karol Suchan

Universidad Diego Portales

Verified email at mail.udp.cl

mathematical modelling algorithms business analytics


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Pursuing a fast robber on a graph FV Fomin, PA Golovach, J Kratochvíl, N Nisse, K Suchan Theoretical Computer Science 411 (7-9), 1167-1181, 2010	128	2010
Pathwidth of circular-arc graphs K Suchan, I Todinca International Workshop on Graph-Theoretic Concepts in Computer Science, 258-269, 2007	40	2007
k-chordal graphs: From cops and robber to compact routing via treewidth A Kosowski, B Li, N Nisse, K Suchan Algorithmica 72 (3), 758-777, 2015	37	2015
Adding a referee to an interconnection network: What can (not) be computed in one round F Becker, M Matamala, N Nisse, I Rapaport, K Suchan, I Todinca 2011 IEEE International Parallel & Distributed Processing Symposium, 508-514, 2011	37	2011
Minimal interval completions P Heggernes, K Suchan, I Todinca, Y Villanger Algorithms–ESA 2005: 13th Annual European Symposium, Palma de Mallorca …, 2005	34	2005
Computing on rings by oblivious robots: a unified approach for different tasks G d’Angelo, G Di Stefano, A Navarra, N Nisse, K Suchan Algorithmica 72, 1055-1096, 2015	33	2015
Minimal proper interval completions I Rapaport, K Suchan, I Todinca Information Processing Letters 106 (5), 195-202, 2008	29	2008
On powers of graphs of bounded NLC-width (clique-width) K Suchan, I Todinca Discrete Applied Mathematics 155 (14), 1885-1893, 2007	27	2007
Apoyando la formulación de políticas públicas y toma de decisiones en educación utilizando técnicas de análisis de datos masivos: el caso de Chile P Rodríguez, R Truffello, K Suchan, F Varela, M Matas, J Mondaca, ... BID, 2016	26	2016
Computing Pathwidth Faster Than 2ⁿ K Suchan, Y Villanger International Workshop on Parameterized and Exact Computation, 324-335, 2009	25	2009
Allowing each node to communicate only once in a distributed system: shared whiteboard models F Becker, A Kosowski, N Nisse, I Rapaport, K Suchan Proceedings of the twenty-fourth annual ACM symposium on Parallelism in …, 2012	24	2012
Fast robber in planar graphs N Nisse, K Suchan International Workshop on Graph-Theoretic Concepts in Computer Science, 312-323, 2008	24	2008
Characterizing minimal interval completions: Towards better understanding of profile and pathwidth P Heggernes, K Suchan, I Todinca, Y Villanger Annual Symposium on Theoretical Aspects of Computer Science, 236-247, 2007	24	2007
Minimal interval completion through graph exploration K Suchan, I Todinca Theoretical computer science 410 (1), 35-43, 2009	23	2009
A unified approach for different tasks on rings in robot-based computing systems G DAngelo, G Di Stefano, A Navarra, N Nisse, K Suchan 2013 IEEE International Symposium on Parallel & Distributed Processing …, 2013	18	2013
Distributed computing of efficient routing schemes in generalized chordal graphs N Nisse, I Rapaport, K Suchan Theoretical Computer Science 444, 17-27, 2012	18	2012
A case study of consistent vehicle routing problem with time windows H Lespay, K Suchan International Transactions in Operational Research 28 (3), 1135-1163, 2021	16	2021
On dissemination thresholds in regular and irregular graph classes I Rapaport, K Suchan, I Todinca, J Verstraëte Algorithmica 59 (1), 16-34, 2011	14	2011
Minimum size tree-decompositions B Li, FZ Moataz, N Nisse, K Suchan Discrete Applied Mathematics 245, 109-127, 2018	13*	2018
Minimal separators in intersection graphs K Suchan Master's thesis, Akademia Gorniczo-Hutnicza im. Stanislawa Staszica w Krakowie, 2003	13	2003

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors