Karol Suchan

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