Csaba D. Tóth
Assistant Professor
Department of Mathematics and Statistics
University of Calgary, Room MS432
2500 University Drive, NW
Calgary, AB, Canada T2N 1N4
Phone: +1 (403) 220-3950
cdtoth ♠ math.ucalgary.ca

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

1. In Journals
  1. Karin Arikushi, Radoslav Fulek, Balázs Keszegh, Filip Morić, and Csaba D. Tólth, Graphs that admit right angle crossing drawings, Comput. Geom. Theory Appl. 45 (4) (2012), 169-177.
  2. Eyal Ackerman, Radoslav Fulek, and Csaba D. Tóth, Graphs that admit polyline drawings with few crossing angles, SIAM J. Discrete Math. (2011), to appear.
  3. André Schulz and Csaba D. Tóth, he union of colorful simplices spanned by a colored point set, Comput. Geom. Theory Appl. (2012), in print.
  4. Marwan Al-Jubeh, Mashhood Ishaque, Kristóf Rédei, Diane L. Souvaine, Csaba D. Tóth, and Pavel Valtr, Augmenting the edge connectivity of planar straight line graphs to three, Algorithmica 61 (4) (2011), 971-999.
  5. Adrian Dumitrescu, Minghui Jiang, and Csaba D. Tóth, New bounds on the average distance from the Fermat-Weber center of a planar convex body, Discrete Optimization 8 (3) (2011), 417-427.
  6. Ondřej Bílka, Kevin Buchin, Radoslav Fulek, Masashi Kiyomi, Yoshio Okamoto, Shin-ichi Tanigawa, and Csaba D. Tóth, A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets, Electronic Journal of Combinatorics 17 (1) (2010), article N35.
  7. Csaba D. Tóth, Connectivity augmentation in planar straight line graphs, European Journal of Combinatorics 33 (3) (2012), 408–425.
  8. Adrian Dumitrescu and Csaba D. Tóth, Long non-crossing configurations in the plane, Discrete Comput. Geom. 44 (4) (2010), 727-752.
  9. Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, and Csaba D. Tóth, Convex partitions with 2-edge connected dual graphs, J. Combinatorial Optimization 22 (3) (2010), 409-425.
  10. Csaba D. Tóth, Binary plane partitions for disjoint line segments, Discrete Comput. Geom. 45 (4) (2011), 617-646..
  11. Adrian Dumitrescu and Csaba D. Tóth, Minimum weight convex Steiner partitions, Algorithmica 60 (3) (2011), 627-652.
  12. Adrian Dumitrescu, Csaba D. Tóth, and Guangwu Xu, On stars and Steiner stars, Discrete Optimization 6 (3) (2009), 324-332.
  13. Adrian Dumitrescu, Micha Sharir, and Csaba D. Tóth, Extremal problems on triangle areas in the plane and three-space, J. Combin. Theory Ser A 116 (2009), 1177–1198.
  14. Eynat Rafalin, Diane L. Souvaine, and Csaba D. Tóth, Cuttings for disks and axis-aligned rectangles in three-space, Discrete Comput. Geom. 43 (2) (2010), 221-241.
  15. Jacob Fox, János Pach, and Csaba D. Tóth, A bipartite strengthening of the Crossing Lemma, J. Combin. Theory, Ser. B 100 (1) (2010), 23-35.
  16. Menelaos I. Karavelas, Csaba D. Tóth, and Elias P. Tsigaridas, Guarding curvilinear art galleries with vertex or point guards, Comput. Geom. Theory Appl. 42 (6-7) (2009), 522-535.
  17. Csaba D. Tóth, Stabbing numbers of convex subdivisions, Periodica Mathematica Hungarica 57 (2) (2008), 217-225.
  18. Adrian Dumitrescu and Csaba D. Tóth, Light orthogonal networks with constant geometric dilation, J. Discrete Algorithms 7 (1) (2009), 112-129.
  19. Jacob Fox, János Pach, and Csaba D. Tóth, Intersection patterns of curves, J. London Math. Soc. 83 (2) (2011), 389-406.
  20. Diane L. Souvaine and Csaba D. Tóth, A vertex-face assignment for plane graphs, Comput. Geom. Theory Appl. 42 (5) (2009), 388-394.
  21. József Solymosi and Csaba D. Tóth, On a question of Bourgain about geometric incidences, Combinatorics Probability and Computing 17 (4) (2008), 617-625.
  22. Csaba D. Tóth, Axis-aligned subdivisions with low stabbing numbers, SIAM J. Discrete Math. 22 (3) (2008), 1187-1204.
  23. Adrian Dumitrescu and Csaba D. Tóth, On the number of tetrahedra with minimal, unit, and distinct volumes in three-space, Combinatorics Probability and Computing 17 (2008), 203-224.
  24. Jacob Fox, János Pach, and Csaba D. Tóth, Turán-type results for partial orders and intersection graphs of convex sets, Israel J. of Math. 178 (2010), 29-50.
  25. Adrian Dumitrescu and Csaba D. Tóth, Analysis of two sweep-line algorithms for constructing spanning trees and Steiner trees, J. Universal Comp. Sci., 13 (11) (2007), 1615-1627.
  26. Csaba D. Tóth, Binary space partition for axis-aligned fat rectangles, SIAM J. Comput. 38 (1) (2008), 429-447.
  27. David Krumme, Eynat Rafalin, Diane L. Souvaine, and Csaba D. Tóth, Tight bounds for connecting sites across barriers, Discrete Comput. Geom. 40 (3) (2008), 377-394.
  28. Jacob Fox and Csaba D. Tóth, On the decay of crossing numbers, J. Combin. Theory Ser. B 98 (1) (2008), 33-42.
  29. 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 23 (5) (2007), 481-507.
  30. Michael Hoffmann, Bettina Speckmann, and Csaba D. Tóth, Pointed binary encompassing trees: simple and optimal, Comput. Geom. Theory Appl. 43 (1) (2010), 35-41.
  31. Nisheeth Shrivastava, Subhash Suri, and Csaba D. Tóth, Detecting cuts in sensor networks, Transactions on Sensor Networks 4 (2) (2008), article 10.
  32. Ferran Hurtado, Mikio Kano, David Rappaport, and Csaba D. Tóth, Encompassing colored crossing-free geometric graphs, Comput. Geom. Theory Appl. 39 (2008), 14-23.
  33. Subhash Suri, Csaba D. Tóth, and Yunhong Zhou, Selfish load balancing and atomic congestion games, Algorithmica 47 (1) (2007), 79-96.
  34. József Solymosi and Csaba D. Tóth, Distinct distances in homogeneous sets in Euclidean space, Discrete Comput. Geom. 35 (4) (2006), 537-549.
  35. John Hershberger, Nisheeth Shrivastava, Subhash Suri, and Csaba D. Tóth, Adaptive spatial partitioning for multidimensional data streams, Algorithmica 46 (2006), 97-117.
  36. Subhash Suri, Csaba D. Tóth, and Yunhong Zhou, Range counting over multidimensional data streams, Discrete Comput. Geom. 36 (2006), 633-655.
  37. Csaba D. Tóth, Alternating paths along axis-parallel segments, Graphs and Combinatorics 22 (2006), 527-543.
  38. 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.
  39. John Hershberger, Subhash Suri, and Csaba D. Tóth, Binary space partition of orthogonal subdivisions, SIAM J. Comput. 34 (6) (2005), 1380-1397.
  40. Bettina Speckmann and Csaba D. Tóth, Allocating vertex π-guards in simple polygons via pseudo-triangulations, Discrete Comput. Geom. 33 (2) (2005), 345-364.
  41. Csaba D. Tóth, Illuminating labyrinths, Discrete Appl. Maths. 138 (1-2) (2004), 215-228.
  42. Csaba D. Tóth, Illuminating disjoint line segments in the plane, Discrete Comput. Geom. 30 (3) (2003), 489-505.
  43. Michael Hoffmann and Csaba D. Tóth, Alternating paths through disjoint line segments, Inform. Proc. Letts. 87 (6) (2003), 287-294.
  44. Csaba D. Tóth, Binary space partition for line segments with a limited number of directions, SIAM J. Comput. 32 (2) (2003), 307-325.
  45. Michael Hoffmann and Csaba D. Tóth, Segment endpoint visibility graphs are Hamiltonian, Comput. Geom. Theory Appl. 26 (1) (2003), 47-68.
  46. Csaba D. Tóth, A note on binary plane partitions, Discrete Comput. Geom. 30 (1) (2003), 3-16.
  47. Csaba D. Tóth, Guarding disjoint triangles and claws in the plane, Comput. Geom. Theory Appl. 25 (1-2) (2003), 51-65.
  48. Csaba D. Tóth, Illumination of polygons 45º-floodlights, Discrete Maths. 265 (1-3) (2003), 251-260.
  49. 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.
  50. Csaba D. Tóth, Illumination in the presence of opaque line segments in the plane, Comput. Geom. Theory Appl. 21 (3) (2002), 193-204.
  51. Csaba D. Tóth, Art galleries with guards of uniform range of vision, Comput. Geom. Theory Appl. 21 (3) (2002), 185-192.
  52. József Solymosi and Csaba D. Tóth, Distinct distances in the plane, Discrete Comput. Geom. 25 (4) (2001), 629-634.
  53. 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.

