Karol Suchan

According to our database, Karol Suchan authored at least 34 papers between 2005 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

<i>k</i>-fault-tolerant graphs for <i>p</i> disjoint complete graphs of order <i>c</i>.

Sylwia Cichacz, Agnieszka Görlich, Karol Suchan

Discuss. Math. Graph Theory, 2024

2023

Zero-sum partitions of Abelian groups of order $2^n$.

Sylwia Cichacz, Karol Suchan

Discret. Math. Theor. Comput. Sci., 2023

Semi-proper orientations of dense graphs.

J. Araujo, Frédéric Havet, Cláudia Linhares Sales, Nicolas Nisse, Karol Suchan

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022

Constrained Fitness Landscape Analysis of Capacitated Vehicle Routing Problems.

Sebastián Muñoz-Herrera, Karol Suchan

Entropy, 2022

Territory Design for the Multi-Period Vehicle Routing Problem with Time Windows.

Hernán Lespay, Karol Suchan

Comput. Oper. Res., 2022

2021

A case study of consistent vehicle routing problem with time windows.

Hernán Lespay, Karol Suchan

Int. Trans. Oper. Res., 2021

Minimum k-critical bipartite graphs.

Sylwia Cichacz, Karol Suchan

Discret. Appl. Math., 2021

2020

Territory Design for Dynamic Multi-Period Vehicle Routing Problem with Time Windows.

Hernán Lespay, Karol Suchan

CoRR, 2020

2019

Vertex-Fault Tolerant Complete Matching in Bipartite graphs: the Biregular Case.

Sylwia Cichacz, Karol Suchan

CoRR, 2019

2018

On interval number in cycle convexity.

Júlio Araújo, Guillaume Ducoffe, Nicolas Nisse, Karol Suchan

Discret. Math. Theor. Comput. Sci., 2018

Minimum size tree-decompositions.

Bi Li, Fatima Zahra Moataz, Nicolas Nisse, Karol Suchan

Discret. Appl. Math., 2018

2015

Allowing each node to communicate only once in a distributed system: shared whiteboard models.

Florent Becker, Adrian Kosowski, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca

Distributed Comput., 2015

Complexity of splits reconstruction for low-degree trees.

Serge Gaspers, Mathieu Liedloff, Maya Jakobine Stein, Karol Suchan

Discret. Appl. Math., 2015

k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth.

Adrian Kosowski, Bi Li, Nicolas Nisse, Karol Suchan

Algorithmica, 2015

Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks.

Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, Karol Suchan

Algorithmica, 2015

2013

Towards optimal kernel for connected vertex cover in planar graphs.

Lukasz Kowalik, Marcin Pilipczuk, Karol Suchan

Discret. Appl. Math., 2013

A Unified Approach for Different Tasks on Rings in Robot-Based Computing Systems.

Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, Karol Suchan

Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

2012

Distributed computing of efficient routing schemes in generalized chordal graphs.

Nicolas Nisse, Ivan Rapaport, Karol Suchan

Theor. Comput. Sci., 2012

Allowing each node to communicate only once in a distributed system: shared whiteboard models.

Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

k-Gap Interval Graphs.

Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011

Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power

Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan

CoRR, 2011

On Dissemination Thresholds in Regular and Irregular Graph Classes.

Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstraëte

Algorithmica, 2011

Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round.

Florent Becker, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca

Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

2010

Pursuing a fast robber on a graph.

Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Nicolas Nisse, Karol Suchan

Theor. Comput. Sci., 2010

2009

Minimal interval completion through graph exploration.

Karol Suchan, Ioan Todinca

Theor. Comput. Sci., 2009

Computing Pathwidth Faster Than 2^<i>n</i>.

Karol Suchan, Yngve Villanger

Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs.

José R. Correa, Nicole Megow, Rajiv Raman, Karol Suchan

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

Minimal proper interval completions.

Ivan Rapaport, Karol Suchan, Ioan Todinca

Inf. Process. Lett., 2008

Fast Robber in Planar Graphs.

Nicolas Nisse, Karol Suchan

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

2007

On powers of graphs of bounded NLC-width (clique-width).

Karol Suchan, Ioan Todinca

Discret. Appl. Math., 2007

Pathwidth of Circular-Arc Graphs.

Karol Suchan, Ioan Todinca

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

Characterizing Minimal Interval Completions.

Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger

Proceedings of the STACS 2007, 2007

2006

Complétions d'intervalles minimales. (Minimal interval completions).

Karol Suchan

PhD thesis, 2006

2005

Minimal Interval Completions.

Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger

Proceedings of the Algorithms, 2005