Thomas C. Shermer

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022

A combinatorial bound for beacon-based routing in orthogonal polygons.

[BibT_eX]

[DOI]

J. Comput. Geom., 2022

On the Zombie Number of Various Graph Classes.

[BibT_eX]

[DOI]

Jean-Lou De Carufel

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

An Efficient Algorithm for the Proximity Connected Two Center Problem.

[BibT_eX]

[DOI]

Binay Bhattacharya

Amirhossein Mozafari

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor.

[BibT_eX]

[DOI]

Jean-Lou De Carufel

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021

Attraction-convexity and normal visibility.

[BibT_eX]

[DOI]

Comput. Geom., 2021

Piercing pairwise intersecting geodesic disks.

[BibT_eX]

[DOI]

Paz Carmi

Comput. Geom., 2021

2020

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

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Gathering by repulsion.

[BibT_eX]

[DOI]

Comput. Geom., 2020

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

2018

Transmitting Particles in a Polygonal Domain by Repulsion.

[BibT_eX]

[DOI]

Amirhossein Mozafari

Proceedings of the Combinatorial Optimization and Applications, 2018

2014

Bitwise data parallelism in regular expression matching.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Parallel Architectures and Compilation, 2014

2011

Nonadaptive broadcasting in trees.

[BibT_eX]

[DOI]

Hovhannes A. Harutyunyan

Kazuhisa Makino

Networks, 2011

Parallel Scanning with Bitstream Addition: An XML Case Study.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2011 Parallel Processing - 17th International Conference, 2011

2009

Edge-disjoint spanners in tori.

[BibT_eX]

[DOI]

Ladislav Stacho

Discret. Math., 2009

2007

Computing the maximum clique in the visibility graph of a simple polygon.

[BibT_eX]

[DOI]

Subir Kumar Ghosh

Binay K. Bhattacharya

Partha P. Goswami

J. Discrete Algorithms, 2007

2006

A linear time algorithm to remove winding of a simple polygon.

[BibT_eX]

[DOI]

Binay K. Bhattacharya

Subir Kumar Ghosh

Comput. Geom., 2006

2005

Edge-disjoint spanners in Cartesian products of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2005

2003

Factor <i>d</i>-domatic colorings of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2003

2002

Finding Specified Sections of Arrangements: 2D Results.

[BibT_eX]

[DOI]

J. Math. Model. Algorithms, 2002

2001

Edge-disjoint spanners of complete bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 2001

Orthogonal Drawings with Few Layers.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 9th International Symposium, 2001

2000

Point Visibility Graphs and O-Convex Cover.

[BibT_eX]

[DOI]

David Bremner

Int. J. Comput. Geom. Appl., 2000

Linear-Time Algorithms for Partial <i>k</i>-Tree Complements.

[BibT_eX]

[DOI]

Algorithmica, 2000

Broadcasting Multiple Messages in Hypercubes (preliminary version).

[BibT_eX]

[DOI]

Matthew J. Suderman

Proceedings of the 5th International Symposium on Parallel Architectures, 2000

Visibility in the Plane.

[BibT_eX]

[DOI]

Tetsuo Asano

Subir Kumar Ghosh

Proceedings of the Handbook of Computational Geometry, 2000

1999

Bounds for Orthogonal 3-D Graph Drawing.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 1999

Edge-disjoint spanners of complete graphs and complete digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1999

On representations of some thickness-two graphs.

[BibT_eX]

[DOI]

Joan P. Hutchinson

Andrew Vince

Comput. Geom., 1999

On the Complements of Partial k-Trees.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1999

1998

A Visibility Representation for Graphs in Three Dimensions.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 1998

Illumination of Orthogonal Polygons with Orthogonal Floodlights.

[BibT_eX]

[DOI]

James Abello

Vladimir Estivill-Castro

Jorge Urrutia

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

1997

Guarding Polyhedral Terrains.

[BibT_eX]

[DOI]

Binhai Zhu

Comput. Geom., 1997

Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Hawaii International Conference on System Sciences (HICSS-30), 1997

Orthogonal 3-D Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 5th International Symposium, 1997

The generalized matching problem on partial $k$-trees.

[BibT_eX]

[DOI]

Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

A Complete Roundness Classification Procedure.

[BibT_eX]

[DOI]

Kurt Mehlhorn

Chee-Keng Yap

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

Isomorphism of Spiral Polygons.

[BibT_eX]

[DOI]

G. MacDonald

Discret. Comput. Geom., 1996

Degree-constrained Spanners for Multidimensional Grids.

[BibT_eX]

[DOI]

Christopher R. Stolte

Discret. Appl. Math., 1996

Generalized Guarding and Partitioning for Rectilinear Polygons.

[BibT_eX]

[DOI]

Comput. Geom., 1996

Vertex Partitioning Problems On Partial k-Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1996

On Rectangle Visibility Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

On the Sectional Area of Convex Polytopes.

[BibT_eX]

[DOI]

David Avis

Binhai Zhu

Jack Snoeyink

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

On Rectangle Visibility Graphs. III. External Visibility and Complexity.

[BibT_eX]

[DOI]

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995

Degree-Constrained Network Spanners with Nonconstant Delay.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1995

Regular-Factors In The Complements Of Partial k-Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

The Chi-t-Coloring Problem.

[BibT_eX]

[DOI]

Proceedings of the STACS 95, 1995

Illumination with Orthogonal Floodlights.

[BibT_eX]

[DOI]

James Abello

Vladimir Estivill-Castro

M. Sheelagh T. Carpendale

Jorge Urrutia

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Graph Folding: Extending Detail and Context Viewing into a Tool for Subgraph Comparisons.

[BibT_eX]

[DOI]

David J. Cowperthwaite

F. David Fracchia

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995

Illuminating convex polygonswith vertex floodlight.

[BibT_eX]

[DOI]

Joseph O'Rourke

Ileana Streinu

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

1994

The Superman problem.

[BibT_eX]

[DOI]

Naji Mouawad

Vis. Comput., 1994

1993

On recognizing unions of two convex polygons and related problems.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1993

Additive graph spanners.

[BibT_eX]

[DOI]

Networks, 1993

Grid spanners.

[BibT_eX]

[DOI]

Networks, 1993

The Continuous-graph Approach to Visibility Problems.

[BibT_eX]

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

1992

Recent results in art galleries (geometry).

[BibT_eX]

[DOI]

Proc. IEEE, 1992

A Linear Algorithm for Bisecting a Polygon.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

Probing Polygons Minimally Is Hard.

[BibT_eX]

[DOI]

Patrice Belleville

Comput. Geom., 1992

1991

Additive Spanners for Hypercubes.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1991

A Counterexample to the Algorithms for Determining Opaque Minimal Forests.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

Computing Bushy and Thin Triangulations.

[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

1989

Hiding people in polygons.

[BibT_eX]

[DOI]