Publication list of Csaba D. Tóth

Csaba D. Tóth
Instructor in Applied Mathematics
Massachusetts Institute of Technology
77 Massachusetts Ave., Room 2-336
Cambridge, MA 02139
+1 (617) 253-6584
toth ♠ math.mit.edu

Publications:
1. Journals
2. Book Chapters
3. Conference Proceedings
4. Others

1. Journals

26. Jacob Fox and Csaba D. Tóth, On the decay of crossing numbers, J. Combin. Theory Ser. B (2007), to appear.

25. Oswin Aichholzer, Clemens Huemer, Sarah Kappes, Bettina Speckmann, and Csaba D. Tóth, Decompositions, partitions, and coverings with convex polygons and pseudo-triangles, Graphs and Combinatorics (2007), to appear.

24. Michael Hoffmann, Bettina Speckmann, and Csaba D. Tóth, Pointed binary encompassing trees: simple and optimal, Comput. Geom. Theory Appl. (2007), to appear.

23. Nisheeth Shrivastava, Subhash Suri, and Csaba D. Tóth, Detecting cuts in sensor networks, Transactions on Sensor Networks (2007), to appear.

22. Ferran Hurtado, Mikio Kano, David Rappaport, and Csaba D. Tóth, Encompassing colored crossing-free geometric graphs, Comput. Geom. Theory Appl. (2006), to appear.

21. Subhash Suri, Csaba D. Tóth, and Yunhong Zhou, Selfish load balancing and atomic congestion games, Algorithmica 47 (1) (2007), 79-96.

20. József Solymosi and Csaba D. Tóth, Distinct distances in homogeneous sets in Euclidean space, Discrete Comput. Geom. 35 (4) (2006), 537-549.

19. John Hershberger, Nisheeth Shrivastava, Subhash Suri, and Csaba D. Tóth, Adaptive spatial partitioning for multidimensional data streams, Algorithmica 46 (2006), 97-117.

18. Subhash Suri, Csaba D. Tóth, and Yunhong Zhou, Range counting over multidimensional data streams, Discrete Comput. Geom. 36 (2006), 633-655.

17. Csaba D. Tóth, Alternating paths along axis-parallel segments, Graphs and Combinatorics 22 (2006), 527-543.

16. Jean-Claude Bermond, Frédéric Havet, and Csaba D. Tóth, Fault tolerant on-board networks with priorities, Networks 47 (1) (2006), 9--25.

15. John Hershberger, Subhash Suri, and Csaba D. Tóth, Binary space partition of orthogonal subdivisions, SIAM J. Comput. 34 (6) (2005), 1380-1397.

14. Bettina Speckmann and Csaba D. Tóth, Allocating vertex π-guards in simple polygons via pseudo-triangulations, Discrete Comput. Geom. 33 (2) (2005), 345-364.

13. Csaba D. Tóth, Illuminating labyrinths, Discrete Appl. Maths. 138 (1-2) (2004), 215-228.

12. Csaba D. Tóth, Illuminating disjoint line segments in the plane, Discrete Comput. Geom. 30 (3) (2003), 489-505.

11. Michael Hoffmann and Csaba D. Tóth, Alternating paths through disjoint line segments, Inform. Proc. Letts. 87 (6) (2003), 287-294.

10. Csaba D. Tóth, Binary space partition for line segments with a limited number of directions, SIAM J. Comput. 32 (2) (2003), 307-325.

9. Michael Hoffmann and Csaba D. Tóth, Segment endpoint visibility graphs are Hamiltonian, Comput. Geom. Theory Appl. 26 (1) (2003), 47-68.

8. Csaba D. Tóth, A note on binary plane partitions, Discrete Comput. Geom. 30 (1) (2003), 3-16.

7. Csaba D. Tóth, Guarding disjoint triangles and claws in the plane, Comput. Geom. Theory Appl. 25 (1-2) (2003), 51-65.

