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
[1]
Hilfe
Suche: Author="T{\'o}th, G{\'e}za"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improvement on the decay of crossing numbers
Jakub C̑erný
,
Jan Kync̑l
,
Géza Tóth
Graphs and Combinatorics
29
(3), 2013, pp. 365-371
Monotone crossing number
János Pach
,
Géza Tóth
Lecture Notes in Computer Science
7034
, 2012, pp. 278-289
Graph unique-maximum and conflict-free colorings
Panagiotis Cheilaris
,
Géza Tóth
Lecture Notes in Computer Science
6078
, 2010, pp. 143-154
Drawing Hamiltonian cycles with no large angles
Adrian Dumitrescu
,
János Pach
,
Géza Tóth
Lecture Notes in Computer Science
5849
, 2010, pp. 3-14
Cubic graphs have bounded slope parameter
Balázs Keszegh
,
János Pach
,
Dömötör Pálvölgyi
,
Géza Tóth
Lecture Notes in Computer Science
5417
, 2009, pp. 50-60
Improvement on the decay of crossing numbers
Jakub C̑erný
,
Jan Kync̑l
,
Géza Tóth
Lecture Notes in Computer Science
4875
, 2008, pp. 25-30
Drawing cubic graphs with at most five slopes
Balázs Keszegh
,
János Pach
,
Dömötör Pálvölgyi
,
Géza Tóth
Lecture Notes in Computer Science
4372
, 2007, pp. 114-125
Crossing stars in topological graphs
Gábor Tardos
,
Géza Tóth
SIAM Journal on Discrete Mathematics
21
(3), 2007, pp. 737-749
How many ways can one draw a graph?
János Pach
,
Géza Tóth
Combinatorica
26
(5), 2006, pp. 559-576
Crossing number of toroidal graphs
János Pach
,
Géza Tóth
Lecture Notes in Computer Science
3843
, 2006, pp. 334-342
Topological graphs with no large grids
János Pach
,
Rom Pinchasi
,
Micha Sharir
,
Géza Tóth
Graphs and Combinatorics
21
(3), 2005, pp. 355-364
Long alternating paths in bicolored point sets
Jan Kync̑l
,
János Pach
,
Géza Tóth
Lecture Notes in Computer Science
3383
, 2004, pp. 340-348
Monotone drawings of planar graphs
János Pach
,
Géza Tóth
Journal of Graph Theory
46
(1), 2004, pp. 39-47
How many ways can one draw a graph?
János Pach
,
Géza Tóth
Lecture Notes in Computer Science
2912
, 2004, pp. 47-58
Ramsey-type results for unions of comparability graphs
Adrian Dumitrescu
,
Géza Tóth
Graphs and Combinatorics
18
(2), 2002, pp. 245-251
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
Recognizing string graphs is decidable
János Pach
,
Géza Tóth
Lecture Notes in Computer Science
2265
, 2002, pp. 247-260
Monotone drawings of planar graphs
János Pach
,
Géza Tóth
Lecture Notes in Computer Science
2518
, 2002, pp. 647-653
Unavoidable configurations in complete topological graphs
János Pach
,
Géza Tóth
Lecture Notes in Computer Science
1984
, 2001, pp. 328-337
Note on a Ramsey-type problem in geometry
György Csizmadia
,
Géza Tóth
Journal of Combinatorial Theory Series A
65
(2), 1993, pp. 302-306