Search the dblp DataBase

Publications of Author

1. Robert Babilon, Helena Nyklová, Ondrej Pangrác, Jan Vondrák
   Visibility Representations of Complete Graphs. [Citation Graph (0, 0)][DBLP]
   Graph Drawing, 1999, pp:333-340 [Conf]
   
2. Jakub Cerný, Daniel Král, Helena Nyklová, Ondrej Pangrác
   On Intersection Graphs of Segments with Prescribed Slopes. [Citation Graph (0, 0)][DBLP]
   Graph Drawing, 2001, pp:261-271 [Conf]
   
3. Zdenek Dvorak, Daniel Král, Ondrej Pangrác
   Locally Consistent Constraint Satisfaction Problems: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
   ICALP, 2004, pp:469-480 [Conf]
   
4. Daniel Král, Ondrej Pangrác
   An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
   MFCS, 2005, pp:603-614 [Conf]
   
5. Zdenek Dvorak, Jan Kára, Daniel Král, Ondrej Pangrác
   An Algorithm for Cyclic Edge Connectivity of Cubic Graphs. [Citation Graph (0, 0)][DBLP]
   SWAT, 2004, pp:236-247 [Conf]
   
6. Zdenek Dvorak, Jan Kára, Daniel Král, Ondrej Pangrác
   Complexity of Pattern Coloring of Cycle Systems. [Citation Graph (0, 0)][DBLP]
   WG, 2002, pp:164-175 [Conf]
   
7. Martin Loebl, Jirí Matousek, Ondrej Pangrác
   Triangles in random graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:289, n:1-3, pp:181-185 [Journal]
   
8. Zdenek Dvorak, Daniel Král, Ondrej Pangrác
   Locally consistent constraint satisfaction problems [Citation Graph (0, 0)][DBLP]
   Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:051, pp:- [Journal]
   
9. Zdenek Dvorak, Daniel Král, Ondrej Pangrác
   Locally consistent constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:348, n:2-3, pp:187-206 [Journal]
   
10. Daniel Král, Ondrej Pangrác, Heinz-Jürgen Voss
    A note on group colorings. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:50, n:2, pp:123-129 [Journal]
    
11. 
    Perfect Matching Preservers. [Citation Graph (, )][DBLP]
    
    
12. 
    On the complexity of paths avoiding forbidden pairs. [Citation Graph (, )][DBLP]
    
    
13. 
    Projective, affine, and abelian colorings of cubic graphs. [Citation Graph (, )][DBLP]