Csaba D. Tóth

ACM Trans. Algorithms, January, 2025

2024

Foreword.

[BibT_eX]

[DOI]

Kenneth L. Clarkson

János Pach

Discret. Comput. Geom., September, 2024

Online Spanners in Metric Spaces.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., March, 2024

Observation routes and external watchman routes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2024

Minimum weight Euclidean (1+ɛ)-spanners.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

Online Hitting Sets for Disks of Bounded Radii.

[BibT_eX]

[DOI]

Minati De

Satyam Singh

CoRR, 2024

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers.

[BibT_eX]

[DOI]

CoRR, 2024

Plane Multigraphs with One-Bend and Circular-Arc Edges of a Fixed Angle.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2024

Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings.

[BibT_eX]

[DOI]

Arnold Filtser

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Minimum Plane Bichromatic Spanning Trees.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Noncrossing Longest Paths and Cycles.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

Towards Instance-Optimal Euclidean Spanners.

[BibT_eX]

[DOI]

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Minimizing Visible Edges in Polyhedra.

[BibT_eX]

[DOI]

Giovanni Viglietta

Graphs Comb., October, 2023

Universal geometric graphs.

[BibT_eX]

[DOI]

Fabrizio Frati

Christopher Meierfrankenfeld

Comb. Probab. Comput., September, 2023

Reconfiguration of connected graph partitions.

[BibT_eX]

[DOI]

J. Graph Theory, 2023

Maximal Distortion of Geodesic Diameters in Polygonal Domains.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

On RAC Drawings of Graphs with Two Bends per Edge.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Reconfiguration of Polygonal Subdivisions via Recombination.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Euclidean Steiner Spanners: Light and Sparse.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2022

Reconfiguration of connected graph partitions via recombination.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Hop-spanners for geometric intersection graphs.

[BibT_eX]

[DOI]

Jonathan B. Conroy

J. Comput. Geom., 2022

Polygons with Prescribed Angles in 2D and 3D.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2022

Atomic Embeddability, Clustered Planarity, and Thickenability.

[BibT_eX]

[DOI]

J. ACM, 2022

Circumscribing Polygons and Polygonizations for Disjoint Line Segments.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2022

Finding Points in Convex Position in Density-Restricted Sets.

[BibT_eX]

[DOI]

CoRR, 2022

Sparse hop spanners for unit disk graphs.

[BibT_eX]

[DOI]

Anirban Ghosh

Comput. Geom., 2022

Edge guards for polyhedra in three-space.

[BibT_eX]

[DOI]

Comput. Geom., 2022

Online Unit Clustering and Unit Covering in Higher Dimensions.

[BibT_eX]

[DOI]

Algorithmica, 2022

Minimum Weight Euclidean (1+ε )-Spanners.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Aspect Ratio Universal Rectangular Layouts.

[BibT_eX]

[DOI]

Stefan Felsner

Andrew Nathenson

Proceedings of the WALCOM: Algorithms and Computation, 2022

2021

On the Stretch Factor of Polygonal Chains.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees.

[BibT_eX]

[DOI]

Marcos Oropeza

Leonardo Martínez-Sandoval

Inf. Process. Lett., 2021

Rainbow polygons for colored point sets in the plane.

[BibT_eX]

[DOI]

David Flores-Peñaloza

Mikio Kano

Discret. Math., 2021

On Euclidean Steiner (1+ε)-Spanners.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Light Euclidean Steiner Spanners in the Plane.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Online unit covering in Euclidean space.

[BibT_eX]

[DOI]

Anirban Ghosh

Theor. Comput. Sci., 2020

Multi-colored spanning graphs.

[BibT_eX]

[DOI]

Maarten Löffler

Theor. Comput. Sci., 2020

Convex polygons in cartesian products.

[BibT_eX]

[DOI]

J. Comput. Geom., 2020

Guest editors' foreword.

[BibT_eX]

[DOI]

Daniel Archambault

