Attila Pór

According to our database1, Attila Pór authored at least 32 papers between 2002 and 2018.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
An Improvement on the Rado Bound for the Centerline Depth.
Discrete & Computational Geometry, 2018

Acknowledgement of priority - A fractional Helly theorem for boxes.
Comput. Geom., 2018

Double Threshold Digraphs.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2016
Forcing Posets with Large Dimension to Contain Large Standard Examples.
Graphs and Combinatorics, 2016

2015
Standard Examples as Subposets of Posets.
Order, 2015

A fractional Helly theorem for boxes.
Comput. Geom., 2015

2014
Colourful and Fractional (p, q)-theorems.
Discrete & Computational Geometry, 2014

The Proof of the Removable Pair Conjecture for Fractional Dimension.
Electr. J. Comb., 2014

Curves in Rd intersecting every hyperplane at most d + 1 times.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2012
On the Connectivity of Visibility Graphs.
Discrete & Computational Geometry, 2012

2011
Graphs with Four Boundary Vertices.
Electr. J. Comb., 2011

Destroying cycles in digraphs.
Combinatorica, 2011

2010
On Visibility and Blockers.
JoCG, 2010

2009
A Step toward the Bermond--Thomassen Conjecture about Disjoint Cycles in Digraphs.
SIAM J. Discrete Math., 2009

Kneser Representations of Graphs.
SIAM J. Discrete Math., 2009

Colourings of the cartesian product of graphs and multiplicative Sidon sets.
Combinatorica, 2009

Every Large Point Set contains Many Collinear Points or an Empty Pentagon.
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.
Discrete Mathematics, 2008

On the computational complexity of partial covers of Theta graphs.
Discrete Applied Mathematics, 2008

Paths with no Small Angles.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007
Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets.
Electronic Notes in Discrete Mathematics, 2007

Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems.
Electronic Notes in Discrete Mathematics, 2007

Characterization of affine Steiner triple systems and Hall triple systems.
Electronic Notes in Discrete Mathematics, 2007

Maximizing Maximal Angles for Plane Straight-Line Graphs.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

2006
On the positive fraction Erdos-Szekeres theorem for convex sets.
Eur. J. Comb., 2006

Tverberg-Type Theorems for Separoids.
Discrete & Computational Geometry, 2006

2005
On the computational complexity of partial covers of Theta graphs.
Electronic Notes in Discrete Mathematics, 2005

On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane.
Discrete & Computational Geometry, 2005

Angel, Devil, and King.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Track Layouts of Graphs.
Discrete Mathematics & Theoretical Computer Science, 2004

No-Three-in-Line-in-3D.
Proceedings of the Graph Drawing, 12th International Symposium, 2004

2002
The Partitioned Version of the Erdös - Szekeres Theorem.
Discrete & Computational Geometry, 2002


  Loading...