The Partitioned Version of the Erdös - Szekeres Theorem. - Attila Pór; Pavel Valtr 001 (Discret. Comput. Geom., 2002)

A Partitioned Version of the Erdös-Szekeres Theorem for Quadrilaterals. - Attila Pór (Discret. Comput. Geom., 2003)

No-Three-in-Line-in-3D. - Attila Pór; David R. Wood (GD, 2004)

Track Layouts of Graphs. - Vida Dujmovic; Attila Pór; David R. Wood (Discret. Math. Theor. Comput. Sci., 2004)

Angel, Devil, and King. - Martin Kutz; Attila Pór (COCOON, 2005)

On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane. - Jan Kára; Attila Pór; David R. Wood (Discret. Comput. Geom., 2005)

On the computational complexity of partial covers of Theta graphs. - Jirí Fiala 001; Jan Kratochvíl; Attila Pór (Electron. Notes Discret. Math., 2005)

Tverberg-Type Theorems for Separoids. - Juan José Montellano-Ballesteros; Attila Pór; Ricardo Strausz (Discret. Comput. Geom., 2006)

On the positive fraction Erdos-Szekeres theorem for convex sets. - Attila Pór; Pavel Valtr 001 (Eur. J. Comb., 2006)

Maximizing Maximal Angles for Plane Straight-Line Graphs. - Oswin Aichholzer; Thomas Hackl; Michael Hoffmann 001; Clemens Huemer; Attila Pór; Francisco Santos; Bettina Speckmann; Birgit Vogtenhuber (WADS, 2007)

Characterization of affine Steiner triple systems and Hall triple systems. - Daniel Král; Edita Mácajová; Attila Pór; Jean-Sébastien Sereni (Electron. Notes Discret. Math., 2007)

Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems. - Daniel Král; Edita Mácajová; Attila Pór; Jean-Sébastien Sereni (Electron. Notes Discret. Math., 2007)

Paths with no Small Angles. - Imre Bárány; Attila Pór; Pavel Valtr 001 (LATIN, 2008)

Lower bounding the boundary of a graph in terms of its maximum or minimum degree. - Tobias Müller 001; Attila Pór; Jean-Sébastien Sereni (Discret. Math., 2008)

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

Colourings of the cartesian product of graphs and multiplicative Sidon sets. - Attila Pór; David R. Wood (Comb., 2009)

Kneser Representations of Graphs. - Peter Hamburger; Attila Pór; Matt Walsh 001 (SIAM J. Discret. Math., 2009)

A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs. - Nicolas Lichiardopol; Attila Pór; Jean-Sébastien Sereni (SIAM J. Discret. Math., 2009)

On Visibility and Blockers. - Attila Pór; David R. Wood (J. Comput. Geom., 2010)

Destroying cycles in digraphs. - Molly W. Dunkum; Peter Hamburger; Attila Pór (Comb., 2011)

Graphs with Four Boundary Vertices. - Tobias Müller 001; Attila Pór; Jean-Sébastien Sereni (Electron. J. Comb., 2011)

On the Connectivity of Visibility Graphs. - Michael S. Payne; Attila Pór; Pavel Valtr 001; David R. Wood (Discret. Comput. Geom., 2012)

Curves in Rd intersecting every hyperplane at most d + 1 times. - Imre Bárány; Jirí Matousek 001; Attila Pór (SoCG, 2014)

The Proof of the Removable Pair Conjecture for Fractional Dimension. - Csaba Biró; Peter Hamburger; Attila Pór (Electron. J. Comb., 2014)

Colourful and Fractional (p, q)-theorems. - Imre Bárány; Ferenc Fodor; Luis Montejano 001; Déborah Oliveros; Attila Pór (Discret. Comput. Geom., 2014)

A fractional Helly theorem for boxes. - Imre Bárány; Ferenc Fodor; Álvaro Martínez-Pérez; Luis Montejano 001; Déborah Oliveros; Attila Pór (Comput. Geom., 2015)

Standard Examples as Subposets of Posets. - Csaba Biró; Peter Hamburger; Attila Pór (Order, 2015)

Forcing Posets with Large Dimension to Contain Large Standard Examples. - Csaba Biró; Peter Hamburger; Attila Pór; William T. Trotter (Graphs Comb., 2016)

Double Threshold Digraphs. - Peter Hamburger; Ross M. McConnell; Attila Pór; Jeremy P. Spinrad (CoRR, 2017)

Double Threshold Digraphs. - Peter Hamburger; Ross M. McConnell; Attila Pór; Jeremy P. Spinrad; Zhisheng Xu (MFCS, 2018)

Acknowledgement of priority - A fractional Helly theorem for boxes. - Imre Bárány; Ferenc Fodor; Álvaro Martínez-Pérez; Luis Montejano 001; Déborah Oliveros; Attila Pór (Comput. Geom., 2018)

An Improvement on the Rado Bound for the Centerline Depth. - Alexander Magazinov; Attila Pór (Discret. Comput. Geom., 2018)

Almost-Equidistant Sets. - Martin Balko; Attila Pór; Manfred Scheucher; Konrad J. Swanepoel; Pavel Valtr 001 (Graphs Comb., 2020)

Orientation Preserving Maps of the Square Grid. - Imre Bárány; Attila Pór; Pavel Valtr 001 (SoCG, 2021)

A new axiomatic approach to the impartial nomination problem. - Paul H. Edelman; Attila Pór (Games Econ. Behav., 2021)

Orientation preserving maps of the n × n grid. - Imre Bárány; Attila Pór; Pavel Valtr 001 (J. Comput. Geom., 2021)

Erdős-Szekeres Theorem for k-Flats. - Imre Bárány; Gil Kalai; Attila Pór (Discret. Comput. Geom., 2023)

Orientation Preserving Maps of the Square Grid II. - Imre Bárány; Attila Pór (Discret. Comput. Geom., 2024)