Stephane Durocher

J. Mark Keil

Theor. Comput. Sci., 2025

2024

Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons.

[BibT_eX]

[DOI]

CoRR, 2024

Hyperplane Distance Depth.

[BibT_eX]

[DOI]

Amirhossein Mashghdoust

CoRR, 2024

String Graph with Cop Number 4 (Poster Abstract).

[BibT_eX]

[DOI]

Myroslav Kryven

Maarten Löffler

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

2023

Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2023

Curve Stabbing Depth: Data Depth for Plane Curves.

[BibT_eX]

[DOI]

Spencer Szabados

CoRR, 2023

Minimum Ply Covering of Points with Unit Squares.

[BibT_eX]

[DOI]

J. Mark Keil

Proceedings of the WALCOM: Algorithms and Computation, 2023

Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Cops and Robbers on 1-Planar Graphs.

[BibT_eX]

[DOI]

Amirhossein Mashghdoust

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

Online Square Packing with Predictions.

[BibT_eX]

Shahin Kamali

Pouria Zamani Nezhad

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

Minimum Ply Covering of Points with Unit Disks.

[BibT_eX]

J. Mark Keil

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

CCOSKEG Discs in Simple Polygons.

[BibT_eX]

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

2022

On the restricted k-Steiner tree problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Curve Stabbing Depth: Data Depth for Plane Curves.

[BibT_eX]

Spencer Szabados

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

Computing Batched Depth Queries and the Depth of a Set of Points.

[BibT_eX]

Sachini Rajapakse

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

A Structured Latent Space for Human Body Motion Generation.

[BibT_eX]

[DOI]

Mathieu Marsot

Stefanie Wuhrer

Jean-Sébastien Franco

Proceedings of the International Conference on 3D Vision, 2022

2021

Robustness and asymptotics of the projection median.

[BibT_eX]

[DOI]

Kelly Ramsay

J. Multivar. Anal., 2021

Multi-frame sequence generator of 4D human body motion.

[BibT_eX]

[DOI]

Mathieu Marsot

Stefanie Wuhrer

Jean-Sébastien Franco

CoRR, 2021

2020

Computing the k-Visibility Region of a Point in a Polygon.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Local Routing in Convex Subdivisions.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2020

Foreword.

[BibT_eX]

[DOI]

Shahin Kamali

Comput. Geom., 2020

Clustering Moving Entities in Euclidean Space.

[BibT_eX]

[DOI]

Md Yeakub Hassan

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

Efficient Privacy-Preserving Approaches for Trajectory Datasets.

[BibT_eX]

[DOI]

Proceedings of the IEEE Intl Conf on Dependable, 2020

On the Restricted 1-Steiner Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

Non-Crossing Matching of Online Points.

[BibT_eX]

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

2019

A simple linear-space data structure for constant-time range minimum query.

[BibT_eX]

[DOI]

Robby Singh

Theor. Comput. Sci., 2019

Polygon simplification by minimizing convex corners.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

A time-space trade-off for computing the k-visibility region of a point in a polygon.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Integrated rank-weighted depth.

[BibT_eX]

[DOI]

Kelly Ramsay

J. Multivar. Anal., 2019

Drawing plane triangulations with few segments.

[BibT_eX]

[DOI]

Comput. Geom., 2019

Computing the k-Crossing Visibility Region of a Point in a Polygon.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Watchtower for k-crossing Visibility.

[BibT_eX]

Yeganeh Bahoo

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

2018

Relating Graph Thickness to Planar Layers and Bend Complexity.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

On Combinatorial Depth Measures.

[BibT_eX]

[DOI]

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

2017

Computing conforming partitions of orthogonal polygons with minimum stabbing number.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

The projection median as a weighted average.

[BibT_eX]

[DOI]

Matthew Skala

J. Comput. Geom., 2017

Drawing Planar Graphs with Reduced Height.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

Guarding monotone art galleries with sliding cameras in linear time.

[BibT_eX]

[DOI]

Mark de Berg

J. Discrete Algorithms, 2017

Competitive Online Routing on Delaunay Triangulations.

[BibT_eX]

[DOI]

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

Guarding orthogonal art galleries with sliding cameras.

[BibT_eX]

[DOI]

Comput. Geom., 2017

Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2017

Interference Minimization in k-Connected Wireless Networks.

[BibT_eX]

Sahar Mehrpour

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

Exploring Increasing-Chord Paths and Trees.

[BibT_eX]

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

2016

Routing in Geometric Networks.

[BibT_eX]

[DOI]

Leszek Gasieniec

Prudence W. H. Wong

Encyclopedia of Algorithms, 2016

Time-Space Trade-off for Finding the k-Visibility Region of a Point in a Polygon.

[BibT_eX]

[DOI]

CoRR, 2016

Thickness and colorability of geometric graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2016

Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees.

[BibT_eX]

[DOI]

Algorithmica, 2016

On the Biplanar Crossing Number of Kn.

[BibT_eX]

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

2015

Bounding Interference in Wireless Ad Hoc Networks With Nodes in Random Position.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2015

On graphs that are not PCGs.

[BibT_eX]

[DOI]

Md. Saidur Rahman

Theor. Comput. Sci., 2015

Low space data structures for geometric range mode query.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Complexity of barrier coverage with relocatable sensors in the plane.

[BibT_eX]

[DOI]

Stefan Dobrev

Mohsen Eftekhari Hesari

Konstantinos Georgiou

Theor. Comput. Sci., 2015

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

[BibT_eX]

[DOI]

Jean-Lou De Carufel

Theor. Comput. Sci., 2015

Plane 3-Trees: Embeddability and Approximation.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Cycle-maximal triangle-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

Linear-Space Data Structures for Range Minority Query in Arrays.

[BibT_eX]

[DOI]

Algorithmica, 2015

Exploring Test Suite Diversification and Code Coverage in Multi-Objective Test Case Selection.

[BibT_eX]

[DOI]

Hadi Hemmati

Proceedings of the 8th IEEE International Conference on Software Testing, 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

Drawing Graphs Using Body Gestures.

[BibT_eX]

[DOI]

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

Guarding Orthogonal Terrains.

[BibT_eX]

[DOI]

Pak Ching Li

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

Duality for Geometric Set Cover and Geometric Hitting Set Problems on Pseudodisks.

[BibT_eX]

[DOI]

Robert Fraser

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

2014

Linear-Space Data Structures for Range Mode Query in Arrays.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

The Hausdorff Core Problem on Simple Polygons.

[BibT_eX]

[DOI]

J. Ian Munro

Matthew Skala

J. Comput. Geom., 2014

A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Drawing HV-Restricted Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

Trade-Offs in Planar Polyline Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 22nd International Symposium, 2014

Indexed Geometric Jumbled Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

Drawing Plane Triangulations with Few Segments, pp. 40-45.

[BibT_eX]

[DOI]

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

2013

A Note on Minimum-Segment Drawings of Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2013

Robust nonparametric Simplification of Polygonal Chains.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2013

Range majority in constant time and linear space.

[BibT_eX]

[DOI]

Inf. Comput., 2013

Bounding the locality of distributed routing algorithms.

[BibT_eX]

[DOI]

Paz Carmi

Distributed Comput., 2013

Faster optimal algorithms for segment minimization with small maximal value.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

New Hardness Results for Guarding Orthogonal Polygons with Sliding Cameras

[BibT_eX]

[DOI]

CoRR, 2013

A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras.

[BibT_eX]

[DOI]

Robert Fraser

CoRR, 2013

Foreword.

[BibT_eX]

[DOI]

Jason Morrison

Comput. Geom., 2013

Plane 3-trees: Embeddability and Approximation - (Extended Abstract).

[BibT_eX]

[DOI]

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

Top-k Color Queries on Tree Paths.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2013

Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

On Balanced ✛-Contact Representations.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 21st International Symposium, 2013

Revisiting the Problem of Searching on a Line.

[BibT_eX]

[DOI]

Jean-Lou De Carufel

Proceedings of the Algorithms - ESA 2013, 2013

Robust Solvers for Square Jigsaw Puzzles.

[BibT_eX]

[DOI]

Yang Wang

Proceedings of the Tenth Conference on Computer and Robot Vision, 2013

On k-Enclosing Objects in a Coloured Point Set.

[BibT_eX]

[DOI]

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

A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query.

[BibT_eX]

[DOI]

Proceedings of the Space-Efficient Data Structures, 2013

2012

Cool-lex order and k-ary Catalan structures.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Robust Non-Parametric Data Approximation of Pointsets via Data Reduction

[BibT_eX]

[DOI]

CoRR, 2012

On the Hardness of Point-Set Embeddability - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

Bounding Interference in Wireless Ad Hoc Networks with Nodes in Random Position.

[BibT_eX]

[DOI]

Majid Khabbazian

Alireza Haghnegahdar

Proceedings of the Structural Information and Communication Complexity, 2012

Robust Nonparametric Data Approximation of Point Sets via Data Reduction.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number.

[BibT_eX]

[DOI]

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

Hamiltonian Paths and Cycles in Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2012

The Cover Contact Graph of Discs Touching a Line.

[BibT_eX]

[DOI]

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

2011

Reconstructing polygons from scanner data.

[BibT_eX]

[DOI]

Therese Biedl

Jack Snoeyink

Theor. Comput. Sci., 2011

Untangled monotonic chains and adaptive range search.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

A note on improving the performance of approximation algorithms for radiation therapy.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Linear-Space Data Structures for Range Mode Query in Arrays

[BibT_eX]

[DOI]

Jason Morrison

CoRR, 2011

Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs.

[BibT_eX]

[DOI]

Krishnam Raju Jampani

Anna Lubiw

Lata Narayanan

Comput. Geom., 2011

Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

Embedding Plane 3-Trees in ℝ2 and ℝ3.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 19th International Symposium, 2011

Realizing Site Permutations.

[BibT_eX]

[DOI]

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

2010

On routing with guaranteed delivery in three-dimensional ad hoc wireless networks.

[BibT_eX]

[DOI]

Lata Narayanan

Wirel. Networks, 2010

An Improved Line-Separable Algorithm for Discrete Unit Disk Cover.

[BibT_eX]

[DOI]

Bradford G. Nickerson

Discret. Math. Algorithms Appl., 2010

2009

Balancing Traffic Load Using One-Turn Rectilinear Routing.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2009

Kinetic maintenance of mobile k-centres on trees.

[BibT_eX]

[DOI]

Christophe Paul

Discret. Appl. Math., 2009

Fixed-Parameter Tractability and Improved Approximations for Segment Minimization

[BibT_eX]

[DOI]

CoRR, 2009

The projection median of a set of points.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance.

[BibT_eX]

[DOI]

J. Ian Munro

Matthew Skala

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm.

[BibT_eX]

[DOI]

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

2008

Bounded-Velocity Approximation of Mobile Euclidean 2-Centres.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2008

On the Structure of Small Motif Recognition Instances.

[BibT_eX]

[DOI]

Christina Boucher

Daniel G. Brown

Proceedings of the String Processing and Information Retrieval, 2008

2006

The Steiner Centre of a Set of Points: Stability, Eccentricity, and Applications to Mobile Facility Location.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2006

Minimizing the Number of Arcs Linking a Permutation of Points in the Plane.

[BibT_eX]

[DOI]

Chris Gray

James A. King

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

2005

The Projection Median of a Set of Points in R2.

[BibT_eX]

[DOI]

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

The gaussian centre and the projection centre of a set of points in r3.

[BibT_eX]

[DOI]

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

2003

Toward the rectilinear crossing number of Kn: new drawings, upper bounds, and asymptotics.

[BibT_eX]

[DOI]

Discret. Math., 2003

The Gaussian Centre of a Set of Mobile Points.

[BibT_eX]

[DOI]

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

2002

On the hardness of turn-angle-restricted rectilinear cycle cover problems.

[BibT_eX]

[DOI]

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

2001

The Rectilinear Crossing Number of K10 is 62.

[BibT_eX]

[DOI]

Electron. J. Comb., 2001

2000

Toward the Rectilinear Crossing Number of $K_n$: New Drawings, Upper Bounds, and Asymptotics

[BibT_eX]

[DOI]

CoRR, 2000

The Rectilinear Crossing Number of K_10 is 62

[BibT_eX]

[DOI]