Jean-Lou De Carufel

Thomas C. Shermer

Discret. Math., 2025

2024

On the Spanning and Routing Ratio of the Directed Theta-Four Graph.

[BibT_eX]

[DOI]

Discret. Comput. Geom., April, 2024

Cops & Robber on Periodic Temporal Graphs.

[BibT_eX]

[DOI]

CoRR, 2024

On 1-Planar Graphs with Bounded Cop-Number.

[BibT_eX]

[DOI]

CoRR, 2024

Computing shortest paths amid non-overlapping weighted disks.

[BibT_eX]

[DOI]

CoRR, 2024

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

[BibT_eX]

[DOI]

CoRR, 2024

So Long Sucker: Endgame Analysis.

[BibT_eX]

[DOI]

Marie Rose Jerade

CoRR, 2024

Routing from Pentagon to Octagon Delaunay Graphs.

[BibT_eX]

[DOI]

Luís Fernando Schultz Xavier da Silveira

John Stuart

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

2023

Constant delay lattice train schedules.

[BibT_eX]

[DOI]

Discret. Appl. Math., November, 2023

Improved Routing on the Delaunay Triangulation.

[BibT_eX]

[DOI]

Discret. Comput. Geom., October, 2023

The Minimum Moving Spanning Tree Problem.

[BibT_eX]

[DOI]

Luís Fernando Schultz Xavier da Silveira

Michiel Smid

J. Graph Algorithms Appl., 2023

The Exact Spanning Ratio of the Parallelogram Delaunay Graph.

[BibT_eX]

[DOI]

Sandrine Njoo

CoRR, 2023

On Separating Path and Tree Systems in Graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Copnumbers of periodic graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Cops & Robber on Periodic Temporal Graphs: Characterization and Improved Bounds.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2023

2022

Preface.

[BibT_eX]

[DOI]

Zachary Friggstad

Comput. Geom., 2022

On the Zombie Number of Various Graph Classes.

[BibT_eX]

[DOI]

Thomas C. Shermer

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021

Local routing in WSPD-based spanners.

[BibT_eX]

[DOI]

J. Comput. Geom., 2021

Transforming plane triangulations by simultaneous diagonal flips.

[BibT_eX]

[DOI]

Tanvir Kaykobad

Inf. Process. Lett., 2021

On the Minimum Consistent Subset Problem.

[BibT_eX]

[DOI]

Algorithmica, 2021

2020

Convex polygons in cartesian products.

[BibT_eX]

[DOI]

J. Comput. Geom., 2020

Expected Complexity of Routing in $\Theta_6$ and Half-$\Theta_6$ Graphs.

[BibT_eX]

[DOI]

Olivier Devillers

J. Comput. Geom., 2020

Fault-induced dynamics of oblivious robots on a line.

[BibT_eX]

[DOI]

Paola Flocchini

Inf. Comput., 2020

Minimizing the continuous diameter when augmenting a geometric tree with a shortcut.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Optimal Art Gallery Localization is NP-hard.

[BibT_eX]

[DOI]

Comput. Geom., 2020

2019

Expected Complexity of Routing in $Θ$ 6 and Half-$Θ$ 6 Graphs.

[BibT_eX]

[DOI]

Olivier Devillers

CoRR, 2019

Maximum Plane Trees in Multipartite Geometric Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2019

On the Spanning and Routing Ratio of Theta-Four.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Reconstructing a Convex Polygon from Its \omega ω -cloud.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2019

2018

Reconstructing a convex polygon from its ω-cloud.

[BibT_eX]

[DOI]

CoRR, 2018

The geodesic 2-center problem in a simple polygon.

[BibT_eX]

[DOI]

Eunjin Oh

Hee-Kap Ahn

Comput. Geom., 2018

Constrained generalized Delaunay graphs are plane spanners.

[BibT_eX]

[DOI]

André van Renssen

Comput. Geom., 2018

Continuous Yao graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2018

2017

A general framework for searching on a line.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

On interference among moving sensors and related problems.

[BibT_eX]

[DOI]

J. Comput. Geom., 2017

Towards plane spanners of degree 3.

[BibT_eX]

[DOI]

J. Comput. Geom., 2017

Essential Constraints of Edge-Constrained Proximity Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

Competitive Online Routing on Delaunay Triangulations.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2017

Upper and Lower Bounds for Online Routing on Delaunay Triangulations.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2017

Art Gallery Localization.

[BibT_eX]

[DOI]

CoRR, 2017

Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Local Routing in Spanners Based on WSPDs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

2016

Towards tight bounds on theta-graphs: More is not always better.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere.

[BibT_eX]

[DOI]

J. Comput. Geom., 2016

A plane 1.88-spanner for points in convex position.

[BibT_eX]

[DOI]

J. Comput. Geom., 2016

A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2016

Probing convex polygons with a wedge.

[BibT_eX]

[DOI]

Comput. Geom., 2016

Discrete Voronoi games and ϵ-nets, in two and three dimensions.

[BibT_eX]

[DOI]

Comput. Geom., 2016

Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts.

[BibT_eX]

[DOI]

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

2015

Searching on a line: A complete characterization of the optimal solution.

[BibT_eX]

[DOI]

Stephane Durocher

Theor. Comput. Sci., 2015

Optimal Data Structures for Farthest-Point Queries in Cactus Networks.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Isoperimetric Enclosures.

[BibT_eX]

[DOI]

Graphs Comb., 2015

On Kinetic Range Spaces and their Applications.

[BibT_eX]

[DOI]

CoRR, 2015

Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations.

[BibT_eX]

[DOI]

CoRR, 2015

The 2-Center Problem in a Simple Polygon.

[BibT_eX]

[DOI]

Eunjin Oh

Hee-Kap Ahn

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

The Shadows of a Cycle Cannot All Be Paths.

[BibT_eX]

[DOI]

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

Constrained Empty-Rectangle Delaunay Graphs.

[BibT_eX]

[DOI]

André van Renssen

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

2014

Towards Tight Bounds on Theta-Graphs.

[BibT_eX]

[DOI]

CoRR, 2014

Towards a General Framework for Searching on a Line and Searching on $m$ Rays.

[BibT_eX]

[DOI]

CoRR, 2014

Similarity of polygonal curves in the presence of outliers.

[BibT_eX]

[DOI]

Comput. Geom., 2014

A note on the unsolvability of the weighted region shortest path problem.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Minimum-area enclosing triangle with a fixed angle.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Weight Balancing on Boundaries and Skeletons.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Continuous Yao Graphs.

[BibT_eX]

[DOI]

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

Voronoi Games and Epsilon Nets.

[BibT_eX]

[DOI]

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

2013

Network Farthest-Point Diagrams.

[BibT_eX]

[DOI]

J. Comput. Geom., 2013

On the Stretch Factor of the Theta-4 Graph.

[BibT_eX]

[DOI]

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

Revisiting the Problem of Searching on a Line.

[BibT_eX]

[DOI]

Stephane Durocher

Proceedings of the Algorithms - ESA 2013, 2013

2012

Optimal Bounds on Theta-Graphs: More is not Always Better.

[BibT_eX]

[DOI]

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

On Farthest-Point Information in Networks.

[BibT_eX]

[DOI]

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

2011

Matching cylindrical panorama sequences using planar reprojections.

[BibT_eX]

[DOI]

Robert Laganière

Proceedings of the IEEE International Conference on Computer Vision Workshops, 2011

Point Location in Well-Shaped Meshes Using Jump-and-Walk.

[BibT_eX]

[DOI]

Craig Dillabaugh

Anil Maheshwari

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

Isoperimetric Triangular Enclosure with a Fixed Angle.

[BibT_eX]

[DOI]

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

2010

Abstract representation theorems for demonic refinement algebras.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2010

Minimum enclosing area triangle with a fixed angle.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2008

On the Structure of Demonic Refinement Algebras with Enabledness and Termination.

[BibT_eX]

[DOI]

Proceedings of the Relations and Kleene Algebra in Computer Science, 2008

Latest News about Demonic Algebra with Domain.

[BibT_eX]

[DOI]

Proceedings of the Relations and Kleene Algebra in Computer Science, 2008

2006

Demonic Algebra with Domain.

[BibT_eX]

[DOI]

Proceedings of the Relations and Kleene Algebra in Computer Science, 2006

2003

A few identities involving partitions with a fixed number of parts.

[BibT_eX]