| Track layouts of graphs V Dujmović, A Pór, DR Wood Discrete Mathematics & Theoretical Computer Science 6, 2004 | 81 | 2004 |
| On 0-1 polytopes with many facets I Bárány, A Pór Advances in Mathematics 161 (2), 209-228, 2001 | 66 | 2001 |
| On the chromatic number of the visibility graph of a set of points in the plane J Kára, A Pór, DR Wood Discrete & Computational Geometry 34, 497-506, 2005 | 53 | 2005 |
| A step toward the Bermond–Thomassen conjecture about disjoint cycles in digraphs N Lichiardopol, A Pór, JS Sereni SIAM Journal on Discrete Mathematics 23 (2), 979-992, 2009 | 46 | 2009 |
| No-three-in-line-in-3D A Pór, DR Wood Algorithmica 47 (4), 481-488, 2007 | 30 | 2007 |
| On visibility and blockers A Pór, DR Wood arXiv preprint arXiv:0912.1150, 2009 | 27 | 2009 |
| Every large point set contains many collinear points or an empty pentagon Z Abel, B Ballinger, P Bose, S Collette, V Dujmović, F Hurtado, ... Graphs and combinatorics 27, 47-60, 2011 | 26 | 2011 |
| On the computational complexity of partial covers of theta graphs J Fiala, J Kratochvíl, A Pór Discrete Applied Mathematics 156 (7), 1143-1149, 2008 | 21 | 2008 |
| Colourful and Fractional (p,q)-theorems I Bárány, F Fodor, L Montejano, D Oliveros, A Pór Discrete & Computational Geometry 51 (3), 628-642, 2014 | 20 | 2014 |
| Characterisation results for Steiner triple systems and their application to edge-colourings of cubic graphs E Máčajová, A Pór, JS Sereni Canadian Journal of Mathematics 62 (2), 355-381, 2010 | 16 | 2010 |
| Kneser representations of graphs P Hamburger, A Por, M Walsh SIAM Journal on Discrete Mathematics 23 (2), 1071-1081, 2009 | 15 | 2009 |
| Characterization of affine Steiner triple systems and Hall triple systems E Máčajová, A Pór, JS Sereni Electronic Notes in Discrete Mathematics 29, 17-21, 2007 | 14 | 2007 |
| On the connectivity of visibility graphs MS Payne, A Pór, P Valtr, DR Wood Discrete & Computational Geometry 48 (3), 669-681, 2012 | 13 | 2012 |
| Destroying cycles in digraphs M Dunkum, P Hamburger, A Pór Combinatorica 31 (1), 55-66, 2011 | 13 | 2011 |
| Colourings of the Cartesian product of graphs and multiplicative Sidon sets A Pór, DR Wood Combinatorica 29, 449-466, 2009 | 13 | 2009 |
| Forcing posets with large dimension to contain large standard examples C Biró, P Hamburger, A Pór, WT Trotter Graphs and Combinatorics 32, 861-880, 2016 | 12 | 2016 |
| Curves in Rd intersecting every hyperplane at most d+ 1 times I Bárány, J Matoušek, A Pór Proceedings of the thirtieth annual symposium on Computational geometry, 565-571, 2014 | 12 | 2014 |
| Geometry-On the intersection of Baer subgeometries of PG (n, q2) I Jagos, G Kiss, A Pór Acta Scientiarum Mathematicarum 69 (1-2), 419-430, 2003 | 12 | 2003 |
| Almost-equidistant sets M Balko, A Pór, M Scheucher, K Swanepoel, P Valtr Graphs and Combinatorics 36 (3), 729-754, 2020 | 11 | 2020 |
| Maximizing maximal angles for plane straight-line graphs O Aichholzer, T Hackl, M Hoffmann, C Huemer, A Pór, F Santos, ... Computational Geometry 46 (1), 17-28, 2013 | 11 | 2013 |
