Csaba D. Tóth

According to our database1, Csaba D. Tóth authored at least 251 papers between 2000 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Minimum weight connectivity augmentation for planar straight-line graphs.
Theor. Comput. Sci., 2019

Beyond-Planar Graphs: Combinatorics, Models and Algorithms (Dagstuhl Seminar 19092).
Dagstuhl Reports, 2019

Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD 2019).
CoRR, 2019

Simple k-Planar Graphs are Simple (k+1)-Quasiplanar.
CoRR, 2019

Atomic Embeddability, Clustered Planarity, and Thickenability.
CoRR, 2019

On the Stretch Factor of Polygonal Chains.
CoRR, 2019

Rock Climber Distance: Frogs versus Dogs.
CoRR, 2019

Circumscribing Polygons and Polygonizations for Disjoint Line Segments.
CoRR, 2019

Reconfiguration of Connected Graph Partitions.
CoRR, 2019

On the Stretch Factor of Polygonal Chains.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Reconstruction of the Crossing Type of a Point Set from the Compatible Exchange Graph of Noncrossing Spanning Trees.
Proceedings of the Discrete Geometry for Computer Imagery, 2019

Convex Polygons in Cartesian Products.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

Circumscribing Polygons and Polygonizations for Disjoint Line Segments.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
Gap-planar graphs.
Theor. Comput. Sci., 2018

Monotone Paths in Geometric Triangulations.
Theory Comput. Syst., 2018

Reconstruction of Weakly Simple Polygons from Their Edges.
Int. J. Comput. Geometry Appl., 2018

Convex Polygons in Cartesian Products.
CoRR, 2018

Improved Bounds on Information Dissemination by Manhattan Random Waypoint Model.
CoRR, 2018

Crossing Minimization in Perturbed Drawings.
CoRR, 2018

Maximum Area Axis-Aligned Square Packings.
CoRR, 2018

Note on k-planar crossing numbers.
Comput. Geom., 2018

Arc diagrams, flip distances, and Hamiltonian triangulations.
Comput. Geom., 2018

Recognizing Weak Embeddings of Graphs.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Maximum Area Axis-Aligned Square Packings.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Transition Operations over Plane Trees.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Improved bounds on information dissemination by Manhattan Random Waypoint model.
Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2018

Crossing Minimization in Perturbed Drawings.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

Online Unit Covering in Euclidean Space.
Proceedings of the Combinatorial Optimization and Applications, 2018

Compatible Paths on Labelled Point Sets.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017
A Census of Plane Graphs with Polyline Edges.
SIAM J. Discrete Math., 2017

The planar tree packing theorem.
JoCG, 2017

Anchored rectangle and square packings.
Discrete Optimization, 2017

Recognizing Weakly Simple Polygons.
Discrete & Computational Geometry, 2017

Convex Polygons in Geometric Triangulations.
Combinatorics, Probability & Computing, 2017

Recognizing Weak Embeddings of Graphs.
CoRR, 2017

Gap-planar Graphs.
CoRR, 2017

Online unit clustering in higher dimensions.
CoRR, 2017

Geometric Biplane Graphs II: Graph Augmentation.
CoRR, 2017

Geometric Biplane Graphs I: Maximal Graphs.
CoRR, 2017

Online Unit Clustering in Higher Dimensions.
Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017

Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs.
Proceedings of the WALCOM: Algorithms and Computation, 2017

Two-Planar Graphs Are Quasiplanar.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Gap-Planar Graphs.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

A Problem on Track Runners.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016
Binary Space Partitions.
Encyclopedia of Algorithms, 2016

On the number of anchored rectangle packings for a planar point set.
Theor. Comput. Sci., 2016

The Traveling Salesman Problem for Lines, Balls, and Planes.
ACM Trans. Algorithms, 2016

Counting Carambolas.
Graphs and Combinatorics, 2016

Disjoint edges in topological graphs and the tangled-thrackle conjecture.
Eur. J. Comb., 2016

The Flip Diameter of Rectangulations and Convex Subdivisions.
Discrete Mathematics & Theoretical Computer Science, 2016

Diffuse reflection diameter in simple polygons.
Discrete Applied Mathematics, 2016

The Planar Tree Packing Theorem.
CoRR, 2016

Monotone Paths in Geometric Triangulations.
CoRR, 2016

Arc diagrams, flip distances, and Hamiltonian triangulations.
CoRR, 2016

Anchored Rectangle and Square Packings.
CoRR, 2016

Reconstruction of weakly simple polygons from their edges.
CoRR, 2016

Multi-Colored Spanning Graphs.
CoRR, 2016

Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs.
CoRR, 2016

Recognizing Weakly Simple Polygons.
CoRR, 2016

Diffuse Reflection Radius in a Simple Polygon.
Algorithmica, 2016

Monotone Paths in Geometric Triangulations.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Reconstruction of Weakly Simple Polygons from their Edges.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Multi-colored Spanning Graphs.
Proceedings of the Graph Drawing and Network Visualization, 2016

The Planar Tree Packing Theorem.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Anchored Rectangle and Square Packings.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Recognizing Weakly Simple Polygons.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Computational Geometry Column 61.
SIGACT News, 2015

Computing Opaque Interior Barriers à la Shermer.
SIAM J. Discrete Math., 2015

Universal point sets for planar three-trees.
J. Discrete Algorithms, 2015

Geometric Biplane Graphs II: Graph Augmentation.
Graphs and Combinatorics, 2015

Geometric Biplane Graphs I: Maximal Graphs.
Graphs and Combinatorics, 2015

Free Edge Lengths in Plane Graphs.
Discrete & Computational Geometry, 2015

A problem on track runners.
CoRR, 2015

Constant-Factor Approximation for TSP with Disks.
CoRR, 2015

The Szemerédi-Trotter theorem in the complex plane.
Combinatorica, 2015

Packing anchored rectangles.
Combinatorica, 2015

Convex Polygons in Geometric Triangulations.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Arc Diagrams, Flip Distances, and Hamiltonian Triangulations.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Linear-Size Universal Point Sets for One-Bend Drawings.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Augmenting Planar Straight Line Graphs to 2-Edge-Connectivity.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Graduate Workshop Recent Trends in Graph Drawing: Curves, Graphs, and Intersections.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

On the Number of Anchored Rectangle Packings for a Planar Point Set.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014
Computational geometry column 59.
SIGACT News, 2014

Upper Bound Constructions for Untangling Planar Geometric Graphs.
SIAM J. Discrete Math., 2014

Minimum Convex Partitions and Maximum Empty Polytopes.
JoCG, 2014

On the Upward Planarity of Mixed Plane Graphs.
J. Graph Algorithms Appl., 2014

Crossing Angles of Geometric Graphs.
J. Graph Algorithms Appl., 2014

Vertex-Colored Encompassing Graphs.
Graphs and Combinatorics, 2014

Covering Paths for Planar Point Sets.
Discrete & Computational Geometry, 2014

Disjoint edges in topological graphs and the tangled-thrackle conjecture.
CoRR, 2014

Diffuse Reflection Radius in a Simple Polygon.
CoRR, 2014

Convex polygons in geometric triangulations.
CoRR, 2014

Counting Carambolas.
CoRR, 2014

On Fence Patrolling by Mobile Agents.
CoRR, 2014

General Position Subsets and Independent Hyperplanes in d-Space.
CoRR, 2014

On Fence Patrolling by Mobile Agents.
Electr. J. Comb., 2014

Relative Convex Hulls in Semi-Dynamic Arrangements.
Algorithmica, 2014

The Flip Diameter of Rectangulations and Convex Subdivisions.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture.
Proceedings of the Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, 2014

A Census of Plane Graphs with Polyline Edges.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Free Edge Lengths in Plane Graphs.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Diffuse Reflection Radius in a Simple Polygon.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

Covering Grids by Trees.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Computing Opaque Interior Barriers à la Shermer.
Proceedings of the Approximation, 2014

2013
Bounds on the Maximum Multiplicity of Some Common Geometric Graphs.
SIAM J. Discrete Math., 2013

Diffuse Reflections in Simple Polygons.
Electronic Notes in Discrete Mathematics, 2013

Disjoint Compatible Geometric Matchings.
Discrete & Computational Geometry, 2013

The traveling salesman problem for lines, balls and planes
CoRR, 2013

Covering Paths for Planar Point Sets
CoRR, 2013

Diffuse Reflections in Simple Polygons
CoRR, 2013

The Flip Diameter of Rectangulations and Convex Subdivisions.
CoRR, 2013

The union of colorful simplices spanned by a colored point set.
Comput. Geom., 2013

A tight bound for point guards in piecewise convex art galleries.
Comput. Geom., 2013

Planar Packing of Binary Trees.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Universal Point Sets for Planar Three-Trees.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

The traveling salesman problem for lines, balls and planes.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

On the Upward Planarity of Mixed Plane Graphs.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

Counting Carambolas.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

On the Total Perimeter of Homothetic Convex Bodies in a Convex Container.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012
Computational geometry column 54.
SIGACT News, 2012

