| 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 | 126 | 2010 |
| Pathwidth of circular-arc graphs K Suchan, I Todinca International Workshop on Graph-Theoretic Concepts in Computer Science, 258-269, 2007 | 38 | 2007 |
| 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 |
| 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 | 36 | 2015 |
| 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 | 32 | 2015 |
| Minimal interval completions P Heggernes, K Suchan, I Todinca, Y Villanger Algorithms–ESA 2005: 13th Annual European Symposium, Palma de Mallorca …, 2005 | 32 | 2005 |
| 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 2n 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 |
| 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 |
| Fast robber in planar graphs N Nisse, K Suchan International Workshop on Graph-Theoretic Concepts in Computer Science, 312-323, 2008 | 23 | 2008 |
| Minimal interval completion through graph exploration K Suchan, I Todinca Theoretical computer science 410 (1), 35-43, 2009 | 22 | 2009 |
| Distributed computing of efficient routing schemes in generalized chordal graphs N Nisse, I Rapaport, K Suchan Theoretical Computer Science 444, 17-27, 2012 | 19 | 2012 |
| 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 |
| 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 | 14 | 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 |
Nicolas NisseInria, France在 inria.fr 的电子邮件经过验证
