Sue Whitesides

Venkatesh Srinivasan

J. Comb. Optim., November, 2024

2023

Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., November, 2023

Combinatorial Properties and Recognition of Unit Square Visibility Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., June, 2023

1-Complex s,t Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids.

[BibT_eX]

[DOI]

Venkatesh Srinivasan

J. Graph Algorithms Appl., 2023

2022

Closed space-filling curves with controlled orientation for 3D printing.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2022

1-Complex s, t Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids.

[BibT_eX]

[DOI]

Venkatesh Srinivasan

Proceedings of the WALCOM: Algorithms and Computation, 2022

2021

Reconfiguring Simple s, t Hamiltonian Paths in Rectangular Grid Graphs.

[BibT_eX]

[DOI]

Srinivasan Venkatesh

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2019

Kinetic k-Semi-Yao graph and its applications.

[BibT_eX]

[DOI]

Comput. Geom., 2019

Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs.

[BibT_eX]

[DOI]

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

2018

Monotone Simultaneous Paths Embeddings in ℝd.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2018

Connecting a set of circles with minimum sum of radii.

[BibT_eX]

[DOI]

Erin W. Chambers

Sándor P. Fekete

Hella-Franziska Hoffmann

Dimitri Marinakis

Joseph S. B. Mitchell

Srinivasan Venkatesh

Ulrike Stege

Comput. Geom., 2018

Visibility representations of boxes in 2.5 dimensions.

[BibT_eX]

[DOI]

Fabrizio Montecchiani

Stephen K. Wismath

Comput. Geom., 2018

On the Planar Split Thickness of Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2018

2017

Connectivity Graphs of Uncertainty Regions.

[BibT_eX]

[DOI]

Algorithmica, 2017

Sliding Local Planners for Sampling-Based Path Planning.

[BibT_eX]

[DOI]

S. M. Rayhan Rahman

Proceedings of the First IEEE International Conference on Robotic Computing, 2017

Bend Complexity and Hamiltonian Cycles in Grid Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016

Monotone Simultaneous Embeddings of Paths in R^d.

[BibT_eX]

[DOI]

CoRR, 2016

Monotone Simultaneous Embeddings of Paths in d Dimensions.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Constrained Light Deployment for Reducing Energy Consumption in Buildings.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Computing upward topological book embeddings of upward planar digraphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2015

A simple, faster method for kinetic proximity problems.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Open Problems from CCCG 2014.

[BibT_eX]

[DOI]

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

Reconfiguring a Chain of Cubes.

[BibT_eX]

[DOI]

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

2014

Computing k-Regret Minimizing Sets.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2014

Kinetic $k$-Semi-Yao Graph and its Applications.

[BibT_eX]

[DOI]

CoRR, 2014

(Reverse) k-nearest neighbors for moving objects.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Conference on Motion in Games, Playa Vista, CA, USA, November 06, 2014

Kinetic Reverse k-Nearest Neighbor Problem.

[BibT_eX]

[DOI]

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

The Range Beacon Placement Problem for Robot Navigation.

[BibT_eX]

[DOI]

Proceedings of the Canadian Conference on Computer and Robot Vision, 2014

Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in R^d.

