Minimal Interval Completions. - Pinar Heggernes; Karol Suchan; Ioan Todinca; Yngve Villanger (ESA, 2005)

Complétions d'intervalles minimales. (Minimal interval completions). - Karol Suchan (2006)

Characterizing Minimal Interval Completions. - Pinar Heggernes; Karol Suchan; Ioan Todinca; Yngve Villanger (STACS, 2007)

Pathwidth of Circular-Arc Graphs. - Karol Suchan; Ioan Todinca (WG, 2007)

On powers of graphs of bounded NLC-width (clique-width). - Karol Suchan; Ioan Todinca (Discret. Appl. Math., 2007)

Fast Robber in Planar Graphs. - Nicolas Nisse; Karol Suchan (WG, 2008)

Minimal proper interval completions. - Ivan Rapaport; Karol Suchan; Ioan Todinca (Inf. Process. Lett., 2008)

Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs. - José R. Correa; Nicole Megow; Rajiv Raman 001; Karol Suchan (CTW, 2009)

Computing Pathwidth Faster Than 2n. - Karol Suchan; Yngve Villanger (IWPEC, 2009)

Minimal interval completion through graph exploration. - Karol Suchan; Ioan Todinca (Theor. Comput. Sci., 2009)

Pursuing a fast robber on a graph. - Fedor V. Fomin; Petr A. Golovach; Jan Kratochvíl; Nicolas Nisse; Karol Suchan (Theor. Comput. Sci., 2010)

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 (IPDPS, 2011)

On Dissemination Thresholds in Regular and Irregular Graph Classes. - Ivan Rapaport; Karol Suchan; Ioan Todinca; Jacques Verstraëte (Algorithmica, 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)

k-Gap Interval Graphs. - Fedor V. Fomin; Serge Gaspers; Petr A. Golovach; Karol Suchan; Stefan Szeider; Erik Jan van Leeuwen; Martin Vatshelle; Yngve Villanger (LATIN, 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 (SPAA, 2012)

Distributed computing of efficient routing schemes in generalized chordal graphs. - Nicolas Nisse; Ivan Rapaport; Karol Suchan (Theor. Comput. Sci., 2012)

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 (IPDPS Workshops, 2013)

Towards optimal kernel for connected vertex cover in planar graphs. - Lukasz Kowalik; Marcin Pilipczuk; Karol Suchan (Discret. Appl. Math., 2013)

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)

k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth. - Adrian Kosowski; Bi Li 004; Nicolas Nisse; Karol Suchan (Algorithmica, 2015)

Complexity of splits reconstruction for low-degree trees. - Serge Gaspers; Mathieu Liedloff; Maya Jakobine Stein; Karol Suchan (Discret. Appl. Math., 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)

Minimum size tree-decompositions. - Bi Li 004; Fatima Zahra Moataz; Nicolas Nisse; Karol Suchan (Discret. Appl. Math., 2018)

On interval number in cycle convexity. - Júlio Araújo 001; Guillaume Ducoffe; Nicolas Nisse; Karol Suchan (Discret. Math. Theor. Comput. Sci., 2018)

Vertex-Fault Tolerant Complete Matching in Bipartite graphs: the Biregular Case. - Sylwia Cichacz; Karol Suchan (CoRR, 2019)

Territory Design for Dynamic Multi-Period Vehicle Routing Problem with Time Windows. - Hernán Lespay; Karol Suchan (CoRR, 2020)

Minimum k-critical bipartite graphs. - Sylwia Cichacz; Karol Suchan (Discret. Appl. Math., 2021)

A case study of consistent vehicle routing problem with time windows. - Hernán Lespay; Karol Suchan (Int. Trans. Oper. Res., 2021)

Territory Design for the Multi-Period Vehicle Routing Problem with Time Windows. - Hernán Lespay; Karol Suchan (Comput. Oper. Res., 2022)

Constrained Fitness Landscape Analysis of Capacitated Vehicle Routing Problems. - Sebastián Muñoz-Herrera; Karol Suchan (Entropy, 2022)

Semi-proper orientations of dense graphs. - J. Araujo; Frédéric Havet; Cláudia Linhares Sales; Nicolas Nisse; Karol Suchan (LAGOS, 2023)

Zero-sum partitions of Abelian groups of order 2n. - Sylwia Cichacz; Karol Suchan (Discret. Math. Theor. Comput. Sci., 2023)

k-fault-tolerant graphs for p disjoint complete graphs of order c. - Sylwia Cichacz; Agnieszka Görlich; Karol Suchan (Discuss. Math. Graph Theory, 2024)

Zero-sum partitions of Abelian groups and their applications to magic- and antimagic-type labelings. - Sylwia Cichacz; Karol Suchan (Discret. Math. Theor. Comput. Sci., 2024)