Csaba D. Tóth

	2009
79		Frank K. H. A. Dehne, Marina L. Gavrilova, Jörg-Rüdiger Sack, Csaba D. Tóth: Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings Springer 2009
78		Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth: Convex Partitions with 2-Edge Connected Dual Graphs. COCOON 2009: 192-204
77		Adrian Dumitrescu, Csaba D. Tóth, Guangwu Xu: On stars and Steiner stars: II. SODA 2009: 311-317
76		Mashhood Ishaque, Bettina Speckmann, Csaba D. Tóth: Shooting permanent rays among disjoint polygons in the plane. Symposium on Computational Geometry 2009: 51-60
75		Csaba D. Tóth: Binary plane partitions for disjoint line segments. Symposium on Computational Geometry 2009: 71-79
74		Adrian Dumitrescu, Csaba D. Tóth: Long non-crossing configurations in the plane CoRR abs/0909.4094: (2009)
73		Adrian Dumitrescu, Csaba D. Tóth: Light orthogonal networks with constant geometric dilation. J. Discrete Algorithms 7(1): 112-129 (2009)
	2008
72		Mashhood Ishaque, Csaba D. Tóth: Relative Convex Hulls in Semi-dynamic Subdivisions. ESA 2008: 780-792
71		Adrian Dumitrescu, Csaba D. Tóth: On stars and Steiner stars. SODA 2008: 1233-1240
70		Adrian Dumitrescu, Csaba D. Tóth: Minimum weight convex Steiner partitions. SODA 2008: 581-590
69		Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth: Extremal problems on triangle areas in two and three dimensions. Symposium on Computational Geometry 2008: 208-217
68		Adrian Dumitrescu, Csaba D. Tóth, Guangwu Xu: On stars and Steiner stars. II CoRR abs/0806.4858: (2008)
67		Adrian Dumitrescu, Csaba D. Tóth: On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space. Combinatorics, Probability & Computing 17(2): 203-224 (2008)
66		József Solymosi, Csaba D. Tóth: On a Question of Bourgain about Geometric Incidences. Combinatorics, Probability & Computing 17(4): 619-625 (2008)
65		Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth: Encompassing colored planar straight line graphs. Comput. Geom. 39(1): 14-23 (2008)
64		David W. Krumme, Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth: Tight Bounds for Connecting Sites Across Barriers. Discrete & Computational Geometry 40(3): 377-394 (2008)
63		Csaba D. Tóth: Connectivity augmentation in plane straight line graphs. Electronic Notes in Discrete Mathematics 31: 49-52 (2008)
62		Jacob Fox, Csaba D. Tóth: On the decay of crossing numbers. J. Comb. Theory, Ser. B 98(1): 33-42 (2008)
61		Csaba D. Tóth: Binary Space Partitions for Axis-Aligned Fat Rectangles. SIAM J. Comput. 38(1): 429-447 (2008)
60		Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth: Detecting cuts in sensor networks. TOSN 4(2): (2008)
	2007
59		Nadia Benbernou, Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth: Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs. CCCG 2007: 13-16
58		Chiranjeeb Buragohain, Subhash Suri, Csaba D. Tóth, Yunhong Zhou: Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks. COCOON 2007: 210-221
57		Jacob Fox, János Pach, Csaba D. Tóth: A Bipartite Strengthening of the Crossing Lemma. Graph Drawing 2007: 13-24
56		Adrian Dumitrescu, Csaba D. Tóth: Distinct Triangle Areas in a Planar Point Set. IPCO 2007: 119-129
55		Adrian Dumitrescu, Csaba D. Tóth: On the number of tetrahedra with minimum, unit, and distinct volumes in three-space. SODA 2007: 1114-1123
54		Adrian Dumitrescu, Csaba D. Tóth: Light Orthogonal Networks with Constant Geometric Dilation. STACS 2007: 175-187
53		Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth: Cuttings for Disks and Axis-Aligned Rectangles. WADS 2007: 470-482
52		Subhash Suri, Csaba D. Tóth, Yunhong Zhou: Selfish Load Balancing and Atomic Congestion Games. Algorithmica 47(1): 79-96 (2007)
51		Adrian Dumitrescu, Csaba D. Tóth: Analysis of two Sweep-line Algorithms for Constructing Spanning Trees and Steiner Trees. J. UCS 13(11): 1615-1627 (2007)
	2006
