| 2009 |
|---|
| 12 | EE | Daniel Král,
Edita Mácajová,
Ondrej Pangrác,
André Raspaud,
Jean-Sébastien Sereni,
Martin Skoviera:
Projective, affine, and abelian colorings of cubic graphs.
Eur. J. Comb. 30(1): 53-69 (2009) |
| 2006 |
|---|
| 11 | EE | Richard A. Brualdi,
Martin Loebl,
Ondrej Pangrác:
Perfect Matching Preservers.
Electr. J. Comb. 13(1): (2006) |
| 2005 |
|---|
| 10 | EE | Daniel Král,
Ondrej Pangrác:
An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems.
MFCS 2005: 603-614 |
| 9 | EE | Daniel Král,
Ondrej Pangrác,
Heinz-Jürgen Voss:
A note on group colorings.
Journal of Graph Theory 50(2): 123-129 (2005) |
| 8 | EE | Zdenek Dvorak,
Daniel Král,
Ondrej Pangrác:
Locally consistent constraint satisfaction problems.
Theor. Comput. Sci. 348(2-3): 187-206 (2005) |
| 2004 |
|---|
| 7 | EE | Zdenek Dvorak,
Daniel Král,
Ondrej Pangrác:
Locally Consistent Constraint Satisfaction Problems: (Extended Abstract).
ICALP 2004: 469-480 |
| 6 | EE | Zdenek Dvorak,
Jan Kára,
Daniel Král,
Ondrej Pangrác:
An Algorithm for Cyclic Edge Connectivity of Cubic Graphs.
SWAT 2004: 236-247 |
| 5 | EE | Martin Loebl,
Jirí Matousek,
Ondrej Pangrác:
Triangles in random graphs.
Discrete Mathematics 289(1-3): 181-185 (2004) |
| 4 | EE | Zdenek Dvorak,
Daniel Král,
Ondrej Pangrác:
Locally consistent constraint satisfaction problems
Electronic Colloquium on Computational Complexity (ECCC)(051): (2004) |
| 2002 |
|---|
| 3 | EE | Zdenek Dvorak,
Jan Kára,
Daniel Král,
Ondrej Pangrác:
Complexity of Pattern Coloring of Cycle Systems.
WG 2002: 164-175 |
| 2001 |
|---|
| 2 | EE | Jakub Cerný,
Daniel Král,
Helena Nyklová,
Ondrej Pangrác:
On Intersection Graphs of Segments with Prescribed Slopes.
Graph Drawing 2001: 261-271 |
| 1999 |
|---|
| 1 | EE | Robert Babilon,
Helena Nyklová,
Ondrej Pangrác,
Jan Vondrák:
Visibility Representations of Complete Graphs.
Graph Drawing 1999: 333-340 |
