Karol Suchan
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
902010
Pathwidth of circular-arc graphs
K Suchan, I Todinca
International Workshop on Graph-Theoretic Concepts in Computer Science, 258-269, 2007
352007
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
302011
Minimal interval completions
P Heggernes, K Suchan, I Todinca, Y Villanger
European Symposium on Algorithms, 403-414, 2005
302005
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
282015
Computing Pathwidth Faster Than 2 n
K Suchan, Y Villanger
International Workshop on Parameterized and Exact Computation, 324-335, 2009
252009
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 (4), 1055-1096, 2015
242015
Characterizing minimal interval completions
P Heggernes, K Suchan, I Todinca, Y Villanger
Annual Symposium on Theoretical Aspects of Computer Science, 236-247, 2007
242007
On powers of graphs of bounded NLC-width (clique-width)
K Suchan, I Todinca
Discrete Applied Mathematics 155 (14), 1885-1893, 2007
222007
Allowing each node to communicate only once in a distributed system: shared whiteboard models
F Becker, A Kosowski, M Matamala, N Nisse, I Rapaport, K Suchan, ...
Distributed Computing 28 (3), 189-200, 2015
202015
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
172016
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
152013
Fast robber in planar graphs
N Nisse, K Suchan
International Workshop on Graph-Theoretic Concepts in Computer Science, 312-323, 2008
152008
Minimal proper interval completions
I Rapaport, K Suchan, I Todinca
International Workshop on Graph-Theoretic Concepts in Computer Science, 217-228, 2006
142006
On dissemination thresholds in regular and irregular graph classes
I Rapaport, K Suchan, I Todinca, J Verstraëte
Algorithmica 59 (1), 16-34, 2011
122011
Towards optimal kernel for connected vertex cover in planar graphs
ŁU Kowalik, M Pilipczuk, K Suchan
Discrete Applied Mathematics 161 (7-8), 1154-1161, 2013
102013
Minimal interval completion through graph exploration
K Suchan, I Todinca
International Symposium on Algorithms and Computation, 517-526, 2006
102006
Minimum size tree-decompositions
B Li, FZ Moataz, N Nisse, K Suchan
Electronic Notes in Discrete Mathematics 50, 21-27, 2015
92015
Minimal interval completion through graph exploration
K Suchan, I Todinca
Theoretical Computer Science 410 (1), 35-43, 2009
92009
Minimal proper interval completions
I Rapaport, K Suchan, I Todinca
Information Processing Letters 106 (5), 195-202, 2008
92008
The system can't perform the operation now. Try again later.
Articles 1–20