6. Csaba D. Tóth, Illumination of polygons 45º-floodlights, Discrete Maths. 265 (1-3) (2003), 251-260.

5. József Solymosi, Gábor Tardos, and Csaba D. Tóth The k most frequent distances in the palne, Discrete Comput. Geom., 28 (4) (2002), 639-648.

4. Csaba D. Tóth, Illumination in the presence of opaque line segments in the plane, Comput. Geom. Theory Appl. 21 (3) (2002), 193-204.

3. Csaba D. Tóth, Art galleries with guards of uniform range of vision, Comput. Geom. Theory Appl. 21 (3) (2002), 185-192.

2. József Solymosi and Csaba D. Tóth, Distinct distances in the plane, Discrete Comput. Geom. 25 (4) (2001), 629-634.

1. Csaba D. Tóth, Art gallery problem with guards whose range of vision is 180º, Comput. Geom. Theory Appl. 17 (3-4) (2000), 121-134.

2. Books and Book Chapters

2. Binary space partitions: recent developments, in Combinatorial and Computational Geometry, vol. 52 of MSRI Publications, Cambridge University Press, 2005, pp. 525-552.

1. Planar subdivisions, PhD thesis, DISS ETH No. 14628, ETH Zürich, 2002.

3. Conference Proceedings

27. Eynat Rafalin, Diane L. Souvaine, and Csaba D. Tóth, Cuttings for disks and axis-aligned rectangles in three-space, in Proc. 10th Workshop on Algorithms and Data Structures (Halifax, NS, 2007), LNCS, Springer, to appear.

26. Chiranjeeb Buragohain, Subhash Suri, Csaba D. Tóth, and Yunhong Zhou, Improved throughput bounds for interference-aware wireless networks, in Proc. 13th Computing and Combinatorics Conference (Banff, AB, 2007), vol. 4598 of LNCS, Springer, pp. 210-221.

25. Adrian Dumitrescu and Csaba D. Tóth, Distinct triangle areas in a planar point set, in Proc. 12th Conf. on Integer Programming and Optimization (Ithaca, NY, 2007), vol. 4513 of LNCS, Springer, pp. 119-129.

24. Adrian Dumitrescu and Csaba D. Tóth, Light orthogonal networks with constant geometric dilation, in Proc. 24th Sympos. Theoretical Aspects of Comp. Sci. (Aachen, 2007), vol. 4393 of LNCS, Springer, pp. 175-187.

23. Adrian Dumitrescu and Csaba D. Tóth, On the number of tetrahedra with minimal, unit, and distinct volumes in three-space, in Proc. 18th ACM-SIAM Sympos. on Discrete Algorithms (New Orleans, LA, 2007), ACM Press, pp. 1114-1123.

22. Jacob Fox and Csaba D. Tóth, On the decay of crossing numbers, in Proc. 14th Sympos. on Graph Drawing (Karlsruhe, 2006), vol. 4372 of LNCS, Springer, pp. 174-183.

21. Oswin Aichholzer, Clemens Huemer, Sarah Kappes, Bettina Speckmann, and Csaba D. Tóth, Decompositions, partitions, and coverings with convex polygons and pseudo-triangles,
in Proc. 31st Sympos. Math. Foundations Comp. Sci. (Stará Lesná, 2006), vol. 4162 of LNCS, Springer, pp. 86-97.

20. David Krumme, Eynat Rafalin, Diane L. Souvaine, and Csaba D. Tóth, Tight bounds for connecting sites across barriers, in Proc. 22nd ACM Sympos. Comput. Geom. (Sedona, AZ, 2006), ACM Press, pp. 439-448.

19. Csaba D. Tóth, Orthogonal subdivisions with low stabbing numbers, in Proc. 9th Workshop on Algorithms and Data Structures (Waterloo, ON, 2005), vol. 3608 of LNCS, Springer, pp. 256-268.

