Csaba D. Tóth
Department of Mathematics
California State University, Northridge
Room SN 434, 18111 Nordhoff St
Northridge, CA 91330-8313
Phone: (818) 677-2826
cdtoth ♠ acm.org


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


1. In Journals
  1. Csaba D. Tóth, Minimum weight Euclidean (1+ε)-spanners, European J. Combin. 118 (2024), 103927.
  2. Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, and Csaba D. Tóth, Online spanners in metric spaces, SIAM J. Discrete Math. 38(1) (2024), pp. 1030-1056.
  3. Jonathan Conroy and Csaba D. Tóth, Hop spanners for geometric intersection graphs, J. Comput. Geom.14 (2) (2023), 26-64.
  4. Csaba D. Tóth, Jorge Urrutia, and Giovanni Viglietta, Minimizing visible edges in polyhedra, Graphs and Combinatorics 39(5) (2023), article 111.
  5. Fabrizio Frati, Michael Hoffmann, and Csaba D. Tóth, Universal geometric graphs, Combinatorics, Probability, and Computing 32 (5) (2023), 742-761.
  6. Hugo A. Akitaya, Matthew D. Jones, Matias Korman, Oliver Korten, Christopher Meierfrankenfeld, Michael J. Munje, Diane Souvaine, Michael Thramann, and Csaba D. Tóth, Reconfiguration of connected graph partitions, Journal of Graph Theory 102 (1) (2023), 35-66.
  7. Sujoy Bhore and Csaba D. Tóth, Euclidean Steiner spanners: Light and sparse, SIAM Discrete Math. 36(3) (2022), 2411-2444.
  8. Alon Efrat, Radoslav Fulek, Stephen Kobourov, and Csaba D. Tóth, Polygons with prescribed angles in 2D and 3D, Journal of Graph Algorithms and Applications 26 (3) (2022), 363-380.
  9. Hugo Akitaya, Matias Korman, Oliver Korten, Mikhail Rudoy, Diane Souvaine, and Csaba D. Tóth, Circumscribing polygons and polygonizations for disjoint line segments, Discrete Comput. Geom. 68 (2022), 218-254.
  10. Hugo A. Akitaya, Matias Korman, Oliver Korten, Diane L. Souvaine, and Csaba D. Tóth, Reconfiguration of connected graph partitions via recombination, Theoretical Computer Science 923 (2022), 13-26.
  11. Adrian Dumitrescu and Csaba D. Tóth, Online unit clustering in higher dimensions, Algorithmica 84 (5) (2022), 1213-1231.
  12. Radoslav Fulek and Csaba D. Tóth, Atomic embeddability, clustered planarity, and thickenability, JACM 69 (2) (2022), article 13.
  13. Javiér Cano, Csaba D. Tóth, Jorge Urrutia, and Giovanni Viglietta, Edge guards for polyhedra in three-space, Computational Geometry: Theory and Applications 104 (2022), 101859.
  14. Adrian Dumitrescu, Anirban Ghosh, and Csaba D. Tóth, Sparse hop spanners for unit disk graphs, Computational Geometry: Theory and Applications 100 (2022), 101808.
  15. Ke Chen, Adrian Dumitrescu, Wolfgang Mulzer, and Csaba D. Tóth, On the stretch factor of a polygonal chain, SIAM J. Discrete Math. 35 (3) (2021), 1592-1614.
  16. David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval, David Orden, Javier Tejel, Csaba D. Tóth, Jorge Urrutia, and Birgit Vogtenhuber, Rainbow polygons for colored point sets in the plane, Discrete Mathematics 344 (7) (2021), 112406.
  17. Marcos Oropeza and Csaba D. Tóth, Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees, Information Processing Letters 170 (2021), 106116.
  18. Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, and Sander Verdonschot, Convex polygons in Cartesian products, Journal of Computational Geometry 11(2) (2020), 205-233.
  19. Hugo A. Akitaya, Maarten Löffler, and Csaba D. Tóth, Multi-colored spanning graphs, Theoretical Computer Science 833 (2020), 11-25.
  20. Radoslav Fulek and Csaba D. Tóth, Crossing minimization in perturbed drawings, J. Combin. Opt. 40 (2020), 279-302.
  21. Hugo A. Akitaya, Matthew D. Jones, David Stalfa, and Csaba D. Tóth, The reach of axis-aligned squares in the plane, Discrete Opt. 37 (2020), 100580.
  22. Torrie L. Nichols, Alexander Pilz, Csaba D. Tóth, and Ahad N. Zehmakan, Transition operations over plane trees, Discrete Math. 343 (8) (2020), 111929.
  23. Adrian Dumitrescu and Csaba D. Tóth, A problem on track runners, Computational Geometry: Theory and Applications 88 (2020), 101611.
  24. Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Michael Hoffmann, Giuseppe Liotta, Fabrizio Montecchian, and Csaba D. Tóth, Simple k-planar graphs are (k+1)-quasiplanar, J. Combin. Theory Ser. B 142 (2020), 1-35.
  25. Adrian Dumitrescu, Anirban Ghosh, and Csaba D. Tóth, Online unit covering in Euclidean space, Theoretical Computer Science 809 (2020), 218-230.
  26. Hugo A. Akitaya, Radoslav Fulek, and Csaba D. Tóth, Recognizing weak embeddings of graphs, ACM Transactions on Algorithms 15(4) (2019), article 50.
  27. Hugo A. Akitaya, Rajasekhar Inkulu, Torrie L. Nichols, Diane L. Souvaine, Csaba D. Tóth, and Charles R. Winston, Minimum weight connectivity augmentation for planar straight-line graphs, Theoretical Computer Science 789 (2019), 50-63.
  28. Sang Won Bae, Jean-Francois Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, and Csaba D. Tóth, Gap-planar graphs, Theoretical Computer Science 745 (2018), 36-52.
  29. Hugo A. Akitaya and Csaba D. Tóth, Reconstruction of weakly simple polygons from their edges, Internat. J. Comput. Geom. Appl. 28 (2) (2018) 161-180.
  30. Adrian Dumitrescu, Ritankar Mandal, and Csaba D. Tóth, Monotone paths in geometric triangulations, Theory of Computing Systems 62 (6) (2018), 1490-1524.
  31. Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, and Manuel Wettstein, Arc diagrams, flip distances, and Hamiltonian triangulations, Computational Geometry: Theory and Applications 68 (2018), 206-225.
  32. János Pach, László Székely, Csaba D. Tóth, and Géza Tóth, Note on k-planar crossing numbers, Computational Geometry: Theory and Applications 68 (2018), 2-6.
  33. Hugo Akitaya, Greg Aloupis, Jeff Erickson, and Csaba D. Tóth, Recognizing weakly simple polygons, Discrete and Computational Geometry 58 (4) (2017), 785–821.
  34. Kevin Balas, Adrian Dumitrescu, and Csaba D. Tóth, Anchored rectangle and square packings, Discrete Optimization 26 (2017), 131-162.
  35. Adrian Dumitrescu and Csaba D. Tóth, Convex polygons in geometric triangulations, Combinatorics, Probability, and Computing 26 (5) (2017), 641-659.
  36. Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, and Csaba D. Tóth, The planar tree packing theorem, J. Comput. Geom. 8 (2) (2017), 109–177.
  37. Andrea Francke and Csaba D. Tóth, A census of plane graphs with polyline edges, SIAM J. Discrete Math. 31 (2) (2017), 1174-1195.
  38. Jean Cardinal, Csaba D. Tóth, and David R. Wood, A note on independent hyperplanes and general position subsets in d-space, Journal of Geometry 108 (1) (2017), 33-43.
  39. Kevin Balas and Csaba D. Tóth, On the number of maximal anchored rectangle packings, Theoretical Computer Science 654 (2016), 143–154.
  40. Eli Fox-Epstein, Csaba D. Tóth, and Andrew Winslow, Diffuse reflection radius in a simple polygon, Algorithmica 76 (4) (2016), 910-931.
  41. Gill Barequet, Sarah M. Cannon, Eli Fox-Epstein, Benjamin Hescott, Diane L. Souvaine, Csaba D. Tóth, and Andrew Winslow, Diffuse reflections in simple polygons, Discrete Applied Mathematics 210 (2016), 123-132.
  42. Adrian Dumitrescu and Csaba D. Tóth, The traveling salesman problem for lines, balls and planes, Transactions on Algorithms 12 (3) (2016), article 43.
  43. Adrian Dumitrescu, Maarten Löffler, André Schulz, and Csaba D. Tóth, Counting carambolas, Graphs and Combinatorics 32 (3) (2016), 923-942.
  44. Eyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine, and Csaba D. Tóth, The flip diameter of rectangulations and convex subdivisions, Discrete Mathematics and Theoretical Computer Science 18 (3) (2016), article 4.
  45. Andres J. Ruiz-Vargas, Andrew Suk, and Csaba D. Tóth, Disjoint edges in topological graphs and the tangled-thrackle conjecture, European J. Combinatorics 51 (2016), 398–406.
  46. Adrian Dumitrescu and Csaba D. Tóth, On the total perimeter of homothetic convex bodies in a convex container, Contributions to Algebra and Geometry 56 (2) (2015), 515-532.
  47. Adrian Dumitrescu, Minghui Jiang, and Csaba D. Tóth, Computing opaque interior barriers à la Shermer, SIAM Journal on Discrete Mathematics 29 (3) (2015), 1372–1386.
  48. Zachary Abel, Robert Connelly, Sarah Eisenstat, Radoslav Fulek, Filip Morić, Yoshio Okamoto, Tibor Szabó, and Csaba D. Tóth, Free edge lengths in plane graphs, Discrete and Computational Geometry 54 (1) (2015), 259-289.
  49. Csaba D. Tóth, The Szemerédi-Trotter Theorem in the complex plane, Combinatorica 35 (1) (2015), 95-126.
  50. Adrian Dumitrescu and Csaba D. Tóth, Packing anchored rectangles, Combinatorica 35 (1) (2015), 39-61.
  51. Alfredo García, Ferran Hurtado, Matias Korman, Inês Matos, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, and Csaba D. Tóth, Geometric biplane graphs II: Graph augmentation, Graphs and Combinatorics 31 (2) (2015), 427-452.
  52. Alfredo García, Ferran Hurtado, Matias Korman, Inês Matos, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, and Csaba D. Tóth, Geometric biplane graphs I: Maximal graphs, Graphs and Combinatorics 31 (2) (2015), 407-425.
  53. Radoslav Fulek and Csaba D. Tóth, Universal point sets for planar three-trees, Journal of Discrete Algorithms 30 (2015), 101-112.
  54. Javier Cano, Csaba D. Tóth, and Jorge Urrutia, Upper bound constructions for untangling planar geometric graphs, SIAM J. Discrete Math. 28 (4) (2014), 1935-1943.
  55. Karin Arikushi and Csaba D. Tóth, Crossing angles of geometric graphs, J. Graph Algorithms and Applications 18 (3) (2014), 401-420.
  56. Adrian Dumitrescu, Anirban Ghosh, and Csaba D. Tóth, On fence patrolling by mobile agents, Electronic Journal of Combinatorics 21 (3) (2014), P3.4.
  57. Michael Hoffmann and Csaba D. Tóth, Vertex-colored encompassing graphs, Graphs and Combinatorics 30 (4) (2014), 933-947.
  58. Fabrizio Frati, Michael Kaufmann, János Pach, Csaba D. Tóth, and David Wood, On the upward planarity of mixed plane graphs, J. Graph Algorithms and Applications 18 (2) (2014), 253-279.
  59. Adrian Dumitrescu, Sariel Har-Peled, and Csaba D. Tóth, Minimum convex partitions and maximum empty polytopes, Journal of Computational Geometry 5 (1) (2014), 86–103.
  60. Adrian Dumitrescu, Dániel Gerbner, Balázs Keszegh, and Csaba D. Tóth, Covering paths for planar point sets, Discrete Comput. Geom. 51 (2) (2014), 462-484.
  61. Mashhood Ishaque and Csaba D. Tóth, Relative convex hulls in semi-dynamic arrangements, Algorithmica 68 (2) (2014), 448-482.
  62. Javier Cano, Csaba D. Tóth, and Jorge Urrutia, A tight bound for point guards in piece-wise convex art galleries, Comput. Geom. Theory. Appl. 46 (8) (2013), 945–958.
  63. Adrian Dumitrescu, André Schulz, Adam Sheffer, and Csaba D. Tóth, Bounds on the maximum multiplicity of some common geometric graphs, SIAM Discrete Math. 27 (2) (2013), 802–826.
  64. Mashhood Ishaque, Diane L. Souvaine, and Csaba D. Tóth, Disjoint compatible geometric matchings, Discrete Comput. Geom. 49 (1) (2013), 89-131.
  65. André Schulz and Csaba D. Tóth, The union of colorful simplices spanned by a colored point set, Comput. Geom. Theory Appl. 46 (2013), 574-590.
  66. Mashhood Ishaque, Bettina Speckmann, and Csaba D. Tóth, Shooting permanent rays among disjoint polygons in the plane, SIAM J. Comput. 41 (4) (2012), 1005-1027.
  67. Adrian Dumitrescu and Csaba D. Tóth, Watchman tours for polygons with holes, Comput. Geom. Theory Appl. 45 (7) (2012), 326-333.
  68. Eyal Ackerman, Radoslav Fulek, and Csaba D. Tóth, Graphs that admit polyline drawings with few crossing angles, SIAM J. Discrete Math. 26 (1) (2012), 305-320.
  69. 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.
  70. Csaba D. Tóth, Connectivity augmentation in planar straight line graphs, European Journal of Combinatorics 33 (3) (2012), 408–425.
  71. 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.
  72. 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.
  73. Csaba D. Tóth, Binary plane partitions for disjoint line segments, Discrete Comput. Geom. 45 (4) (2011), 617-646.
  74. Adrian Dumitrescu and Csaba D. Tóth, Minimum weight convex Steiner partitions, Algorithmica 60 (3) (2011), 627-652.
  75. Jacob Fox, János Pach, and Csaba D. Tóth, Intersection patterns of curves, J. London Math. Soc. 83 (2) (2011), 389-406.
  76. 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) (2011), 409-425.
  77. 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.
  78. Adrian Dumitrescu and Csaba D. Tóth, Long non-crossing configurations in the plane, Discrete Comput. Geom. 44 (4) (2010), 727-752.
  79. 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.
  80. 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.
  81. 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.
  82. 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.
  83. 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.
  84. Adrian Dumitrescu, Csaba D. Tóth, and Guangwu Xu, On stars and Steiner stars, Discrete Optimization 6 (3) (2009), 324-332.
  85. 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.
  86. Adrian Dumitrescu and Csaba D. Tóth, Light orthogonal networks with constant geometric dilation, J. Discrete Algorithms 7 (1) (2009), 112-129.
  87. Diane L. Souvaine and Csaba D. Tóth, A vertex-face assignment for plane graphs, Comput. Geom. Theory Appl. 42 (5) (2009), 388-394.
  88. Csaba D. Tóth, Stabbing numbers of convex subdivisions, Periodica Mathematica Hungarica 57 (2) (2008), 217-225.
  89. 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.
  90. Csaba D. Tóth, Axis-aligned subdivisions with low stabbing numbers, SIAM J. Discrete Math. 22 (3) (2008), 1187-1204.
  91. 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.
  92. Csaba D. Tóth, Binary space partition for axis-aligned fat rectangles, SIAM J. Comput. 38 (1) (2008), 429-447.
  93. 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.
  94. Jacob Fox and Csaba D. Tóth, On the decay of crossing numbers, J. Combin. Theory Ser. B 98 (1) (2008), 33-42.
  95. Nisheeth Shrivastava, Subhash Suri, and Csaba D. Tóth, Detecting cuts in sensor networks, Transactions on Sensor Networks 4 (2) (2008), article 10.
  96. 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.
  97. 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.
  98. 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.
  99. Subhash Suri, Csaba D. Tóth, and Yunhong Zhou, Selfish load balancing and atomic congestion games, Algorithmica 47 (1) (2007), 79-96.
  100. József Solymosi and Csaba D. Tóth, Distinct distances in homogeneous sets in Euclidean space, Discrete Comput. Geom. 35 (4) (2006), 537-549.
  101. John Hershberger, Nisheeth Shrivastava, Subhash Suri, and Csaba D. Tóth, Adaptive spatial partitioning for multidimensional data streams, Algorithmica 46 (2006), 97-117.
  102. Subhash Suri, Csaba D. Tóth, and Yunhong Zhou, Range counting over multidimensional data streams, Discrete Comput. Geom. 36 (2006), 633-655.
  103. Csaba D. Tóth, Alternating paths along axis-parallel segments, Graphs and Combinatorics 22 (2006), 527-543.
  104. 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.
  105. John Hershberger, Subhash Suri, and Csaba D. Tóth, Binary space partition of orthogonal subdivisions, SIAM J. Comput. 34 (6) (2005), 1380-1397.
  106. Bettina Speckmann and Csaba D. Tóth, Allocating vertex π-guards in simple polygons via pseudo-triangulations, Discrete Comput. Geom. 33 (2) (2005), 345-364.
  107. Csaba D. Tóth, Illuminating labyrinths, Discrete Appl. Maths. 138 (1-2) (2004), 215-228.
  108. Csaba D. Tóth, Illuminating disjoint line segments in the plane, Discrete Comput. Geom. 30 (3) (2003), 489-505.
  109. Michael Hoffmann and Csaba D. Tóth, Alternating paths through disjoint line segments, Inform. Proc. Letts. 87 (6) (2003), 287-294.
  110. Csaba D. Tóth, Binary space partition for line segments with a limited number of directions, SIAM J. Comput. 32 (2) (2003), 307-325.
  111. Michael Hoffmann and Csaba D. Tóth, Segment endpoint visibility graphs are Hamiltonian, Comput. Geom. Theory Appl. 26 (1) (2003), 47-68.
  112. Csaba D. Tóth, A note on binary plane partitions, Discrete Comput. Geom. 30 (1) (2003), 3-16.
  113. Csaba D. Tóth, Guarding disjoint triangles and claws in the plane, Comput. Geom. Theory Appl. 25 (1-2) (2003), 51-65.
  114. Csaba D. Tóth, Illumination of polygons 45º-floodlights, Discrete Maths. 265 (1-3) (2003), 251-260.
  115. József Symosi, Gábor Tardos, and Csaba D. Tóth, The k most frequent distances in the palne, Discrete Comput. Geom., 28 (4) (2002), 639-648.
  116. Csaba D. Tóth, Illumination in the presence of opaque line segments in the plane, Comput. Geom. Theory Appl. 21 (3) (2002), 193-204.
  117. Csaba D. Tóth, Art galleries with guards of uniform range of vision, Comput. Geom. Theory Appl. 21 (3) (2002), 185-192.
  118. József Solymosi and Csaba D. Tóth, Distinct distances in the plane, Discrete Comput. Geom. 25 (4) (2001), 629-634.
  119. 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 Peer-Reviewed Conference Proceedings
  1. Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, and Jules Wulms Fully dynamic maximum independent sets of disks in polylogarithmic update time, in Proc. 40th Sympos. Comput. Geom. (Athens, 2024), LIPIcs, Schloss Dagstuhl, to appear.
  2. Csaba D. Tóth, Plane multigraphs with one-bend and circular-arc edges of a fixed angle, in Proc. 18th International Conference and Workshop on Algorithms and Computation (Kanazawa, 2024), LNCS 14549, Springer, pp. 15-31
  3. Sujoy Bhore, Arnold Filtser, and Csaba D. Tóth, Online duet between metric embeddings and minimum-weight perfect matchings, in Proc. 34th ACM-SIAM Sympos. on Discrete Algorithms (Alexandria, VA, 2024), pp. 4564-4579.
  4. Csaba D. Tóth, On RAC drawings of graphs with two bends per edge, in Proc. 31st Symposium on Graph Drawing and Network Visualization (Isola delle Femmine, 2023), LNCS 14465, Springer, pp. 69–77.
  5. Hugo Akitaya, Andrei Gonczi, Diane Souvaine, Csaba D. Tóth, and Thomas Weighill, Reconfiguration of polygonal subdivisions via recombination, in Proc. 31st European Symposium on Algorithms (Amsterdam, 2023), LIPIcs 274, Schloss Dagstuhl, 6:1-6:16.
  6. Adrian Dumitrescu and Csaba D. Tóth, Observation routes and external watchman routes, in Proc. 18th Algorithms and Data Structures Symposium (Montréal, QC, 2023), LNCS 14079, Springer, pp. 401-415.
  7. Adrian Dumitrescu and Csaba D. Tóth, Maximal distortion of geodesic diameters in polygonal domains, in Proc. 34th International Workshop on Combinatorial Algorithms (Tainan, 2023), LNCS 13889, Springer, pp. 197–208.
  8. Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, and Csaba D. Tóth, Online spanners in metric spaces, in Proc. 30th European Symposium on Algorithms (Potsdam, 2022), LIPIcs 244, Schloss Dagstuhl, 18:1-18:20.
  9. Csaba D. Tóth, Minimum weight Euclidean (1+ε)-spanners, in Proc. 48th Workshop on Graph-Theoretic Concepts in Computer Science (Tübingen, 2022), LNCS 13453, Springer, pp. 439-452.
  10. Jonathan Conroy and Csaba D. Tóth, Hop spanners for geometric intersection graphs, in Proc. 38th International Symposium on Computational Geometry (Berlin, 2022), LIPIcs, Schloss Dagstuhl, pp. 30:1-30:17.
  11. Stefan Felsner, Andrew Nathenson, and Csaba D. Tóth, Aspect ratio universal rectangular layouts, in Proc. 16th International Conference and Workshops on Algorithms and Computation (Jember, 2022), LNCS 13174, Springer, pp. 73-84.
  12. Sujoy Bhore and Csaba D. Tóth, Online Euclidean spanners, in Proc. 29th European Symposium on Algorithms (Lisbon, 2021), LIPIcs 204, Schloss Dagstuhl, pp. 16:1-19.
  13. Sujoy Bhore and Csaba D. Tóth, Light Euclidean Steiner spanners in the plane, in Proc. 37th International Symposium on Computational Geometry (Buffalo, NY, 2021), LIPIcs 189, Schloss Dagstuhl, pp. 15:1-15:17.
  14. Hugo A. Akitaya, Matias Korman, Oliver Korten, Diane L. Souvaine, and Csaba D. Tóth, Reconfiguration of connected graph partitions via recombination, in Proc. 12th International Conference on Algorithms and Complexity (Larnaca, 2021), LNCS 12701, Springer, pp. 61-74.
  15. Sujoy Bhore and Csaba D. Tóth, On Euclidean Steiner (1+ε)-spanners, in Proc. 38th Symposium on Theoretical Aspects of Computer Science (Saarbrücken, 2021), LIPIcs 187, Schloss Dagstuhl, pp. 13:1-13:6.
  16. Adrian Dumitrescu, Anirban Ghosh, and Csaba D. Tóth, Sparse hop spanners for unit disk graphs, in Proc. 31st International Symposium on Algorithms and Computation (Hong Kong, 2020), LIPIcs 181, Schloss Dagstuhl, article 57.
  17. Alon Efrat, Radoslav Fulek, Stephen Kobourov, and Csaba D. Tóth, Polygons with prescribed angles in 2D and 3D, in Proc. 28th International Symposium on Graph Drawing and Network Visualization (Vancouver, BC, 2020), LNCS 12590, Springer, 2021, pp. 135-147.
  18. Michael Hoffmann, Chih-Hung Liu, Meghana M. Reddy, and Csaba D. Tóth, Simple topological drawings of k-planar graphs, in Proc. 28th International Symposium on Graph Drawing and Network Visualization (Vancouver, BC, 2020), LNCS 12590, Springer, 2021, pp. 390-402.
  19. Esther Arkin, Rathish Das, Jie Gao, Mayank Goswami, Joseph S.B. Mitchell, Valentin Polishchuk, and Csaba D. Tóth, Cutting polygons into small pieces with chords: Laser-based localization, in Proc. 28th European Symposium on Algorithms (Pisa, 2020), LIPIcs 173, Schloss Dagstuhl, article 7.
  20. Fabrizio Frati, Michael Hoffmann, and Csaba D. Tóth, Universal geometric graphs, in Proc. 46th Workshop on Graph-Theoretic Concepts in Computer Science (Leeds, 2020), LNCS 12301, Springer, pp 174-186.
  21. Radoslav Fulek and Csaba D. Tóth, Atomic embeddability, clustered planarity, and thickenability, in Proc. 31st ACM-SIAM Symposium on Discrete Algorithms (Salt Lake City, UT, 2020), pp. 2876-2895.
  22. Adrian Dumitrescu and Csaba D. Tóth, On the cover of the Rolling Stone, in Proc. 31st ACM-SIAM Symposium on Discrete Algorithms (Salt Lake City, UT, 2020), pp. 2575-2586.
  23. Ke Chen, Adrian Dumitrescu, Wolfgang Mulzer, and Csaba D. Tóth, On the stretch factor of a polygonal chain, in Proc. 44th Symposium on Mathematical Foundations of Computer Science (Aachen, 2019), LIPIcs 138, article 56.
  24. Hugo Akitaya, Matias Korman, Mikhail Rudoy, Diane Souvaine, and Csaba D. Tóth, Circumscribing polygons and polygonizations for disjoint line segments, in Proc. 35th Symposium on Computational Geometry (Portland, OR, 2019), LIPIcs 129, article 9.
  25. Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, and Sander Verdonschot, Convex polygons in Cartesian products, in Proc. 35th Symposium on Computational Geometry (Portland, OR, 2019), LIPIcs 129, article 22.
  26. Marcos Oropeza and Csaba D. Tóth, Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees, in Proc. 21st IAPR International Conference on Discrete Geometry for Computer Imagery (Paris, 2019), LNCS 11414, Springer, 2019, pp. 234-245.
  27. Adrian Dumitrescu, Anirban Ghosh, and Csaba D. Tóth, Online unit covering in Euclidean space, in Proc. 12th Conference on Combinatorial Optimization and Applications (Atlanta, GA, 2018), LNCS 11346, Springer, pp. 609-623.
  28. Aria Rezaei, Jie Gao, Jeff Phillips, and Csaba D. Tóth, Improved bounds on information dissemination by Manhattan random waypoint model, in Proc. 26th ACM SIGSPATIAL Int. Conf. on Advances in Geographic Information Systems (Seattle, WA, 2018), pp. 139-148.
  29. Radoslav Fulek and Csaba D. Tóth, Crossing minimization in perturbed drawings, in Proc. 26th Symposium on Graph Drawing & Network Visualization (Barcelona, 2018), LNCS 11282, Springer, pp. 229-241.
  30. Hugo A. Akitaya, Matthew D. Jones, David Stalfa, and Csaba D. Tóth, Maximum area axis-aligned square packings, in Proc. 43rd Symposium on Mathematical Foundations of Computer Science (Liverpool, 2018), LIPIcs 117, Schloss Dagstuhl, pp. 77:1--77:15.
  31. Torrie L. Nichols, Alexander Pilz, Csaba D. Tóth, and Ahad N. Zehmakan, Transition operations over plane trees, in Proc. 13th Latin American Theoretical INformatics Symposium (Buenos Aires, 2018), LNCS 10807, Springer, pp. 835-838.
  32. Hugo A. Akitaya, Radoslav Fulek, and Csaba D. Tóth, Recognizing weak embeddings of graphs, in Proc. ACM-SIAM Symposium on Discrete Algorithms (New Orleans, LA, 2018), pp. 274-292.
  33. Sang Won Bae, Jean-Francois Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, and Csaba D. Tóth, Gap-planar graphs, in Proc. 25th International Symposium on Graph Drawing & Network Visualization (Boston, MA, 2017), LNCS 10692, Springer, 531-545.
  34. Adrian Dumitrescu and Csaba D. Tóth, Online unit clustering in higher dimensions, in Proc. 15th Workshop on Approximation and Online Algorithms (Vienna, 2017), LNCS 10787, Springer, pp. 238-252.
  35. Michael Hoffmann and Csaba D. Tóth, Two-planar graphs are quasiplanar, in Proc. 42nd Symposium on Mathematical Foundations of Computer Science (Aalborg, 2017), LIPIcs 83, Schloss Dagstuhl, article 47.
  36. Hugo A. Akitaya, Rajasekhar Inkulu, Torrie L. Nichols, Diane L. Souvaine, Csaba D. Tóth, and Charles R. Winston, Minimum weight connectivity augmentation for planar straight-line graphs, in Proc. 11th International Conference and Workshops on Algorithms and Computation (Hsinchu, 2017), LNCS 10167, Springer, 204-216.
  37. Hugo A. Akitaya and Csaba D. Tóth, Reconstruction of weakly simple polygons from their edges, in Proc. 27th International Symposium on Algorithms and Computation (Sydney, 2016), LIPIcs 64, Schloss Dagstuhl, article 10.
  38. Hugo A. Akitaya, Maarten Löffler, and Csaba D. Tóth, Multi-colored spanning graphs in Proc. 24th Symposium on Graph Drawing and Network Visualization (Athens, 2016), LNCS 9801, Springer, pp. 81-93.
  39. Adrian Dumitrescu, Ritankar Mandal, and Csaba D. Tóth, Monotone paths in geometric triangulations, in Proc. 27th International Workshop on Combinatorial Algorithms (Helsinki, 2016), LNCS 9843, Springer, pp. 411-422.
  40. Hugo A. Akitaya, Greg Aloupis, Jeff Erickson, and Csaba D. Tóth, Recognizing weakly simple polygons, Proc. 32nd Symposium on Computational Geometry (Boston, MA, 2016), LIPIcs 51, article 8.
  41. Kevin Balas, Adrian Dumitrescu, and Csaba D. Tóth, Anchored rectangle and square packings, Proc. 32nd Symposium on Computational Geometry (Boston, MA, 2016), LIPIcs 51, article 13:1-13:16.
  42. Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, and Csaba D. Tóth, The planar tree packing theorem, Proc. 32nd Symposium on Computational Geometry (Boston, MA, 2016), LIPIcs 51, article 41.
  43. Maarten Löffler and Csaba D. Tóth, Linear-size universal point sets for one-bend drawings, Proc. 23rd Symposium on Graph Drawing and Network Visualization (Los Angeles, CA, 2015), LNCS 9411, Springer, pp. 423-429.
  44. Clinton Bowen, Stephane Durocher, Maarten Löffler, Anika Rounds, André Schulz, and Csaba D. Tóth, Realizations of simply connected polygonal linkages, Proc. 23rd Symposium on Graph Drawing and Network Visualization (Los Angeles, CA, 2015), LNCS 9411, Springer, pp. 447-459.
  45. Kevin Balas and Csaba D. Tóth, On the number of anchored rectangle packings for a planar point set, in Proc. 21st Computing and Combinatorics Conference (Beijing, 2015), LNCS 9198, Springer, pp. 377-389.
  46. Adrian Dumitrescu and Csaba D. Tóth, Convex polygons in geometric triangulations, in Proc. WADS (Victoria, BC, 2015), LNCS 9214, Springer, pp. 289-300.
  47. Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, and Manuel Wettstein, Arc diagrams, flip distances, and Hamiltonian triangulations, in Proc. 32nd Sympos. Theoretical Aspects of Computer Science (Munich, 2015), LIPIcs 30, pp. 197-210.
  48. Andres J. Ruiz-Vargas, Andrew Suk, and Csaba D. Tóth, Disjoint edges in topological graphs and the tangled-thrackle conjecture, in Proc. 22nd Sympos. Graph Drawing (Würzburg, 2014), LNCS 8871, Springer, pp. 284-293.
  49. Adrian Dumitrescu, Minghui Jiang, and Csaba D. Tóth, Computing opaque interior barriers à la Shermer, in Proc. 17th Workshop on Approximation Algorithms for Combinatorial Optimization Problems (Barcelona, 2014), LIPIcs 28, Dagstuhl, pp. 128-143.
  50. Eli Fox-Epstein, Csaba D. Tóth, and Andrew Winslow, Diffuse reflection radius in a simple polygon, in Proc. 20th Computing and Combinatorics Conference (Atlanta, GA, 2014), LNCS 8591, Springer, pp. 239-250.
  51. Andrea Francke and Csaba D. Tóth, 30th Sympos. on Computational Geometry (Kyoto, 2014), ACM Press, pp. 242-250.
  52. Zachary Abel, Robert Connelly, Sarah Eisenstat, Radoslav Fulek, Filip Morić, Yoshio Okamoto, Tibor Szabó, and Csaba D. Tóth, Free edge lengths in plane graphs, in Proc. 30th Sympos. on Computational Geometry (Kyoto, 2014), ACM Press, pp. 426-435.
  53. Eyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine, and Csaba D. Tóth, The flip diameter of rectangulations and convex subdivisions, in Proc. Latin American Theoretical INformatics (Montevideo, 2014), LNCS 8392, Springer, pp. 478-489.
  54. Fabrizio Frati, Michael Kaufmann, János Pach, Csaba D. Tóth, and David Wood, On the upward planarity of mixed plane graphs, in Proc. 21st Symposium on Graph Drawing (Bordeaux, 2013), LNCS 8242, Springer, pp 1-12.
  55. Adrian Dumitrescu and Csaba D. Tóth, On the total perimeter of homothetic convex bodies in a convex container, in Proc. 16th Workshop on Approximation Algorithms for Combinatorial Optimization Problems (Berkeley, CA, 2013), LNCS 8096, Springer, pp. 96-109.
  56. Markus Geyer, Michael Kaufmann, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Planar packing of binary trees, in Proc. WADS (London, ON, 2013), LNCS 8037, Springer, pp. 353–364.
  57. Radoslav Fulek and Csaba D. Tóth, Universal point sets for planar three-trees, in Proc. WADS (London, ON, 2013), LNCS 8037, Springer, pp. 341–352.
  58. Gill Barequet, Sarah M. Cannon, Eli Fox-Epstein, Benjamin Hescott, Diane L. Souvaine, Csaba D. Tóth, and Andrew Winslow, Diffuse reflections in simple polygons, in Proc. VII Latin-American Algorithms, Graphs and Optimization Symposium (Playa del Carmen, 2013), Electronic Notes in Discrete Mathematics 44 (5) (2013), 345–350.
  59. Adrian Dumitrescu and Csaba D. Tóth, The traveling salesman problem for lines, balls and planes, in Proc. 24th ACM-SIAM Symposium on Discrete Algorithms (New Orleans, LA, 2013), SIAM, pp. 828-843.
  60. Adrian Dumitrescu and Csaba D. Tóth, Covering paths for planar point sets, in Proc. 20th Symposium on Graph Drawing (Redmond, WA, 2012), LNCS 7704, Springer, 2013, pp. 303–314.
  61. Karin Arikushi and Csaba D. Tóth, Crossing angles of geometric graphs, in Proc. 6th Conference on Combinatorial Optimization and Applications (Banff, AB, 2012), LNCS 7402, Springer, pp. 103-114.
  62. Adrian Dumitrescu, Günter Rote, and Csaba D. Tóth, Monotone paths in convex subdivisions, in Proc. 18th Computing and Combinatorics Conference (Sydney, 2012), LNCS 7434, Springer, pp. 240–251.
  63. Adrian Dumitrescu, Sariel Har-Peled, and Csaba D. Tóth, Minimum convex partitions and maximum empty polytopes, in Proc. 13th Scandinavian Symposium and Workshops on Algorithm Theory (Helsinki, 2012), LNCS 7357, Springer, pp. 213-224.
  64. Sarah Cannon, Mashhood Ishaque, and Csaba D. Tóth, Conflict-free graph orientations with parity constraints, in Proc. 6th Conf. on Fun with Algorithms (Venice, 2012), LNCS 7288, Springer, pp. 57-68.
  65. Adrian Dumitrescu and Csaba D. Tóth, Packing anchored rectangles, in Proc. 23rd ACM-SIAM Sympos. on Discrete Algorithms (Kyoto, 2012), SIAM, pp. 294-305.
  66. 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 7034, Springer, pp. 290-295.
  67. 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), LNCS 6844, Springer, pp. 524-535.
  68. 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.
  69. 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.
  70. 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, HI, 2010), LNCS 6508, Springer, pp. 324-338.
  71. 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), LNCS 6502, Springer, 2011, pp. 1-12.
  72. 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), LNCS 6410, Springer, pp. 135-146.
  73. 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.
  74. 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), LNCS 5878, Springer, pp. 132-141.
  75. 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), LNCS 5878, Springer, pp. 902-911.
  76. 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.
  77. 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), LNCS 5609, Springer, pp. 192-204.
  78. Csaba D. Tóth, Binary plane partitions for disjoint line segments, Proc. 25th Sympos. on Comput. Geom. (Aarhus, 2009), ACM Press, pp. 71-79.
  79. 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.
  80. 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.
  81. Mashhood Ishaque and Csaba D. Tóth, Dynamic geodesic hulls in semi-dynamic subdivisions, in Proc. 16th European Symposium on Algorithms (Karlsruhe, 2008), LNCS 5193, Springer, pp. 780-792.
  82. Csaba D. Tóth, Connectivity augmentation in plane straight line graphs, in Proc. Conf. on Topological & Geometric Graph Theory (Paris, 2008), pp. 51-54.
  83. Adrian Dumitrescu, Micha Sharir, and Csaba D. Tóth, Extremal problems on triangle areas in the plane and three-space, in Proc. 24th Sympos. Comput. Geom. (College Park, MD, 2008), ACM Press, pp. 208-217.
  84. 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.
  85. 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.
  86. 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), LNCS 4875, Springer, 2008, pp. 13-24.
  87. 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 4619, Springer, pp. 470-482.
  88. 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), LNCS 4598, Springer, pp. 210-221.
  89. 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), LNCS 4513, Springer, pp. 119-129.
  90. 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), LNCS 4393, Springer, pp. 175-187.
  91. 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.
  92. Jacob Fox and Csaba D. Tóth, On the decay of crossing numbers, in Proc. 14th Sympos. on Graph Drawing (Karlsruhe, 2006), LNCS 4372, Springer, pp. 174-183.
  93. 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), LNCS 4162, Springer, pp. 86-97.
  94. David Krumme, Eynat Rafalin, Diane L. Souvaine, and Csaba D. Tóth, Tight bounds for connecting sites across barriers, in Proc. 22nd Sympos. Comput. Geom. (Sedona, AZ, 2006), ACM Press, pp. 439-448.
  95. Csaba D. Tóth, Orthogonal subdivisions with low stabbing numbers, in Proc. 9th Workshop on Algorithms and Data Structures (Waterloo, ON, 2005), LNCS 3608, Springer, pp. 256-268.
  96. 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 ACM Sympos. on Principles of Database Systems (Baltimore, MD, 2005), ACM Press, pp. 338-347.
  97. Michael Hoffmann and Csaba D. Tóth, Pointed and colored binary encompassing trees, in Proc. 21st Sympos. Comput. Geom. (Pisa, 2005), ACM Press, pp. 81-90.
  98. György Elekes and Csaba D. Tóth, Incidences of not-too-degenerate hyperplanes, in Proc. 21st Sympos. Comput. Geom. (Pisa, 2005), ACM Press, pp. 16-21.
  99. 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.
  100. 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), LNCS 3341, Springer, pp. 522-533.
  101. Michael Hoffmann, Bettina Speckmann, and Csaba D. Tóth, Pointed binary encompassing trees, in Proc. 9th Scandinavian Workshop on Algorithm Theory (Humlebæk, 2004), LNCS 3111, Springer, pp. 442-454.
  102. 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.
  103. John Hershberger, Subhash Suri, and Csaba D. Tóth, Binary space partition of orthogonal subdivisions, in Proc. 20th Sympos. Comput. Geom. (Brooklyn, NY, 2004), ACM Press, pp. 230-238.
  104. Subhash Suri, Csaba D. Tóth, and Yunhong Zhou, Range counting over multidimensional data streams, in Proc. 20th Sympos. Comput. Geom. (Brooklyn, NY, 2004), ACM Press, pp. 160-169.
  105. 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), LNCS 3279, Springer, pp. 123-130.
  106. Csaba D. Tóth, Binary space partition for orthogonal fat rectangles, in Proc. 11th European Symposium on Algorithms (Budapest, 2003), LNCS 2832, Springer, Berlin, pp. 494-505.
  107. Csaba D. Tóth, Alternating paths along axis-parallel segments, in Proc. 8th Workshop on Algorithms and Data Structures (Ottawa, ON, 2003), LNCS 2748, Springer, Berlin, 2003, pp. 389-400.
  108. 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, pp. 109-118.
  109. 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, pp. 465-471.
  110. Csaba D. Tóth, Illuminating both sides of line segments, in Discrete and Computational Geometry (J. Akiyama, M. Kano, M. Urabe, eds.), LNCS 2098, Springer, Berlin, 2001, pp. 370-380.
  111. Csaba D. Tóth, A note on binary plane partitions, in Proc. 17th Sympos. on Comput. Geom. (Medford, MA, 2001), ACM Press, 2001, pp. 151-156.
  112. József Solymosi and Csaba D. Tóth, Distinct distances in the plane, in Proc. 17th Sympos. on Comput. Geom. (Medford, MA, 2001), ACM Press, 2001, pp. 29-31.
  113. 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, pp. 185-190.


