Search the dblp DataBase

Publications of Author

1. Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth
   Drawing Cubic Graphs with at Most Five Slopes. [Citation Graph (0, 0)][DBLP]
   Graph Drawing, 2006, pp:114-125 [Conf]
   
2. 
   Consistent digital line segments. [Citation Graph (, )][DBLP]
   
   
3. 
   Cubic Graphs Have Bounded Slope Parameter. [Citation Graph (, )][DBLP]
   
   
4. 
   Testing Additive Integrality Gaps. [Citation Graph (, )][DBLP]
   
   
5. 
   2D-TUCKER Is PPAD-Complete. [Citation Graph (, )][DBLP]
   
   
6. 
   Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers. [Citation Graph (, )][DBLP]
   
   
7. 
   Drawing cubic graphs with at most five slopes. [Citation Graph (, )][DBLP]
   
   
8. 
   Partitionability to two trees is NP-complete [Citation Graph (, )][DBLP]
   
   
9. 
   Communication Complexity [Citation Graph (, )][DBLP]
   
   
10. 
    Bin Packing via Discrepancy of Permutations [Citation Graph (, )][DBLP]
    
    
11. 
    Finding the maximum and minimum elements with one lie. [Citation Graph (, )][DBLP]
    
    
12. 
    Convex Polygons are Cover-Decomposable. [Citation Graph (, )][DBLP]
    
    
13. 
    Indecomposable Coverings with Concave Polygons. [Citation Graph (, )][DBLP]
    
    
14. 
    Polychromatic colorings of arbitrary rectangular partitions. [Citation Graph (, )][DBLP]