David Rappaport

Int. J. Found. Comput. Sci., 2019

2018

State Complexity of Neighbourhoods and Approximate Pattern Matching.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2018

Routing in a polygonal terrain with the shortest beacon watchtower.

[BibT_eX]

[DOI]

Bahram Kouhestani

Comput. Geom., 2018

An Optimal Algorithm to Compute the Inverse Beacon Attraction Region.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

State complexity of prefix distance.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

State Complexity of Prefix Distance of Subregular Languages.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2017

Guest Editor's foreword.

[BibT_eX]

[DOI]

Comput. Geom., 2017

Relative Prefix Distance Between Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 21st International Conference, 2017

Quasi-Distances and Weighted Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Role of Theory in Computer Science, 2017

2016

The Length of the Beacon Attraction Trajectory.

[BibT_eX]

Bahram Kouhestani

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

2015

Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences.

[BibT_eX]

[DOI]

Mustafa Mohamad

Godfried Toussaint

Graphs Comb., 2015

On the Inverse Beacon Attraction Region of a Point.

[BibT_eX]

[DOI]

Bahram Kouhestani

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

Super Generalized 4PCS for 3D Registration.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on 3D Vision, 2015

2014

A decision algorithm for reversible pairs of polygons.

[BibT_eX]

[DOI]

Jin Akiyama

Hyunwoo Seong

Discret. Appl. Math., 2014

Generalized 4-Points Congruent Sets for 3D Registration.

[BibT_eX]

[DOI]

Mustafa Mohamad

Michael A. Greenspan

Proceedings of the 2nd International Conference on 3D Vision, 2014

2013

On point-sets that support planar graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Establishing strong connectivity using optimal radius half-disk antennas.

[BibT_eX]

[DOI]

Comput. Geom., 2013

2012

Minimizing the error of linear separators on linearly inseparable data.

[BibT_eX]

[DOI]

Boris Aronov

Delia Garijo

Carlos Seara

Jorge Urrutia

Discret. Appl. Math., 2012

On Representing Graphs by Touching Cuboids.

[BibT_eX]

[DOI]

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

2010

Fault Recovery in Wireless Networks: The Geometric Recolouring Approach.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

2009

An algorithm for computing simple k-factors.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Bounds for point recolouring in geometric graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Editorial CCCG 2006.

[BibT_eX]

[DOI]

Comput. Geom., 2009

The distance geometry of music.

[BibT_eX]

[DOI]

Erik D. Demaine

Francisco Gomez-Martin

Perouz Taslakian

Terry Winograd

David R. Wood

Comput. Geom., 2009

Small weak epsilon-nets.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Not being (super)thin or solid is hard: A study of grid Hamiltonicity.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Valentin Polishchuk

Henry Xiao

Comput. Geom., 2009

Compatible geometric matchings.

[BibT_eX]

[DOI]

Oswin Aichholzer

Sergey Bereg

Adrian Dumitrescu

Alfredo García Olaverri

Comput. Geom., 2009

Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments.

[BibT_eX]

[DOI]

Farzad Hassanzadeh

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

2008

Encompassing colored planar straight line graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2008

On the Complexity of Point Recolouring in Geometric Graphs.

[BibT_eX]

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007

Maximal Area Sets and Harmony.

[BibT_eX]

[DOI]

Graphs Comb., 2007

Hamilton Circuits in Hexagonal Grid Graphs.

[BibT_eX]

[DOI]

Kamrul Islam

Henry Xiao

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

2006

Algorithms for Computing Geometric Measures of Melodic Similarity.

[BibT_eX]

[DOI]

Comput. Music. J., 2006

Moving coins.

[BibT_eX]

[DOI]

Manuel Abellanas

Sergey Bereg

Ferran Hurtado

Alfredo García Olaverri

Javier Tejel

Comput. Geom., 2006

Biclique Edge Cover Graphs and Confluent Drawings.

[BibT_eX]

[DOI]

Michael Hirsch

Proceedings of the Graph Drawing, 14th International Symposium, 2006

Tight Bounds for Point Recolouring.

[BibT_eX]

[DOI]

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

2005

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2005

Bi-chromatic minimum spanning trees.

[BibT_eX]

[DOI]

Magdalene Grantson

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

Closest Segments.

[BibT_eX]

[DOI]

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

The Distance Geometry of Deep Rhythms and Scales.