3. In Books and Book Chapters
  1. Csaba D. Tóth, Quantitative restrictions on crossing patterns, in Beyond Planar Graphs (Seok-Hee Hong and Takeshi Tokuyama, eds.), Communications of NII Shonan Meetings, Springer, Singapore, 2020, pp. 11-29.
  2. Joseph O'Rourke, Subhash Suri, and Csaba D. Tóth, Polygons, chapter 30 in Handbook of Discrete and Computational Geometry, 3rd edition, CRC Press, 2017, pp. 787-810.
  3. Adrian Dumitrescu and Csaba D. Tóth, Constant-factor approximation for TSP with disks, in Journey Through Discrete Mathematics: A Tribute to Jiří Matoušek, Springer, 2017, pp. 375-390.
  4. Adrian Dumitrescu and Csaba D. Tóth, Binary space partitions, in Encyclopedia of Algorithms (Ming-Yang Kao, ed.), 2nd edition, 2015, Springer.
  5. Adrian Dumitrescu, Günter Rote, and Csaba D. Tóth, Monotone paths in convex subdivisions and polytopes, in Discrete Geometry and Optimization, vol 69 of Fields Institute Communications, 2013, Springer, pp. 79-104.
  6. Ferran Hurtado and Csaba D. Tóth, Plane geometric graph augmentation: a generic perspective, in Thirty Essays on Geometric Graph Theory (J. Pach, ed.), Springer, 2013, pp. 327-354.
  7. Michael Hoffmann, André Schulz, 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.), Springer, 2013, pp. 303-326.
  8. 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.), Springer, 2013, pp. 49-70.
  9. Diane L. Souvaine, Csaba D. Tóth, and Andrew Winslow, Simultaneously flippable edges in triangulations, in Computational Geometry (A. Marquez et al., eds.), LNCS 7579, Springer, 2012, pp. 138-145.
  10. Csaba D. Tóth, Godfried Toussaint, and Andrew Winslow, Open guard edges and edge guards in simple polygons, in Computational Geometry (A. Marquez et al., eds.), LNCS 7579, Springer, 2012, pp. 54-64.
  11. Binary space partitions: recent developments, in Combinatorial and Computational Geometry, vol. 52 of MSRI Publications, Cambridge University Press, 2005, pp. 529-556.
  12. Planar subdivisions, PhD thesis, DISS ETH No. 14628, ETH Zürich, 2002.