3. In Conference Proceedings
  1. Adrian Dumitrescu and Csaba D. Tóth, Packing anchored rectangles, in Proc. 23rd ACM-SIAM Sympos. on Discrete Algorithms (Kyoto, 2012), SIAM, 2012, to appear.
  2. Javier Cano, Csaba D. Tóth, and Jorge Urrutia, New upper bound constructions for untangling planar geometric graphs, in Proc. 19th Sympos. Graph Drawing (Eindhoven, 2011), LNCS, Springer, to appear.
  3. Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, and Emo Welzl, Counting plane graphs: flippability and its applications, in Proc. WADS (Brooklyn, NY, 2011), vol. 6844 of LNCS, Springer, pp. 524-535.
  4. Mashhood Ishaque, Diane L. Souvaine, and Csaba D. Tóth, Disjoint compatible geometric matchings, in Proc. 27th Sympos on Comput. Geom. (Paris, 2011), ACM Press, pp. 125-134.
  5. Adrian Dumitrescu, André Schulz, Adam Sheffer, and Csaba D. Tóth, Bounds on the maximum multiplicity of some common geometric graphs, in Proc. 28th Sympos. on Theoretical Aspects of Comp. Sci. (Dortmund, 2011), vol. 5 of Leibniz International Proceedings in Informatics, Schloss Dagstuhl, pp. 637-648.
  6. André Schulz and Csaba D. Tóth, The union of colorful simplices spanned by a colored point set, in Proc. 4th Conf. on Combin. Optimization and Appl. (Kailua Kona, 2010), vol. 6508 of LNCS, Springer, pp. 324-338.
  7. Eyal Ackerman, Radoslav Fulek, and Csaba D. Tóth, On the size of graphs that admit polyline drawings with few bends and crossing angles, in Proc. 18th Sympos. on Graph Drawing (Konstanz, 2010), vol. 6502 of LNCS, Springer, 2011, pp. 1-12.
  8. Karin Arikushi, Radoslav Fulek, Balázs Keszegh, Filip Morić, and Csaba D. Tólth, Graphs that admit right angle crossing drawings, in Proc. 36th International Workshop on Graph Theoretic Concepts in Computer Science (Zaró, 2010), vol. 6410 of LNCS, Springer, pp. 135-146.
  9. Adrian Dumitrescu and Csaba D. Tóth, Long non-crossing configurations in the plane, in Proc. 27th Sympos. Theoretical Aspects of Comp. Sci. (Nancy, 2010), Leibniz International Proceedings in Informatics, Schloss Dagstuhl, pp. 311-322.
  10. Adrian Dumitrescu and Csaba D. Tóth, New bounds on the average distance from the Fermat-Weber center of a planar convex body, in Proc. 20th Internat. Sympos. on Algorithms and Computation (Honolulu, HI, 2009), vol. 5878 of LNCS, Springer, pp. 132-141.
  11. Marwan Al-Jubeh, Mashhood Ishaque, Kristóf Rédei, Diane L. Souvaine, and Csaba D. Tóth, Tri-edge-connectivity augmentation for planar straight line graphs, in Proc. 20th Internat. Sympos. on Algorithms and Computation (Honolulu, HI, 2009), vol. 5878 of LNCS, Springer, pp. 902-911.
  12. Kevin Buchin, Radoslav Fulek, Masashi Kiyomi, Yoshio Okamoto, Shin-ichi Tanigawa, and Csaba D. Tóth, A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets, in Proc. 7th Japan Conference on Computational Geometry and Graphs (Kanazawa, 2009), JAIST.
  13. Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, and Csaba D. Tóth, Convex partitions with 2-edge connected dual graphs, in Proc. 15th Internat. Computing and Combin. Conf. (Niagara Falls, NY, 2009), vol. 5609 of LNCS, Springer, pp. 192-204.
  14. Csaba D. Tóth, Binary plane partitions for disjoint line segments, Proc. 25th Sympos. on Comput. Geom. (Aarhus, 2009), ACM Press, pp. 71-79.
  15. Mashhood Ishaque, Bettina Speckmann, and Csaba D. Tóth, Shooting permanent rays among disjoint polygons in the plane, in Proc. 25th Sympos. on Comput. Geom. (Aarhus, 2009), ACM Press, pp. 51-60.
  16. Adrian Dumitrescu, Csaba D. Tóth, and Guangwu Xu, On stars and Steiner stars II, in Proc. 20th ACM-SIAM Sympos. on Discrete Algorithms (New York, NY, 2009), ACM Press, pp. 311-317.
  17. Mashhood Ishaque and Csaba D. Tóth, Dynamic geodesic hulls in semi-dynamic subdivisions, in Proc. 16th European Symposium on Algorithms (Karlsruhe, 2008), vol. 5193 of LNCS, Springer, pp. 780-792.
  18. Csaba D. Tóth, Connectivity augmentation in plane straight line graphs, in Proc. Conf. on Topological & Geometric Graph Theory (Paris, 2008), pp. 51-54.
  19. Adrian Dumitrescu, Micha Sharir, and Csaba D. Tóth, Extremal problems on triangle areas in the plane and three-space, in Proc. 24nd ACM Sympos. Comput. Geom. (College Park, MD, 2008), ACM Press, pp. 208-217.
  20. Adrian Dumitrescu and Csaba D. Tóth, Minimum weight convex Steiner partitions, in Proc. 19th ACM-SIAM Sympos. on Discrete Algorithms (San Francisco, CA, 2008), ACM Press, pp. 581-590.
  21. Adrian Dumitrescu and Csaba D. Tóth, On stars and Steiner stars, in Proc. 19th ACM-SIAM Sympos. on Discrete Algorithms (San Francisco, CA, 2008), ACM Press, pp. 1233-1240.
  22. Jacob Fox, János Pach, and Csaba D. Tóth, A bipartite strengthening of the Crossing Lemma, in Proc. 15th Sympos. on Graph Drawing (Sydney, 2007), vol. 4875 of LNCS, Springer, 2008, pp. 13-24.
  23. 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, pp. 470-482.
  24. 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.
  26. 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.
  27. 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.
  28. 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.
  29. 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.
  30. 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.
  31. 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.
  32. 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.
  33. 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.
  34. 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.
  35. 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.
  36. 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.
  37. 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.
  38. 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.
  39. 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.
  40. 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.
  41. 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.
  42. 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.
  43. 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.
  44. 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.
  45. 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.
  46. 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.
  47. 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.
  48. 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.
  49. 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.