[BibT_eX]

[DOI]

Erik D. Demaine

Francisco Gomez-Martin

Perouz Taslakian

Terry Winograd

David R. Wood

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

2004

Simultaneous edge flips for convex subdivisions.

[BibT_eX]

[DOI]

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

Encompassing colored crossing-free geometric graphs.

[BibT_eX]

[DOI]

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

2003

The Largest Empty Annulus Problem.

[BibT_eX]

[DOI]

José Miguel Díaz-Báñez

Int. J. Comput. Geom. Appl., 2003

The visibility graph of congruent discs is Hamiltonian.

[BibT_eX]

[DOI]

Comput. Geom., 2003

Computing the Similarity of two Melodies.

[BibT_eX]

[DOI]

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

2002

Finding Specified Sections of Arrangements: 2D Results.

[BibT_eX]

[DOI]

J. Math. Model. Algorithms, 2002

Tight Bounds for Visibility Matching of f-Equal Width Objects.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

2001

On the visibility graph of convex translates.

[BibT_eX]

[DOI]

Kiyoshi Hosono

Discret. Appl. Math., 2001

Minimum convex partition of a constrained point set.

[BibT_eX]

[DOI]

Thomas Fevens

Discret. Appl. Math., 2001

2000

On Convex Decompositions of Points.

[BibT_eX]

[DOI]

Kiyoshi Hosono

Masatsugu Urabe

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

1998

Algorithms for Cluster Busting in Anchored Graph Drawing.

[BibT_eX]

[DOI]

Kelly A. Lyons

J. Graph Algorithms Appl., 1998

Decision trees for geometric models.

[BibT_eX]

[DOI]

Esther M. Arkin

Joseph S. B. Mitchell

Steven Skiena

Int. J. Comput. Geom. Appl., 1998

1995

Minimum polygon transversals of line segments.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1995

Motivating lazy guards.

[BibT_eX]

[DOI]

Paul Colley

Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994

An efficient algorithm for identifying objects using robot probes.

[BibT_eX]

[DOI]

Kelly A. Lyons

Vis. Comput., 1994

Moldable and Castable Polygons.

[BibT_eX]

[DOI]

Arnold Rosenbloom

Comput. Geom., 1994

Optimal Nearly-Similar Polygon Stabbers of Convex Polygons.

[BibT_eX]

Paul Colley

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993

The complexity of computing minimum separating polygons.

[BibT_eX]

[DOI]

Peter Eades

Pattern Recognit. Lett., 1993

Probing a Set of Hyperplanes by Lines and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Dominance Drawings of Bipartite Graphs.

[BibT_eX]

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

Properties of the voronoi diagram cluster buster.

[BibT_eX]

[DOI]

Kelly A. Lyons

Proceedings of the 1993 Conference of the Centre for Advanced Studies on Collaborative Research, 1993

1992

Computing the Minimum Weight Triangulation of a Set of Linearly Ordered Points.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

1991

A Convex Hull Algorithm for Discs, and Applications.

[BibT_eX]

[DOI]

Comput. Geom., 1991

The Aquarium Keeper's Problem.

[BibT_eX]

[DOI]

Jorge Urrutia

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1990

Computing Simple Circuits form a Set of Line Segments.

[BibT_eX]

[DOI]

Hiroshi Imai

Discret. Comput. Geom., 1990

1989

Computing Simple Circuits from a Set of Line Segments is NP-Complete.

[BibT_eX]

[DOI]

SIAM J. Comput., 1989

Computing the Furthest Site Voronoi Diagram for a Set of Discs (Preliminary Report).

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 1989

1986

A linear algorithm for eliminating hidden-lines from a polygonal cylinder.

[BibT_eX]

[DOI]

Vis. Comput., 1986

On Computing Simple Circuits on a Set of Line Segments.

[BibT_eX]

[DOI]

Hiroshi Imai

Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985

A simple linear hidden-line algorithm for star-shaped polygons.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1985

Computing the largest empty convex subset of a set of points.

[BibT_eX]

[DOI]

David Avis

Proceedings of the First Annual Symposium on Computational Geometry, 1985

1979

Optimality criteria for controlled discontinous processes.

[BibT_eX]

[DOI]

Izidor Gertner

Inf. Sci., 1979

1977

Stochastic control of system with unobserved jump parameter process.

[BibT_eX]

[DOI]

Izidor Gertner