
Search the dblp DataBase
Karol Suchan:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger
Minimal Interval Completions. [Citation Graph (0, 0)][DBLP] ESA, 2005, pp:403414 [Conf]
 Karol Suchan, Ioan Todinca
Minimal Interval Completion Through Graph Exploration. [Citation Graph (0, 0)][DBLP] ISAAC, 2006, pp:517526 [Conf]
 Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger
Characterizing Minimal Interval Completions. [Citation Graph (0, 0)][DBLP] STACS, 2007, pp:236247 [Conf]
 Ivan Rapaport, Karol Suchan, Ioan Todinca
Minimal Proper Interval Completions. [Citation Graph (0, 0)][DBLP] WG, 2006, pp:217228 [Conf]
 Karol Suchan, Ioan Todinca
On powers of graphs of bounded NLCwidth (cliquewidth). [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:14, pp:18851893 [Journal]
Computing Pathwidth Faster Than 2^{n}. [Citation Graph (, )][DBLP]
On Dissemination Thresholds in Regular and Irregular Graph Classes. [Citation Graph (, )][DBLP]
Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs. [Citation Graph (, )][DBLP]
Pathwidth of CircularArc Graphs. [Citation Graph (, )][DBLP]
Fast Robber in Planar Graphs. [Citation Graph (, )][DBLP]
Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs. [Citation Graph (, )][DBLP]
Complexity of Splits Reconstruction for LowDegree Trees [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
