Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="P{\'o}r, Attila"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Every large point set contains many collinear points or an empty pentagon
Zachary Abel
,
Brad Ballinger
,
Prosenjit Bose
,
Sébastien Collette
,
Vida Dujmović
,
Ferran Hurtado
,
Scott Duke Kominers
,
Stefan Langerman
,
Attila Pór
,
David R. Wood
Graphs and Combinatorics
27
(1), 2011, pp. 47-60
Destroying cycles in digraphs
Molly Dunkum
,
Peter Hamburger
,
Attila Pór
Combinatorica
31
(1), 2011, pp. 55-66
Paths with no small angles
Imre Bárány
,
Attila Pór
,
Pavel Valtr
SIAM Journal on Discrete Mathematics
23
(4), 2009-2010, pp. 1655-1666
A step toward the Bermond-Thomassen conjecture about disjoint cycles in digraphs
Nicolas Lichiardopol
,
Attila Pór
,
Jean-Sebastien Séreni
SIAM Journal on Discrete Mathematics
23
(2), 2009, pp. 979-992
Colourings of the Cartesian product of graphs and multiplicative Sidon sets
Attila Pór
,
David R. Wood
Combinatorica
29
(4), 2009, pp. 449-466
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
Lecture Notes in Computer Science
4619
, 2007, pp. 458-469
No-three-in-line-in-3D
Attila Pór
,
David R. Wood
Algorithmica
47
(4), 2007, pp. 481-488
Angel, devil, and king
Martin Kutz
,
Attila Pór
Lecture Notes in Computer Science
3595
, 2005, pp. 925-934
No-three-in-line-in-3D
Attila Pór
,
David R. Wood
Lecture Notes in Computer Science
3383
, 2004, pp. 395-402