J. Graph Algorithms Appl., 2020

Simple <i>k</i>-planar graphs are simple (<i>k</i> + 1)-quasiplanar.

[BibT_eX]

[DOI]

Fabrizio Montecchiani

Ignaz Rutter

J. Comb. Theory B, 2020

Crossing minimization in perturbed drawings.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

Transition operations over plane trees.

[BibT_eX]

[DOI]

Discret. Math., 2020

The reach of axis-aligned squares in the plane.

[BibT_eX]

[DOI]

Discret. Optim., 2020

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2020

Problems on track runners.

[BibT_eX]

[DOI]

Comput. Geom., 2020

On the Cover of the Rolling Stone.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Simple Topological Drawings of k-Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

Cutting Polygons into Small Pieces with Chords: Laser-Based Localization.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Valentin Polishchuk

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2048 Without Merging.

[BibT_eX]

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

Quantitative Restrictions on Crossing Patterns.

[BibT_eX]

[DOI]

Proceedings of the Beyond Planar Graphs, Communications of NII Shonan Meetings., 2020

2019

Minimum weight connectivity augmentation for planar straight-line graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Recognizing Weak Embeddings of Graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

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

[BibT_eX]

[DOI]

Dagstuhl Reports, 2019

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

[BibT_eX]

[DOI]

Daniel Archambault

CoRR, 2019

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

[BibT_eX]

[DOI]

Fabrizio Montecchiani

Ignaz Rutter

CoRR, 2019

Reconfiguration of Connected Graph Partitions.

[BibT_eX]

[DOI]

Christopher Meierfrankenfeld

Matthew D. Jones

Matias Korman

CoRR, 2019

Circumscribing Polygons and Polygonizations for Disjoint Line Segments.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

Rock Climber Distance: Frogs versus Dogs.

[BibT_eX]

Leonie Ryvkin

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018

Gap-planar graphs.

[BibT_eX]

[DOI]

Sang Won Bae

Jean-François Baffier

Fabrizio Montecchiani

Ignaz Rutter

Theor. Comput. Sci., 2018

Monotone Paths in Geometric Triangulations.

[BibT_eX]

[DOI]

Ritankar Mandal

Theory Comput. Syst., 2018

Reconstruction of Weakly Simple Polygons from Their Edges.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2018

Note on k-planar crossing numbers.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Arc diagrams, flip distances, and Hamiltonian triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Maximum Area Axis-Aligned Square Packings.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Improved bounds on information dissemination by Manhattan Random Waypoint model.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2018

Compatible Paths on Labelled Point Sets.

[BibT_eX]

[DOI]

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017

A Census of Plane Graphs with Polyline Edges.

[BibT_eX]

[DOI]

Andrea Francke

SIAM J. Discret. Math., 2017

The planar tree packing theorem.

[BibT_eX]

[DOI]

J. Comput. Geom., 2017

Anchored rectangle and square packings.

[BibT_eX]

[DOI]

Kevin Balas

Discret. Optim., 2017

Recognizing Weakly Simple Polygons.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2017

Convex Polygons in Geometric Triangulations.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2017

Online Unit Clustering in Higher Dimensions.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017

Two-Planar Graphs Are Quasiplanar.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

A Problem on Track Runners.

[BibT_eX]

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016

Binary Space Partitions.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

On the number of anchored rectangle packings for a planar point set.

[BibT_eX]

[DOI]

Kevin Balas

Theor. Comput. Sci., 2016

The Traveling Salesman Problem for Lines, Balls, and Planes.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Counting Carambolas.

[BibT_eX]

[DOI]

Graphs Comb., 2016

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

[BibT_eX]

[DOI]

Andres J. Ruiz-Vargas

Andrew Suk

Eur. J. Comb., 2016

The Flip Diameter of Rectangulations and Convex Subdivisions.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2016

Diffuse reflection diameter in simple polygons.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Diffuse Reflection Radius in a Simple Polygon.

[BibT_eX]

