Search the dblp DataBase

Publications of Author

1. Martin Kutz, Attila Pór
   Angel, Devil, and King. [Citation Graph (0, 0)][DBLP]
   COCOON, 2005, pp:925-934 [Conf]
   
2. Attila Pór, David R. Wood
   No-Three-in-Line-in-3D. [Citation Graph (0, 0)][DBLP]
   Graph Drawing, 2004, pp:395-402 [Conf]
   
3. Vida Dujmovic, Attila Pór, David R. Wood
   Track Layouts of Graphs [Citation Graph (0, 0)][DBLP]
   CoRR, 2004, v:0, n:, pp:- [Journal]
   
4. Jan Kára, Attila Pór, David R. Wood
   On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 2005, v:34, n:3, pp:497-506 [Journal]
   
5. Juan José Montellano-Ballesteros, Attila Pór, Ricardo Strausz
   Tverberg-Type Theorems for Separoids. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 2006, v:35, n:3, pp:513-523 [Journal]
   
6. Attila Pór, Pavel Valtr
   The Partitioned Version of the Erdös - Szekeres Theorem. [Citation Graph (0, 0)][DBLP]
   Discrete & Computational Geometry, 2002, v:28, n:4, pp:625-637 [Journal]
   
7. Attila Pór, Pavel Valtr
   On the positive fraction Erdos-Szekeres theorem for convex sets. [Citation Graph (0, 0)][DBLP]
   Eur. J. Comb., 2006, v:27, n:7, pp:1199-1205 [Journal]
   
8. Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Attila Pór, Francisco Santos, Bettina Speckmann, Birgit Vogtenhuber
   Maximizing Maximal Angles for Plane Straight-Line Graphs. [Citation Graph (0, 0)][DBLP]
   WADS, 2007, pp:458-469 [Conf]
   
9. Attila Pór, David R. Wood
   No-Three-in-Line-in-3D. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2007, v:47, n:4, pp:481-488 [Journal]
   
10. Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Attila Pór, Francisco Santos, Bettina Speckmann, Birgit Vogtenhuber
    Maximizing Maximal Angles for Plane Straight-Line Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
    
11. Vida Dujmovic, Attila Pór, David R. Wood
    Track Layouts of Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2004, v:6, n:2, pp:497-522 [Journal]
    
12. 
    Every Large Point Set contains Many Collinear Points or an Empty Pentagon. [Citation Graph (, )][DBLP]
    
    
13. 
    Paths with no Small Angles. [Citation Graph (, )][DBLP]
    
    
14. 
    On the computational complexity of partial covers of Theta graphs. [Citation Graph (, )][DBLP]
    
    
15. 
    Lower bounding the boundary of a graph in terms of its maximum or minimum degree. [Citation Graph (, )][DBLP]