Attila Pór

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. Comput. Geom. 46(1): 17-28 (2013)

Michael S. Payne, Attila Pór, Pavel Valtr, David R. Wood: On the Connectivity of Visibility Graphs. Discrete & Computational Geometry 48(3): 669-681 (2012)

Molly Dunkum, Peter Hamburger, Attila Pór: Destroying cycles in digraphs. Combinatorica 31(1): 55-66 (2011)

Tobias Müller, Attila Pór, Jean-Sébastien Sereni: Graphs with Four Boundary Vertices. Electr. J. Comb. 18(1) (2011)

Zachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmovic, Ferran Hurtado, Scott Duke Kominers, Stefan Langerman, Attila Pór, David R. Wood: Every Large Point Set contains Many Collinear Points or an Empty Pentagon. Graphs and Combinatorics 27(1): 47-60 (2011)

Attila Pór, David R. Wood: On Visibility and Blockers. JoCG 1(1): 29-40 (2010)

Attila Pór, David R. Wood: Colourings of the cartesian product of graphs and multiplicative Sidon sets. Combinatorica 29(4): 449-466 (2009)

Nicolas Lichiardopol, Attila Pór, Jean-Sébastien Sereni: A Step toward the Bermond--Thomassen Conjecture about Disjoint Cycles in Digraphs. SIAM J. Discrete Math. 23(2): 979-992 (2009)

Peter Hamburger, Attila Pór, Matt Walsh: Kneser Representations of Graphs. SIAM J. Discrete Math. 23(2): 1071-1081 (2009)

Imre Bárány, Attila Pór, Pavel Valtr: Paths with No Small Angles. SIAM J. Discrete Math. 23(4): 1655-1666 (2009)

Zachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmovic, Ferran Hurtado, Scott D. Kominers, Stefan Langerman, Attila Pór, David R. Wood: Every Large Point Set contains Many Collinear Points or an Empty Pentagon. CCCG 2009: 99-102

Jirí Fiala, Jan Kratochvíl, Attila Pór: On the computational complexity of partial covers of Theta graphs. Discrete Applied Mathematics 156(7): 1143-1149 (2008)

Tobias Müller, Attila Pór, Jean-Sébastien Sereni: Lower bounding the boundary of a graph in terms of its maximum or minimum degree. Discrete Mathematics 308(24): 6581-6583 (2008)

Imre Bárány, Attila Pór, Pavel Valtr: Paths with no Small Angles. LATIN 2008: 654-663

Attila Pór, David R. Wood: No-Three-in-Line-in-3D. Algorithmica 47(4): 481-488 (2007)

Attila Pór, David R. Wood: Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets. Electronic Notes in Discrete Mathematics 28: 33-40 (2007)

Daniel Král, Edita Mácajová, Attila Pór, Jean-Sébastien Sereni: Characterization of affine Steiner triple systems and Hall triple systems. Electronic Notes in Discrete Mathematics 29: 17-21 (2007)

Daniel Král, Edita Mácajová, Attila Pór, Jean-Sébastien Sereni: Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems. Electronic Notes in Discrete Mathematics 29: 23-27 (2007)

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. WADS 2007: 458-469

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. CoRR abs/0705.3820 (2007)

Juan José Montellano-Ballesteros, Attila Pór, Ricardo Strausz: Tverberg-Type Theorems for Separoids. Discrete & Computational Geometry 35(3): 513-523 (2006)

Attila Pór, Pavel Valtr: On the positive fraction Erdos-Szekeres theorem for convex sets. Eur. J. Comb. 27(7): 1199-1205 (2006)

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. Discrete & Computational Geometry 34(3): 497-506 (2005)

Jirí Fiala, Jan Kratochvíl, Attila Pór: On the computational complexity of partial covers of Theta graphs. Electronic Notes in Discrete Mathematics 19: 79-85 (2005)

Martin Kutz, Attila Pór: Angel, Devil, and King. COCOON 2005: 925-934

Vida Dujmovic, Attila Pór, David R. Wood: Track Layouts of Graphs. Discrete Mathematics & Theoretical Computer Science 6(2): 497-522 (2004)

Attila Pór, David R. Wood: No-Three-in-Line-in-3D. Graph Drawing 2004: 395-402

Vida Dujmovic, Attila Pór, David R. Wood: Track Layouts of Graphs. CoRR cs.DM/0407033 (2004)

Attila Pór, Pavel Valtr: The Partitioned Version of the Erdös - Szekeres Theorem. Discrete & Computational Geometry 28(4): 625-637 (2002)