50		Csaba D. Tóth, Michael Hoffmann: Spanning trees across axis-parallel segments. CCCG 2006
49		Jacob Fox, Csaba D. Tóth: On the Decay of Crossing Numbers. Graph Drawing 2006: 174-183
48		Oswin Aichholzer, Clemens Huemer, S. Kappes, Bettina Speckmann, Csaba D. Tóth: Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles. MFCS 2006: 86-97
47		David W. Krumme, Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth: Tight bounds for connecting sites across barriers. Symposium on Computational Geometry 2006: 439-448
46		John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth: Adaptive Spatial Partitioning for Multidimensional Data Streams. Algorithmica 46(1): 97-117 (2006)
45		József Solymosi, Csaba D. Tóth: Distinct Distances in Homogeneous Sets in Euclidean Space. Discrete & Computational Geometry 35(4): 537-549 (2006)
44		Subhash Suri, Csaba D. Tóth, Yunhong Zhou: Range Counting over Multidimensional Data Streams. Discrete & Computational Geometry 36(4): 633-655 (2006)
43		Jean-Claude Bermond, Frédéric Havet, Csaba D. Tóth: Fault tolerant on-board networks with priorities. Networks 47(1): 9-25 (2006)
	2005
42		Csaba D. Tóth, Diane L. Souvaine: A vertex-face assignment for plane graphs. CCCG 2005: 138-141
41		Oswin Aichholzer, Clemens Huemer, Sarah Renkl, Bettina Speckmann, Csaba D. Tóth: On pseudo-convex decompositions, partitions, and coverings. EWCG 2005: 89-92
40		Michael Hoffmann, Csaba D. Tóth: Pointed binary encompassing trees: Simple and optimal. EWCG 2005: 93-96
39		Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth: Detecting cuts in sensor networks. IPSN 2005: 210-217
38		John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth: Space complexity of hierarchical heavy hitters in multi-dimensional data streams. PODS 2005: 338-347
37		György Elekes, Csaba D. Tóth: Incidences of not-too-degenerate hyperplanes. Symposium on Computational Geometry 2005: 16-21
36		Michael Hoffmann, Csaba D. Tóth: Pointed and colored binary encompassing trees. Symposium on Computational Geometry 2005: 81-90
35		Csaba D. Tóth: Orthogonal Subdivisions with Low Stabbing Numbers. WADS 2005: 256-268
34		Bettina Speckmann, Csaba D. Tóth: Allocating Vertex pi-Guards in Simple Polygons via Pseudo-Triangulations. Discrete & Computational Geometry 33(2): 345-364 (2005)
33		John Hershberger, Subhash Suri, Csaba D. Tóth: Binary Space Partitions of Orthogonal Subdivisions. SIAM J. Comput. 34(6): 1380-1397 (2005)
	2004
32		Anshul Kothari, Subhash Suri, Csaba D. Tóth, Yunhong Zhou: Congestion Games, Load Balancing, and Price of Anarchy. CAAN 2004: 13-27
31		Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth: Encompassing colored crossing-free geometric graphs. CCCG 2004: 48-52
30		Subhash Suri, Csaba D. Tóth, Yunhong Zhou: Uncoordinated Load Balancing and Congestion Games in P2P Systems. IPTPS 2004: 123-130
29		John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth: Adaptive Spatial Partitioning for Multidimensional Data Streams. ISAAC 2004: 522-533
28		Subhash Suri, Csaba D. Tóth, Yunhong Zhou: Selfish load balancing and atomic congestion games. SPAA 2004: 188-195
27		Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth: Pointed Binary Encompassing Trees. SWAT 2004: 442-454
26		Subhash Suri, Csaba D. Tóth, Yunhong Zhou: Range counting over multidimensional data streams. Symposium on Computational Geometry 2004: 160-169
25		John Hershberger, Subhash Suri, Csaba D. Tóth: Binary space partitions of orthogonal subdivisions. Symposium on Computational Geometry 2004: 230-238
24		Csaba D. Tóth: Illuminating labyrinths. Discrete Applied Mathematics 138(1-2): 215-228 (2004)
	2003
