The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Csaba D. Tóth: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Anshul Kothari, Subhash Suri, Csaba D. Tóth, Yunhong Zhou
    Congestion Games, Load Balancing, and Price of Anarchy. [Citation Graph (0, 0)][DBLP]
    CAAN, 2004, pp:13-27 [Conf]
  2. Oswin Aichholzer, Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth
    Degree Bounds for Constrained Pseudo-Triangulations. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:155-158 [Conf]
  3. Michael Hoffmann, Csaba D. Tóth
    Segment endpoint visibility graphs are hamiltonian. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:109-112 [Conf]
  4. Michael Hoffmann, Csaba D. Tóth
    Connecting points in the presence of obstacles in the plane. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:63-67 [Conf]
  5. Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth
    Encompassing colored crossing-free geometric graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:48-52 [Conf]
  6. Csaba D. Tóth, Diane L. Souvaine
    A vertex-face assignment for plane graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:138-141 [Conf]
  7. György Elekes, Csaba D. Tóth
    Incidences of not-too-degenerate hyperplanes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:16-21 [Conf]
  8. John Hershberger, Subhash Suri, Csaba D. Tóth
    Binary space partitions of orthogonal subdivisions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:230-238 [Conf]
  9. Michael Hoffmann, Csaba D. Tóth
    Pointed and colored binary encompassing trees. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:81-90 [Conf]
  10. David W. Krumme, Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth
    Tight bounds for connecting sites across barriers. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:439-448 [Conf]
  11. József Solymosi, Csaba D. Tóth
    On the distinct distances determined by a planar point set. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:29-32 [Conf]
  12. Subhash Suri, Csaba D. Tóth, Yunhong Zhou
    Range counting over multidimensional data streams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:160-169 [Conf]
  13. Csaba D. Tóth
    A note on binary plane partitions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:151-156 [Conf]
  14. Csaba D. Tóth
    Binary Space Partition for Orthogonal Fat Rectangles. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:494-505 [Conf]
  15. Jacob Fox, Csaba D. Tóth
    On the Decay of Crossing Numbers. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:174-183 [Conf]
  16. Csaba D. Tóth
    Illuminating Polygons with Vertex pi-Floodlights. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (1), 2001, pp:772-784 [Conf]
  17. Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth
    Detecting cuts in sensor networks. [Citation Graph (0, 0)][DBLP]
    IPSN, 2005, pp:210-217 [Conf]
  18. Subhash Suri, Csaba D. Tóth, Yunhong Zhou
    Uncoordinated Load Balancing and Congestion Games in P2P Systems. [Citation Graph (0, 0)][DBLP]
    IPTPS, 2004, pp:123-130 [Conf]
  19. John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth
    Adaptive Spatial Partitioning for Multidimensional Data Streams. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:522-533 [Conf]
  20. Csaba D. Tóth
    Illuminating Both Sides of Line Segments. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2000, pp:370-380 [Conf]
  21. Oswin Aichholzer, Clemens Huemer, S. Kappes, Bettina Speckmann, Csaba D. Tóth
    Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:86-97 [Conf]
  22. John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth
    Space complexity of hierarchical heavy hitters in multi-dimensional data streams. [Citation Graph (0, 0)][DBLP]
    PODS, 2005, pp:338-347 [Conf]
  23. Bettina Speckmann, Csaba D. Tóth
    Allocating vertex pi-guards in simple polygons via pseudo-triangulations. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:109-118 [Conf]
  24. Csaba D. Tóth
    Binary space partitions for line segments with a limited number of directions. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:465-471 [Conf]
  25. Subhash Suri, Csaba D. Tóth, Yunhong Zhou
    Selfish load balancing and atomic congestion games. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:188-195 [Conf]
  26. Adrian Dumitrescu, Csaba D. Tóth
    Light Orthogonal Networks with Constant Geometric Dilation. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:175-187 [Conf]
  27. Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth
    Pointed Binary Encompassing Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:442-454 [Conf]
  28. Csaba D. Tóth
    Orthogonal Subdivisions with Low Stabbing Numbers. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:256-268 [Conf]
  29. Csaba D. Tóth
    Alternating Paths along Orthogonal Segments. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:389-400 [Conf]
  30. John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth
    Adaptive Spatial Partitioning for Multidimensional Data Streams. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:1, pp:97-117 [Journal]
  31. Michael Hoffmann, Csaba D. Tóth
    Segment endpoint visibility graphs are Hamiltonian. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:26, n:1, pp:47-68 [Journal]
  32. Csaba D. Tóth
    Art gallery problem with guards whose range of vision is 180. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:17, n:3-4, pp:121-134 [Journal]
  33. Csaba D. Tóth
    Art galleries with guards of uniform range of vision. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:21, n:3, pp:185-192 [Journal]
  34. Csaba D. Tóth
    Illumination in the presence of opaque line segments in the plane. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:21, n:3, pp:193-204 [Journal]
  35. Csaba D. Tóth
    Guarding disjoint triangles and claws in the plane. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:25, n:1-2, pp:51-65 [Journal]
  36. Csaba D. Tóth
    Illuminating labyrinths. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:138, n:1-2, pp:215-228 [Journal]
  37. József Solymosi, Csaba D. Tóth
    Distinct Distances in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:4, pp:629-634 [Journal]
  38. József Solymosi, Csaba D. Tóth
    Distinct Distances in Homogeneous Sets in Euclidean Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:35, n:4, pp:537-549 [Journal]
  39. József Solymosi, Gábor Tardos, Csaba D. Tóth
    The k Most Frequent Distances in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:4, pp:639-648 [Journal]
  40. Bettina Speckmann, Csaba D. Tóth
    Allocating Vertex pi-Guards in Simple Polygons via Pseudo-Triangulations. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:2, pp:345-364 [Journal]
  41. Csaba D. Tóth
    A Note on Binary Plane Partitions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:30, n:1, pp:3-16 [Journal]
  42. Csaba D. Tóth
    Illuminating Disjoint Line Segments in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:30, n:3, pp:489-505 [Journal]
  43. Subhash Suri, Csaba D. Tóth, Yunhong Zhou
    Range Counting over Multidimensional Data Streams. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:36, n:4, pp:633-655 [Journal]
  44. Csaba D. Tóth
    Illumination of polygons by 45°-floodlights. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:265, n:1-3, pp:251-260 [Journal]
  45. Michael Hoffmann, Csaba D. Tóth
    Alternating paths through disjoint line segments. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:6, pp:287-294 [Journal]
  46. Jean-Claude Bermond, F. Havet, Csaba D. Tóth
    Fault tolerant on-board networks with priorities. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:47, n:1, pp:9-25 [Journal]
  47. Csaba D. Tóth
    Binary Space Partitions for Line Segments with a Limited Number of Directions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:2, pp:307-325 [Journal]
  48. Csaba D. Tóth, Michael Hoffmann
    Spanning trees across axis-parallel segments. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  49. Nadia Benbernou, Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth
    Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:13-16 [Conf]
  50. Chiranjeeb Buragohain, Subhash Suri, Csaba D. Tóth, Yunhong Zhou
    Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:210-221 [Conf]
  51. Adrian Dumitrescu, Csaba D. Tóth
    Distinct Triangle Areas in a Planar Point Set. [Citation Graph (0, 0)][DBLP]
    IPCO, 2007, pp:119-129 [Conf]
  52. Adrian Dumitrescu, Csaba D. Tóth
    On the number of tetrahedra with minimum, unit, and distinct volumes in three-space. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:1114-1123 [Conf]
  53. Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth
    Cuttings for Disks and Axis-Aligned Rectangles. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:470-482 [Conf]
  54. Subhash Suri, Csaba D. Tóth, Yunhong Zhou
    Selfish Load Balancing and Atomic Congestion Games. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:1, pp:79-96 [Journal]
  55. Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth
    Encompassing colored planar straight line graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2008, v:39, n:1, pp:14-23 [Journal]

  56. Watchman tours for polygons with holes. [Citation Graph (, )][DBLP]


  57. Convex Partitions with 2-Edge Connected Dual Graphs. [Citation Graph (, )][DBLP]


  58. Extremal problems on triangle areas in two and three dimensions. [Citation Graph (, )][DBLP]


  59. Shooting permanent rays among disjoint polygons in the plane. [Citation Graph (, )][DBLP]


  60. Binary plane partitions for disjoint line segments. [Citation Graph (, )][DBLP]


  61. Relative Convex Hulls in Semi-dynamic Subdivisions. [Citation Graph (, )][DBLP]


  62. Pointed binary encompassing trees: Simple and optimal. [Citation Graph (, )][DBLP]


  63. On pseudo-convex decompositions, partitions, and coverings. [Citation Graph (, )][DBLP]


  64. A Bipartite Strengthening of the Crossing Lemma. [Citation Graph (, )][DBLP]


  65. New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body. [Citation Graph (, )][DBLP]


  66. Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs. [Citation Graph (, )][DBLP]


  67. Minimum weight convex Steiner partitions. [Citation Graph (, )][DBLP]


  68. On stars and Steiner stars. [Citation Graph (, )][DBLP]


  69. On stars and Steiner stars: II. [Citation Graph (, )][DBLP]


  70. Long Non-crossing Configurations in the Plane. [Citation Graph (, )][DBLP]


  71. Guarding curvilinear art galleries with vertex or point guards. [Citation Graph (, )][DBLP]


  72. A vertex-face assignment for plane graphs. [Citation Graph (, )][DBLP]


  73. Pointed binary encompassing trees: Simple and optimal. [Citation Graph (, )][DBLP]


  74. On stars and Steiner stars. II [Citation Graph (, )][DBLP]


  75. Long non-crossing configurations in the plane [Citation Graph (, )][DBLP]


  76. On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space. [Citation Graph (, )][DBLP]


  77. On a Question of Bourgain about Geometric Incidences. [Citation Graph (, )][DBLP]


  78. Tight Bounds for Connecting Sites Across Barriers. [Citation Graph (, )][DBLP]


  79. Cuttings for Disks and Axis-Aligned Rectangles in Three-Space. [Citation Graph (, )][DBLP]


Search in 0.042secs, Finished in 0.045secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002