Karol Suchan

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 17

Top Venues

CoRR

Discret. Appl. Math.

Discret. Math. Theor. Comput. Sci.

Algorithmica

University of Orléans, France (PHD)

Education History

University of Orléans, France

PHD

Publications

Sylwia Cichacz, Agnieszka Görlich, Karol Suchan
. Discuss. Math. Graph Theory 44 (4) (2024)
J. Araujo, Frédéric Havet, Cláudia Linhares Sales, Nicolas Nisse, Karol Suchan
Semi-proper orientations of dense graphs. LAGOS (2023)
Sylwia Cichacz, Karol Suchan
Zero-sum partitions of Abelian groups of order $2^n$. Discret. Math. Theor. Comput. Sci. 25 (2023)
Hernán Lespay, Karol Suchan
Territory Design for the Multi-Period Vehicle Routing Problem with Time Windows. Comput. Oper. Res. 145 (2022)
Sebastián Muñoz-Herrera, Karol Suchan
Constrained Fitness Landscape Analysis of Capacitated Vehicle Routing Problems. Entropy 24 (1) (2022)
Hernán Lespay, Karol Suchan
A case study of consistent vehicle routing problem with time windows. Int. Trans. Oper. Res. 28 (3) (2021)
Sylwia Cichacz, Karol Suchan
Minimum k-critical bipartite graphs. Discret. Appl. Math. 302 (2021)
Hernán Lespay, Karol Suchan
Territory Design for Dynamic Multi-Period Vehicle Routing Problem with Time Windows. CoRR (2020)
Hernán Lespay, Karol Suchan
A case study of Consistent Vehicle Routing Problem with Time Windows. CoRR (2019)
Sylwia Cichacz, Karol Suchan
Vertex-Fault Tolerant Complete Matching in Bipartite graphs: the Biregular Case. CoRR (2019)
Bi Li, Fatima Zahra Moataz, Nicolas Nisse, Karol Suchan
Minimum size tree-decompositions. Discret. Appl. Math. 245 (2018)
Júlio Araújo, Guillaume Ducoffe, Nicolas Nisse, Karol Suchan
On interval number in cycle convexity. Discret. Math. Theor. Comput. Sci. 20 (1) (2018)
Serge Gaspers, Mathieu Liedloff, Maya Jakobine Stein, Karol Suchan
Complexity of splits reconstruction for low-degree trees. Discret. Appl. Math. 180 (2015)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, Karol Suchan
Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks. Algorithmica 72 (4) (2015)
Florent Becker, Adrian Kosowski, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca
Allowing each node to communicate only once in a distributed system: shared whiteboard models. Distributed Comput. 28 (3) (2015)
Bi Li, Fatima Zahra Moataz, Nicolas Nisse, Karol Suchan
Minimum Size Tree-decompositions. Electron. Notes Discret. Math. 50 (2015)
Adrian Kosowski, Bi Li, Nicolas Nisse, Karol Suchan
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth. Algorithmica 72 (3) (2015)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, Karol Suchan
A Unified Approach for Different Tasks on Rings in Robot-Based Computing Systems. IPDPS Workshops (2013)
Lukasz Kowalik, Marcin Pilipczuk, Karol Suchan
Towards optimal kernel for connected vertex cover in planar graphs. Discret. Appl. Math. 161 (7-8) (2013)
Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger
k-Gap Interval Graphs. LATIN (2012)
Adrian Kosowski, Bi Li, Nicolas Nisse, Karol Suchan
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth. ICALP (2) (2012)
Nicolas Nisse, Ivan Rapaport, Karol Suchan
Distributed computing of efficient routing schemes in generalized chordal graphs. Theor. Comput. Sci. 444 (2012)
Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan
Allowing each node to communicate only once in a distributed system: shared whiteboard models. SPAA (2012)
Lukasz Kowalik, Marcin Pilipczuk, Karol Suchan
Towards optimal kernel for connected vertex cover in planar graphs CoRR (2011)
Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan
Complexity of Splits Reconstruction for Low-Degree Trees. WG (2011)
Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstraëte
On Dissemination Thresholds in Regular and Irregular Graph Classes. Algorithmica 59 (1) (2011)
Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger
k-Gap Interval Graphs CoRR (2011)
Florent Becker, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca
Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round. IPDPS (2011)
Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan
Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power CoRR (2011)
Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Nicolas Nisse, Karol Suchan
Pursuing a fast robber on a graph. Theor. Comput. Sci. 411 (7-9) (2010)
Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan
Complexity of Splits Reconstruction for Low-Degree Trees CoRR (2010)
Florent Becker, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca
Adding a referee to an interconnection network: What can(not) be computed in one round CoRR (2010)
José R. Correa, Nicole Megow, Rajiv Raman, Karol Suchan
Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs. CTW (2009)
Nicolas Nisse, Ivan Rapaport, Karol Suchan
Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs. SIROCCO (2009)
Karol Suchan, Yngve Villanger
. IWPEC (2009)
Karol Suchan, Ioan Todinca
Minimal interval completion through graph exploration. Theor. Comput. Sci. 410 (1) (2009)
Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstraëte
On Dissemination Thresholds in Regular and Irregular Graph Classes. LATIN (2008)
Ivan Rapaport, Karol Suchan, Ioan Todinca
Minimal proper interval completions. Inf. Process. Lett. 106 (5) (2008)
Nicolas Nisse, Karol Suchan
Fast Robber in Planar Graphs. WG (2008)
Karol Suchan, Ioan Todinca
Pathwidth of Circular-Arc Graphs. WG (2007)
Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger
Characterizing Minimal Interval Completions. STACS (2007)
Karol Suchan, Ioan Todinca
On powers of graphs of bounded NLC-width (clique-width). Discret. Appl. Math. 155 (14) (2007)
Ivan Rapaport, Karol Suchan, Ioan Todinca
Minimal Proper Interval Completions. WG (2006)
Karol Suchan, Ioan Todinca
Minimal Interval Completion Through Graph Exploration. ISAAC (2006)
Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger
Minimal Interval Completions. ESA (2005)

Karol Suchan.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Karol Suchan