Graphs That Admit Polyline Drawings with Few Crossing Angles.
SIAM J. Discrete Math., 2012

Shooting Permanent Rays among Disjoint Polygons in the Plane.
SIAM J. Comput., 2012

Connectivity augmentation in planar straight line graphs.
Eur. J. Comb., 2012

Universal point sets for planar three-tree
CoRR, 2012

Conflict-free graph orientations with parity constraints
CoRR, 2012

Watchman tours for polygons with holes.
Comput. Geom., 2012

Graphs that admit right angle crossing drawings.
Comput. Geom., 2012

Minimum Convex Partitions and Maximum Empty Polytopes.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

Packing anchored rectangles.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Covering Paths for Planar Point Sets.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

Conflict-Free Graph Orientations with Parity Constraints.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Monotone Paths in Planar Convex Subdivisions.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

Crossing Angles of Geometric Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2012

Edge Guards for Polyhedra in 3-Space.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011
Intersection patterns of curves.
J. London Math. Society, 2011

Convex partitions with 2-edge connected dual graphs.
J. Comb. Optim., 2011

New bounds on the average distance from the Fermat-Weber center of a planar convex body.
Discrete Optimization, 2011

Binary Plane Partitions for Disjoint Line Segments.
Discrete & Computational Geometry, 2011

Minimum Convex Partitions and Maximum Empty Polytopes
CoRR, 2011

Packing anchored rectangles
CoRR, 2011

Collinearities in Kinetic Point Sets
CoRR, 2011

Minimum Weight Convex Steiner Partitions.
Algorithmica, 2011

Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three.
Algorithmica, 2011

Counting Plane Graphs: Flippability and Its Applications.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Bounds on the maximum multiplicity of some common geometric graphs.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Simultaneously Flippable Edges in Triangulations.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Upper Bound Constructions for Untangling Planar Geometric Graphs.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

Disjoint compatible geometric matchings.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

Open Guard Edges and Edge Guards in Simple Polygons.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Collinearities in Kinetic Point Sets.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
A bipartite strengthening of the Crossing Lemma.
J. Comb. Theory, Ser. B, 2010

Cuttings for Disks and Axis-Aligned Rectangles in Three-Space.
Discrete & Computational Geometry, 2010

Long Non-crossing Configurations in the Plane.
Discrete & Computational Geometry, 2010

Bounds on the maximum multiplicity of some common geometric graphs
CoRR, 2010

Counting Plane Graphs: Flippability and its Applications
CoRR, 2010

Pointed binary encompassing trees: Simple and optimal.
Comput. Geom., 2010

A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets.
Electr. J. Comb., 2010

Graphs that Admit Right Angle Crossing Drawings.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Long Non-crossing Configurations in the Plane.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

The Union of Colorful Simplices Spanned by a Colored Point Set.
Proceedings of the Combinatorial Optimization and Applications, 2010

Watchman tours for polygons with holes.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009
Light orthogonal networks with constant geometric dilation.
J. Discrete Algorithms, 2009

Extremal problems on triangle areas in two and three dimensions.
J. Comb. Theory, Ser. A, 2009

On stars and Steiner stars.
Discrete Optimization, 2009

Long non-crossing configurations in the plane
CoRR, 2009

A vertex-face assignment for plane graphs.
Comput. Geom., 2009

Guarding curvilinear art galleries with vertex or point guards.
Comput. Geom., 2009

On stars and Steiner stars: II.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Binary plane partitions for disjoint line segments.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

Shooting permanent rays among disjoint polygons in the plane.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

Convex Partitions with 2-Edge Connected Dual Graphs.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008
Detecting cuts in sensor networks.
TOSN, 2008

Axis-Aligned Subdivisions with Low Stabbing Numbers.
SIAM J. Discrete Math., 2008

Binary Space Partitions for Axis-Aligned Fat Rectangles.
SIAM J. Comput., 2008

Convex subdivisions with low stabbing numbers.
Periodica Mathematica Hungarica, 2008

On the decay of crossing numbers.
J. Comb. Theory, Ser. B, 2008

Connectivity augmentation in plane straight line graphs.
Electronic Notes in Discrete Mathematics, 2008

Tight Bounds for Connecting Sites Across Barriers.
Discrete & Computational Geometry, 2008

On a Question of Bourgain about Geometric Incidences.
Combinatorics, Probability & Computing, 2008

On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space.
Combinatorics, Probability & Computing, 2008

On stars and Steiner stars. II
CoRR, 2008

Encompassing colored planar straight line graphs.
Comput. Geom., 2008

On stars and Steiner stars.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Minimum weight convex Steiner partitions.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Relative Convex Hulls in Semi-dynamic Subdivisions.
Proceedings of the Algorithms, 2008

Extremal problems on triangle areas in two and three dimensions.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007
Analysis of two Sweep-line Algorithms for Constructing Spanning Trees and Steiner Trees.
J. UCS, 2007

Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles.
Graphs and Combinatorics, 2007

Selfish Load Balancing and Atomic Congestion Games.
Algorithmica, 2007

Cuttings for Disks and Axis-Aligned Rectangles.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Light Orthogonal Networks with Constant Geometric Dilation.
Proceedings of the STACS 2007, 2007

On the number of tetrahedra with minimum, unit, and distinct volumes in three-space.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Distinct Triangle Areas in a Planar Point Set.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

A Bipartite Strengthening of the Crossing Lemma.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Fault tolerant on-board networks with priorities.
Networks, 2006

Alternating Paths along Axis-Parallel Segments.
Graphs and Combinatorics, 2006

Range Counting over Multidimensional Data Streams.
Discrete & Computational Geometry, 2006

Distinct Distances in Homogeneous Sets in Euclidean Space.
Discrete & Computational Geometry, 2006

Adaptive Spatial Partitioning for Multidimensional Data Streams.
Algorithmica, 2006

Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

On the Decay of Crossing Numbers.
Proceedings of the Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, 2006

Tight bounds for connecting sites across barriers.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

Spanning trees across axis-parallel segments.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005
Binary Space Partitions of Orthogonal Subdivisions.
SIAM J. Comput., 2005

Allocating Vertex pi-Guards in Simple Polygons via Pseudo-Triangulations.
Discrete & Computational Geometry, 2005

Orthogonal Subdivisions with Low Stabbing Numbers.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Space complexity of hierarchical heavy hitters in multi-dimensional data streams.
Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2005

Detecting cuts in sensor networks.
Proceedings of the Fourth International Symposium on Information Processing in Sensor Networks, 2005

Pointed binary encompassing trees: Simple and optimal.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

On pseudo-convex decompositions, partitions, and coverings.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Pointed and colored binary encompassing trees.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

Incidences of not-too-degenerate hyperplanes.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

A vertex-face assignment for plane graphs.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
Illuminating labyrinths.
Discrete Applied Mathematics, 2004

Pointed Binary Encompassing Trees.
Proceedings of the Algorithm Theory, 2004

Selfish load balancing and atomic congestion games.
Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

Adaptive Spatial Partitioning for Multidimensional Data Streams.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Uncoordinated Load Balancing and Congestion Games in P2P Systems.
Proceedings of the Peer-to-Peer Systems III, Third International Workshop, 2004

Range counting over multidimensional data streams.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Binary space partitions of orthogonal subdivisions.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Encompassing colored crossing-free geometric graphs.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

Congestion Games, Load Balancing, and Price of Anarchy.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

2003
Binary Space Partitions for Line Segments with a Limited Number of Directions.
SIAM J. Comput., 2003

Alternating paths through disjoint line segments.
Inf. Process. Lett., 2003

Illumination of polygons by 45°-floodlights.
Discrete Mathematics, 2003

Illuminating Disjoint Line Segments in the Plane.
Discrete & Computational Geometry, 2003

A Note on Binary Plane Partitions.
Discrete & Computational Geometry, 2003

Guarding disjoint triangles and claws in the plane.
Comput. Geom., 2003

Segment endpoint visibility graphs are Hamiltonian.
Comput. Geom., 2003

Alternating Paths along Orthogonal Segments.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Allocating vertex pi-guards in simple polygons via pseudo-triangulations.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Binary Space Partition for Orthogonal Fat Rectangles.
Proceedings of the Algorithms, 2003

Degree Bounds for Constrained Pseudo-Triangulations.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
The k Most Frequent Distances in the Plane.
Discrete & Computational Geometry, 2002

Illumination in the presence of opaque line segments in the plane.
Comput. Geom., 2002

Art galleries with guards of uniform range of vision.
Comput. Geom., 2002

Binary space partitions for line segments with a limited number of directions.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Connecting points in the presence of obstacles in the plane.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
Distinct Distances in the Plane.
Discrete & Computational Geometry, 2001

Illuminating Polygons with Vertex pi-Floodlights.
Proceedings of the Computational Science - ICCS 2001, 2001

A note on binary plane partitions.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

On the distinct distances determined by a planar point set.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

Segment endpoint visibility graphs are hamiltonian.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000
Art gallery problem with guards whose range of vision is 180.
Comput. Geom., 2000

Illuminating Both Sides of Line Segments.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000


  Loading...