3. In Books and Book Chapters
  1. Ferran Hurtado and Csaba D. Tóth, Plane geometric graph augmentation: a generic perspective, in Thirty Essays on Geometric Graph Theory (J. Pach, ed.), vol. 29 of Algorithms and Combinatorics, Springer, 2012, to appear.
  2. Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, and Emo Welzl, Counting plane graphs: flippability and its applications, in Thirty Essays on Geometric Graph Theory (J. Pach, ed.), vol. 29 of Algorithms and Combinatorics, Springer, 2012, to appear.
  3. Marwan Al-Jubeh, Gill Barequet, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth, and Andrew Winslow, Constrained tri-connected planar straight line graphs, in Thirty Essays on Geometric Graph Theory (J. Pach, ed.), vol. 29 of Algorithms and Combinatorics, Springer, 2012, to appear.
  4. Binary space partitions: recent developments, in Combinatorial and Computational Geometry, vol. 52 of MSRI Publications, Cambridge University Press, 2005, pp. 525-552.
  5. Planar subdivisions, PhD thesis, DISS ETH No. 14628, ETH Zürich, 2002.

4. Others
  1. Csaba D. Tóth, Godfried Toussaint, and Andrew Winslow, Open guard edges and edge guards in simple polygons, in Proc. 23rd Canadian Conf. Comput. Geom. (Toronto, ON, 2011), pp. 449-454.
  2. Ben D. Lund, George B. Purdy, Justin W. Smith, and Csaba D. Tóth, Collinearities in kinetic points, in Proc. 23rd Canadian Conf. Comput. Geom. (Toronto, ON, 2011), pp. 223-227.
  3. Diane L. Souvaine, Csaba D. Tóth, and Andrew Winslow, Simultaneously flippable edges in triangulations, in Proc. XIV Spanish Meeting on Comput. Geom. (Alcalá de Henares, 2011), 137-140.
  4. Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth, and Andrew Winslow, Constrained tri-connected planar straight line graphs, in Abstracts of the 20th Fall Workshop on Comput. Geom. (Stony Brook, NY, 2010).
  5. Sarah Cannon, Mashhood Ishaque, and Csaba D. Tóth, Even orientations with forbilien pairs and demands, in Abstracts of the 20th Fall Workshop on Comput. Geom. (Stony Brook, NY, 2010).
  6. Adrian Dumitrescu and Csaba D. Tóth, Watchman tours for polygons with holes, in Proc. 22nd Canadian Conf. Comput. Geom. (Winnipeg, 2010), pp. 113-116.
  7. Marwan Al-Jubeh, Gill Barequet, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth, and Andrew Winslow, Connecting obstacles in vertex-disjoint paths, in Abstracts of the 26th European Workshop on Comput. Geom. (Dortmund, 2010).
  8. Karin Arikushi and Csaba D. Tóth, Drawing graphs with 90° crossings and at most 1 or 2 bends per edge, in Abstracts of the 19th Fall Workshop on Comput. Geom. (Medford, MA, 2009), pp. 41-42.
  9. Csaba D. Tóth and Pavel Valtr, Augmenting the edge connectivity of planar straight line graphs to three, in Proc. XIII Encuentros de Geometría Computacional (Zaragoza, 2009).
  10. Adrian Dumitrescu and Csaba D. Tóth, A tight lower bound on the average distance from the Fermat-Weber center of a planar convex body, Abstracts of the 18th Fall Workshop on Comput. Geom. (Troy, NY, 2008), pp. 63-64.
  11. Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, and Csaba D. Tóth, Convex partitions with 2-edge connected dual graphs, in Abstracts of the 18th Fall Workshop on Comput. Geom. (Troy, NY, 2008), pp. 61-62.
  12. Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, and Csaba D. Tóth, Disjoint segments have a convex partition with a 2-edge connected dual graph, in Proc. 19th Canadian Conf. Comp. Geom. (Ottawa, ON, 2007), pp. 13-16.
  13. 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.
  14. 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.
  15. 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.
  16. 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.
  17. 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.
  18. 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.
  19. 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.
  20. Csaba D. Tóth, Alternating paths along axis-parallel segments, in Abstracts of 19th European Wrokshop on Comput. Geom. (Bonn, 2003), pp. 133-136.
  21. Michael Hoffmann and Csaba D. Tóth, Alternating paths through disjoint line segments, Abstracts of the 18th European Workshop on Comput. Geom. (Warsaw, 2002),
  22. 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.
  23. 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.
  24. 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.
  25. Csaba D. Tóth, Guarding disjoint triangles and claws in the plane, in Abstracts of the 17th European Workshop on Comput. Geom. (Berlin, 2001),
  26. Csaba D. Tóth, Illuminating labyrinths, in Abstracts of Optimal Discrete Structures and Algorithms (Rostock, 2000).

Manuscripts