Search the dblp DataBase

Publications of Author

1. Jakub Cerný, Zdenek Dvorak, Vít Jelínek, Jan Kára
   Noncrossing Hamiltonian Paths in Geometric Graphs. [Citation Graph (0, 0)][DBLP]
   Graph Drawing, 2003, pp:86-97 [Conf]
   
2. Zdenek Dvorak, Vít Jelínek
   On the Complexity of the G-Reconstruction Problem. [Citation Graph (0, 0)][DBLP]
   ISAAC, 2005, pp:196-205 [Conf]
   
3. Zdenek Dvorak, Vít Jelínek, Daniel Král, Jan Kyncl, Michael E. Saks
   Three Optimal Algorithms for Balls of Three Colors. [Citation Graph (0, 0)][DBLP]
   STACS, 2005, pp:206-217 [Conf]
   
4. Jakub Cerný, Zdenek Dvorak, Vít Jelínek, Jan Kára
   Noncrossing Hamiltonian paths in geometric graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:9, pp:1096-1105 [Journal]
   
5. Vít Jelínek
   Dyck paths and pattern-avoiding matchings. [Citation Graph (0, 0)][DBLP]
   Eur. J. Comb., 2007, v:28, n:1, pp:202-213 [Journal]
   
6. 
   Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters. [Citation Graph (, )][DBLP]
   
   
7. 
   Clustered Planarity: Clusters with Few Outgoing Edges. [Citation Graph (, )][DBLP]
   
   
8. 
   The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree. [Citation Graph (, )][DBLP]
   
   
9. 
   Testing Planarity of Partially Embedded Graphs. [Citation Graph (, )][DBLP]
   
   
10. 
    The Rank-Width of the Square Grid. [Citation Graph (, )][DBLP]
    
    
11. 
    Matchings Avoiding Partial Patterns and Lattice Paths. [Citation Graph (, )][DBLP]
    
    
12. 
    The rank-width of the square grid. [Citation Graph (, )][DBLP]