Attila Pór

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

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

2020
Almost-Equidistant Sets.
Graphs Comb., 2020

2018
An Improvement on the Rado Bound for the Centerline Depth.
Discret. Comput. Geom., 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

2017
Double Threshold Digraphs.
CoRR, 2017

2016
Forcing Posets with Large Dimension to Contain Large Standard Examples.
Graphs Comb., 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.
Discret. Comput. Geom., 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

2013
Maximizing maximal angles for plane straight-line graphs.
Comput. Geom., 2013

2012
On the Connectivity of Visibility Graphs.
Discret. Comput. Geom., 2012

2011
Every Large Point Set contains Many Collinear Points or an Empty Pentagon.
Graphs Comb., 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. Discret. Math., 2009

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

Paths with No Small Angles.
SIAM J. Discret. Math., 2009

2008
Lower bounding the boundary of a graph in terms of its maximum or minimum degree.
Discret. Math., 2008

2007
Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets.
Electron. Notes Discret. Math., 2007

Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems.
Electron. Notes Discret. Math., 2007

Characterization of affine Steiner triple systems and Hall triple systems.
Electron. Notes Discret. Math., 2007

No-Three-in-Line-in-3D.
Algorithmica, 2007

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

Tverberg-Type Theorems for Separoids.
Discret. Comput. Geom., 2006

2005
On the computational complexity of partial covers of Theta graphs.
Electron. Notes Discret. Math., 2005

On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane.
Discret. Comput. Geom., 2005

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

2004
Track Layouts of Graphs.
Discret. Math. Theor. Comput. Sci., 2004

2002
The Partitioned Version of the Erdös - Szekeres Theorem.
Discret. Comput. Geom., 2002


  Loading...