[DOI]

Eli Fox-Epstein

Andrew Winslow

Algorithmica, 2016

2015

Computational Geometry Column 61.

[BibT_eX]

[DOI]

SIGACT News, 2015

Computing Opaque Interior Barriers à la Shermer.

[BibT_eX]

[DOI]

Minghui Jiang

SIAM J. Discret. Math., 2015

Universal point sets for planar three-trees.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2015

Geometric Biplane Graphs II: Graph Augmentation.

[BibT_eX]

[DOI]

Alfredo García Olaverri

Graphs Comb., 2015

Geometric Biplane Graphs I: Maximal Graphs.

[BibT_eX]

[DOI]

Alfredo García Olaverri

Graphs Comb., 2015

Free Edge Lengths in Plane Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2015

Constant-Factor Approximation for TSP with Disks.

[BibT_eX]

[DOI]

CoRR, 2015

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

[BibT_eX]

[DOI]

Comb., 2015

Packing anchored rectangles.

[BibT_eX]

[DOI]

Comb., 2015

Linear-Size Universal Point Sets for One-Bend Drawings.

[BibT_eX]

[DOI]

Maarten Löffler

Silvia Fernández-Merchant

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.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Augmenting Planar Straight Line Graphs to 2-Edge-Connectivity.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Graduate Workshop Recent Trends in Graph Drawing: Curves, Graphs, and Intersections.

[BibT_eX]

[DOI]

Bernardo M. Ábrego

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014

Computational geometry column 59.

[BibT_eX]

[DOI]

SIGACT News, 2014

Upper Bound Constructions for Untangling Planar Geometric Graphs.

[BibT_eX]

[DOI]

Javier Cano

SIAM J. Discret. Math., 2014

Minimum Convex Partitions and Maximum Empty Polytopes.

[BibT_eX]

[DOI]

Sariel Har-Peled

J. Comput. Geom., 2014

On the Upward Planarity of Mixed Plane Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

Crossing Angles of Geometric Graphs.

[BibT_eX]

[DOI]

Karin Arikushi

J. Graph Algorithms Appl., 2014

Vertex-Colored Encompassing Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2014

Covering Paths for Planar Point Sets.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

General Position Subsets and Independent Hyperplanes in d-Space.

[BibT_eX]

[DOI]

Jean Cardinal

David R. Wood

CoRR, 2014

On Fence Patrolling by Mobile Agents.

[BibT_eX]

[DOI]

Anirban Ghosh

Electron. J. Comb., 2014

Relative Convex Hulls in Semi-Dynamic Arrangements.

[BibT_eX]

[DOI]

Algorithmica, 2014

Covering Grids by Trees.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

Bounds on the Maximum Multiplicity of Some Common Geometric Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Diffuse Reflections in Simple Polygons.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Disjoint Compatible Geometric Matchings.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

The union of colorful simplices spanned by a colored point set.

[BibT_eX]

[DOI]

André Schulz

Comput. Geom., 2013

A tight bound for point guards in piecewise convex art galleries.

[BibT_eX]

[DOI]

Javier Cano

Comput. Geom., 2013

Planar Packing of Binary Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Counting Carambolas.

[BibT_eX]

[DOI]

Maarten Löffler

André Schulz

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

On the Total Perimeter of Homothetic Convex Bodies in a Convex Container.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012

Computational geometry column 54.

[BibT_eX]

[DOI]

SIGACT News, 2012

Graphs That Admit Polyline Drawings with Few Crossing Angles.

[BibT_eX]

[DOI]

Eyal Ackerman

SIAM J. Discret. Math., 2012

Shooting Permanent Rays among Disjoint Polygons in the Plane.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

Connectivity augmentation in planar straight line graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

Universal point sets for planar three-tree

[BibT_eX]

[DOI]

CoRR, 2012

Watchman tours for polygons with holes.

[BibT_eX]

[DOI]

Comput. Geom., 2012

Graphs that admit right angle crossing drawings.

[BibT_eX]

[DOI]

Comput. Geom., 2012

Covering Paths for Planar Point Sets.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 20th International Symposium, 2012

Conflict-Free Graph Orientations with Parity Constraints.

[BibT_eX]

[DOI]

Sarah Cannon

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Monotone Paths in Planar Convex Subdivisions.

[BibT_eX]

[DOI]

Günter Rote

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

Edge Guards for Polyhedra in 3-Space.

[BibT_eX]

[DOI]

Javier Cano

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011

Intersection patterns of curves.

[BibT_eX]

[DOI]

Jacob Fox

János Pach

J. Lond. Math. Soc., 2011

Convex partitions with 2-edge connected dual graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2011

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

[BibT_eX]

[DOI]

Minghui Jiang

Discret. Optim., 2011

Binary Plane Partitions for Disjoint Line Segments.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2011

Minimum Weight Convex Steiner Partitions.

[BibT_eX]

[DOI]

Algorithmica, 2011

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

[BibT_eX]

[DOI]

Algorithmica, 2011

Counting Plane Graphs: Flippability and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Open Guard Edges and Edge Guards in Simple Polygons.

[BibT_eX]

[DOI]

Godfried T. Toussaint

Andrew Winslow

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Simultaneously Flippable Edges in Triangulations.

[BibT_eX]

[DOI]

Andrew Winslow

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Collinearities in Kinetic Point Sets.

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

A bipartite strengthening of the Crossing Lemma.

[BibT_eX]

[DOI]

Jacob Fox

János Pach

J. Comb. Theory B, 2010

Cuttings for Disks and Axis-Aligned Rectangles in Three-Space.

[BibT_eX]

[DOI]

Eynat Rafalin

Discret. Comput. Geom., 2010

Long Non-crossing Configurations in the Plane.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2010

Pointed binary encompassing trees: Simple and optimal.

[BibT_eX]

[DOI]

Comput. Geom., 2010

A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets.

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles.

[BibT_eX]

[DOI]

Eyal Ackerman

Proceedings of the Graph Drawing - 18th International Symposium, 2010

2009

Light orthogonal networks with constant geometric dilation.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2009

Extremal problems on triangle areas in two and three dimensions.

[BibT_eX]

[DOI]

Micha Sharir

J. Comb. Theory A, 2009

On stars and Steiner stars.

[BibT_eX]

[DOI]

Guangwu Xu

Discret. Optim., 2009

A vertex-face assignment for plane graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Guarding curvilinear art galleries with vertex or point guards.

[BibT_eX]

[DOI]

Menelaos I. Karavelas

Elias P. Tsigaridas

Comput. Geom., 2009

On stars and Steiner stars: II.

[BibT_eX]

[DOI]

Guangwu Xu

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.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Detecting cuts in sensor networks.

[BibT_eX]

[DOI]

Nisheeth Shrivastava

ACM Trans. Sens. Networks, 2008

Axis-Aligned Subdivisions with Low Stabbing Numbers.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Binary Space Partitions for Axis-Aligned Fat Rectangles.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Convex subdivisions with low stabbing numbers.

[BibT_eX]

[DOI]

Period. Math. Hung., 2008

On the decay of crossing numbers.

[BibT_eX]

[DOI]

Jacob Fox

J. Comb. Theory B, 2008

Connectivity augmentation in plane straight line graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

Tight Bounds for Connecting Sites Across Barriers.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2008

On a Question of Bourgain about Geometric Incidences.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2008

On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2008

Encompassing colored planar straight line graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2008

On stars and Steiner stars.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Relative Convex Hulls in Semi-dynamic Subdivisions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2008

2007

Analysis of two Sweep-line Algorithms for Constructing Spanning Trees and Steiner Trees.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2007

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

[BibT_eX]

[DOI]

Graphs Comb., 2007

Selfish Load Balancing and Atomic Congestion Games.

[BibT_eX]

