 | 2009 |
|---|
| 11 |       | J. Correa,
Nicole Megow,
R. Raman,
Karol Suchan:
Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs.
CTW 2009: 347-350 |
| 10 | | Karol Suchan,
Ioan Todinca:
Minimal interval completion through graph exploration.
Theor. Comput. Sci. 410(1): 35-43 (2009) |
| 2008 |
|---|
| 9 | | Ivan Rapaport,
Karol Suchan,
Ioan Todinca,
Jacques Verstraëte:
On Dissemination Thresholds in Regular and Irregular Graph Classes.
LATIN 2008: 24-35 |
| 8 | | Nicolas Nisse,
Karol Suchan:
Fast Robber in Planar Graphs.
WG 2008: 312-323 |
| 7 | | Ivan Rapaport,
Karol Suchan,
Ioan Todinca:
Minimal proper interval completions.
Inf. Process. Lett. 106(5): 195-202 (2008) |
| 2007 |
|---|
| 6 | | Pinar Heggernes,
Karol Suchan,
Ioan Todinca,
Yngve Villanger:
Characterizing Minimal Interval Completions.
STACS 2007: 236-247 |
| 5 | | Karol Suchan,
Ioan Todinca:
Pathwidth of Circular-Arc Graphs.
WG 2007: 258-269 |
| 4 | | Karol Suchan,
Ioan Todinca:
On powers of graphs of bounded NLC-width (clique-width).
Discrete Applied Mathematics 155(14): 1885-1893 (2007) |
| 2006 |
|---|
| 3 | | Karol Suchan,
Ioan Todinca:
Minimal Interval Completion Through Graph Exploration.
ISAAC 2006: 517-526 |
| 2 | | Ivan Rapaport,
Karol Suchan,
Ioan Todinca:
Minimal Proper Interval Completions.
WG 2006: 217-228 |
| 2005 |
|---|
| 1 | | Pinar Heggernes,
Karol Suchan,
Ioan Todinca,
Yngve Villanger:
Minimal Interval Completions.
ESA 2005: 403-414 |
