University of Calgary
List of publications from the DBLP Bibliography Server - FAQ| 2013 | ||
|---|---|---|
| j56 | André Schulz, Csaba D. Tóth: The union of colorful simplices spanned by a colored point set. Comput. Geom. 46(5): 574-590 (2013) | |
| j55 | Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth: Disjoint Compatible Geometric Matchings. Discrete & Computational Geometry 49(1): 89-131 (2013) | |
| c65 | Adrian Dumitrescu, Csaba D. Tóth: The traveling salesman problem for lines, balls and planes. SODA 2013: 828-843 | |
| i14 | 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) | |
| i13 | Adrian Dumitrescu, Dániel Gerbner, Balázs Keszegh, Csaba D. Tóth: Covering Paths for Planar Point Sets. CoRR abs/1303.0262 (2013) | |
| i12 | Adrian Dumitrescu, Csaba D. Tóth: The traveling salesman problem for lines, balls and planes. CoRR abs/1303.6659 (2013) | |
| 2012 | ||
| j54 | Karin Arikushi, Radoslav Fulek, Balázs Keszegh, Filip Moric, Csaba D. Tóth: Graphs that admit right angle crossing drawings. Comput. Geom. 45(4): 169-177 (2012) | |
| j53 | Adrian Dumitrescu, Csaba D. Tóth: Watchman tours for polygons with holes. Comput. Geom. 45(7): 326-333 (2012) | |
| j52 | Csaba D. Tóth: Connectivity augmentation in planar straight line graphs. Eur. J. Comb. 33(3): 408-425 (2012) | |
| j51 | Mashhood Ishaque, Bettina Speckmann, Csaba D. Tóth: Shooting Permanent Rays among Disjoint Polygons in the Plane. SIAM J. Comput. 41(4): 1005-1027 (2012) | |
| j50 | Eyal Ackerman, Radoslav Fulek, Csaba D. Tóth: Graphs That Admit Polyline Drawings with Few Crossing Angles. SIAM J. Discrete Math. 26(1): 305-320 (2012) | |
| j49 | ||
| c64 | ||
| c63 | ||
| c62 | Adrian Dumitrescu, Günter Rote, Csaba D. Tóth: Monotone Paths in Planar Convex Subdivisions. COCOON 2012: 240-251 | |
| c61 | Sarah Cannon, Mashhood Ishaque, Csaba D. Tóth: Conflict-Free Graph Orientations with Parity Constraints. FUN 2012: 57-68 | |
| c60 | ||
| c59 | ||
| c58 | 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 | ||
| j48 | Adrian Dumitrescu, Csaba D. Tóth: Minimum Weight Convex Steiner Partitions. Algorithmica 60(3): 627-652 (2011) | |
| j47 | 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) | |
| j46 | Csaba D. Tóth: Binary Plane Partitions for Disjoint Line Segments. Discrete & Computational Geometry 45(4): 617-646 (2011) | |
| j45 | Adrian Dumitrescu, Minghui Jiang, Csaba D. Tóth: New bounds on the average distance from the Fermat-Weber center of a planar convex body. Discrete Optimization 8(3): 417-427 (2011) | |
| j44 | 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) | |
| c57 | Benjamin Lund, George B. Purdy, Justin W. Smith, Csaba D. Tóth: Collinearities in Kinetic Point Sets. CCCG 2011 | |
| c56 | Csaba D. Tóth, Godfried T. Toussaint, Andrew Winslow: Open Guard Edges and Edge Guards in Simple Polygons. CCCG 2011 | |
| c55 | Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth: Disjoint compatible geometric matchings. Symposium on Computational Geometry 2011: 125-134 | |
| c54 | Javier Cano, Csaba D. Tóth, Jorge Urrutia: Upper Bound Constructions for Untangling Planar Geometric Graphs. Graph Drawing 2011: 290-295 | |
| 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 | ||
| 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, Yoshio Okamoto, Shin-ichi Tanigawa, Csaba D. Tóth: A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets. Electr. J. Comb. 17(1) (2010) | |
| j42 | Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth: 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. Discrete & Computational Geometry 43(2): 221-241 (2010) | |
| j40 | Adrian Dumitrescu, Csaba D. Tóth: Long Non-crossing Configurations in the Plane. Discrete & Computational Geometry 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, Ser. B 100(1): 23-35 (2010) | |
| c51 | ||
| 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, Csaba D. Tóth: On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles. Graph Drawing 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, Balázs Keszegh, Filip Moric, Csaba D. Tóth: 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) | |
| 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. Discrete Optimization 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, Ser. 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, Csaba D. Tóth: Shooting permanent rays among disjoint polygons in the plane. Symposium on Computational Geometry 2009: 51-60 | |
| c44 | Csaba D. Tóth: Binary plane partitions for disjoint line segments. Symposium on Computational Geometry 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 | ||
| e1 | Frank K. H. A. Dehne, Marina L. Gavrilova, Jörg-Rüdiger Sack, Csaba D. Tóth (Eds.): 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 | |
| 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. Combinatorics, Probability & Computing 17(2): 203-224 (2008) | |
| j31 | József Solymosi, Csaba D. Tóth: On a Question of Bourgain about Geometric Incidences. Combinatorics, Probability & Computing 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. Discrete & Computational Geometry 40(3): 377-394 (2008) | |
| j29 | Csaba D. Tóth: Connectivity augmentation in plane straight line graphs. Electronic Notes in Discrete Mathematics 31: 49-52 (2008) | |
| j28 | Jacob Fox, Csaba D. Tóth: On the decay of crossing numbers. J. Comb. Theory, Ser. B 98(1): 33-42 (2008) | |
| j27 | Csaba D. Tóth: Convex subdivisions with low stabbing numbers. Periodica Mathematica Hungarica 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. Discrete Math. 22(3): 1187-1204 (2008) | |
| j24 | Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth: Detecting cuts in sensor networks. TOSN 4(2) (2008) | |
| c40 | Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth: Extremal problems on triangle areas in two and three dimensions. Symposium on Computational Geometry 2008: 208-217 | |
| c39 | Mashhood Ishaque, Csaba D. Tóth: Relative Convex Hulls in Semi-dynamic Subdivisions. ESA 2008: 780-792 | |
| c38 | ||
| c37 | ||
| 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, Csaba D. Tóth: Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles. Graphs and Combinatorics 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. UCS 13(11): 1615-1627 (2007) | |
| c36 | 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. 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. Graph Drawing 2007: 13-24 | |
| c33 | ||
| 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. Discrete & Computational Geometry 35(4): 537-549 (2006) | |
| j18 | Subhash Suri, Csaba D. Tóth, Yunhong Zhou: Range Counting over Multidimensional Data Streams. Discrete & Computational Geometry 36(4): 633-655 (2006) | |
| j17 | Csaba D. Tóth: Alternating Paths along Axis-Parallel Segments. Graphs and Combinatorics 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 | ||
| c28 | David W. Krumme, Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth: Tight bounds for connecting sites across barriers. Symposium on Computational Geometry 2006: 439-448 | |
| c27 | ||
| c26 | Oswin Aichholzer, Clemens Huemer, Sarah Kappes, Bettina Speckmann, Csaba D. Tóth: Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles. MFCS 2006: 86-97 | |
| 2005 | ||
| j15 | Bettina Speckmann, Csaba D. Tóth: Allocating Vertex pi-Guards in Simple Polygons via Pseudo-Triangulations. Discrete & Computational Geometry 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 | ||
| c24 | György Elekes, Csaba D. Tóth: Incidences of not-too-degenerate hyperplanes. Symposium on Computational Geometry 2005: 16-21 | |
| c23 | Michael Hoffmann, Csaba D. Tóth: Pointed and colored binary encompassing trees. Symposium on Computational Geometry 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 | ||
| 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 | ||
| 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. Symposium on Computational Geometry 2004: 160-169 | |
| c16 | John Hershberger, Subhash Suri, Csaba D. Tóth: Binary space partitions of orthogonal subdivisions. Symposium on Computational Geometry 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, Csaba D. Tóth: 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. Discrete & Computational Geometry 30(1): 3-16 (2003) | |
| j9 | Csaba D. Tóth: Illuminating Disjoint Line Segments in the Plane. Discrete & Computational Geometry 30(3): 489-505 (2003) | |
| j8 | Csaba D. Tóth: Illumination of polygons by 45°-floodlights. Discrete Mathematics 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 | ||
| c9 | Bettina Speckmann, Csaba D. Tóth: Allocating vertex pi-guards in simple polygons via pseudo-triangulations. SODA 2003: 109-118 | |
| c8 | ||
| 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, Csaba D. Tóth: The k Most Frequent Distances in the Plane. Discrete & Computational Geometry 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. Discrete & Computational Geometry 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. Symposium on Computational Geometry 2001: 29-32 | |
| c3 | ||
| 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 | ||
Colors in the list of coauthors
Last update Sat May 25 05:27:46 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page