| 2009 |
|---|
| 71 | EE | Adrian Dumitrescu,
Csaba D. Tóth,
Guangwu Xu:
On stars and Steiner stars: II.
SODA 2009: 311-317 |
| 2008 |
|---|
| 70 | EE | Mashhood Ishaque,
Csaba D. Tóth:
Relative Convex Hulls in Semi-dynamic Subdivisions.
ESA 2008: 780-792 |
| 69 | EE | Adrian Dumitrescu,
Csaba D. Tóth:
On stars and Steiner stars.
SODA 2008: 1233-1240 |
| 68 | EE | Adrian Dumitrescu,
Csaba D. Tóth:
Minimum weight convex Steiner partitions.
SODA 2008: 581-590 |
| 67 | EE | 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 |
| 66 | EE | Adrian Dumitrescu,
Csaba D. Tóth,
Guangwu Xu:
On stars and Steiner stars. II
CoRR abs/0806.4858: (2008) |
| 65 | EE | 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) |
| 64 | EE | József Solymosi,
Csaba D. Tóth:
On a Question of Bourgain about Geometric Incidences.
Combinatorics, Probability & Computing 17(4): 619-625 (2008) |
| 63 | EE | Ferran Hurtado,
Mikio Kano,
David Rappaport,
Csaba D. Tóth:
Encompassing colored planar straight line graphs.
Comput. Geom. 39(1): 14-23 (2008) |
| 62 | EE | 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) |
| 61 | EE | Csaba D. Tóth:
Connectivity augmentation in plane straight line graphs.
Electronic Notes in Discrete Mathematics 31: 49-52 (2008) |
| 60 | EE | Jacob Fox,
Csaba D. Tóth:
On the decay of crossing numbers.
J. Comb. Theory, Ser. B 98(1): 33-42 (2008) |
| 59 | EE | Csaba D. Tóth:
Binary Space Partitions for Axis-Aligned Fat Rectangles.
SIAM J. Comput. 38(1): 429-447 (2008) |
| 58 | EE | Nisheeth Shrivastava,
Subhash Suri,
Csaba D. Tóth:
Detecting cuts in sensor networks.
TOSN 4(2): (2008) |
| 2007 |
|---|
| 57 | | 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 |
| 56 | EE | Chiranjeeb Buragohain,
Subhash Suri,
Csaba D. Tóth,
Yunhong Zhou:
Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks.
COCOON 2007: 210-221 |
| 55 | EE | Jacob Fox,
János Pach,
Csaba D. Tóth:
A Bipartite Strengthening of the Crossing Lemma.
Graph Drawing 2007: 13-24 |
| 54 | EE | Adrian Dumitrescu,
Csaba D. Tóth:
Distinct Triangle Areas in a Planar Point Set.
IPCO 2007: 119-129 |
| 53 | EE | Adrian Dumitrescu,
Csaba D. Tóth:
On the number of tetrahedra with minimum, unit, and distinct volumes in three-space.
SODA 2007: 1114-1123 |
| 52 | EE | Adrian Dumitrescu,
Csaba D. Tóth:
Light Orthogonal Networks with Constant Geometric Dilation.
STACS 2007: 175-187 |
| 51 | EE | Eynat Rafalin,
Diane L. Souvaine,
Csaba D. Tóth:
Cuttings for Disks and Axis-Aligned Rectangles.
WADS 2007: 470-482 |
| 50 | EE | Subhash Suri,
Csaba D. Tóth,
Yunhong Zhou:
Selfish Load Balancing and Atomic Congestion Games.
Algorithmica 47(1): 79-96 (2007) |
| 49 | EE | 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 |
|---|
| 48 | EE | Csaba D. Tóth,
Michael Hoffmann:
Spanning trees across axis-parallel segments.
CCCG 2006 |
| 47 | EE | Jacob Fox,
Csaba D. Tóth:
On the Decay of Crossing Numbers.
Graph Drawing 2006: 174-183 |
| 46 | EE | 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 |
| 45 | EE | 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 |
| 44 | EE | John Hershberger,
Nisheeth Shrivastava,
Subhash Suri,
Csaba D. Tóth:
Adaptive Spatial Partitioning for Multidimensional Data Streams.
Algorithmica 46(1): 97-117 (2006) |
| 43 | EE | József Solymosi,
Csaba D. Tóth:
Distinct Distances in Homogeneous Sets in Euclidean Space.
Discrete & Computational Geometry 35(4): 537-549 (2006) |
| 42 | EE | Subhash Suri,
Csaba D. Tóth,
Yunhong Zhou:
Range Counting over Multidimensional Data Streams.
Discrete & Computational Geometry 36(4): 633-655 (2006) |
| 41 | EE | 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 |
|---|
| 40 | EE | Csaba D. Tóth,
Diane L. Souvaine:
A vertex-face assignment for plane graphs.
CCCG 2005: 138-141 |
| 39 | EE | Nisheeth Shrivastava,
Subhash Suri,
Csaba D. Tóth:
Detecting cuts in sensor networks.
IPSN 2005: 210-217 |
| 38 | EE | 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 | EE | György Elekes,
Csaba D. Tóth:
Incidences of not-too-degenerate hyperplanes.
Symposium on Computational Geometry 2005: 16-21 |
| 36 | EE | Michael Hoffmann,
Csaba D. Tóth:
Pointed and colored binary encompassing trees.
Symposium on Computational Geometry 2005: 81-90 |
| 35 | EE | Csaba D. Tóth:
Orthogonal Subdivisions with Low Stabbing Numbers.
WADS 2005: 256-268 |
| 34 | EE | 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 | EE | John Hershberger,
Subhash Suri,
Csaba D. Tóth:
Binary Space Partitions of Orthogonal Subdivisions.
SIAM J. Comput. 34(6): 1380-1397 (2005) |
| 2004 |
|---|
| 32 | EE | Anshul Kothari,
Subhash Suri,
Csaba D. Tóth,
Yunhong Zhou:
Congestion Games, Load Balancing, and Price of Anarchy.
CAAN 2004: 13-27 |
| 31 | EE | Ferran Hurtado,
Mikio Kano,
David Rappaport,
Csaba D. Tóth:
Encompassing colored crossing-free geometric graphs.
CCCG 2004: 48-52 |
| 30 | EE | Subhash Suri,
Csaba D. Tóth,
Yunhong Zhou:
Uncoordinated Load Balancing and Congestion Games in P2P Systems.
IPTPS 2004: 123-130 |
| 29 | EE | John Hershberger,
Nisheeth Shrivastava,
Subhash Suri,
Csaba D. Tóth:
Adaptive Spatial Partitioning for Multidimensional Data Streams.
ISAAC 2004: 522-533 |
| 28 | EE | Subhash Suri,
Csaba D. Tóth,
Yunhong Zhou:
Selfish load balancing and atomic congestion games.
SPAA 2004: 188-195 |
| 27 | EE | Michael Hoffmann,
Bettina Speckmann,
Csaba D. Tóth:
Pointed Binary Encompassing Trees.
SWAT 2004: 442-454 |
| 26 | EE | Subhash Suri,
Csaba D. Tóth,
Yunhong Zhou:
Range counting over multidimensional data streams.
Symposium on Computational Geometry 2004: 160-169 |
| 25 | EE | John Hershberger,
Subhash Suri,
Csaba D. Tóth:
Binary space partitions of orthogonal subdivisions.
Symposium on Computational Geometry 2004: 230-238 |
| 24 | EE | 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 | EE | Csaba D. Tóth:
Binary Space Partition for Orthogonal Fat Rectangles.
ESA 2003: 494-505 |
| 21 | EE | Bettina Speckmann,
Csaba D. Tóth:
Allocating vertex pi-guards in simple polygons via pseudo-triangulations.
SODA 2003: 109-118 |
| 20 | EE | 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 | EE | Michael Hoffmann,
Csaba D. Tóth:
Segment endpoint visibility graphs are Hamiltonian.
Comput. Geom. 26(1): 47-68 (2003) |
| 17 | EE | Csaba D. Tóth:
A Note on Binary Plane Partitions.
Discrete & Computational Geometry 30(1): 3-16 (2003) |
| 16 | EE | Csaba D. Tóth:
Illuminating Disjoint Line Segments in the Plane.
Discrete & Computational Geometry 30(3): 489-505 (2003) |
| 15 | EE | Csaba D. Tóth:
Illumination of polygons by 45°-floodlights.
Discrete Mathematics 265(1-3): 251-260 (2003) |
| 14 | EE | Michael Hoffmann,
Csaba D. Tóth:
Alternating paths through disjoint line segments.
Inf. Process. Lett. 87(6): 287-294 (2003) |
| 13 | EE | 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 | EE | Michael Hoffmann,
Csaba D. Tóth:
Connecting points in the presence of obstacles in the plane.
CCCG 2002: 63-67 |
| 11 | EE | 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 | EE | 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 | EE | Michael Hoffmann,
Csaba D. Tóth:
Segment endpoint visibility graphs are hamiltonian.
CCCG 2001: 109-112 |
| 6 | EE | Csaba D. Tóth:
Illuminating Polygons with Vertex pi-Floodlights.
International Conference on Computational Science (1) 2001: 772-784 |
| 5 | EE | Csaba D. Tóth:
A note on binary plane partitions.
Symposium on Computational Geometry 2001: 151-156 |
| 4 | EE | 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 | EE | József Solymosi,
Csaba D. Tóth:
Distinct Distances in the Plane.
Discrete & Computational Geometry 25(4): 629-634 (2001) |
| 2000 |
|---|
| 2 | EE | 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) |
