Spremljaj
Karol Suchan
Karol Suchan
Universidad Diego Portales
Preverjeni e-poštni naslov na mail.udp.cl
Naslov
Navedeno
Navedeno
Leto
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
1112010
Pathwidth of circular-arc graphs
K Suchan, I Todinca
Graph-Theoretic Concepts in Computer Science: 33rd International Workshop …, 2007
372007
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
362011
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
322015
Minimal interval completions
P Heggernes, K Suchan, I Todinca, Y Villanger
Algorithms–ESA 2005: 13th Annual European Symposium, Palma de Mallorca …, 2005
292005
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
282015
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
272016
Minimal proper interval completions
I Rapaport, K Suchan, I Todinca
Information Processing Letters 106 (5), 195-202, 2008
262008
Computing Pathwidth Faster Than 2 n
K Suchan, Y Villanger
Parameterized and Exact Computation: 4th International Workshop, IWPEC 2009 …, 2009
252009
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
242012
On powers of graphs of bounded NLC-width (clique-width)
K Suchan, I Todinca
Discrete Applied Mathematics 155 (14), 1885-1893, 2007
242007
Characterizing minimal interval completions: Towards better understanding of profile and pathwidth
P Heggernes, K Suchan, I Todinca, Y Villanger
STACS 2007: 24th Annual Symposium on Theoretical Aspects of Computer Science …, 2007
232007
Minimal interval completion through graph exploration
K Suchan, I Todinca
Theoretical Computer Science 410 (1), 35-43, 2009
212009
Fast robber in planar graphs
N Nisse, K Suchan
Graph-Theoretic Concepts in Computer Science: 34th International Workshop …, 2008
212008
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
172013
Distributed computing of efficient routing schemes in generalized chordal graphs
N Nisse, I Rapaport, K Suchan
Theoretical Computer Science 444, 17-27, 2012
172012
On dissemination thresholds in regular and irregular graph classes
I Rapaport, K Suchan, I Todinca, J Verstraëte
Algorithmica 59 (1), 16-34, 2011
152011
Minimum size tree-decompositions
B Li, FZ Moataz, N Nisse, K Suchan
Discrete Applied Mathematics 245, 109-127, 2018
12*2018
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
112021
Minimal separators in intersection graphs
K Suchan
Master's thesis, Akademia Gorniczo-Hutnicza im. Stanislawa Staszica w Krakowie, 2003
112003
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20