18. John Hershberger, Nisheeth Shrivastava, Subhash Suri, and Csaba D. Tóth, Space complexity of hierarchical heavy hitters in multi-dimensional data streams, in Proc. 24th Sympos. on Principles of Database Systems (Baltimore, MD, 2005), ACM Press, pp. 338-347.

17. Michael Hoffmann and Csaba D. Tóth, Pointed and colored binary encompassing trees, in Proc. 21st ACM Sympos. Comput. Geom. (Pisa, 2005), ACM Press, pp. 81-90.

16. György Elekes and Csaba D. Tóth, Incidences of not-too-degenerate hyperplanes, in Proc. 21st ACM Sympos. Comput. Geom. (Pisa, 2005), ACM Press, pp. 16-21.

15. Nisheeth Shrivastava, Subhash Suri, and Csaba D. Tóth, Detecting cuts in sensor networks, in Proc. 4th International Conference on Information Processing in Sensor Networks (Los Angeles, CA, 2005), IEEE, pp. 210-217.

14. John Hershberger, Nisheeth Shrivastava, Subhash Suri, and Csaba D. Tóth, Adaptive spatial partitioning for multidimensional data streams, in Proc. 15th International Symposium on Algorithms and Computation (Hong Kong, 2004), vol. 3341 of LNCS, Springer, pp. 522-533.

13.Michael Hoffmann, Bettina Speckmann, and Csaba D. Tóth, Pointed binary encompassing trees, in Proc. 9th Scandinavian Workshop on Algorithm Theory (Humlebæk, 2004), vol. 3111 of LNCS, Springer, pp. 442-454.

12. Subhash Suri, Csaba D. Tóth, and Yunhong Zhou, Selfish load balancing and atomic congestion games, in Proc. 16th ACM Sympos. on Parallelism in Algorithms and Architectures (Barcelona, 2004), ACM Press, 2004, pp. 188-195.

11. John Hershberger, Subhash Suri, and Csaba D. Tóth, Binary space partition of orthogonal subdivisions, in Proc. 20th ACM Sympos. Comput. Geom. (Brooklyn, NY, 2004), ACM Press, pp. 230-238.

10. Subhash Suri, Csaba D. Tóth, and Yunhong Zhou, Range counting over multidimensional data streams, in Proc. 20th ACM Sympos. Comput. Geom. (Brooklyn, NY, 2004), ACM Press, pp. 160-169.

9. Subhash Suri, Csaba D. Tóth, and Yunhong Zhou, Uncoordinated load balancing and congestion games in P2P systems, in Proc. 3rd Internat. Workshop on Peer-to-Peer Systems (La Jolla, CA, 2004), vol. 3279 of LNCS, Springer, pp. 123-130.

8. Csaba D. Tóth, Binary space partition for orthogonal fat rectangles, in Proc. 11th European Symposium on Algorithms (Budapest, 2003), vol. 2832 of LNCS, Springer, Berlin, pp. 494-505.

7. Csaba D. Tóth, Alternating paths along axis-parallel segments, in Proc. 8th Workshop on Algorithms and Data Structures (Ottawa, ON, 2003), vol. 2748 of LNCS, Springer, Berlin, 2003, pp. 389-400.

6. Bettina Speckmann and Csaba D. Tóth, Allocating vertex π-guards in simple polygons via pseudo-triangulations, in Proc. 14th ACM-SIAM Sympos. on Discrete Algorithms (Baltimore, MD, 2003), ACM Press, 2003, 109-118.

5. Csaba D. Tóth, Binary space partition for line segments with a limited number of directions, in Proc. 13th ACM-SIAM Sympos. on Discrete Algorithms (San Francisco, CA, 2002), ACM Press, 2002, 465-471.

4. Csaba D. Tóth, Illuminating both sides of line segments, in Discrete and Computational Geometry (J. Akiyama, M. Kano, M. Urabe, eds.), vol. 2098 of LNCS, Springer, Berlin, 2001, 370-380.

3. Csaba D. Tóth, A note on binary plane partitions, in Proc. 17th ACM Sympos. on Comput. Geom. (Medford, MA, 2001), ACM Press, 2001, 151-156.

