default search action
Attila Pór
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j35]Imre Bárány
, Attila Pór:
Orientation Preserving Maps of the Square Grid II. Discret. Comput. Geom. 72(2): 569-602 (2024) - 2023
- [j34]Imre Bárány, Gil Kalai, Attila Pór
Erdős-Szekeres Theorem for k-Flats. Discret. Comput. Geom. 69(4): 1232-1240 (2023) - 2021
- [j33]Paul H. Edelman, Attila Pór:
A new axiomatic approach to the impartial nomination problem. Games Econ. Behav. 130: 443-451 (2021) - [j32]Imre Bárány, Attila Pór, Pavel Valtr:
Orientation preserving maps of the n × n grid. J. Comput. Geom. 13(2): 73-89 (2021) - [c8]Imre Bárány, Attila Pór, Pavel Valtr:
Orientation Preserving Maps of the Square Grid. SoCG 2021: 14:1-14:12 - 2020
- [j31]Martin Balko
Almost-Equidistant Sets. Graphs Comb. 36(3): 729-754 (2020)
2010 – 2019
- 2018
- [j30]Imre Bárány, Ferenc Fodor
Acknowledgement of priority - A fractional Helly theorem for boxes. Comput. Geom. 67: 1 (2018) - [j29]Alexander Magazinov
An Improvement on the Rado Bound for the Centerline Depth. Discret. Comput. Geom. 59(2): 477-505 (2018) - [c7]Peter Hamburger, Ross M. McConnell, Attila Pór, Jeremy P. Spinrad, Zhisheng Xu:
Double Threshold Digraphs. MFCS 2018: 69:1-69:12 - 2017
- [i4]Peter Hamburger, Ross M. McConnell, Attila Pór, Jeremy P. Spinrad:
Double Threshold Digraphs. CoRR abs/1702.06614 (2017) - 2016
- [j28]Csaba Biró, Peter Hamburger, Attila Pór, William T. Trotter:
Forcing Posets with Large Dimension to Contain Large Standard Examples. Graphs Comb. 32(3): 861-880 (2016) - 2015
- [j27]Imre Bárány, Ferenc Fodor
A fractional Helly theorem for boxes. Comput. Geom. 48(3): 221-224 (2015) - [j26]Csaba Biró, Peter Hamburger, Attila Pór:
Standard Examples as Subposets of Posets. Order 32(2): 293-299 (2015) - 2014
- [j25]Csaba Biró, Peter Hamburger, Attila Pór:
The Proof of the Removable Pair Conjecture for Fractional Dimension. Electron. J. Comb. 21(1): 1 (2014) - [j24]Imre Bárány, Ferenc Fodor
Colourful and Fractional (p, q)-theorems. Discret. Comput. Geom. 51(3): 628-642 (2014) - [c6]Imre Bárány, Jirí Matousek, Attila Pór:
Curves in Rd intersecting every hyperplane at most d + 1 times. SoCG 2014: 565 - 2013
- [j23]Oswin Aichholzer
Maximizing maximal angles for plane straight-line graphs. Comput. Geom. 46(1): 17-28 (2013) - 2012
- [j22]Michael S. Payne, Attila Pór, Pavel Valtr, David R. Wood
On the Connectivity of Visibility Graphs. Discret. Comput. Geom. 48(3): 669-681 (2012) - 2011
- [j21]Molly W. Dunkum
Destroying cycles in digraphs. Comb. 31(1): 55-66 (2011) - [j20]Tobias Müller, Attila Pór, Jean-Sébastien Sereni:
Graphs with Four Boundary Vertices. Electron. J. Comb. 18(1) (2011) - [j19]Zachary Abel, Brad Ballinger, Prosenjit Bose
Every Large Point Set contains Many Collinear Points or an Empty Pentagon. Graphs Comb. 27(1): 47-60 (2011) - 2010
- [j18]Attila Pór, David R. Wood:
On Visibility and Blockers. J. Comput. Geom. 1(1): 29-40 (2010)
2000 – 2009
- 2009
- [j17]Attila Pór, David R. Wood
Colourings of the cartesian product of graphs and multiplicative Sidon sets. Comb. 29(4): 449-466 (2009) - [j16]Nicolas Lichiardopol, Attila Pór, Jean-Sébastien Sereni:
A Step toward the Bermond--Thomassen Conjecture about Disjoint Cycles in Digraphs. SIAM J. Discret. Math. 23(2): 979-992 (2009) - [j15]Peter Hamburger, Attila Pór, Matt Walsh:
Kneser Representations of Graphs. SIAM J. Discret. Math. 23(2): 1071-1081 (2009) - [j14]Imre Bárány, Attila Pór, Pavel Valtr:
Paths with No Small Angles. SIAM J. Discret. Math. 23(4): 1655-1666 (2009) - [c5]Zachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmovic, Ferran Hurtado, Scott Duke Kominers, Stefan Langerman, Attila Pór, David R. Wood:
Every Large Point Set contains Many Collinear Points or an Empty Pentagon. CCCG 2009: 99-102 - [i3]Zachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmovic, Ferran Hurtado, Scott Duke Kominers, Stefan Langerman, Attila Pór, David R. Wood:
Every Large Point Set contains Many Collinear Points or an Empty Pentagon. CoRR abs/0904.0262 (2009) - 2008
- [j13]Jirí Fiala, Jan Kratochvíl
On the computational complexity of partial covers of Theta graphs. Discret. Appl. Math. 156(7): 1143-1149 (2008) - [j12]Tobias Müller, Attila Pór, Jean-Sébastien Sereni:
Lower bounding the boundary of a graph in terms of its maximum or minimum degree. Discret. Math. 308(24): 6581-6583 (2008) - [c4]Imre Bárány, Attila Pór, Pavel Valtr:
Paths with no Small Angles. LATIN 2008: 654-663 - 2007
- [j11]Attila Pór, David R. Wood
No-Three-in-Line-in-3D. Algorithmica 47(4): 481-488 (2007) - [j10]Attila Pór, David R. Wood
Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets. Electron. Notes Discret. Math. 28: 33-40 (2007) - [j9]Daniel Král
Characterization of affine Steiner triple systems and Hall triple systems. Electron. Notes Discret. Math. 29: 17-21 (2007) - [j8]Daniel Král
Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems. Electron. Notes Discret. Math. 29: 23-27 (2007) - [c3]Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer
Maximizing Maximal Angles for Plane Straight-Line Graphs. WADS 2007: 458-469 - [i2]Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Attila Pór, Francisco Santos
Maximizing Maximal Angles for Plane Straight-Line Graphs. CoRR abs/0705.3820 (2007) - 2006
- [j7]Juan José Montellano-Ballesteros
Tverberg-Type Theorems for Separoids. Discret. Comput. Geom. 35(3): 513-523 (2006) - [j6]Attila Pór, Pavel Valtr:
On the positive fraction Erdos-Szekeres theorem for convex sets. Eur. J. Comb. 27(7): 1199-1205 (2006) - 2005
- [j5]Jan Kára, Attila Pór, David R. Wood
On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane. Discret. Comput. Geom. 34(3): 497-506 (2005) - [j4]Jirí Fiala, Jan Kratochvíl, Attila Pór:
On the computational complexity of partial covers of Theta graphs. Electron. Notes Discret. Math. 19: 79-85 (2005) - [c2]Martin Kutz, Attila Pór:
Angel, Devil, and King. COCOON 2005: 925-934 - 2004
- [j3]Vida Dujmovic, Attila Pór, David R. Wood
Track Layouts of Graphs. Discret. Math. Theor. Comput. Sci. 6(2): 497-522 (2004) - [c1]Attila Pór, David R. Wood
No-Three-in-Line-in-3D. GD 2004: 395-402 - [i1]Vida Dujmovic, Attila Pór, David R. Wood:
Track Layouts of Graphs. CoRR cs.DM/0407033 (2004) - 2003
- [j2]Attila Pór:
A Partitioned Version of the Erdös-Szekeres Theorem for Quadrilaterals. Discret. Comput. Geom. 30(2): 321-336 (2003) - 2002
- [j1]Attila Pór, Pavel Valtr:
The Partitioned Version of the Erdös - Szekeres Theorem. Discret. Comput. Geom. 28(4): 625-637 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: