Therese Biedl

John Wittnebel

Discret. Math., 2025

2024

Optimal-area visibility representations of outer-1-plane graphs.

[BibT_eX]

[DOI]

Jayson Lynch

J. Comput. Geom., 2024

Improved Outerplanarity Bounds for Planar Graphs.

[BibT_eX]

[DOI]

Debajyoti Mondal

CoRR, 2024

Finding maximum matchings in RDV graphs efficiently.

[BibT_eX]

[DOI]

Prashant Gokhale

CoRR, 2024

On the Independence Number of 1-Planar Graphs.

[BibT_eX]

[DOI]

Prosenjit Bose

Babak Miraftab

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Morphing Planar Graph Drawings via Orthogonal Box Drawings.

[BibT_eX]

[DOI]

Jack Spalding-Jamieson

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

Constrained Outer-String Representations.

[BibT_eX]

[DOI]

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

The Price of Upwardness.

[BibT_eX]

[DOI]

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

A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs.

[BibT_eX]

[DOI]

Prosenjit Bose

Karthik Murali

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

On Computing the Vertex Connectivity of 1-Plane Graphs.

[BibT_eX]

[DOI]

Karthik Murali

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

On the complexity of embedding in graph products.

[BibT_eX]

David Eppstein

Torsten Ueckerdt

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

2022

Matchings in 1-planar graphs with large minimum degree.

[BibT_eX]

[DOI]

John Wittnebel

J. Graph Theory, 2022

Drawing Halin-graphs with small height.

[BibT_eX]

[DOI]

Milap Sheth

J. Graph Algorithms Appl., 2022

Drawing outer-1-planar graphs revisited.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2022

Horton-Strahler number, rooted pathwidth and upward drawings of trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2022

Reconfiguration of Non-crossing Spanning Trees.

[BibT_eX]

[DOI]

CoRR, 2022

Visibility Representations of Toroidal and Klein-bottle Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

Drawing complete outer-1-planar graphs in linear area.

[BibT_eX]

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

2021

A note on 1-planar graphs with minimum degree 7.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Computing the vertex connectivity of a locally maximal 1-plane graph in linear time.

[BibT_eX]

[DOI]

Karthik Murali

CoRR, 2021

Minimum ply covering of points with disks and squares.

[BibT_eX]

[DOI]

Ahmad Biniaz

Comput. Geom., 2021

On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth.

[BibT_eX]

[DOI]

Algorithmica, 2021

Dispersion for Intervals: A Geometric Approach.

[BibT_eX]

[DOI]

Anurag Murty Naredla

Peter Dominik Ralbovsky

Graeme Stroud

Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

All Subgraphs of a Wheel Are 5-Coupled-Choosable.

[BibT_eX]

[DOI]

Sam Barr

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

Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest.

[BibT_eX]

[DOI]

Sam Barr

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Distant Representatives for Rectangles in the Plane.

[BibT_eX]

[DOI]

Anurag Murty Naredla

Peter Dominik Ralbovsky

Graeme Stroud

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Generalized LR-Drawings of Trees.

[BibT_eX]

Jayson Lynch

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width).

[BibT_eX]

[DOI]

Johannes Batzill

J. Graph Algorithms Appl., 2020

Segment representations with small resolution.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

Building a larger class of graphs for efficient reconfiguration of vertex colouring.

[BibT_eX]

[DOI]

Owen D. Merkel

CoRR, 2020

On Layered Fan-Planar Graph Drawings.

[BibT_eX]

[DOI]

Chrysanthi N. Raftopoulou

Martin Nöllenburg

CoRR, 2020

Packing boundary-anchored rectangles and squares.

[BibT_eX]

[DOI]

Comput. Geom., 2020

Crossing Number for Graphs with Bounded Pathwidth.

[BibT_eX]

[DOI]

Algorithmica, 2020

Finding Large Matchings in 1-Planar Graphs of Minimum Degree 3.

[BibT_eX]

[DOI]

Fabian Klute

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

Layered Fan-Planar Graph Drawings.

[BibT_eX]

[DOI]

Steven Chaplick

Chrysanthi N. Raftopoulou

Martin Nöllenburg

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019

Rollercoasters: Long Sequences without Short Runs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Andreas Kerren

J. Graph Algorithms Appl., 2019

Are highly connected 1-planar graphs Hamiltonian?

[BibT_eX]

[DOI]

CoRR, 2019

Quasiperiodic bobbin lace patterns.

[BibT_eX]

[DOI]

Veronika Irvine

Craig S. Kaplan

CoRR, 2019

Finding big matchings in planar graphs quickly.

[BibT_eX]

[DOI]

CoRR, 2019

Maximum Matchings and Minimum Blocking Sets in Θ6-Graphs.

[BibT_eX]

[DOI]

CoRR, 2019

Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation.

[BibT_eX]

[DOI]

Hamideh Vosoughpour

Ziting Yu

Algorithmica, 2019

Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -Graphs.

[BibT_eX]

[DOI]

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

Finding Tutte Paths in Linear Time.

[BibT_eX]

[DOI]

Philipp Kindermann

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Line and Plane Cover Numbers Revisited.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Homotopy Height, Grid-Major Height and Graph-Drawing Height.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Reconstructing a Polyhedron between Polygons in Parallel Slices.

[BibT_eX]

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

2018

Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2018

Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018).

[BibT_eX]

[DOI]

Andreas Kerren

CoRR, 2018

On the Size of Outer-String Representations.

[BibT_eX]

[DOI]

Ahmad Biniaz

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Partitioning Orthogonal Histograms into Rectangular Boxes.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Rollercoasters and Caterpillars.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Integral Unit Bar-Visibility Graphs.

[BibT_eX]

[DOI]

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017

Non-aligned Drawings of Planar Graphs.

[BibT_eX]

[DOI]

Claire Pennarun

J. Graph Algorithms Appl., 2017

Ideal Drawings of Rooted Trees With Approximately Optimal Width.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

4-connected planar graphs are in B3-EPG.

[BibT_eX]

[DOI]

Claire Pennarun

CoRR, 2017

A Note on Plus-Contacts, Rectangular Duals, and Box-Orthogonal Drawings.

[BibT_eX]

[DOI]

Debajyoti Mondal

CoRR, 2017

On Guarding Orthogonal Polygons with Sliding Cameras.

[BibT_eX]

[DOI]

Hamideh Vosoughpour

Proceedings of the WALCOM: Algorithms and Computation, 2017

Splitting B_2 -VPG Graphs into Outer-String and Co-Comparability Graphs.

[BibT_eX]

[DOI]

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

A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings.

[BibT_eX]

[DOI]

Philippe Demontigny

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

Order-Preserving 1-String Representations of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

On Upward Drawings of Trees on a Given Grid.

[BibT_eX]

[DOI]

Debajyoti Mondal

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Grid-Obstacle Representations with Connections to Staircase Guarding.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Drawing Bobbin Lace Graphs, or, Fundamental Cycles for a Subclass of Periodic Graphs.

[BibT_eX]

[DOI]

Veronika Irvine

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

EPG-representations with Small Grid-Size.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

On Guarding Orthogonal Polygons with Bounded Treewidth.

[BibT_eX]

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

Packing Boundary-Anchored Rectangles.

[BibT_eX]

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

Upward Order-Preserving 8-Grid-Drawings of Binary Trees.

[BibT_eX]

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

2016

1-string B2-VPG representation of planar graphs.

[BibT_eX]

[DOI]

J. Comput. Geom., 2016

The (3, 1)-ordering for 4-connected planar triangulations.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2016

Planar Matchings for Weighted Straight Skeletons.

[BibT_eX]

[DOI]

Stefan Huber

Peter Palfrader

Int. J. Comput. Geom. Appl., 2016

On r-Guarding Thin Orthogonal Polygons.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

On Visibility Representations of Non-Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Rectangle-of-influence triangulations.

[BibT_eX]

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

Realizing Farthest-Point Voronoi Diagrams.

[BibT_eX]

Jonathan Richard Shewchuk

Carsten Grimm

Leonidas Palios

Sander Verdonschot

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

Sliding k-Transmitters: Hardness and Approximation.

[BibT_eX]

Ziting Yu

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

2015

A simple algorithm for computing positively weighted straight skeletons of monotone polygons.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

On triangulating k-outerplanar graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

DAG-width of Control Flow Graphs with Applications to Model Checking.

[BibT_eX]

[DOI]

Sebastian Fischmeister

Neeraj Kumar

CoRR, 2015

$1$-String $B_1$-VPG Representations of Planar Partial $3$-Trees and Some Subclasses.

[BibT_eX]

[DOI]

CoRR, 2015

Optimum-width upward order-preserving poly-line drawings of trees.

[BibT_eX]

[DOI]

CoRR, 2015

Optimum-width upward drawings of trees I: Rooted pathwidth.

[BibT_eX]

[DOI]

CoRR, 2015

Reprint of: Weighted straight skeletons in the plane.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Weighted straight skeletons in the plane.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Triangulating Planar Graphs While Keeping the Pathwidth Small.

[BibT_eX]

[DOI]

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

Small-Area Orthogonal Drawings of 3-Connected Graphs.

[BibT_eX]

[DOI]

Jens M. Schmidt

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

Representing Directed Trees as Straight Skeletons.

[BibT_eX]

[DOI]

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

1-String B_2-VPG Representation of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Computational Geometry, 2015

1-string B1-VPG-representations of planar partial 3-trees and some subclasses.

[BibT_eX]

[DOI]

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

2014

1-String CZ-Representation of Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2014

Straightening out planar poly-line drawings.

[BibT_eX]

[DOI]

CoRR, 2014

Orthogonal cartograms with at most 12 corners per face.

[BibT_eX]

[DOI]

Lesvia Elena Ruiz Velázquez

Comput. Geom., 2014

Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory - SWAT 2014, 2014

On Area-Optimal Planar Graph Drawings.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Height-Preserving Transformations of Planar Graph Drawings.

[BibT_eX]

[DOI]

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

Turning Orthogonally Convex Polyhedra into Orthoballs.

[BibT_eX]

[DOI]

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

2013

Morphing orthogonal planar graph drawings.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2013

The Point-Set Embeddability Problem for Plane graphs.

[BibT_eX]

[DOI]

Martin Vatshelle

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

Computing Cartograms with Optimal Complexity.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

Faster optimal algorithms for segment minimization with small maximal value.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Dihedral angles and orthogonal polyhedra.

[BibT_eX]

[DOI]

CoRR, 2013

Trees and co-trees with constant maximum degree in planar 3-connected graphs.

[BibT_eX]

[DOI]

CoRR, 2013

Transforming planar graph drawings while maintaining height.

[BibT_eX]

[DOI]

CoRR, 2013

Drawing planar 3-trees with given face areas.

[BibT_eX]

[DOI]

Lesvia Elena Ruiz Velázquez

Comput. Geom., 2013

Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations.

[BibT_eX]

[DOI]

Muhammad Jawaherul Alam

Algorithmica, 2013

Smart-Grid Electricity Allocation via Strip Packing with Slicing.

[BibT_eX]

[DOI]

Krishnam Raju Jampani

Srinivasan Keshav

Vinayak Pathak

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

Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input.

[BibT_eX]

[DOI]

Martin Held

Stefan Huber

Proceedings of the 10th International Symposium on Voronoi Diagrams in Science and Engineering, 2013

Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings.

[BibT_eX]

[DOI]

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

2012

Proportional Contact Representations of Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2012

The Art Gallery Theorem for Polyominoes.

[BibT_eX]

[DOI]

Mohammad Tanvir Irfan

Justin Iwerks

Joondong Kim

Joseph S. B. Mitchell

Discret. Comput. Geom., 2012

A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Drawing Planar Graphs on Points Inside a Polygon.

[BibT_eX]

[DOI]

Peter Floderus

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs.

[BibT_eX]

[DOI]

Soroush Alamdari

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

The Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar Subgraphs.

[BibT_eX]

[DOI]

Terry Anderson

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

2011

Reconstructing polygons from scanner data.

[BibT_eX]

[DOI]

Stephane Durocher

Jack Snoeyink

Theor. Comput. Sci., 2011

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

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Reconstructing Convex Polygons and Convex Polyhedra from Edge and Face Counts in Orthogonal Projections.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2011

Stoker's Theorem for Orthogonal Polyhedra.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2011

Small Drawings of Outerplanar Graphs, Series-Parallel Graphs, and Other Planar Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2011

Efficient view point selection for silhouettes of convex polyhedra.

[BibT_eX]

[DOI]

Comput. Geom., 2011

Reconstructing orthogonal polyhedra from putative vertex sets.

[BibT_eX]

[DOI]

Comput. Geom., 2011

Orthogonal Cartograms with Few Corners Per Face.

[BibT_eX]

[DOI]

Lesvia Elena Ruiz Velázquez

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames.

[BibT_eX]

[DOI]

Soroush Alamdari

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

Guarding polyominoes.

[BibT_eX]

[DOI]

Mohammad Tanvir Irfan

Justin Iwerks

Joondong Kim

Joseph S. B. Mitchell

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

Drawing some planar graphs with integer edge-lengths.

[BibT_eX]

[DOI]

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

2010

Reconstructing hv-convex multi-coloured polyominoes.

[BibT_eX]

[DOI]

Adam Bains

Theor. Comput. Sci., 2010

On edge-intersection graphs of k-bend paths in grids.

[BibT_eX]

[DOI]

Michal Stern

Discret. Math. Theor. Comput. Sci., 2010

Sorting with networks of data structures.

[BibT_eX]

[DOI]

Alexander Golynski

Angèle M. Hamel

J. Ian Munro

Discret. Appl. Math., 2010

2009

On the complexity of crossings in permutations.

[BibT_eX]

[DOI]

Xiaotie Deng

Discret. Math., 2009

Fixed-Parameter Tractability and Improved Approximations for Segment Minimization

[BibT_eX]

[DOI]

CoRR, 2009

Morphing polyhedra with parallel faces: Counterexamples.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 17th International Symposium, 2009

Cauchy's Theorem for Orthogonal Polyhedra of Genus 0.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2009

Edge-Intersection Graphs of k-Bend Paths in Grids.

[BibT_eX]

[DOI]

Michal Stern

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2007

Cauchy's Theorem and Edge Lengths of Convex Polyhedra.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Realizations of Hexagonal Graph Representations.

[BibT_eX]

[DOI]

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

Improved Layouts of the Multigrid Network.

[BibT_eX]

[DOI]

Shabnam Aziza

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

2006

Polygons Needing Many Flipturns.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2006

Three-Dimensional Orthogonal Graph Drawing with Optimal Volume.

[BibT_eX]

[DOI]

Torsten Thiele

David R. Wood

Algorithmica, 2006

Partitions of Graphs into Trees.

[BibT_eX]

[DOI]

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

2005

Bounded-Degree Independent Sets in Planar Graphs.

[BibT_eX]

[DOI]

Dana F. Wilkinson

Theory Comput. Syst., 2005

Balanced vertex-orderings of graphs.

[BibT_eX]

[DOI]

Mohammad Taghi Hajiaghayi

Yashar Ganjali

David R. Wood

Discret. Appl. Math., 2005

A note on 3D orthogonal graph drawing.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

When can a net fold to a polyhedron?

[BibT_eX]

[DOI]

Julie Sun

Comput. Geom., 2005

Morphing Planar Graphs While Preserving Edge Directions.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 13th International Symposium, 2005

Crossings and Permutations.

[BibT_eX]

[DOI]

Xiaotie Deng

Proceedings of the Graph Drawing, 13th International Symposium, 2005

Morphing Polyhedra Preserving Face Normals: A Counterexample.

[BibT_eX]

[DOI]

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

Cross-Stitching Using Little Thread.

[BibT_eX]

[DOI]

Joseph Douglas Horton

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

Complexity of Octagonal and Rectangular Cartograms.

[BibT_eX]

[DOI]

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

Drawing planar bipartite graphs with small area.

[BibT_eX]

[DOI]

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

The complexity of domino tiling.

[BibT_eX]

[DOI]

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

2004

Finding hidden independent sets in interval graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Tight bounds on maximal and maximum matchings.

[BibT_eX]

[DOI]

Discret. Math., 2004

Fun-Sort--or the chaos of unordered binary search.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Angles and Lengths in Reconfigurations of Polygons and Polyhedra.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Hexagonal Grid Drawings: Algorithms and Lower Bounds.

[BibT_eX]

[DOI]

Shabnam Aziza

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

When can a graph form an orthogonal polyhedron?

[BibT_eX]

[DOI]

Mohammad Taghi Hajiaghayi

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

2003

Palindrome recognition using a multidimensional tape.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Drawing K2, n: A lower bound.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting.

[BibT_eX]

[DOI]

Erik D. Demaine

Alexander Golynski

Joseph Douglas Horton

Guillaume Poirier

Claude-Guy Quimper

Proceedings of the Algorithms, 2003

Parallel morphing of trees and cycles.

[BibT_eX]

[DOI]

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

2002

Curvature-Constrained Shortest Paths in a Convex Polygon.

[BibT_eX]

[DOI]

SIAM J. Comput., 2002

Balanced k-colorings.

[BibT_eX]

[DOI]

Discret. Math., 2002

A note on reconfiguring tree linkages: trees can lock.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

Drawing Outer-Planar Graphs in O(n log n) Area.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 10th International Symposium, 2002

Searching for the center of a circle.

[BibT_eX]

[DOI]

Joseph Douglas Horton

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

Drawing k2, n: A lower bound.

[BibT_eX]

[DOI]

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

Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles.

[BibT_eX]

[DOI]

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

2001

1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2001

Efficient Algorithms for Petersen's Matching Theorem.

[BibT_eX]

[DOI]

J. Algorithms, 2001

Locked and Unlocked Polygonal Chains in Three Dimensions.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2001

The Complexity of Clickomania

[BibT_eX]

[DOI]

CoRR, 2001

The DFS-heuristic for orthogonal graph drawing.

[BibT_eX]

[DOI]

Comput. Geom., 2001

Linear reductions of maximum matching.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Orthogonal Drawings with Few Layers.

[BibT_eX]

[DOI]

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

Graph-Drawing Contest Report.

[BibT_eX]

[DOI]

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

2000

The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing.

[BibT_eX]

[DOI]

Brendan Madden

Ioannis G. Tollis

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

Simplifying Flow Networks.

[BibT_eX]

[DOI]

Brona Brejová

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

1-bend 3-D orthogonal drawings: two open problems solved.

[BibT_eX]

[DOI]

Proceedings of the 12th Canadian Conference on Computational Geometry, 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

Convexifying Monotone Polygons.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Rectangle of Influence Drawings of Graphs without Filled 3-Cycles.

[BibT_eX]

[DOI]

Anna Bretscher

Henk Meijer

Proceedings of the Graph Drawing, 7th International Symposium, 1999

1998

New Lower Bounds For Orthogonal Drawings.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 1998

Relating Bends and Size in Orthogonal Graph Drawings.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

A better heuristic for orthogonal graph drawings.

[BibT_eX]

[DOI]

Goos Kant

Comput. Geom., 1998

Drawing Planar Partitions II: HH-Drawings.

[BibT_eX]

[DOI]

Petra Mutzel

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

Graph Multidrawing: Finding Nice Drawings Without Defining Nice.

[BibT_eX]

[DOI]

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

Three Approaches to 3D-Orthogonal Box-Drawings.

[BibT_eX]

[DOI]

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

Drawing Planar Partitions I: LL-Drawings and LH-Drawings.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

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

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

Hiding disks in folded 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

On Triangulating Planar Graphs Under the Four-Connectivity Constraint.

[BibT_eX]

[DOI]

Goos Kant

Algorithmica, 1997

Orthogonal 3-D Graph Drawing.

[BibT_eX]

[DOI]

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

Area-Efficient Static and Incremental Graph Drawings.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1997

1996

Optimal Orthogonal Drawings of Triconnected Plane Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1996

Optimal Orthogonal Drawings of Connected Plane Graphs.

[BibT_eX]

[DOI]

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

Improved Orthogonal Drawings of 3-graphs.

[BibT_eX]

[DOI]

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

1995

New Lower Bounds for Orthogonal Graph Drawings.

[BibT_eX]

[DOI]