Karol Suchan

According to our database1, Karol Suchan
  • authored at least 34 papers between 2005 and 2015.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2015
Minimum Size Tree-decompositions.
Electronic Notes in Discrete Mathematics, 2015

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

Complexity of splits reconstruction for low-degree trees.
Discrete Applied Mathematics, 2015

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

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

2013
Towards optimal kernel for connected vertex cover in planar graphs.
Discrete Applied Mathematics, 2013

A Unified Approach for Different Tasks on Rings in Robot-Based Computing Systems.
Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

2012
Distributed computing of efficient routing schemes in generalized chordal graphs.
Theor. Comput. Sci., 2012

Allowing each node to communicate only once in a distributed system: shared whiteboard models.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

k-Gap Interval Graphs.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
k-Gap Interval Graphs
CoRR, 2011

Towards optimal kernel for connected vertex cover in planar graphs
CoRR, 2011

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

On Dissemination Thresholds in Regular and Irregular Graph Classes.
Algorithmica, 2011

Complexity of Splits Reconstruction for Low-Degree Trees.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

2010
Pursuing a fast robber on a graph.
Theor. Comput. Sci., 2010

Adding a referee to an interconnection network: What can(not) be computed in one round
CoRR, 2010

Complexity of Splits Reconstruction for Low-Degree Trees
CoRR, 2010

2009
Minimal interval completion through graph exploration.
Theor. Comput. Sci., 2009

Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs.
Proceedings of the Structural Information and Communication Complexity, 2009

Computing Pathwidth Faster Than 2n.
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
Minimal proper interval completions.
Inf. Process. Lett., 2008

Fast Robber in Planar Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

On Dissemination Thresholds in Regular and Irregular Graph Classes.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007
On powers of graphs of bounded NLC-width (clique-width).
Discrete Applied Mathematics, 2007

Pathwidth of Circular-Arc Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

Characterizing Minimal Interval Completions.
Proceedings of the STACS 2007, 2007

2006
Complétions d'intervalles minimales. (Minimal interval completions).
PhD thesis, 2006

Minimal Proper Interval Completions.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

Minimal Interval Completion Through Graph Exploration.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

2005
Minimal Interval Completions.
Proceedings of the Algorithms, 2005


  Loading...