2. József Solymosi and Csaba D. Tóth, Distinct distances in the plane, in Proc. 17th ACM Sympos. on Comput. Geom. (Medford, MA, 2001), ACM Press, 2001, 29-31.

1. Bruno Beauquier, Stéphane Pérennes, and David Tóth, All-to-all routing and coloring in weighted trees of rings, in Proc. 11th ACM Sympos. on Parallel Algorithms and Architectures (Saint-Malo, 1999), ACM Press, 1999, 185-190.

4. Others

14. Michael Hoffmann and Csaba D. Tóth, Spanning trees across axis-parallel segments, Proc. 18th Canadian Conf. Comput. Geom. (Kingston, ON, 2006), pp. 101-104.

13. Diane L. Souvaine and Csaba D. Tóth, A vertex-face assignment for plane graphs, in Proc. 17th Canadian Conf. on Comput. Geom. (Windsor, ON, 2005), pp. 131-134.

12. Anshul Kothari, Subhash Suri, Csaba D. Tóth, and Yunhong Zhou, Congestion games, load balancing, and price of anarchy, in Proc. Workshop on Combinatorial and Algorithmic Aspects of Networking (Banff, AB, 2004), vol. 3405 of LNCS, Springer, 2005, pp. 13-27.

11. Michael Hoffmann, Bettina Speckmann, and Csaba D. Tóth, Pointed binary encompassing trees: simple and optimal, in Abstracts of 14th Annual Fall Workshop on Computational Geometry (Cambridge, MA, 2004), pp. 28-29; and in Abstracts of 21st European Workshop on Comput. Geom. (Eidhoven, 2005), pp. 93-96.

10. Ferran Hurtado, Mikio Kano, David Rappaport, and Csaba D. Tóth, Encompassing colored crossing-free geometric graphs, in Proc. 16th Canadian Conf. Comput. Geom. (Montréal, QC, 2004), pp. 48-52.

9. Michael Hoffmann, Bettina Speckmann, and Csaba D. Tóth, Pointed binary encompassing trees, in Abstracts of 20th European Workshop on Comput. Geom. (Seville, 2004), pp. 131-314.

8. Oswin Aichholzer, Michael Hoffmann, Bettina Speckmann, and Csaba D. Tóth, Degree bounds for constrained pseudo-triangulations, in Proc. 15th Canadian Conf. Comput. Geom. (Halifax, NS, 2003), pp. 155-158.

7. Csaba D. Tóth, Alternating paths along axis-parallel segments, in Abstracts of 19th European Wrokshop on Comput. Geom. (Bonn, 2003), pp. 133-136.

6. Michael Hoffmann and Csaba D. Tóth, Alternating paths through disjoint line segments, Abstracts of the 18th European Workshop on Comput. Geom. (Warsaw, 2002),

5. Michael Hoffmann and Csaba D. Tóth, Segment endpoint visibility graphs are Hamiltonian, in Proc. 13th Canadian Conference on Comput. Geom. (Waterloo, ON, 2001), 109-112.

4. Csaba D. Tóth, Illuminating polygons with vertex π-floodlights, in Proc. Int. Conf. on Comput. Sci. (San Francisco, CA, 2001) Part I, vol, 2073 of LNCS, Springer, Berlin, 2001, 772-781.

3. Jean-Claude Bermond, Frédéric Havet, and Csaba D. Tóth, Fault tolerant on-board networks with priorities, in Proc. 3rd AlgoTel (Saint-Jean-de-Luz, 2001), pp. 95-98.

2. Csaba D. Tóth, Guarding disjoint triangles and claws in the plane, in Abstracts of the 17th European Workshop on Comput. Geom. (Berlin, 2001),

1. Csaba D. Tóth, Illuminating labyrinths, in Abstracts of Optimal Discrete Structures and Algorithms (Rostock, 2000).

Manuscripts