default search action
Csaba D. Tóth
Person information
- affiliation: California State University Northridge, Los Angeles, USA
- affiliation: Tufts University, Medford, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j125]Kenneth L. Clarkson, János Pach, Csaba D. Tóth:
Foreword. Discret. Comput. Geom. 72(2): 403-404 (2024) - [j124]Csaba D. Tóth:
Minimum weight Euclidean (1+ɛ)-spanners. Eur. J. Comb. 118: 103927 (2024) - [j123]Sujoy Bhore
, Arnold Filtser
Online Spanners in Metric Spaces. SIAM J. Discret. Math. 38(1): 1030-1056 (2024) - [j122]Adrian Dumitrescu, Csaba D. Tóth
Observation routes and external watchman routes. Theor. Comput. Sci. 1019: 114818 (2024) - [c135]Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, Jules Wulms:
Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time. SoCG 2024: 19:1-19:16 - [c134]Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang:
Towards Instance-Optimal Euclidean Spanners. FOCS 2024: 1579-1609 - [c133]Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr:
Noncrossing Longest Paths and Cycles. GD 2024: 36:1-36:17 - [c132]Hugo A. Akitaya, Ahmad Biniaz, Erik D. Demaine, Linda Kleist, Frederick Stock, Csaba D. Tóth:
Minimum Plane Bichromatic Spanning Trees. ISAAC 2024: 4:1-4:14 - [c131]Sujoy Bhore, Arnold Filtser, Csaba D. Tóth:
Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings. SODA 2024: 4564-4579 - [c130]Csaba D. Tóth
Plane Multigraphs with One-Bend and Circular-Arc Edges of a Fixed Angle. WALCOM 2024: 15-31 - [i77]Sujoy Bhore, Balázs Keszegh, Andrey Kupavskii, Hung Le, Alexandre Louvet, Dömötör Pálvölgyi, Csaba D. Tóth:
Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers. CoRR abs/2404.05045 (2024) - [i76]Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang:
Towards Instance-Optimal Euclidean Spanners. CoRR abs/2409.08227 (2024) - [i75]Hugo A. Akitaya, Ahmad Biniaz, Erik D. Demaine, Linda Kleist, Frederick Stock, Csaba D. Tóth:
Minimum Plane Bichromatic Spanning Trees. CoRR abs/2409.11614 (2024) - [i74]Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr:
Noncrossing Longest Paths and Cycles. CoRR abs/2410.05580 (2024) - 2023
- [j121]Fabrizio Frati
Universal geometric graphs. Comb. Probab. Comput. 32(5): 742-761 (2023) - [j120]Csaba D. Tóth, Jorge Urrutia, Giovanni Viglietta
Minimizing Visible Edges in Polyhedra. Graphs Comb. 39(5): 111 (2023) - [j119]Hugo A. Akitaya
Reconfiguration of connected graph partitions. J. Graph Theory 102(1): 35-66 (2023) - [c129]Hugo A. Akitaya, Andrei Gonczi, Diane L. Souvaine, Csaba D. Tóth, Thomas Weighill:
Reconfiguration of Polygonal Subdivisions via Recombination. ESA 2023: 6:1-6:16 - [c128]Csaba D. Tóth
On RAC Drawings of Graphs with Two Bends per Edge. GD (1) 2023: 69-77 - [c127]Adrian Dumitrescu, Csaba D. Tóth:
Maximal Distortion of Geodesic Diameters in Polygonal Domains. IWOCA 2023: 197-208 - [c126]Adrian Dumitrescu, Csaba D. Tóth:
Observation Routes and External Watchman Routes. WADS 2023: 401-415 - [i73]Adrian Dumitrescu, Csaba D. Tóth:
Maximal Distortion of Geodesic Diameters in Polygonal Domains. CoRR abs/2304.03484 (2023) - [i72]Adrian Dumitrescu, Csaba D. Tóth:
Observation Routes and External Watchman Routes. CoRR abs/2306.11522 (2023) - [i71]Hugo A. Akitaya, Andrei Gonczi, Diane L. Souvaine, Csaba D. Tóth, Thomas Weighill:
Reconfiguration of Polygonal Subdivisions via Recombination. CoRR abs/2307.00704 (2023) - [i70]Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, Jules Wulms:
Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time. CoRR abs/2308.00979 (2023) - [i69]Csaba D. Tóth:
On RAC Drawings of Graphs with Two Bends per Edge. CoRR abs/2308.02663 (2023) - [i68]Sujoy Bhore, Arnold Filtser, Csaba D. Tóth:
Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings. CoRR abs/2310.14078 (2023) - [i67]Csaba D. Tóth:
Plane Multigraphs with One-Bend and Circular-Arc Edges of a Fixed Angle. CoRR abs/2311.15043 (2023) - 2022
- [j118]Adrian Dumitrescu, Csaba D. Tóth
Online Unit Clustering and Unit Covering in Higher Dimensions. Algorithmica 84(5): 1213-1231 (2022) - [j117]Adrian Dumitrescu, Anirban Ghosh
Sparse hop spanners for unit disk graphs. Comput. Geom. 100: 101808 (2022) - [j116]Javier Cano, Csaba D. Tóth, Jorge Urrutia, Giovanni Viglietta
Edge guards for polyhedra in three-space. Comput. Geom. 104: 101859 (2022) - [j115]Hugo A. Akitaya
Circumscribing Polygons and Polygonizations for Disjoint Line Segments. Discret. Comput. Geom. 68(1): 218-254 (2022) - [j114]Radoslav Fulek
Atomic Embeddability, Clustered Planarity, and Thickenability. J. ACM 69(2): 13:1-13:34 (2022) - [j113]Alon Efrat
Polygons with Prescribed Angles in 2D and 3D. J. Graph Algorithms Appl. 26(3): 363-380 (2022) - [j112]Jonathan B. Conroy, Csaba D. Tóth:
Hop-spanners for geometric intersection graphs. J. Comput. Geom. 14(2): 26-64 (2022) - [j111]Sujoy Bhore
Euclidean Steiner Spanners: Light and Sparse. SIAM J. Discret. Math. 36(3): 2411-2444 (2022) - [j110]Hugo A. Akitaya, Matias Korman, Oliver Korten, Diane L. Souvaine, Csaba D. Tóth
Reconfiguration of connected graph partitions via recombination. Theor. Comput. Sci. 923: 13-26 (2022) - [c125]Jonathan B. Conroy, Csaba D. Tóth:
Hop-Spanners for Geometric Intersection Graphs. SoCG 2022: 30:1-30:17 - [c124]Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, Csaba D. Tóth:
Online Spanners in Metric Spaces. ESA 2022: 18:1-18:20 - [c123]Stefan Felsner, Andrew Nathenson, Csaba D. Tóth:
Aspect Ratio Universal Rectangular Layouts. WALCOM 2022: 73-84 - [c122]Csaba D. Tóth
Minimum Weight Euclidean (1+ε )-Spanners. WG 2022: 439-452 - [i66]Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, Csaba D. Tóth:
Online Spanners in Metric Spaces. CoRR abs/2202.09991 (2022) - [i65]Adrian Dumitrescu, Csaba D. Tóth:
Finding Points in Convex Position in Density-Restricted Sets. CoRR abs/2205.03437 (2022) - [i64]Sujoy Bhore, Csaba D. Tóth:
Euclidean Steiner Spanners: Light and Sparse. CoRR abs/2206.09648 (2022) - [i63]Csaba D. Tóth:
Minimum Weight Euclidean (1+ε)-Spanners. CoRR abs/2206.14911 (2022) - [i62]Csaba D. Tóth, Jorge Urrutia, Giovanni Viglietta:
Minimizing Visible Edges in Polyhedra. CoRR abs/2208.09702 (2022) - 2021
- [j109]David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval
Rainbow polygons for colored point sets in the plane. Discret. Math. 344(7): 112406 (2021) - [j108]Marcos Oropeza, Csaba D. Tóth:
Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees. Inf. Process. Lett. 170: 106116 (2021) - [j107]Ke Chen
On the Stretch Factor of Polygonal Chains. SIAM J. Discret. Math. 35(3): 1592-1614 (2021) - [c121]Hugo A. Akitaya
Reconfiguration of Connected Graph Partitions via Recombination. CIAC 2021: 61-74 - [c120]Sujoy Bhore, Csaba D. Tóth:
Light Euclidean Steiner Spanners in the Plane. SoCG 2021: 15:1-15:17 - [c119]Sujoy Bhore, Csaba D. Tóth:
Online Euclidean Spanners. ESA 2021: 16:1-16:19 - [c118]Sujoy Bhore, Csaba D. Tóth:
On Euclidean Steiner (1+ε)-Spanners. STACS 2021: 13:1-13:16 - [i61]Sujoy Bhore, Csaba D. Tóth:
Online Euclidean Spanners. CoRR abs/2107.00684 (2021) - [i60]Stefan Felsner, Andrew Nathenson, Csaba D. Tóth:
Aspect Ratio Universal Rectangular Layouts. CoRR abs/2112.03242 (2021) - [i59]Jonathan B. Conroy, Csaba D. Tóth:
Hop-Spanners for Geometric Intersection Graphs. CoRR abs/2112.07158 (2021) - 2020
- [j106]Adrian Dumitrescu, Csaba D. Tóth:
Problems on track runners. Comput. Geom. 88: 101611 (2020) - [j105]Bettina Speckmann, Csaba D. Tóth:
Guest Editors' Foreword. Discret. Comput. Geom. 63(4): 765-767 (2020) - [j104]Hugo A. Akitaya, Matthew D. Jones, David Stalfa, Csaba D. Tóth:
The reach of axis-aligned squares in the plane. Discret. Optim. 37: 100580 (2020) - [j103]Torrie L. Nichols, Alexander Pilz, Csaba D. Tóth
Transition operations over plane trees. Discret. Math. 343(8): 111929 (2020) - [j102]Radoslav Fulek
Crossing minimization in perturbed drawings. J. Comb. Optim. 40(2): 279-302 (2020) - [j101]Patrizio Angelini
Simple k-planar graphs are simple (k + 1)-quasiplanar. J. Comb. Theory B 142: 1-35 (2020) - [j100]Daniel Archambault, Csaba D. Tóth:
Guest editors' foreword. J. Graph Algorithms Appl. 24(4): 547-549 (2020) - [j99]Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, Sander Verdonschot:
Convex polygons in cartesian products. J. Comput. Geom. 11(2): 205-233 (2020) - [j98]Adrian Dumitrescu, Anirban Ghosh
Online unit covering in Euclidean space. Theor. Comput. Sci. 809: 218-230 (2020) - [j97]Hugo A. Akitaya, Maarten Löffler, Csaba D. Tóth:
Multi-colored spanning graphs. Theor. Comput. Sci. 833: 11-25 (2020) - [c117]Hugo A. Akitaya, Erik D. Demaine, Jason S. Ku, Jayson Lynch, Csaba D. Tóth:
2048 Without Merging. CCCG 2020: 285-291 - [c116]Esther M. Arkin, Rathish Das, Jie Gao, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk, Csaba D. Tóth:
Cutting Polygons into Small Pieces with Chords: Laser-Based Localization. ESA 2020: 7:1-7:23 - [c115]Alon Efrat
Polygons with Prescribed Angles in 2D and 3D. GD 2020: 135-147 - [c114]Michael Hoffmann
Simple Topological Drawings of k-Planar Graphs. GD 2020: 390-402 - [c113]Adrian Dumitrescu
Sparse Hop Spanners for Unit Disk Graphs. ISAAC 2020: 57:1-57:17 - [c112]Adrian Dumitrescu, Csaba D. Tóth:
On the Cover of the Rolling Stone. SODA 2020: 2575-2586 - [c111]Radoslav Fulek
Atomic Embeddability, Clustered Planarity, and Thickenability. SODA 2020: 2876-2895 - [c110]Fabrizio Frati
Universal Geometric Graphs. WG 2020: 174-186 - [p1]Csaba D. Tóth:
Quantitative Restrictions on Crossing Patterns. Beyond Planar Graphs 2020: 11-29 - [i58]Adrian Dumitrescu, Anirban Ghosh, Csaba D. Tóth:
Sparse Hop Spanners for Unit Disk Graphs. CoRR abs/2002.07840 (2020) - [i57]Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz, Pilar Cano, Farah Chanchary, John Iacono, Kshitij Jain, Anna Lubiw, Debajyoti Mondal, Khadijeh Sheikhan, Csaba D. Tóth:
Compatible Paths on Labelled Point Sets. CoRR abs/2004.07996 (2020) - [i56]Fabrizio Frati, Michael Hoffmann, Csaba D. Tóth:
Universal Geometric Graphs. CoRR abs/2006.11262 (2020) - [i55]Esther M. Arkin, Rathish Das, Jie Gao, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk, Csaba D. Tóth:
Cutting Polygons into Small Pieces with Chords: Laser-Based Localization. CoRR abs/2006.15089 (2020) - [i54]David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval, David Orden, Javier Tejel, Csaba D. Tóth, Jorge Urrutia, Birgit Vogtenhuber:
Rainbow polygons for colored point sets in the plane. CoRR abs/2007.10139 (2020) - [i53]Alon Efrat, Radoslav Fulek, Stephen G. Kobourov, Csaba D. Tóth:
Polygons with Prescribed Angles in 2D and 3D. CoRR abs/2008.10192 (2020) - [i52]Michael Hoffmann, Chih-Hung Liu, Meghana M. Reddy, Csaba D. Tóth:
Simple Topological Drawings of k-Planar Graphs. CoRR abs/2008.10794 (2020) - [i51]Sujoy Bhore, Csaba D. Tóth:
On Euclidean Steiner (1+ε)-Spanners. CoRR abs/2010.02908 (2020) - [i50]Hugo A. Akitaya, Matias Korman, Oliver Korten, Diane L. Souvaine, Csaba D. Tóth:
Reconfiguration of Connected Graph Partitions via Recombination. CoRR abs/2011.07378 (2020) - [i49]Sujoy Bhore, Csaba D. Tóth:
Light Euclidean Steiner Spanners in the Plane. CoRR abs/2012.02216 (2020)
2010 – 2019
- 2019
- [j96]Hugo A. Akitaya
Recognizing Weak Embeddings of Graphs. ACM Trans. Algorithms 15(4): 50:1-50:27 (2019) - [j95]Hugo A. Akitaya
Minimum weight connectivity augmentation for planar straight-line graphs. Theor. Comput. Sci. 789: 50-63 (2019) - [c109]Hugo A. Akitaya, Leonie Ryvkin, Csaba D. Tóth:
Rock Climber Distance: Frogs versus Dogs. CCCG 2019: 210-217 - [c108]Hugo A. Akitaya, Matias Korman, Mikhail Rudoy, Diane L. Souvaine, Csaba D. Tóth:
Circumscribing Polygons and Polygonizations for Disjoint Line Segments. SoCG 2019: 9:1-9:17 - [c107]Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, Sander Verdonschot:
Convex Polygons in Cartesian Products. SoCG 2019: 22:1-22:17 - [c106]Marcos Oropeza, Csaba D. Tóth:
Reconstruction of the Crossing Type of a Point Set from the Compatible Exchange Graph of Noncrossing Spanning Trees. DGCI 2019: 234-245 - [c105]Ke Chen
On the Stretch Factor of Polygonal Chains. MFCS 2019: 56:1-56:14 - [e3]Daniel Archambault, Csaba D. Tóth:
Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings. Lecture Notes in Computer Science 11904, Springer 2019, ISBN 978-3-030-35801-3 [contents] - [i48]Hugo A. Akitaya, Matthew D. Jones, Matias Korman, Christopher Meierfrankenfeld, Michael J. Munje, Diane L. Souvaine, Michael Thramann, Csaba D. Tóth:
Reconfiguration of Connected Graph Partitions. CoRR abs/1902.10765 (2019) - [i47]Hugo A. Akitaya, Matias Korman, Mikhail Rudoy, Diane L. Souvaine, Csaba D. Tóth:
Circumscribing Polygons and Polygonizations for Disjoint Line Segments. CoRR abs/1903.07019 (2019) - [i46]Hugo A. Akitaya, Leonie Ryvkin, Csaba D. Tóth:
Rock Climber Distance: Frogs versus Dogs. CoRR abs/1906.08141 (2019) - [i45]Ke Chen, Adrian Dumitrescu, Wolfgang Mulzer, Csaba D. Tóth:
On the Stretch Factor of Polygonal Chains. CoRR abs/1906.10217 (2019) - [i44]Radoslav Fulek, Csaba D. Tóth:
Atomic Embeddability, Clustered Planarity, and Thickenability. CoRR abs/1907.13086 (2019) - [i43]Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Michael Hoffmann, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth:
Simple k-Planar Graphs are Simple (k+1)-Quasiplanar. CoRR abs/1909.00223 (2019) - [i42]Daniel Archambault, Csaba D. Tóth:
Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD 2019). CoRR abs/1909.07013 (2019) - [i41]Seok-Hee Hong, Michael Kaufmann, János Pach, Csaba D. Tóth:
Beyond-Planar Graphs: Combinatorics, Models and Algorithms (Dagstuhl Seminar 19092). Dagstuhl Reports 9(2): 123-156 (2019) - 2018
- [j94]János Pach, László A. Székely, Csaba D. Tóth, Géza Tóth:
Note on k-planar crossing numbers. Comput. Geom. 68: 2-6 (2018) - [j93]Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein:
Arc diagrams, flip distances, and Hamiltonian triangulations. Comput. Geom. 68: 206-225 (2018) - [j92]Hugo A. Akitaya, Csaba D. Tóth:
Reconstruction of Weakly Simple Polygons from Their Edges. Int. J. Comput. Geom. Appl. 28(2): 161-180 (2018) - [j91]Adrian Dumitrescu, Ritankar Mandal, Csaba D. Tóth:
Monotone Paths in Geometric Triangulations. Theory Comput. Syst. 62(6): 1490-1524 (2018) - [j90]Sang Won Bae
Gap-planar graphs. Theor. Comput. Sci. 745: 36-52 (2018) - [c104]Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz, Pilar Cano, Farah Chanchary, John Iacono, Kshitij Jain, Anna Lubiw, Debajyoti Mondal, Khadijeh Sheikhan, Csaba D. Tóth:
Compatible Paths on Labelled Point Sets. CCCG 2018: 54-60 - [c103]Adrian Dumitrescu, Anirban Ghosh, Csaba D. Tóth:
Online Unit Covering in Euclidean Space. COCOA 2018: 609-623 - [c102]Radoslav Fulek, Csaba D. Tóth:
Crossing Minimization in Perturbed Drawings. GD 2018: 229-241 - [c101]Aria Rezaei, Jie Gao, Jeff M. Phillips, Csaba D. Tóth:
Improved bounds on information dissemination by Manhattan Random Waypoint model. SIGSPATIAL/GIS 2018: 139-148 - [c100]Torrie L. Nichols, Alexander Pilz, Csaba D. Tóth, Ahad N. Zehmakan
Transition Operations over Plane Trees. LATIN 2018: 835-848 - [c99]Hugo A. Akitaya, Matthew D. Jones, David Stalfa, Csaba D. Tóth:
Maximum Area Axis-Aligned Square Packings. MFCS 2018: 77:1-77:15 - [c98]Hugo A. Akitaya
Recognizing Weak Embeddings of Graphs. SODA 2018: 274-292 - [e2]Bettina Speckmann, Csaba D. Tóth:
34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary. LIPIcs 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-066-8 [contents] - [i40]Hugo A. Akitaya, Matthew D. Jones, David Stalfa, Csaba D. Tóth:
Maximum Area Axis-Aligned Square Packings. CoRR abs/1806.09562 (2018) - [i39]Radoslav Fulek, Csaba D. Tóth:
Crossing Minimization in Perturbed Drawings. CoRR abs/1808.07608 (2018) - [i38]Aria Rezaei, Jie Gao, Jeff M. Phillips, Csaba D. Tóth:
Improved Bounds on Information Dissemination by Manhattan Random Waypoint Model. CoRR abs/1809.07392 (2018) - [i37]Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, Sander Verdonschot:
Convex Polygons in Cartesian Products. CoRR abs/1812.11332 (2018) - 2017
- [j89]Adrian Dumitrescu, Csaba D. Tóth:
Convex Polygons in Geometric Triangulations. Comb. Probab. Comput. 26(5): 641-659 (2017) - [j88]Hugo A. Akitaya
Recognizing Weakly Simple Polygons. Discret. Comput. Geom. 58(4): 785-821 (2017) - [j87]Kevin Balas, Adrian Dumitrescu
Anchored rectangle and square packings. Discret. Optim. 26: 131-162 (2017) - [j86]Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth:
The planar tree packing theorem. J. Comput. Geom. 8(2): 109-177 (2017) - [j85]Andrea Francke, Csaba D. Tóth:
A Census of Plane Graphs with Polyline Edges. SIAM J. Discret. Math. 31(2): 1174-1195 (2017) - [c97]Adrian Dumitrescu, Csaba D. Tóth:
A Problem on Track Runners. CCCG 2017: 198-201 - [c96]Sang Won Bae
Gap-Planar Graphs. GD 2017: 531-545 - [c95]Michael Hoffmann, Csaba D. Tóth:
Two-Planar Graphs Are Quasiplanar. MFCS 2017: 47:1-47:14 - [c94]Hugo A. Akitaya, Rajasekhar Inkulu, Torrie L. Nichols, Diane L. Souvaine, Csaba D. Tóth, Charles R. Winston:
Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs. WALCOM 2017: 204-216 - [c93]Adrian Dumitrescu, Csaba D. Tóth:
Online Unit Clustering in Higher Dimensions. WAOA 2017: 238-252 - [i36]Alfredo García Olaverri, Ferran Hurtado, Matias Korman, Inês Matos, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, Csaba D. Tóth:
Geometric Biplane Graphs I: Maximal Graphs. CoRR abs/1702.01275 (2017) - [i35]Alfredo García Olaverri, Ferran Hurtado, Matias Korman, Inês Matos, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, Csaba D. Tóth:
Geometric Biplane Graphs II: Graph Augmentation. CoRR abs/1702.01277 (2017) - [i34]Adrian Dumitrescu, Csaba D. Tóth:
Online unit clustering in higher dimensions. CoRR abs/1708.02662 (2017) - [i33]Sang Won Bae, Jean-François Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth:
Gap-planar Graphs. CoRR abs/1708.07653 (2017) - [i32]Hugo A. Akitaya, Radoslav Fulek, Csaba D. Tóth:
Recognizing Weak Embeddings of Graphs. CoRR abs/1709.09209 (2017) - 2016
- [j84]Eli Fox-Epstein, Csaba D. Tóth, Andrew Winslow:
Diffuse Reflection Radius in a Simple Polygon. Algorithmica 76(4): 910-931 (2016) - [j83]Gill Barequet, Sarah Cannon, Eli Fox-Epstein, Benjamin Hescott, Diane L. Souvaine, Csaba D. Tóth, Andrew Winslow:
Diffuse reflection diameter in simple polygons. Discret. Appl. Math. 210: 123-132 (2016) - [j82]Eyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine, Csaba D. Tóth:
The Flip Diameter of Rectangulations and Convex Subdivisions. Discret. Math. Theor. Comput. Sci. 18(3) (2016) - [j81]Andres J. Ruiz-Vargas, Andrew Suk, Csaba D. Tóth:
Disjoint edges in topological graphs and the tangled-thrackle conjecture. Eur. J. Comb. 51: 398-406 (2016) - [j80]Adrian Dumitrescu, Maarten Löffler, André Schulz, Csaba D. Tóth:
Counting Carambolas. Graphs Comb. 32(3): 923-942 (2016) - [j79]Adrian Dumitrescu, Csaba D. Tóth:
The Traveling Salesman Problem for Lines, Balls, and Planes. ACM Trans. Algorithms 12(3): 43:1-43:29 (2016) - [j78]Kevin Balas, Csaba D. Tóth:
On the number of anchored rectangle packings for a planar point set. Theor. Comput. Sci. 654: 143-154 (2016) - [c92]Hugo A. Akitaya, Greg Aloupis, Jeff Erickson, Csaba D. Tóth:
Recognizing Weakly Simple Polygons. SoCG 2016: 8:1-8:16 - [c91]Kevin Balas, Adrian Dumitrescu, Csaba D. Tóth:
Anchored Rectangle and Square Packings. SoCG 2016: 13:1-13:16 - [c90]Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth:
The Planar Tree Packing Theorem. SoCG 2016: 41:1-41:15 - [c89]Hugo A. Akitaya, Maarten Löffler, Csaba D. Tóth:
Multi-colored Spanning Graphs. GD 2016: 81-93 - [c88]Hugo A. Akitaya, Csaba D. Tóth:
Reconstruction of Weakly Simple Polygons from their Edges. ISAAC 2016: 10:1-10:13 - [c87]Adrian Dumitrescu, Ritankar Mandal, Csaba D. Tóth:
Monotone Paths in Geometric Triangulations. IWOCA 2016: 411-422 - [r1]Adrian Dumitrescu, Csaba D. Tóth:
Binary Space Partitions. Encyclopedia of Algorithms 2016: 220-223 - [i31]Kevin Balas, Adrian Dumitrescu, Csaba D. Tóth:
Anchored Rectangle and Square Packings. CoRR abs/1603.00060 (2016) - [i30]Hugo A. Akitaya, Greg Aloupis, Jeff Erickson, Csaba D. Tóth:
Recognizing Weakly Simple Polygons. CoRR abs/1603.07401 (2016) - [i29]Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth:
The Planar Tree Packing Theorem. CoRR abs/1603.07737 (2016) - [i28]Adrian Dumitrescu, Ritankar Mandal, Csaba D. Tóth:
Monotone Paths in Geometric Triangulations. CoRR abs/1608.04812 (2016) - [i27]Hugo A. Akitaya, Maarten Löffler, Csaba D. Tóth:
Multi-Colored Spanning Graphs. CoRR abs/1608.07056 (2016) - [i26]Hugo A. Akitaya, Csaba D. Tóth:
Reconstruction of weakly simple polygons from their edges. CoRR abs/1610.00361 (2016) - [i25]Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein:
Arc diagrams, flip distances, and Hamiltonian triangulations. CoRR abs/1611.02541 (2016) - [i24]Hugo A. Akitaya, Rajasekhar Inkulu, Torrie L. Nichols, Diane L. Souvaine, Csaba D. Tóth, Charles R. Winston:
Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs. CoRR abs/1612.04780 (2016) - 2015
- [j77]Adrian Dumitrescu, Csaba D. Tóth:
Packing anchored rectangles. Comb. 35(1): 39-61 (2015) - [j76]Csaba D. Tóth:
The Szemerédi-Trotter theorem in the complex plane. Comb. 35(1): 95-126 (2015) - [j75]Zachary Abel, Robert Connelly, Sarah Eisenstat, Radoslav Fulek
Free Edge Lengths in Plane Graphs. Discret. Comput. Geom. 54(1): 259-289 (2015) - [j74]Alfredo García Olaverri, Ferran Hurtado, Matias Korman, Inês Matos, Maria Saumell
Geometric Biplane Graphs I: Maximal Graphs. Graphs Comb. 31(2): 407-425 (2015) - [j73]Alfredo García Olaverri, Ferran Hurtado, Matias Korman, Inês Matos, Maria Saumell
Geometric Biplane Graphs II: Graph Augmentation. Graphs Comb. 31(2): 427-452 (2015) - [j72]Radoslav Fulek
Universal point sets for planar three-trees. J. Discrete Algorithms 30: 101-112 (2015) - [j71]Adrian Dumitrescu, Minghui Jiang, Csaba D. Tóth:
Computing Opaque Interior Barriers à la Shermer. SIAM J. Discret. Math. 29(3): 1372-1386 (2015) - [j70]Bernardo M. Ábrego, Adrian Dumitrescu, Silvia Fernández, Csaba D. Tóth:
Computational Geometry Column 61. SIGACT News 46(2): 65-77 (2015) - [c86]Kevin Balas, Csaba D. Tóth:
On the Number of Anchored Rectangle Packings for a Planar Point Set. COCOON 2015: 377-389 - [c85]Maarten Löffler, Csaba D. Tóth:
Linear-Size Universal Point Sets for One-Bend Drawings. GD 2015: 423-429 - [c84]Clinton Bowen, Stephane Durocher, Maarten Löffler, Anika Rounds, André Schulz, Csaba D. Tóth:
Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees. GD 2015: 447-459 - [c83]Bernardo M. Ábrego, Silvia Fernández-Merchant
Graduate Workshop Recent Trends in Graph Drawing: Curves, Graphs, and Intersections. GD 2015: 541 - [c82]Hugo Alves Akitaya, Jonathan Castello, Yauheniya Lahoda, Anika Rounds, Csaba D. Tóth:
Augmenting Planar Straight Line Graphs to 2-Edge-Connectivity. GD 2015: 563-564 - [c81]Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein:
Arc Diagrams, Flip Distances, and Hamiltonian Triangulations. STACS 2015: 197-210 - [c80]Adrian Dumitrescu, Csaba D. Tóth:
Convex Polygons in Geometric Triangulations. WADS 2015: 289-300 - [i23]Adrian Dumitrescu, Csaba D. Tóth:
Constant-Factor Approximation for TSP with Disks. CoRR abs/1506.07903 (2015) - [i22]Adrian Dumitrescu, Csaba D. Tóth:
A problem on track runners. CoRR abs/1508.07289 (2015) - 2014
- [j69]Mashhood Ishaque, Csaba D. Tóth:
Relative Convex Hulls in Semi-Dynamic Arrangements. Algorithmica 68(2): 448-482 (2014) - [j68]Adrian Dumitrescu, Anirban Ghosh
On Fence Patrolling by Mobile Agents. Electron. J. Comb. 21(3): 3 (2014) - [j67]Adrian Dumitrescu, Dániel Gerbner
Covering Paths for Planar Point Sets. Discret. Comput. Geom. 51(2): 462-484 (2014) - [j66]Michael Hoffmann, Csaba D. Tóth:
Vertex-Colored Encompassing Graphs. Graphs Comb. 30(4): 933-947 (2014) - [j65]Fabrizio Frati
On the Upward Planarity of Mixed Plane Graphs. J. Graph Algorithms Appl. 18(2): 253-279 (2014) - [j64]Karin Arikushi, Csaba D. Tóth:
Crossing Angles of Geometric Graphs. J. Graph Algorithms Appl. 18(3): 401-420 (2014) - [j63]Adrian Dumitrescu, Sariel Har-Peled
Minimum Convex Partitions and Maximum Empty Polytopes. J. Comput. Geom. 5(1): 86-103 (2014) - [j62]Javier Cano, Csaba D. Tóth, Jorge Urrutia:
Upper Bound Constructions for Untangling Planar Geometric Graphs. SIAM J. Discret. Math. 28(4): 1935-1943 (2014) - [j61]Adrian Dumitrescu, Csaba D. Tóth:
Computational geometry column 59. SIGACT News 45(2): 68-72 (2014) - [c79]Adrian Dumitrescu, Minghui Jiang, Csaba D. Tóth:
Computing Opaque Interior Barriers à la Shermer. APPROX-RANDOM 2014: 128-143 - [c78]Adrian Dumitrescu, Csaba D. Tóth:
Covering Grids by Trees. CCCG 2014 - [c77]Eli Fox-Epstein, Csaba D. Tóth, Andrew Winslow:
Diffuse Reflection Radius in a Simple Polygon. COCOON 2014: 239-250 - [c76]Andrea Francke, Csaba D. Tóth:
A Census of Plane Graphs with Polyline Edges. SoCG 2014: 242 - [c75]Zachary Abel, Robert Connelly, Sarah Eisenstat, Radoslav Fulek
Free Edge Lengths in Plane Graphs. SoCG 2014: 426 - [c74]Andres J. Ruiz-Vargas, Andrew Suk, Csaba D. Tóth:
Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture. GD 2014: 284-293 - [c73]Eyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine, Csaba D. Tóth:
The Flip Diameter of Rectangulations and Convex Subdivisions. LATIN 2014: 478-489 - [i21]Adrian Dumitrescu, Anirban Ghosh, Csaba D. Tóth:
On Fence Patrolling by Mobile Agents. CoRR abs/1401.6070 (2014) - [i20]Eli Fox-Epstein, Csaba D. Tóth, Andrew Winslow:
Diffuse Reflection Radius in a Simple Polygon. CoRR abs/1402.5303 (2014) - [i19]Andres J. Ruiz-Vargas, Andrew Suk, Csaba D. Tóth:
Disjoint edges in topological graphs and the tangled-thrackle conjecture. CoRR abs/1406.2726 (2014) - [i18]Adrian Dumitrescu, Maarten Löffler, André Schulz, Csaba D. Tóth:
Counting Carambolas. CoRR abs/1410.1579 (2014) - [i17]Jean Cardinal, Csaba D. Tóth, David R. Wood:
General Position Subsets and Independent Hyperplanes in d-Space. CoRR abs/1410.3637 (2014) - [i16]Adrian Dumitrescu, Csaba D. Tóth:
Convex polygons in geometric triangulations. CoRR abs/1411.1303 (2014) - 2013
- [j60]André Schulz, Csaba D. Tóth:
The union of colorful simplices spanned by a colored point set. Comput. Geom. 46(5): 574-590 (2013) - [j59]Javier Cano, Csaba D. Tóth, Jorge Urrutia:
A tight bound for point guards in piecewise convex art galleries. Comput. Geom. 46(8): 945-958 (2013) - [j58]Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth:
Disjoint Compatible Geometric Matchings. Discret. Comput. Geom. 49(1): 89-131 (2013) - [j57]Gill Barequet, Sarah Cannon, Eli Fox-Epstein, Benjamin Hescott, Diane L. Souvaine, Csaba D. Tóth, Andrew Winslow:
Diffuse Reflections in Simple Polygons. Electron. Notes Discret. Math. 44: 345-350 (2013) - [j56]Adrian Dumitrescu, André Schulz, Adam Sheffer, Csaba D. Tóth:
Bounds on the Maximum Multiplicity of Some Common Geometric Graphs. SIAM J. Discret. Math. 27(2): 802-826 (2013) - [c72]Adrian Dumitrescu, Csaba D. Tóth:
On the Total Perimeter of Homothetic Convex Bodies in a Convex Container. APPROX-RANDOM 2013: 96-109 - [c71]Maarten Löffler, André Schulz, Csaba D. Tóth:
Counting Carambolas. CCCG 2013 - [c70]Fabrizio Frati
On the Upward Planarity of Mixed Plane Graphs. GD 2013: 1-12 - [c69]Adrian Dumitrescu, Csaba D. Tóth:
The traveling salesman problem for lines, balls and planes. SODA 2013: 828-843 - [c68]Radoslav Fulek
Universal Point Sets for Planar Three-Trees. WADS 2013: 341-352 - [c67]Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth:
Planar Packing of Binary Trees. WADS 2013: 353-364 - [i15]Gill Barequet, Sarah Cannon, Eli Fox-Epstein, Benjamin Hescott, Diane L. Souvaine, Csaba D. Tóth, Andrew Winslow:
Diffuse Reflections in Simple Polygons. CoRR abs/1302.2271 (2013) - [i14]Adrian Dumitrescu, Dániel Gerbner, Balázs Keszegh, Csaba D. Tóth:
Covering Paths for Planar Point Sets. CoRR abs/1303.0262 (2013) - [i13]Adrian Dumitrescu, Csaba D. Tóth:
The traveling salesman problem for lines, balls and planes. CoRR abs/1303.6659 (2013) - [i12]Eyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine, Csaba D. Tóth:
The Flip Diameter of Rectangulations and Convex Subdivisions. CoRR abs/1312.4429 (2013) - 2012
- [j55]Karin Arikushi, Radoslav Fulek
Graphs that admit right angle crossing drawings. Comput. Geom. 45(4): 169-177 (2012) - [j54]Adrian Dumitrescu, Csaba D. Tóth:
Watchman tours for polygons with holes. Comput. Geom. 45(7): 326-333 (2012) - [j53]Csaba D. Tóth:
Connectivity augmentation in planar straight line graphs. Eur. J. Comb. 33(3): 408-425 (2012) - [j52]Mashhood Ishaque, Bettina Speckmann
Shooting Permanent Rays among Disjoint Polygons in the Plane. SIAM J. Comput. 41(4): 1005-1027 (2012) - [j51]Eyal Ackerman, Radoslav Fulek
Graphs That Admit Polyline Drawings with Few Crossing Angles. SIAM J. Discret. Math. 26(1): 305-320 (2012) - [j50]Adrian Dumitrescu, Csaba D. Tóth:
Computational geometry column 54. SIGACT News 43(4): 90-97 (2012) - [c66]Javier Cano, Csaba D. Tóth, Jorge Urrutia:
Edge Guards for Polyhedra in 3-Space. CCCG 2012: 155-160 - [c65]Karin Arikushi, Csaba D. Tóth:
Crossing Angles of Geometric Graphs. COCOA 2012: 103-114 - [c64]Adrian Dumitrescu, Günter Rote, Csaba D. Tóth:
Monotone Paths in Planar Convex Subdivisions. COCOON 2012: 240-251 - [c63]Sarah Cannon, Mashhood Ishaque, Csaba D. Tóth:
Conflict-Free Graph Orientations with Parity Constraints. FUN 2012: 57-68 - [c62]Adrian Dumitrescu, Csaba D. Tóth:
Covering Paths for Planar Point Sets. GD 2012: 303-314 - [c61]Adrian Dumitrescu, Csaba D. Tóth:
Packing anchored rectangles. SODA 2012: 294-305 - [c60]Adrian Dumitrescu, Sariel Har-Peled, Csaba D. Tóth:
Minimum Convex Partitions and Maximum Empty Polytopes. SWAT 2012: 213-224 - [i11]Sarah Cannon, Mashhood Ishaque, Csaba D. Tóth:
Conflict-free graph orientations with parity constraints. CoRR abs/1203.3256 (2012) - [i10]Radoslav Fulek, Csaba D. Tóth:
Universal point sets for planar three-tree. CoRR abs/1212.6148 (2012) - 2011
- [j49]Adrian Dumitrescu, Csaba D. Tóth:
Minimum Weight Convex Steiner Partitions. Algorithmica 60(3): 627-652 (2011) - [j48]Marwan Al-Jubeh, Mashhood Ishaque, Kristóf Rédei, Diane L. Souvaine, Csaba D. Tóth, Pavel Valtr:
Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three. Algorithmica 61(4): 971-999 (2011) - [j47]Csaba D. Tóth:
Binary Plane Partitions for Disjoint Line Segments. Discret. Comput. Geom. 45(4): 617-646 (2011) - [j46]Adrian Dumitrescu, Minghui Jiang, Csaba D. Tóth:
New bounds on the average distance from the Fermat-Weber center of a planar convex body. Discret. Optim. 8(3): 417-427 (2011) - [j45]Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth:
Convex partitions with 2-edge connected dual graphs. J. Comb. Optim. 22(3): 409-425 (2011) - [j44]Jacob Fox, János Pach, Csaba D. Tóth:
Intersection patterns of curves. J. Lond. Math. Soc. 83(2): 389-406 (2011) - [c59]Ben D. Lund, George B. Purdy, Justin W. Smith, Csaba D. Tóth:
Collinearities in Kinetic Point Sets. CCCG 2011 - [c58]Csaba D. Tóth, Godfried T. Toussaint, Andrew Winslow:
Open Guard Edges and Edge Guards in Simple Polygons. CCCG 2011 - [c57]Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth:
Disjoint compatible geometric matchings. SCG 2011: 125-134 - [c56]Javier Cano, Csaba D. Tóth, Jorge Urrutia:
Upper Bound Constructions for Untangling Planar Geometric Graphs. GD 2011: 290-295 - [c55]Csaba D. Tóth, Godfried T. Toussaint, Andrew Winslow:
Open Guard Edges and Edge Guards in Simple Polygons. EGC 2011: 54-64 - [c54]Diane L. Souvaine, Csaba D. Tóth, Andrew Winslow:
Simultaneously Flippable Edges in Triangulations. EGC 2011: 138-145 - [c53]Adrian Dumitrescu, André Schulz, Adam Sheffer, Csaba D. Tóth:
Bounds on the maximum multiplicity of some common geometric graphs. STACS 2011: 637-648 - [c52]Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl:
Counting Plane Graphs: Flippability and Its Applications. WADS 2011: 524-535 - [i9]Ben D. Lund, George B. Purdy, Justin W. Smith, Csaba D. Tóth:
Collinearities in Kinetic Point Sets. CoRR abs/1105.3078 (2011) - [i8]Adrian Dumitrescu, Csaba D. Tóth:
Packing anchored rectangles. CoRR abs/1107.5102 (2011) - [i7]Adrian Dumitrescu, Sariel Har-Peled, Csaba D. Tóth:
Minimum Convex Partitions and Maximum Empty Polytopes. CoRR abs/1112.1124 (2011) - 2010
- [j43]Ondrej Bílka, Kevin Buchin, Radoslav Fulek, Masashi Kiyomi
A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets. Electron. J. Comb. 17(1) (2010) - [j42]Michael Hoffmann, Bettina Speckmann
Pointed binary encompassing trees: Simple and optimal. Comput. Geom. 43(1): 35-41 (2010) - [j41]Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth:
Cuttings for Disks and Axis-Aligned Rectangles in Three-Space. Discret. Comput. Geom. 43(2): 221-241 (2010) - [j40]Adrian Dumitrescu, Csaba D. Tóth:
Long Non-crossing Configurations in the Plane. Discret. Comput. Geom. 44(4): 727-752 (2010) - [j39]Jacob Fox, János Pach, Csaba D. Tóth:
A bipartite strengthening of the Crossing Lemma. J. Comb. Theory B 100(1): 23-35 (2010) - [c51]Adrian Dumitrescu, Csaba D. Tóth:
Watchman tours for polygons with holes. CCCG 2010: 113-116 - [c50]André Schulz, Csaba D. Tóth:
The Union of Colorful Simplices Spanned by a Colored Point Set. COCOA (1) 2010: 324-338 - [c49]Eyal Ackerman, Radoslav Fulek
On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles. GD 2010: 1-12 - [c48]Adrian Dumitrescu, Csaba D. Tóth:
Long Non-crossing Configurations in the Plane. STACS 2010: 311-322 - [c47]Karin Arikushi, Radoslav Fulek
Graphs that Admit Right Angle Crossing Drawings. WG 2010: 135-146 - [i6]Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl:
Counting Plane Graphs: Flippability and its Applications. CoRR abs/1012.0591 (2010) - [i5]Adrian Dumitrescu, André Schulz, Adam Sheffer, Csaba D. Tóth:
Bounds on the maximum multiplicity of some common geometric graphs. CoRR abs/1012.5664 (2010)
2000 – 2009
- 2009
- [j38]Diane L. Souvaine, Csaba D. Tóth:
A vertex-face assignment for plane graphs. Comput. Geom. 42(5): 388-394 (2009) - [j37]Menelaos I. Karavelas, Csaba D. Tóth, Elias P. Tsigaridas:
Guarding curvilinear art galleries with vertex or point guards. Comput. Geom. 42(6-7): 522-535 (2009) - [j36]Adrian Dumitrescu, Csaba D. Tóth, Guangwu Xu:
On stars and Steiner stars. Discret. Optim. 6(3): 324-332 (2009) - [j35]Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth:
Extremal problems on triangle areas in two and three dimensions. J. Comb. Theory A 116(7): 1177-1198 (2009) - [j34]Adrian Dumitrescu, Csaba D. Tóth:
Light orthogonal networks with constant geometric dilation. J. Discrete Algorithms 7(1): 112-129 (2009) - [c46]Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth:
Convex Partitions with 2-Edge Connected Dual Graphs. COCOON 2009: 192-204 - [c45]Mashhood Ishaque, Bettina Speckmann
Shooting permanent rays among disjoint polygons in the plane. SCG 2009: 51-60 - [c44]Csaba D. Tóth:
Binary plane partitions for disjoint line segments. SCG 2009: 71-79 - [c43]Adrian Dumitrescu, Csaba D. Tóth:
New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body. ISAAC 2009: 132-141 - [c42]Marwan Al-Jubeh, Mashhood Ishaque, Kristóf Rédei, Diane L. Souvaine, Csaba D. Tóth:
Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs. ISAAC 2009: 902-912 - [c41]Adrian Dumitrescu, Csaba D. Tóth, Guangwu Xu:
On stars and Steiner stars: II. SODA 2009: 311-317 - [e1]Frank K. H. A. Dehne, Marina L. Gavrilova, Jörg-Rüdiger Sack, Csaba D. Tóth:
Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings. Lecture Notes in Computer Science 5664, Springer 2009, ISBN 978-3-642-03366-7 [contents] - [i4]Adrian Dumitrescu, Csaba D. Tóth:
Long non-crossing configurations in the plane. CoRR abs/0909.4094 (2009) - 2008
- [j33]Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth:
Encompassing colored planar straight line graphs. Comput. Geom. 39(1): 14-23 (2008) - [j32]Adrian Dumitrescu, Csaba D. Tóth:
On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space. Comb. Probab. Comput. 17(2): 203-224 (2008) - [j31]József Solymosi, Csaba D. Tóth:
On a Question of Bourgain about Geometric Incidences. Comb. Probab. Comput. 17(4): 619-625 (2008) - [j30]David W. Krumme, Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth:
Tight Bounds for Connecting Sites Across Barriers. Discret. Comput. Geom. 40(3): 377-394 (2008) - [j29]Csaba D. Tóth:
Connectivity augmentation in plane straight line graphs. Electron. Notes Discret. Math. 31: 49-52 (2008) - [j28]Jacob Fox, Csaba D. Tóth:
On the decay of crossing numbers. J. Comb. Theory B 98(1): 33-42 (2008) - [j27]Csaba D. Tóth:
Convex subdivisions with low stabbing numbers. Period. Math. Hung. 57(2): 217-225 (2008) - [j26]Csaba D. Tóth:
Binary Space Partitions for Axis-Aligned Fat Rectangles. SIAM J. Comput. 38(1): 429-447 (2008) - [j25]Csaba D. Tóth:
Axis-Aligned Subdivisions with Low Stabbing Numbers. SIAM J. Discret. Math. 22(3): 1187-1204 (2008) - [j24]Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth:
Detecting cuts in sensor networks. ACM Trans. Sens. Networks 4(2): 10:1-10:25 (2008) - [c40]Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth:
Extremal problems on triangle areas in two and three dimensions. SCG 2008: 208-217 - [c39]Mashhood Ishaque, Csaba D. Tóth:
Relative Convex Hulls in Semi-dynamic Subdivisions. ESA 2008: 780-792 - [c38]Adrian Dumitrescu, Csaba D. Tóth:
Minimum weight convex Steiner partitions. SODA 2008: 581-590 - [c37]Adrian Dumitrescu, Csaba D. Tóth:
On stars and Steiner stars. SODA 2008: 1233-1240 - [i3]Adrian Dumitrescu, Csaba D. Tóth, Guangwu Xu:
On stars and Steiner stars. II. CoRR abs/0806.4858 (2008) - 2007
- [j23]Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Selfish Load Balancing and Atomic Congestion Games. Algorithmica 47(1): 79-96 (2007) - [j22]Oswin Aichholzer, Clemens Huemer, Sarah Kappes, Bettina Speckmann
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles. Graphs Comb. 23(5): 481-507 (2007) - [j21]Adrian Dumitrescu, Csaba D. Tóth:
Analysis of two Sweep-line Algorithms for Constructing Spanning Trees and Steiner Trees. J. Univers. Comput. Sci. 13(11): 1615-1627 (2007) - [c36]Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth:
Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs. CCCG 2007: 13-16 - [c35]Chiranjeeb Buragohain, Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks. COCOON 2007: 210-221 - [c34]Jacob Fox, János Pach, Csaba D. Tóth:
A Bipartite Strengthening of the Crossing Lemma. GD 2007: 13-24 - [c33]Adrian Dumitrescu, Csaba D. Tóth:
Distinct Triangle Areas in a Planar Point Set. IPCO 2007: 119-129 - [c32]Adrian Dumitrescu, Csaba D. Tóth:
On the number of tetrahedra with minimum, unit, and distinct volumes in three-space. SODA 2007: 1114-1123 - [c31]Adrian Dumitrescu, Csaba D. Tóth:
Light Orthogonal Networks with Constant Geometric Dilation. STACS 2007: 175-187 - [c30]Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth:
Cuttings for Disks and Axis-Aligned Rectangles. WADS 2007: 470-482 - 2006
- [j20]John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth:
Adaptive Spatial Partitioning for Multidimensional Data Streams. Algorithmica 46(1): 97-117 (2006) - [j19]József Solymosi, Csaba D. Tóth:
Distinct Distances in Homogeneous Sets in Euclidean Space. Discret. Comput. Geom. 35(4): 537-549 (2006) - [j18]Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Range Counting over Multidimensional Data Streams. Discret. Comput. Geom. 36(4): 633-655 (2006) - [j17]Csaba D. Tóth:
Alternating Paths along Axis-Parallel Segments. Graphs Comb. 22(4): 527-543 (2006) - [j16]Jean-Claude Bermond, Frédéric Havet, Csaba D. Tóth:
Fault tolerant on-board networks with priorities. Networks 47(1): 9-25 (2006) - [c29]Csaba D. Tóth, Michael Hoffmann:
Spanning trees across axis-parallel segments. CCCG 2006 - [c28]David W. Krumme, Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth:
Tight bounds for connecting sites across barriers. SCG 2006: 439-448 - [c27]Jacob Fox, Csaba D. Tóth:
On the Decay of Crossing Numbers. GD 2006: 174-183 - [c26]Oswin Aichholzer
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles. MFCS 2006: 86-97 - 2005
- [j15]Bettina Speckmann
Allocating Vertex pi-Guards in Simple Polygons via Pseudo-Triangulations. Discret. Comput. Geom. 33(2): 345-364 (2005) - [j14]John Hershberger, Subhash Suri, Csaba D. Tóth:
Binary Space Partitions of Orthogonal Subdivisions. SIAM J. Comput. 34(6): 1380-1397 (2005) - [c25]Csaba D. Tóth, Diane L. Souvaine:
A vertex-face assignment for plane graphs. CCCG 2005: 138-141 - [c24]György Elekes, Csaba D. Tóth:
Incidences of not-too-degenerate hyperplanes. SCG 2005: 16-21 - [c23]Michael Hoffmann, Csaba D. Tóth:
Pointed and colored binary encompassing trees. SCG 2005: 81-90 - [c22]Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth:
Detecting cuts in sensor networks. IPSN 2005: 210-217 - [c21]John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth:
Space complexity of hierarchical heavy hitters in multi-dimensional data streams. PODS 2005: 338-347 - [c20]Csaba D. Tóth:
Orthogonal Subdivisions with Low Stabbing Numbers. WADS 2005: 256-268 - [i2]Oswin Aichholzer, Clemens Huemer, Sarah Renkl, Bettina Speckmann, Csaba D. Tóth:
On pseudo-convex decompositions, partitions, and coverings. EuroCG 2005: 89-92 - [i1]Michael Hoffmann, Csaba D. Tóth:
Pointed binary encompassing trees: Simple and optimal. EuroCG 2005: 93-96 - 2004
- [j13]Csaba D. Tóth:
Illuminating labyrinths. Discret. Appl. Math. 138(1-2): 215-228 (2004) - [c19]Anshul Kothari, Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Congestion Games, Load Balancing, and Price of Anarchy. CAAN 2004: 13-27 - [c18]Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth:
Encompassing colored crossing-free geometric graphs. CCCG 2004: 48-52 - [c17]Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Range counting over multidimensional data streams. SCG 2004: 160-169 - [c16]John Hershberger, Subhash Suri, Csaba D. Tóth:
Binary space partitions of orthogonal subdivisions. SCG 2004: 230-238 - [c15]Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Uncoordinated Load Balancing and Congestion Games in P2P Systems. IPTPS 2004: 123-130 - [c14]John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth:
Adaptive Spatial Partitioning for Multidimensional Data Streams. ISAAC 2004: 522-533 - [c13]Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Selfish load balancing and atomic congestion games. SPAA 2004: 188-195 - [c12]Michael Hoffmann, Bettina Speckmann
Pointed Binary Encompassing Trees. SWAT 2004: 442-454 - 2003
- [j12]Csaba D. Tóth:
Guarding disjoint triangles and claws in the plane. Comput. Geom. 25(1-2): 51-65 (2003) - [j11]Michael Hoffmann, Csaba D. Tóth:
Segment endpoint visibility graphs are Hamiltonian. Comput. Geom. 26(1): 47-68 (2003) - [j10]Csaba D. Tóth:
A Note on Binary Plane Partitions. Discret. Comput. Geom. 30(1): 3-16 (2003) - [j9]Csaba D. Tóth:
Illuminating Disjoint Line Segments in the Plane. Discret. Comput. Geom. 30(3): 489-505 (2003) - [j8]Csaba D. Tóth:
Illumination of polygons by 45°-floodlights. Discret. Math. 265(1-3): 251-260 (2003) - [j7]Michael Hoffmann, Csaba D. Tóth:
Alternating paths through disjoint line segments. Inf. Process. Lett. 87(6): 287-294 (2003) - [j6]Csaba D. Tóth:
Binary Space Partitions for Line Segments with a Limited Number of Directions. SIAM J. Comput. 32(2): 307-325 (2003) - [c11]Oswin Aichholzer, Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth:
Degree Bounds for Constrained Pseudo-Triangulations. CCCG 2003: 155-158 - [c10]Csaba D. Tóth:
Binary Space Partition for Orthogonal Fat Rectangles. ESA 2003: 494-505 - [c9]Bettina Speckmann, Csaba D. Tóth:
Allocating vertex pi-guards in simple polygons via pseudo-triangulations. SODA 2003: 109-118 - [c8]Csaba D. Tóth:
Alternating Paths along Orthogonal Segments. WADS 2003: 389-400 - 2002
- [j5]Csaba D. Tóth:
Art galleries with guards of uniform range of vision. Comput. Geom. 21(3): 185-192 (2002) - [j4]Csaba D. Tóth:
Illumination in the presence of opaque line segments in the plane. Comput. Geom. 21(3): 193-204 (2002) - [j3]József Solymosi, Gábor Tardos
The k Most Frequent Distances in the Plane. Discret. Comput. Geom. 28(4): 639-648 (2002) - [c7]Michael Hoffmann, Csaba D. Tóth:
Connecting points in the presence of obstacles in the plane. CCCG 2002: 63-67 - [c6]Csaba D. Tóth:
Binary space partitions for line segments with a limited number of directions. SODA 2002: 465-471 - 2001
- [j2]József Solymosi, Csaba D. Tóth:
Distinct Distances in the Plane. Discret. Comput. Geom. 25(4): 629-634 (2001) - [c5]Michael Hoffmann, Csaba D. Tóth:
Segment endpoint visibility graphs are hamiltonian. CCCG 2001: 109-112 - [c4]József Solymosi, Csaba D. Tóth:
On the distinct distances determined by a planar point set. SCG 2001: 29-32 - [c3]Csaba D. Tóth:
A note on binary plane partitions. SCG 2001: 151-156 - [c2]Csaba D. Tóth:
Illuminating Polygons with Vertex pi-Floodlights. International Conference on Computational Science (1) 2001: 772-784 - 2000
- [j1]Csaba D. Tóth:
Art gallery problem with guards whose range of vision is 180. Comput. Geom. 17(3-4): 121-134 (2000) - [c1]Csaba D. Tóth:
Illuminating Both Sides of Line Segments. JCDCG 2000: 370-380
Coauthor Index
Hugo A. Akitaya
aka: Hugo Alves Akitaya
aka: Hugo Alves Akitaya
[j122] [c127] [c126] [i73] [i72] [j118] [j117] [i65] [j107] [j106] [j99] [j98] [c113] [c112] [i58] [c107] [c105] [i45] [j91] [c103] [i37] [j89] [j87] [c97] [c93] [i34] [j80] [j79] [c91] [c87] [r1] [i31] [i28] [j77] [j71] [j70] [c80] [i23] [i22] [j68] [j67] [j63] [j61] [c79] [c78] [i21] [i18] [i16] [j56] [c72] [c69] [i14] [i13] [j54] [j50] [c64] [c62] [c61] [c60] [j49] [j46] [c53] [i8] [i7] [j40] [c51] [c48] [i5] [j36] [j35] [j34] [c43] [c41] [i4] [j32] [c40] [c38] [c37] [i3] [j21] [c33] [c32] [c31]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: