Attila Pór

According to our database, Attila Pór authored at least 38 papers between 2002 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Orientation Preserving Maps of the Square Grid II.

Imre Bárány, Attila Pór

Discret. Comput. Geom., September, 2024

2023

Erdős-Szekeres Theorem for k-Flats.

Imre Bárány, Gil Kalai, Attila Pór

Discret. Comput. Geom., June, 2023

2021

Orientation preserving maps of the n × n grid.

Imre Bárány, Attila Pór, Pavel Valtr

J. Comput. Geom., 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 Square Grid.

Imre Bárány, Attila Pór, Pavel Valtr

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Almost-Equidistant Sets.

Martin Balko, Attila Pór, Manfred Scheucher, Konrad J. Swanepoel, Pavel Valtr

Graphs Comb., 2020

2018

An Improvement on the Rado Bound for the Centerline Depth.

Alexander Magazinov, Attila Pór

Discret. Comput. Geom., 2018

Acknowledgement of priority - A fractional Helly theorem for boxes.

Imre Bárány, Ferenc Fodor, Álvaro Martínez-Pérez, Luis Montejano, Déborah Oliveros, Attila Pór

Comput. Geom., 2018

Double Threshold Digraphs.

Peter Hamburger, Ross M. McConnell, Attila Pór, Jeremy P. Spinrad, Zhisheng Xu

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017

Double Threshold Digraphs.

Peter Hamburger, Ross M. McConnell, Attila Pór, Jeremy P. Spinrad

CoRR, 2017

2016

Forcing Posets with Large Dimension to Contain Large Standard Examples.

Csaba Biró, Peter Hamburger, Attila Pór, William T. Trotter

Graphs Comb., 2016

2015

Standard Examples as Subposets of Posets.

Csaba Biró, Peter Hamburger, Attila Pór

Order, 2015

A fractional Helly theorem for boxes.

Imre Bárány, Ferenc Fodor, Álvaro Martínez-Pérez, Luis Montejano, Déborah Oliveros, Attila Pór

Comput. Geom., 2015

2014

Colourful and Fractional (p, q)-theorems.

Imre Bárány, Ferenc Fodor, Luis Montejano, Déborah Oliveros, Attila Pór

Discret. Comput. Geom., 2014

The Proof of the Removable Pair Conjecture for Fractional Dimension.

Csaba Biró, Peter Hamburger, Attila Pór

Electron. J. Comb., 2014

Curves in Rd intersecting every hyperplane at most d + 1 times.

Imre Bárány, Jirí Matousek, Attila Pór

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2012

On the Connectivity of Visibility Graphs.

Michael S. Payne, Attila Pór, Pavel Valtr, David R. Wood

Discret. Comput. Geom., 2012

2011

Graphs with Four Boundary Vertices.

Tobias Müller, Attila Pór, Jean-Sébastien Sereni

Electron. J. Comb., 2011

Destroying cycles in digraphs.

Molly W. Dunkum, Peter Hamburger, Attila Pór

Comb., 2011

2010

On Visibility and Blockers.

Attila Pór, David R. Wood

J. Comput. Geom., 2010

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

Kneser Representations of Graphs.

Peter Hamburger, Attila Pór, Matt Walsh

SIAM J. Discret. Math., 2009

Colourings of the cartesian product of graphs and multiplicative Sidon sets.

Attila Pór, David R. Wood

Comb., 2009

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

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

Lower bounding the boundary of a graph in terms of its maximum or minimum degree.

Tobias Müller, Attila Pór, Jean-Sébastien Sereni

Discret. Math., 2008

Paths with no Small Angles.

Imre Bárány, Attila Pór, Pavel Valtr

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

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

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

Maximizing Maximal Angles for Plane Straight-Line Graphs.

Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Attila Pór, Francisco Santos, Bettina Speckmann, Birgit Vogtenhuber

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

2006

On the positive fraction Erdos-Szekeres theorem for convex sets.

Attila Pór, Pavel Valtr

Eur. J. Comb., 2006

Tverberg-Type Theorems for Separoids.

Juan José Montellano-Ballesteros, Attila Pór, Ricardo Strausz

Discret. Comput. Geom., 2006

2005

On the computational complexity of partial covers of Theta graphs.

Jirí Fiala, Jan Kratochvíl, Attila Pór

Electron. Notes Discret. Math., 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

Angel, Devil, and King.

Martin Kutz, Attila Pór

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Track Layouts of Graphs.

Vida Dujmovic, Attila Pór, David R. Wood

Discret. Math. Theor. Comput. Sci., 2004

No-Three-in-Line-in-3D.

Attila Pór, David R. Wood

Proceedings of the Graph Drawing, 12th International Symposium, 2004

2003

A Partitioned Version of the Erdös-Szekeres Theorem for Quadrilaterals.

Attila Pór

Discret. Comput. Geom., 2003

2002

The Partitioned Version of the Erdös - Szekeres Theorem.

Attila Pór, Pavel Valtr

Discret. Comput. Geom., 2002