default search action
Karol Suchan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j20]Sylwia Cichacz
, Agnieszka Görlich, Karol Suchan
k-fault-tolerant graphs for p disjoint complete graphs of order c. Discuss. Math. Graph Theory 44(4): 1471-1484 (2024) - 2023
- [j19]Sylwia Cichacz
Zero-sum partitions of Abelian groups of order $2^n$. Discret. Math. Theor. Comput. Sci. 25 (2023) - [c17]J. Araujo, Frédéric Havet, Cláudia Linhares Sales, Nicolas Nisse, Karol Suchan
Semi-proper orientations of dense graphs. LAGOS 2023: 231-240 - 2022
- [j18]Hernán Lespay
Territory Design for the Multi-Period Vehicle Routing Problem with Time Windows. Comput. Oper. Res. 145: 105866 (2022) - [j17]Sebastián Muñoz-Herrera
Constrained Fitness Landscape Analysis of Capacitated Vehicle Routing Problems. Entropy 24(1): 53 (2022) - 2021
- [j16]Sylwia Cichacz
Minimum k-critical bipartite graphs. Discret. Appl. Math. 302: 54-66 (2021) - [j15]Hernán Lespay
A case study of consistent vehicle routing problem with time windows. Int. Trans. Oper. Res. 28(3): 1135-1163 (2021) - 2020
- [i8]Hernán Lespay, Karol Suchan:
Territory Design for Dynamic Multi-Period Vehicle Routing Problem with Time Windows. CoRR abs/2012.10506 (2020)
2010 – 2019
- 2019
- [i7]Sylwia Cichacz, Karol Suchan:
Vertex-Fault Tolerant Complete Matching in Bipartite graphs: the Biregular Case. CoRR abs/1907.04844 (2019) - [i6]Hernán Lespay, Karol Suchan:
A case study of Consistent Vehicle Routing Problem with Time Windows. CoRR abs/1912.05929 (2019) - 2018
- [j14]Bi Li
Minimum size tree-decompositions. Discret. Appl. Math. 245: 109-127 (2018) - [j13]Júlio Araújo
On interval number in cycle convexity. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - 2015
- [j12]Adrian Kosowski, Bi Li
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth. Algorithmica 72(3): 758-777 (2015) - [j11]Gianlorenzo D'Angelo
Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks. Algorithmica 72(4): 1055-1096 (2015) - [j10]Serge Gaspers
Complexity of splits reconstruction for low-degree trees. Discret. Appl. Math. 180: 89-100 (2015) - [j9]Florent Becker, Adrian Kosowski, Martín Matamala
Allowing each node to communicate only once in a distributed system: shared whiteboard models. Distributed Comput. 28(3): 189-200 (2015) - [j8]Bi Li
Minimum Size Tree-decompositions. Electron. Notes Discret. Math. 50: 21-27 (2015) - 2013
- [j7]Lukasz Kowalik
Towards optimal kernel for connected vertex cover in planar graphs. Discret. Appl. Math. 161(7-8): 1154-1161 (2013) - [c16]Gianlorenzo D'Angelo
A Unified Approach for Different Tasks on Rings in Robot-Based Computing Systems. IPDPS Workshops 2013: 667-676 - 2012
- [j6]Nicolas Nisse, Ivan Rapaport
Distributed computing of efficient routing schemes in generalized chordal graphs. Theor. Comput. Sci. 444: 17-27 (2012) - [c15]Adrian Kosowski, Bi Li, Nicolas Nisse, Karol Suchan
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth. ICALP (2) 2012: 610-622 - [c14]Fedor V. Fomin
k-Gap Interval Graphs. LATIN 2012: 350-361 - [c13]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: 11-17 - 2011
- [j5]Ivan Rapaport, Karol Suchan
On Dissemination Thresholds in Regular and Irregular Graph Classes. Algorithmica 59(1): 16-34 (2011) - [c12]Florent Becker, Martín Matamala
Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round. IPDPS 2011: 508-514 - [c11]Serge Gaspers, Mathieu Liedloff, Maya Stein
Complexity of Splits Reconstruction for Low-Degree Trees. WG 2011: 167-178 - [i5]Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan:
Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power. CoRR abs/1109.6534 (2011) - [i4]Lukasz Kowalik, Marcin Pilipczuk, Karol Suchan:
Towards optimal kernel for connected vertex cover in planar graphs. CoRR abs/1110.1964 (2011) - [i3]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 abs/1112.3244 (2011) - 2010
- [j4]Fedor V. Fomin
Pursuing a fast robber on a graph. Theor. Comput. Sci. 411(7-9): 1167-1181 (2010) - [i2]Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan:
Complexity of Splits Reconstruction for Low-Degree Trees. CoRR abs/1007.1733 (2010) - [i1]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 abs/1009.4447 (2010)
2000 – 2009
- 2009
- [j3]Karol Suchan
Minimal interval completion through graph exploration. Theor. Comput. Sci. 410(1): 35-43 (2009) - [c10]José R. Correa, Nicole Megow, Rajiv Raman, Karol Suchan:
Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs. CTW 2009: 347-350 - [c9]Karol Suchan
Computing Pathwidth Faster Than 2n. IWPEC 2009: 324-335 - [c8]Nicolas Nisse, Ivan Rapaport, Karol Suchan
Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs. SIROCCO 2009: 252-265 - 2008
- [j2]Ivan Rapaport
Minimal proper interval completions. Inf. Process. Lett. 106(5): 195-202 (2008) - [c7]Ivan Rapaport, Karol Suchan
On Dissemination Thresholds in Regular and Irregular Graph Classes. LATIN 2008: 24-35 - [c6]Nicolas Nisse, Karol Suchan
Fast Robber in Planar Graphs. WG 2008: 312-323 - 2007
- [j1]Karol Suchan
On powers of graphs of bounded NLC-width (clique-width). Discret. Appl. Math. 155(14): 1885-1893 (2007) - [c5]Pinar Heggernes, Karol Suchan, Ioan Todinca
Characterizing Minimal Interval Completions. STACS 2007: 236-247 - [c4]Karol Suchan
Pathwidth of Circular-Arc Graphs. WG 2007: 258-269 - 2006
- [b1]Karol Suchan:
Complétions d'intervalles minimales. (Minimal interval completions). University of Orléans, France, 2006 - [c3]Karol Suchan
Minimal Interval Completion Through Graph Exploration. ISAAC 2006: 517-526 - [c2]Ivan Rapaport, Karol Suchan
Minimal Proper Interval Completions. WG 2006: 217-228 - 2005
- [c1]Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger:
Minimal Interval Completions. ESA 2005: 403-414
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 01:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: