Ahmad Biniaz

Discret. Comput. Geom., September, 2024

Improved bounds for covering paths and trees in the plane.

[BibT_eX]

[DOI]

J. Comput. Geom., 2024

The Minimum Consistent Spanning Subset Problem on Trees.

[BibT_eX]

[DOI]

Parham Khamsepour

J. Graph Algorithms Appl., 2024

Contiguous Boundary Guarding.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Saeed Odak

Valentin Polishchuk

Thomas C. Shermer

CoRR, 2024

Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults.

[BibT_eX]

[DOI]

CoRR, 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

Art Galleries and Mobile Guards: Revisiting O'Rourke's Proof.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

Simple linear time algorithms for piercing pairwise intersecting disks.

[BibT_eX]

[DOI]

Yunkai Wang

Comput. Geom., October, 2023

A 10-Approximation of the π/2 -MST.

[BibT_eX]

[DOI]

Majid Daliri

Amir Hossein Moradpour

J. Comput. Geom., 2023

Approximating longest spanning tree with neighborhoods.

[BibT_eX]

[DOI]

Luís Fernando Schultz Xavier da Silveira

J. Comput. Geom., 2023

The Minimum Moving Spanning Tree Problem.

[BibT_eX]

[DOI]

Michiel Smid

J. Graph Algorithms Appl., 2023

On Separating Path and Tree Systems in Graphs.

[BibT_eX]

[DOI]

CoRR, 2023

City Guarding with Cameras of Bounded Field of View.

[BibT_eX]

Mohammad Hashemi

Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

Piercing Unit Geodesic Disks.

[BibT_eX]

Thomas C. Shermer

Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

2022

Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2022

A short proof of the non-biplanarity of K9.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2022

Token Swapping on Trees.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2022

Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2022

On the spanning and routing ratios of the directed Θ6-graph.

[BibT_eX]

[DOI]

Hugo A. Akitaya

Comput. Geom., 2022

Approximating Bottleneck Spanning Trees on Partitioned Tuples of Points.

[BibT_eX]

[DOI]

Michiel Smid

Comput. Geom. Topol., 2022

Bounded-Angle Minimum Spanning Trees.

[BibT_eX]

[DOI]

Algorithmica, 2022

Piercing Pairwise Intersecting Convex Shapes in the Plane.

[BibT_eX]

[DOI]

Saman Bazargani

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

A 13/9-approximation of the average-2π/3-MST.

[BibT_eX]

Patrick Devaney

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2021

A short proof of the toughness of Delaunay triangulations.

[BibT_eX]

[DOI]

J. Comput. Geom., 2021

Minimum ply covering of points with disks and squares.

[BibT_eX]

[DOI]

Therese Biedl

Anna Lubiw

Comput. Geom., 2021

On the Minimum Consistent Subset Problem.

[BibT_eX]

[DOI]

Algorithmica, 2021

Euclidean Maximum Matchings in the Plane - Local to Global.

[BibT_eX]

[DOI]

Michiel Smid

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

On the Spanning and Routing Ratios of the Directed $\varTheta _6$-Graph.

[BibT_eX]

[DOI]

Hugo A. Akitaya

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

A Short Proof of the Non-biplanarity of $$K_9$$.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

2020

Faster algorithms for some optimization problems on collinear points.

[BibT_eX]

[DOI]

J. Comput. Geom., 2020

Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

Plane and planarity thresholds for random geometric graphs.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2020

Improved approximation ratios for two Euclidean maximum spanning tree problems.

[BibT_eX]

[DOI]

CoRR, 2020

Packing plane spanning trees into a point set.

[BibT_eX]

[DOI]

Alfredo García

Comput. Geom., 2020

Plane hop spanners for unit disk graphs: Simpler and better.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Packing boundary-anchored rectangles and squares.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Minimum Ply Covering of Points with Convex Shapes.

[BibT_eX]

Zhikai Lin

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

2019

Rollercoasters: Long Sequences without Short Runs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Improved Bounds for Guarding Plane Graphs with Edges.

[BibT_eX]

[DOI]

Graphs Comb., 2019

Maximum Matchings and Minimum Blocking Sets in Θ6-Graphs.

[BibT_eX]

[DOI]

CoRR, 2019

Flip distance to some plane configurations.

[BibT_eX]

[DOI]

Comput. Geom., 2019

Maximum Plane Trees in Multipartite Geometric Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2019

Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -Graphs.

[BibT_eX]

[DOI]

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

Plane Hop Spanners for Unit Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Three-Coloring Three-Dimensional Uniform Hypergraphs.

[BibT_eX]

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

2018

Plane Bichromatic Trees of Low Degree.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2018

Strong matching of points with geometric shapes.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Spanning Trees in Multipartite Geometric Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2018

On the Size of Outer-String Representations.

[BibT_eX]

[DOI]

Therese Biedl

Martin Derka

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Rollercoasters and Caterpillars.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Compatible 4-Holes in Point Sets.

[BibT_eX]

[DOI]

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

Integral Unit Bar-Visibility Graphs.

[BibT_eX]

[DOI]

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

Compatible Paths on Labelled Point Sets.

[BibT_eX]

[DOI]

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

2017

Towards plane spanners of degree 3.

[BibT_eX]

[DOI]

J. Comput. Geom., 2017

Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

An optimal algorithm for plane matchings in multipartite geometric graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2017

Approximation algorithms for the unit disk cover problem in 2D and 3D.

[BibT_eX]

[DOI]

Comput. Geom., 2017

Packing Boundary-Anchored Rectangles.

[BibT_eX]

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

2016

A plane 1.88-spanner for points in convex position.

[BibT_eX]

[DOI]

J. Comput. Geom., 2016

Matchings in Geometric Graphs.

[BibT_eX]

[DOI]

CoRR, 2016

Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon.

[BibT_eX]

[DOI]

Comput. Geom., 2016

A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle.

[BibT_eX]

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

Matchings in higher-order Gabriel graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

On the hardness of full Steiner tree problems.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2015

Packing Plane Perfect Matchings into a Point Set.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2015

Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties.

[BibT_eX]

[DOI]

Comput. Geom., 2015

On full Steiner trees in unit disk graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Approximating the bottleneck plane perfect matching of a point set.

[BibT_eX]

[DOI]

Comput. Geom., 2015

A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014

Fixed-orientation equilateral triangle matching of point sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Matching in Gabriel Graphs.

[BibT_eX]

[DOI]

CoRR, 2014

An optimal algorithm for the Euclidean bottleneck full Steiner tree problem.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Bottleneck Bichromatic Plane Matching of Points.

[BibT_eX]

[DOI]

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

Approximating Full Steiner Tree in a Unit Disk Graph.

[BibT_eX]

[DOI]

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

2013

Approximating the Bottleneck Plane Perfect Matching of a Point Set.

[BibT_eX]

[DOI]

CoRR, 2013

2012

A faster circle-sweep Delaunay triangulation algorithm.

[BibT_eX]

[DOI]

Gholamhossein Dastghaibyfard

Adv. Eng. Softw., 2012

2009

Slope Preserving Terrain Simplification - An Experimental Study.

[BibT_eX]

[DOI]