The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Karol Suchan" ( http://dblp.L3S.de/Authors/Karol_Suchan )

URL (Homepage):  https://zbmath.org/authors/?q=ai:suchan.karol  Author page on DBLP  Author page in RDF  Community of Karol Suchan in ASPL-2

Publication years (Num. hits)
2005-2010 (17) 2011-2015 (17) 2018-2019 (3)
Publication types (Num. hits)
article(20) inproceedings(16) phdthesis(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 4 occurrences of 4 keywords

Results
Found 38 publication records. Showing 37 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Sylwia Cichacz, Karol Suchan Vertex-Fault Tolerant Complete Matching in Bipartite graphs: the Biregular Case. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Júlio Araújo, Guillaume Ducoffe, Nicolas Nisse, Karol Suchan On interval number in cycle convexity. Search on Bibsonomy Discrete Mathematics & Theoretical Computer Science The full citation details ... 2018 DBLP  BibTeX  RDF
1Bi Li 0004, Fatima Zahra Moataz, Nicolas Nisse, Karol Suchan Minimum size tree-decompositions. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Bi Li 0004, Fatima Zahra Moataz, Nicolas Nisse, Karol Suchan Minimum Size Tree-decompositions. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Florent 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. Search on Bibsonomy Distributed Computing The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, Karol Suchan Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks. Search on Bibsonomy Algorithmica The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Adrian Kosowski, Bi Li 0004, Nicolas Nisse, Karol Suchan k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth. Search on Bibsonomy Algorithmica The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Mathieu Liedloff, Maya Jakobine Stein, Karol Suchan Complexity of splits reconstruction for low-degree trees. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Lukasz Kowalik, Marcin Pilipczuk, Karol Suchan Towards optimal kernel for connected vertex cover in planar graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, Karol Suchan A Unified Approach for Different Tasks on Rings in Robot-Based Computing Systems. Search on Bibsonomy IPDPS Workshops The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Nicolas Nisse, Ivan Rapaport, Karol Suchan Distributed computing of efficient routing schemes in generalized chordal graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Adrian Kosowski, Bi Li 0004, Nicolas Nisse, Karol Suchan k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth. Search on Bibsonomy ICALP (2) The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger k-Gap Interval Graphs. Search on Bibsonomy LATIN The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan Allowing each node to communicate only once in a distributed system: shared whiteboard models. Search on Bibsonomy SPAA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstraëte On Dissemination Thresholds in Regular and Irregular Graph Classes. Search on Bibsonomy Algorithmica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Lukasz Kowalik, Marcin Pilipczuk, Karol Suchan Towards optimal kernel for connected vertex cover in planar graphs Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger k-Gap Interval Graphs Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan Complexity of Splits Reconstruction for Low-Degree Trees. Search on Bibsonomy WG The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Florent 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. Search on Bibsonomy IPDPS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Nicolas Nisse, Karol Suchan Pursuing a fast robber on a graph. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan Complexity of Splits Reconstruction for Low-Degree Trees Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Florent 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 Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Karol Suchan, Ioan Todinca Minimal interval completion through graph exploration. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1José R. Correa, Nicole Megow, Rajiv Raman, Karol Suchan Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs. Search on Bibsonomy CTW The full citation details ... 2009 DBLP  BibTeX  RDF
1Nicolas Nisse, Ivan Rapaport, Karol Suchan Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs. Search on Bibsonomy SIROCCO The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Karol Suchan, Yngve Villanger Computing Pathwidth Faster Than 2n. Search on Bibsonomy IWPEC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Ivan Rapaport, Karol Suchan, Ioan Todinca Minimal proper interval completions. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Nicolas Nisse, Karol Suchan Fast Robber in Planar Graphs. Search on Bibsonomy WG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Cops and robber, grid, planar graph, subdivision, minor
1Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstraëte On Dissemination Thresholds in Regular and Irregular Graph Classes. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Karol Suchan, Ioan Todinca On powers of graphs of bounded NLC-width (clique-width). Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Karol Suchan, Ioan Todinca Pathwidth of Circular-Arc Graphs. Search on Bibsonomy WG The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger Characterizing Minimal Interval Completions. Search on Bibsonomy STACS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Karol Suchan, Ioan Todinca Minimal Interval Completion Through Graph Exploration. Search on Bibsonomy ISAAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Ivan Rapaport, Karol Suchan, Ioan Todinca Minimal Proper Interval Completions. Search on Bibsonomy WG The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Karol Suchan Complétions d'intervalles minimales. (Minimal interval completions). Search on Bibsonomy 2006   RDF
1Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger Minimal Interval Completions. Search on Bibsonomy ESA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #37 of 37 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license