4. Others
  1. Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, and Jules Wulms, Fully dynamic maximum independent sets of disks in polylogarithmic update time, in Abstracts of 40th European Workshop on Computational Geometry (Ioannina, 2024), pp. 43:1-43:8.
  2. Kimberly Kokado and Csaba D. Tóth, On the realizability of planar and spherical occlusion diagrams, in Abstracts of XX Spanish Meeting on Computational GeometryM (Santiago de Compostela, 2023), pp. 83-34.
  3. Adrian Dumitrescu and Csaba D. Tóth, Geodesic diameter in polygons with holes, in Proc. 12th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (Budapest, 2023), pp. 543-548.
  4. Kimberly Kokado and Csaba D. Tóth, Nonrealizable planar and spherical occlusion diagrams, in Abstract of the Japanese Conf. Discrete and Comp. Geom. Graphs, and Games (JCDCG3) (Tokyo, 2022), pp. 60-61.
  5. Hugo A. Akitaya, Andrei Gonczi, Diane L. Souvaine, Csaba D. Tóth, and Thomas Weighill, Reconfiguration of polygonal subdivisions via recombination, in Abstracts of 2nd Workshop on Combinatorial Reconfiguration (Paris, 2022).
  6. Giovanni Viglietta, Csaba D. Tóth, and Jorge Urrutia, Minimizing visible edges in polyhedra, in Abstracts of 23rd Thailand-Japan Conference on Discrete and Computational Geometry, Graphs, and Games (Chiang Mai, 2021), pp. 70-71.
  7. Hugo Akitaya, Matthew Jones, Matias Korman, Oliver Korten, Christopher Meierfrankenfeld, Michael Munje, Diane Souvaine, Csaba D. Tóth, and Michael Thramann, Reconfiguration of connected graph partitions: Single switches and recombinations, in Abstracts of Workshop on Combinatorial Reconfiguration (Glasgow, 2021).
  8. Hugo Akitaya, Erik D. Demaine, Jason S. Ku, Jayson Lynch, Mike Paterson, and Csaba D. Tóth, 2048 without merging, in Proc. 32nd Canadian Conference on Computational Geometry (Saskatoon, SK, 2020).
  9. Chih-Hung Liu, Meghana M. Reddy, and Csaba D. Tóth, Simple topological drawings of k-planar graphs, in Abstracts of 36th European Workshop on Computational Geometry (Würzburg, 2020), pp. 80:1-80:6.
  10. Hugo A. Akitaya, Leonie Ryvkin, and Csaba D. Tóth, Rock climber distance: Frogs versus dogs, in Proc. 31st Canadian Conference on Computational Geometry (Edmonton, AB, 2019), pp. 210-217.
  11. Oswin Aichholzer, Carlos Alegría, Irene Parada, Alexander Pilz, Javier Tejel, Csaba D. Tóth, Jorge Urrutia, and Birgit Vogtenhuber, Hamiltonian meander paths and cycles on bichromatic point sets, in Abstracts of the XVIII Spanish Meeting on Computational Geometry (Girona, 2019), pp. 35-38.
  12. David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval, David Orden, Javier Tejel, Csaba D. Tóth, Jorge Urrutia, and Birgit Vogtenhuber, Perfect rainbow polygons for colored point sets in the plane, in Abstracts of the XVIII Spanish Meeting on Computational Geometry (Girona, 2019), pp. 43-46.
  13. Yeganeh Bahoo, Ahmad Biniaz, Pilar Cano, Farah Chanchary, John Iacono, Kshitij Jain, Elena Khramtcova, Anna Lubiw, Debajyoti Mondal, Khadijeh Sheikhan, and Csaba D. Tóth, Compatible paths on labelled point sets, in Proc. 30th Canadian Conference on Computational Geometry (Winnipeg, MB, 2018), pp. 54-60.
  14. Hugo A. Akitaya, Matthew D. Jones, Gregory A. Sandoval, Diane L. Souvaine, David Stalfa and Csaba D. Tóth, Flattening polygonal linkages via uniform angular motion (poster), in Proc. 25th International Symposium on Graph Drawing & Network Visualization (Boston, MA, 2017), LNCS 10692, Springer, pp. 615-617.
  15. Adrian Dumitrescu and Csaba D. Tóth, A problem on track runners, in Proc. 29th Canadian Conference on Computational Geometry (Ottawa, ON, 2017), pp. 198-201.
  16. Hugo A. Akitaya, Jonathan Castello, Yauheniya Lahoda, Anika Rounds, and Csaba D. Tóth, Augmenting planar straight line graphs to 2-edge-connectivity (poster), in Proc. 23rd Symposium on Graph Drawing and Network Visualization (Los Angeles, CA, 2015), LNCS 9411, Springer, pp. 563-564.
  17. Bernardo Ábrego, Adrian Dumitrescu, Silvia Fernández, and Csaba D. Tóth, Computational Geometry Column 61, SIGACT News 46 (2) (2015), 65-77
  18. Adrian Dumitrescu and Csaba D. Tóth, Covering grids by trees, in Proc. 26th Canadian Conference on Computational Geometry (Halifax, NS, 2014).
  19. Adrian Dumitrescu and Csaba D. Tóth, Computational Geometry Column 59, ACM SIGACT News 45 (2) (2014), 68-72.
  20. Alfredo García, Ferran Hurtado, Matias Korman, Inês Matos, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, and Csaba D. Tóth, Geometric biplane graphs II: Graph Augmentation, in Proc. Mexican Conf. on Discrete Math. and Computational Geometry (Oaxaca, 2013).
  21. Alfredo García, Ferran Hurtado, Matias Korman, Inês Matos, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, and Csaba D. Tóth, Geometric biplane graphs I: Maximal Graphs, in Proc. Mexican Conf. on Discrete Math. and Computational Geometry (Oaxaca, 2013).
  22. Maarten Löffler, André Schulz, and Csaba D. Tóth, Counting carambolas, in Proc. 25th Canadian Conf. on Comput. Geom. (Waterloo, ON, 2013), pp. 163-168.
  23. Adrian Dumitrescu, Dániel Gerbner, Balázs Keszegh, Csaba D. Tóth, Covering paths for planar point sets, in Proc. 8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (Veszprém, 2013).
  24. Adrian Dumitrescu and Csaba D. Tóth, Packing disks that touch the boundary of a square, in Abstracts of 22nd Annual Fall Workshop on Computational Geometry (College Park, MD, 2012).
  25. Adrian Dumitrescu and Csaba D. Tóth, Computational Geometry Column 54, ACM SIGACT News 43 (4) (2012), 90-97.
  26. Javiér Cano, Csaba D. Tóth, and Jorge Urrutia, Edge guards for polyhedra in three-space, in Proc. 24th Canadian Conf. Comput. Geom. (Charlottetown, PE, 2012), pp. 155-160.
  27. 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.
  28. 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.
  29. 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.
  30. 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).
  31. Sarah Cannon, Mashhood Ishaque, and Csaba D. Tóth, Even orientations with forbidden pairs and demands, in Abstracts of the 20th Fall Workshop on Comput. Geom. (Stony Brook, NY, 2010).
  32. 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.
  33. 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).
  34. 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.
  35. 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).
  36. 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.
  37. 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.
  38. 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.
  39. 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.
  40. Diane L. Souvaine and Csaba D. Tóth, A vertex-face assignment for plane graphs, in Proc. 17th Canadian Conf. Comput. Geom. (Windsor, ON, 2005), pp. 131-134.
  41. 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), LNCS 3405, Springer, 2005, pp. 13-27.
  42. 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 Comput. Geom. (Eidhoven, 2005), pp. 93-96.
  43. 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.
  44. Michael Hoffmann, Bettina Speckmann, and Csaba D. Tóth, Pointed binary encompassing trees, in Abstracts of 20th European Workshop Comput. Geom. (Seville, 2004), pp. 131-314.
  45. 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.
  46. Csaba D. Tóth, Alternating paths along axis-parallel segments, in Abstracts of 19th European Wrokshop Comput. Geom. (Bonn, 2003), pp. 133-136.
  47. Michael Hoffmann and Csaba D. Tóth, Alternating paths through disjoint line segments, Abstracts of the 18th European Workshop on Comput. Geom. (Warsaw, 2002),
  48. Michael Hoffmann and Csaba D. Tóth, Segment endpoint visibility graphs are Hamiltonian, in Proc. 13th Canadian Conf. Comput. Geom. (Waterloo, ON, 2001), 109-112.
  49. Csaba D. Tóth, Illuminating polygons with vertex π-floodlights, in Proc. Int. Conf. on Comput. Sci. (San Francisco, CA, 2001), Part I, LNCS 2073, Springer, Berlin, 2001, 772-781.
  50. 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.
  51. Csaba D. Tóth, Guarding disjoint triangles and claws in the plane, in Abstracts of the 17th European Workshop on Comput. Geom. (Berlin, 2001),
  52. Csaba D. Tóth, Illuminating labyrinths, in Abstracts of Optimal Discrete Structures and Algorithms (Rostock, 2000).



Manuscripts