23		Oswin Aichholzer, Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth: Degree Bounds for Constrained Pseudo-Triangulations. CCCG 2003: 155-158
22		Csaba D. Tóth: Binary Space Partition for Orthogonal Fat Rectangles. ESA 2003: 494-505
21		Bettina Speckmann, Csaba D. Tóth: Allocating vertex pi-guards in simple polygons via pseudo-triangulations. SODA 2003: 109-118
20		Csaba D. Tóth: Alternating Paths along Orthogonal Segments. WADS 2003: 389-400
19		Csaba D. Tóth: Guarding disjoint triangles and claws in the plane. Comput. Geom. 25(1-2): 51-65 (2003)
18		Michael Hoffmann, Csaba D. Tóth: Segment endpoint visibility graphs are Hamiltonian. Comput. Geom. 26(1): 47-68 (2003)
17		Csaba D. Tóth: A Note on Binary Plane Partitions. Discrete & Computational Geometry 30(1): 3-16 (2003)
16		Csaba D. Tóth: Illuminating Disjoint Line Segments in the Plane. Discrete & Computational Geometry 30(3): 489-505 (2003)
15		Csaba D. Tóth: Illumination of polygons by 45°-floodlights. Discrete Mathematics 265(1-3): 251-260 (2003)
14		Michael Hoffmann, Csaba D. Tóth: Alternating paths through disjoint line segments. Inf. Process. Lett. 87(6): 287-294 (2003)
13		Csaba D. Tóth: Binary Space Partitions for Line Segments with a Limited Number of Directions. SIAM J. Comput. 32(2): 307-325 (2003)
	2002
12		Michael Hoffmann, Csaba D. Tóth: Connecting points in the presence of obstacles in the plane. CCCG 2002: 63-67
11		Csaba D. Tóth: Binary space partitions for line segments with a limited number of directions. SODA 2002: 465-471
10		Csaba D. Tóth: Art galleries with guards of uniform range of vision. Comput. Geom. 21(3): 185-192 (2002)
9		Csaba D. Tóth: Illumination in the presence of opaque line segments in the plane. Comput. Geom. 21(3): 193-204 (2002)
8		József Solymosi, Gábor Tardos, Csaba D. Tóth: The k Most Frequent Distances in the Plane. Discrete & Computational Geometry 28(4): 639-648 (2002)
	2001
7		Michael Hoffmann, Csaba D. Tóth: Segment endpoint visibility graphs are hamiltonian. CCCG 2001: 109-112
6		Csaba D. Tóth: Illuminating Polygons with Vertex pi-Floodlights. International Conference on Computational Science (1) 2001: 772-784
5		Csaba D. Tóth: A note on binary plane partitions. Symposium on Computational Geometry 2001: 151-156
4		József Solymosi, Csaba D. Tóth: On the distinct distances determined by a planar point set. Symposium on Computational Geometry 2001: 29-32
3		József Solymosi, Csaba D. Tóth: Distinct Distances in the Plane. Discrete & Computational Geometry 25(4): 629-634 (2001)
	2000
2		Csaba D. Tóth: Illuminating Both Sides of Line Segments. JCDCG 2000: 370-380
1		Csaba D. Tóth: Art gallery problem with guards whose range of vision is 180. Comput. Geom. 17(3-4): 121-134 (2000)

Coauthor Index

1	Oswin Aichholzer	[23] [41] [48]
2	Marwan Al-Jubeh	[78]
3	Nadia Benbernou	[59]
4	Jean-Claude Bermond	[43]
5	Chiranjeeb Buragohain	[58]
6	Frank K. H. A. Dehne	[79]
7	Erik D. Demaine	[59]
8	Martin L. Demaine	[59]
9	Adrian Dumitrescu	[51] [54] [55] [56] [67] [68] [69] [70] [71] [73] [74] [77]
10	György Elekes	[37]
11	Jacob Fox	[49] [57] [62]
12	Marina L. Gavrilova	[79]
13	Frédéric Havet	[43]
14	John Hershberger	[25] [29] [33] [38] [46]
15	Michael Hoffmann	[7] [12] [14] [18] [23] [27] [36] [40] [50] [59] [78]
16	Clemens Huemer	[41] [48]
17	Ferran Hurtado	[31] [65]
18	Mashhood Ishaque	[59] [72] [76] [78]
19	Mikio Kano (M. Kano)	[31] [65]
20	S. Kappes	[48]
21	Anshul Kothari	[32]
22	David W. Krumme	[47] [64]
23	János Pach	[57]
24	Eynat Rafalin	[47] [53] [64]
25	David Rappaport	[31] [65]
26	Sarah Renkl	[41]
27	Jörg-Rüdiger Sack	[79]
28	Micha Sharir	[69]
29	Nisheeth Shrivastava	[29] [38] [39] [46] [60]
30	József Solymosi	[3] [4] [8] [45] [66]
31	Diane L. Souvaine	[42] [47] [53] [59] [64] [78]
32	Bettina Speckmann	[21] [23] [27] [34] [41] [48] [76]
33	Subhash Suri	[25] [26] [28] [29] [30] [32] [33] [38] [39] [44] [46] [52] [58] [60]
34	Gábor Tardos	[8]
35	Guangwu Xu	[68] [77]
36	Yunhong Zhou	[26] [28] [30] [32] [44] [52] [58]

Colors in the list of coauthors