[DOI]

Algorithmica, 2007

Cuttings for Disks and Axis-Aligned Rectangles.

[BibT_eX]

[DOI]

Eynat Rafalin

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Distinct Triangle Areas in a Planar Point Set.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks.

[BibT_eX]

[DOI]

Chiranjeeb Buragohain

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs.

[BibT_eX]

[DOI]

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Fault tolerant on-board networks with priorities.

[BibT_eX]

[DOI]

Jean-Claude Bermond

Frédéric Havet

Networks, 2006

Alternating Paths along Axis-Parallel Segments.

[BibT_eX]

[DOI]

Graphs Comb., 2006

Range Counting over Multidimensional Data Streams.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2006

Distinct Distances in Homogeneous Sets in Euclidean Space.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2006

Adaptive Spatial Partitioning for Multidimensional Data Streams.

[BibT_eX]

[DOI]

Algorithmica, 2006

Spanning trees across axis-parallel segments.

[BibT_eX]

[DOI]

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005

Binary Space Partitions of Orthogonal Subdivisions.

[BibT_eX]

[DOI]

John Hershberger

SIAM J. Comput., 2005

Allocating Vertex pi-Guards in Simple Polygons via Pseudo-Triangulations.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2005

Orthogonal Subdivisions with Low Stabbing Numbers.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Space complexity of hierarchical heavy hitters in multi-dimensional data streams.

[BibT_eX]

[DOI]

Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2005

Pointed binary encompassing trees: Simple and optimal.

[BibT_eX]

[DOI]

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

On pseudo-convex decompositions, partitions, and coverings.

[BibT_eX]

[DOI]

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Pointed and colored binary encompassing trees.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

Incidences of not-too-degenerate hyperplanes.

[BibT_eX]

[DOI]

György Elekes

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004

Illuminating labyrinths.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Pointed Binary Encompassing Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2004

Uncoordinated Load Balancing and Congestion Games in P2P Systems.

[BibT_eX]

[DOI]

Proceedings of the Peer-to-Peer Systems III, Third International Workshop, 2004

Encompassing colored crossing-free geometric graphs.

[BibT_eX]

[DOI]

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

Congestion Games, Load Balancing, and Price of Anarchy.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

2003

Binary Space Partitions for Line Segments with a Limited Number of Directions.

[BibT_eX]

[DOI]

SIAM J. Comput., 2003

Alternating paths through disjoint line segments.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Illumination of polygons by 45°-floodlights.

[BibT_eX]

[DOI]

Discret. Math., 2003

Illuminating Disjoint Line Segments in the Plane.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2003

A Note on Binary Plane Partitions.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2003

Guarding disjoint triangles and claws in the plane.

[BibT_eX]

[DOI]

Comput. Geom., 2003

Segment endpoint visibility graphs are Hamiltonian.

[BibT_eX]

[DOI]

Comput. Geom., 2003

Alternating Paths along Orthogonal Segments.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Binary Space Partition for Orthogonal Fat Rectangles.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

Degree Bounds for Constrained Pseudo-Triangulations.

[BibT_eX]

[DOI]

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

The k Most Frequent Distances in the Plane.

[BibT_eX]

[DOI]

Gábor Tardos

Discret. Comput. Geom., 2002

Illumination in the presence of opaque line segments in the plane.

[BibT_eX]

[DOI]

Comput. Geom., 2002

Art galleries with guards of uniform range of vision.

[BibT_eX]

[DOI]

Comput. Geom., 2002

Connecting points in the presence of obstacles in the plane.

[BibT_eX]

[DOI]

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001

Distinct Distances in the Plane.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2001

Illuminating Polygons with Vertex pi-Floodlights.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2001, 2001

On the distinct distances determined by a planar point set.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

2000

Art gallery problem with guards whose range of vision is 180.

[BibT_eX]

[DOI]

Comput. Geom., 2000

Illuminating Both Sides of Line Segments.

[BibT_eX]

[DOI]