[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

Acyclic coloring with few division vertices.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2013

Indexing Reverse Top-k Queries in Two Dimensions.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2013

Kinetic data structures for all nearest neighbors and closest pair in the plane.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Computational Geometry 2013, 2013

Kinetic Data Structures on The Move.

[BibT_eX]

[DOI]

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

Map Folding.

[BibT_eX]

[DOI]

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

Grid Proximity Graphs: LOGs, GIGs and GIRLs.

[BibT_eX]

[DOI]

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

2012

Network Optimization for Lightweight Stochastic Scheduling in Underwater Sensor Networks.

[BibT_eX]

[DOI]

IEEE Trans. Wirel. Commun., 2012

Acyclic colorings of graph subdivisions revisited.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

The Shape of Orthogonal Cycles in Three Dimensions.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2012

Computing optimal k-regret minimizing sets with top-k depth contours

[BibT_eX]

[DOI]

CoRR, 2012

Indexing Reverse Top-k Queries

[BibT_eX]

[DOI]

CoRR, 2012

On Three-Dimensional Graph Drawing and Embedding.

[BibT_eX]

[DOI]

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

Kinetic and Stationary Point-Set Embeddability for Plane Graphs.

[BibT_eX]

[DOI]

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

On Representing Graphs by Touching Cuboids.

[BibT_eX]

[DOI]

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

2011

Sampled medial loci for 3D shape representation.

[BibT_eX]

[DOI]

Kaleem Siddiqi

Comput. Vis. Image Underst., 2011

Stochastic Scheduling for Underwater Sensor Networks.

[BibT_eX]

[DOI]

Dimitri Marinakis

Kui Wu

Proceedings of the NETWORKING 2011, 2011

Acyclic Colorings of Graph Subdivisions.

[BibT_eX]

[DOI]

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

Simultaneous localization and environmental mapping with a sensor network.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Robotics and Automation, 2011

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

[BibT_eX]

[DOI]

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

Indexing for Vector Projections.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2011

Range-based Navigation System for a Mobile Robot.

[BibT_eX]

[DOI]

Proceedings of the Canadian Conference on Computer and Robot Vision, 2011

Approximating the Medial Axis by Shooting Rays: 3D Case.

[BibT_eX]

[DOI]

Kaleem Siddiqi

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

2010

A Succinct 3D Visibility Skeleton.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2010

Milling a Graph with Turn Costs: A Parameterized Complexity Perspective.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Collaborative problem solving: integrating theory and practice in the classroom.

[BibT_eX]

[DOI]

Proceedings of the 15th Western Canadian Conference on Computing Education, 2010

The Sentinel Problem for a Multi-hop Sensor Network.

[BibT_eX]

[DOI]

Dimitri Marinakis

Proceedings of the Canadian Conference on Computer and Robot Vision, 2010

On the Computation of 3D Visibility Skeletons.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009

Depth potential function for folding pattern representation, registration and analysis.

[BibT_eX]

[DOI]

Maxime Boucher

Alan C. Evans

Medical Image Anal., 2009

Abstract Milling with Turn Costs

[BibT_eX]

[DOI]

CoRR, 2009

Intractability in Graph Drawing and Geometry: FPT Approaches.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Medial Axis Approximation with Bounded Error.

[BibT_eX]

[DOI]

Proceedings of the Sixth International Symposium on Voronoi Diagrams, 2009

Sampled medial loci and boundary differential geometry.

[BibT_eX]

[DOI]

Kaleem Siddiqi

Proceedings of the 12th IEEE International Conference on Computer Vision Workshops, 2009

2008

Realizing partitions respecting full and partial order information.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

Parameterized Complexity of Geometric Problems.

[BibT_eX]

[DOI]

Panos Giannopoulos

Christian Knauer

Comput. J., 2008

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.

[BibT_eX]

[DOI]

Dimitrios M. Thilikos

Algorithmica, 2008

On the Parameterized Complexity of Layered Graph Drawing.

[BibT_eX]

[DOI]

Algorithmica, 2008

Embeddability Problems for Upward Planar Digraphs.

[BibT_eX]

[DOI]

Francesco Giordano

Proceedings of the Graph Drawing, 16th International Symposium, 2008

On the Size of the 3D Visibility Skeleton: Experimental Results.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2008

2007

Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

Randomized Algorithms for Minimum Distance Localization.

[BibT_eX]

[DOI]

Malvika Rao

Gregory Dudek

Int. J. Robotics Res., 2007

Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2007

A Discrete Differential Operator for Direction-based Surface Morphometry.

[BibT_eX]

[DOI]

Proceedings of the IEEE 11th International Conference on Computer Vision, 2007

Towards an implementation of the 3D visibility skeleton.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

A Note on Drawing Direction-constrained Paths in 3D.

[BibT_eX]

[DOI]

Ethan Kim

Louis-François Préville-Ratelle

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

On Bus Graph Realizability.

[BibT_eX]

[DOI]

Nuo Yu

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

2006

The strength of weak proximity.

[BibT_eX]

[DOI]

Giuseppe Di Battista

J. Discrete Algorithms, 2006

A Fixed-Parameter Approach to 2-Layer Planarization.

[BibT_eX]

[DOI]

Algorithmica, 2006

On Computing Shortest External Watchman Routes for Convex Polygons.

[BibT_eX]

[DOI]

Rafa Absar

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

Discrete mathematics for computer science.

[BibT_eX]

Gary Haggard

John S. Schlipf

Thomson Brooks/Cole, ISBN: 978-0-534-49501-5, 2006

2005

Experiments with the Fixed-Parameter Approach for Two-Layer Planarization.

[BibT_eX]

[DOI]

Matthew Suderman

J. Graph Algorithms Appl., 2005

Separating Point Sets in Polygonal Environments.

[BibT_eX]

[DOI]

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

Transversals to Line Segments in Three-Dimensional Space.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2005

Minimum Distance Localization for a Robot with Limited Visibility.

[BibT_eX]

[DOI]

Malvika Rao

Gregory Dudek

Proceedings of the 2005 IEEE International Conference on Robotics and Automation, 2005

05191 Open Problem Session Report.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 8.-13. May 2005, 2005

2004

Tuning and comparing spatial normalization methods.

[BibT_eX]

[DOI]

Medical Image Anal., 2004

An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization.

[BibT_eX]

[DOI]

Vida Dujmovic

Algorithmica, 2004

The Three Dimensional Logic Engine.

[BibT_eX]

[DOI]

Matthew Kitching

Proceedings of the Graph Drawing, 12th International Symposium, 2004

The number of lines tangent to arbitrary convex polyhedra in 3D.

[BibT_eX]

[DOI]

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003

The number of transversals to line segments in R^3

[BibT_eX]

[DOI]

CoRR, 2003

Rectangle Visibility Graphs: Characterization, Construction, and Compaction.

[BibT_eX]

[DOI]

Ileana Streinu

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

A complete and effective move set for simplified protein folding.

[BibT_eX]

[DOI]

Neal Lesh

Michael Mitzenmacher

Proceedings of the Sventh Annual International Conference on Computational Biology, 2003

On the Reliability of Triangle Intersection in 3D.

[BibT_eX]

[DOI]

Steven M. Robbins

Proceedings of the Computational Science and Its Applications, 2003

The complexity of (un)folding.

[BibT_eX]

[DOI]

Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

Transversals to line segments in R3.

[BibT_eX]

[DOI]

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

2002

Embedding problems for paths with direction constrained edges.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Curvature-Constrained Shortest Paths in a Convex Polygon.

[BibT_eX]

[DOI]

SIAM J. Comput., 2002

A note on reconfiguring tree linkages: trees can lock.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

On the number of lines tangent to four convex polyhedra.

[BibT_eX]

[DOI]

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

2001

Locked and Unlocked Polygonal Chains in Three Dimensions.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2001

On validating planar worlds.

[BibT_eX]

[DOI]

Vida Dujmovic

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Chain Reconfiguration. The INs and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

A Fixed-Parameter Approach to Two-Layer Planarization.

[BibT_eX]

[DOI]

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

On the Parameterized Complexity of Layered Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2001

2000

Guest Editors' Foreword.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2000

Three-dimensional orthogonal graph drawing algorithms.

[BibT_eX]

[DOI]

Antonios Symvonis

Discret. Appl. Math., 2000

Orthogonal Drawings of Cycles in 3D Space (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 8th International Symposium, 2000

1999

Bounds for Orthogonal 3-D Graph Drawing.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 1999

Locked and Unlocked Polygonal Chains in 3D.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

Localizing a Robot with Minimum Travel.

[BibT_eX]

[DOI]

Gregory Dudek

Kathleen Romanik

SIAM J. Comput., 1998

A Visibility Representation for Graphs in Three Dimensions.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 1998

The rectangle of influence drawability problem.

[BibT_eX]

[DOI]

Comput. Geom., 1998

The largest k-ball in a d-dimensional box.

[BibT_eX]

[DOI]

Comput. Geom., 1998

Universal 3-dimensional visibility representations for graphs.

[BibT_eX]

[DOI]

Helmut Alt

Michael Godau

Comput. Geom., 1998

Graph Multidrawing: Finding Nice Drawings Without Defining Nice.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 6th International Symposium, 1998

Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

Convexifying star-shaped polygons.

[BibT_eX]

[DOI]

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Unfolding some classes of orthogonal polyhedra.

[BibT_eX]

[DOI]

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

On reconfiguring tree linkages: Trees can lock.

[BibT_eX]

[DOI]

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997

The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems.

[BibT_eX]

[DOI]

Sándor P. Fekete

Michael E. Houle

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

Orthogonal 3-D Graph Drawing.

[BibT_eX]

[DOI]

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

On folding rulers in regular polygons.

[BibT_eX]

Naixun Pei

Proceedings of the 9th Canadian Conference on Computational Geometry, 1997

1996

The Logic Engine and the Realization Problem for Nearest Neighbor Graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

The Techniques of Komolgorov and Bardzin for Three-Dimensional Orthogonal Graph Drawings.

[BibT_eX]

[DOI]

Charles Stirk

Inf. Process. Lett., 1996

Folding Rulers Inside Triangles.

[BibT_eX]

[DOI]

Marc J. van Kreveld

Jack Snoeyink

Discret. Comput. Geom., 1996

The Realization Problem for Euclidean Minimum Spanning Trees in NP-Hard.

[BibT_eX]

[DOI]

Algorithmica, 1996

Two Algorithms for Three Dimensional Orthogonal Graph Drawing.

[BibT_eX]

[DOI]

Antonios Symvonis

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

On the Reconfiguration of Chains (Extended Abstract).

[BibT_eX]

[DOI]

Naixun Pei

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

On the Reachable Regions of Chains.

[BibT_eX]

[DOI]

Naixun Pei

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

1995

Reconfigurating Closed Polygonal Chains in Euclidean d-Space.

[BibT_eX]

[DOI]

William J. Lenhart

Discret. Comput. Geom., 1995

Nearest Neighbour Graph Realizability is NP-hard.

[BibT_eX]

[DOI]

Proceedings of the LATIN '95: Theoretical Informatics, 1995

New Results on a Visibility Representation of Graphs in 3D.

[BibT_eX]

[DOI]

Sándor P. Fekete

Michael E. Houle

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

1994

Drawing Graphs in Two Layers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Poster Gallery Report.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

Recognizing Rectangle of Influence Drawable Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993

Grid intersection graphs and boxicity.

[BibT_eX]

[DOI]

S. Bellantoni

Irith Ben-Arroyo Hartman

Teresa M. Przytycka

Discret. Math., 1993

Dominance Drawings of Bipartite Graphs.

[BibT_eX]

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

1992

Algorithmic Issues in the Geometry of Planar Linkage Movement.

[BibT_eX]

Aust. Comput. J., 1992

Algorithmic and Complexity Results for Drawing Euclidian Trees.

[BibT_eX]

Rongyao Zhao

Proceedings of the Advanced Visual Interfaces - Proceedings of the International Workshop, 1992

1988

Computing the Link Center of a Simple Polygon.

[BibT_eX]

[DOI]

Chee-Keng Yap

Discret. Comput. Geom., 1988

1985

On the Movement of Robot Arms in 2-Dimensional Bounded Regions.

[BibT_eX]

[DOI]

John E. Hopcroft

Deborah Joseph

SIAM J. Comput., 1985

1984

Movement Problems for 2-Dimensional Linkages.

[BibT_eX]

[DOI]

John E. Hopcroft

Deborah Joseph

SIAM J. Comput., 1984

1983

Edge-colored complete graphs with alternating cycles.

[BibT_eX]

[DOI]

Discret. Math., 1983

1982

A classification of certain graphs with minimal imperfection properties.

[BibT_eX]

[DOI]

Discret. Math., 1982

1981

An Algorithm for Finding Clique Cut-Sets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1981

1979

Collineations of Projective Planes of Order 10, Part II.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1979

Collineations of Projective Planes of Order 10, Part I.

[BibT_eX]

[DOI]