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
[2]
Hilfe
Suche: Author="Tardos, G{\'a}bor"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On list coloring and list homomorphism of permutation and interval graphs
Jessica Enright
,
Lorna Stewart
,
Gábor Tardos
SIAM Journal on Discrete Mathematics
28
(4), 2014, pp. 1675-1685
Caterpillar dualities and regular languages
Péter L. Erdŏs
,
Claude Tardif
,
Gábor Tardos
SIAM Journal on Discrete Mathematics
27
(3), 2013, pp. 1287-1294
Local chromatic number of quadrangulations of surfaces
Bojan Mohar
,
Gábor Simonyi
,
Gábor Tardos
Combinatorica
33
(4), 2013, pp. 467-494
The visible perimeter of an arrangement of disks
Gabriel Nivasch
,
János Pach
,
Gábor Tardos
Lecture Notes in Computer Science
7704
, 2013, pp. 364-375
Remarks on a Ramsey theory for trees
János Pach
,
Gábor Tardos
,
József Solymosi
Combinatorica
32
(4), 2012, pp. 473-482
Piercing quasi-rectangles - On a problem of Danzer and Rogers
János Pach
,
Gábor Tardos
Journal of Combinatorial Theory Series A
119
(7), 2012, pp. 1391-1397
Piercing quasi-rectangles: On a problem of Danzer and Rogers
János Pach
,
Gábor Tardos
Lecture Notes in Computer Science
6844
, 2011, pp. 654-654
On directed local chromatic number, shift graphs, and Borsuk-like graphs
Gábor Simonyi
,
Gábor Tardos
Journal of Graph Theory
66
(1), 2011, pp. 65-82
Coloring axis-parallel rectangles
János Pach
,
Gábor Tardos
Journal of Combinatorial Theory Series A
117
(6), 2010, pp. 776-782
On the maximum number of edges in quasi-planar graphs
Eyal Ackerman
,
Gábor Tardos
Journal of Combinatorial Theory Series A
114
(3), 2007, pp. 563-571
Crossing stars in topological graphs
Gábor Tardos
,
Géza Tóth
SIAM Journal on Discrete Mathematics
21
(3), 2007, pp. 737-749
Intersection reverse sequences and geometric applications
Adam Marcus
,
Gábor Tardos
Journal of Combinatorial Theory Series A
113
(4), 2006, pp. 675-691
Local chromatic number, Ky Fan's theorem, and circular colorings
Gábor Simonyi
,
Gábor Tardos
Combinatorica
26
(5), 2006, pp. 587-626
Extremal problems for transversals in graphs with bounded degree
Tibor Szabó
,
Gábor Tardos
Combinatorica
26
(3), 2006, pp. 333-351
On 0-1 matrices and small excluded submatrices
Gábor Tardos
Journal of Combinatorial Theory Series A
111
(2), 2005, pp. 266-288
Excluded permutation matrices and the Stanley-Wilf conjecture
Adam Marcus
,
Gábor Tardos
Journal of Combinatorial Theory Series A
107
(1), 2004, pp. 153-160
Intersection reverse sequences and geometric applications
Adam Marcus
,
Gábor Tardos
Lecture Notes in Computer Science
3383
, 2004, pp. 349-359
Distinct distances in three and higher dimensions
Boris Aronov
,
János Pach
,
Micha Sharir
,
Gábor Tardos
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 541-546
A note on non-deterministic communication complexity with few witnesses
Vince Grolmusz
,
Gábor Tardos
Theory of Computing Systems
36
(4), 2003, pp. 387-391
Bounded size components-partitions and transversals
Penny Haxell
,
Tibor Szabó
,
Gábor Tardos
Journal of Combinatorial Theory Series B
88
(2), 2003, pp. 281-297
Optimal probabilistic fingerprint codes
Gábor Tardos
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 116-125
Geometric graphs with no self-intersecting path of length three
János Pach
,
Rom Pinchasi
,
Gábor Tardos
,
Géza Tóth
Lecture Notes in Computer Science
2528
, 2002, pp. 295-311
Isosceles triangles determined by a planar point set
János Pach
,
Gábor Tardos
Graphs and Combinatorics
18
(4), 2002, pp. 769-779
Untangling a polygon
János Pach
,
Gábor Tardos
Lecture Notes in Computer Science
2265
, 2002, pp. 154-161
On the knowledge complexity of
NP
Erez Petrank
,
Gábor Tardos
Combinatorica
22
(1), 2002, pp. 83-121
Seiten 1
2
>