David Eppstein

Algorithmica, September, 2024

Three-Dimensional Graph Products with Unbounded Stack-Number.

[BibT_eX]

[DOI]

Discret. Comput. Geom., June, 2024

Product Structure Extension of the Alon-Seymour-Thomas Theorem.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2024

On the Biplanarity of Blowups.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2024

Computational Complexities of Folding.

[BibT_eX]

[DOI]

CoRR, 2024

Maintaining Light Spanners via Minimal Updates.

[BibT_eX]

[DOI]

CoRR, 2024

Non-Euclidean Erdős-Anning Theorems.

[BibT_eX]

[DOI]

CoRR, 2024

Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature.

[BibT_eX]

[DOI]

Abraham M. Illickan

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

Noncrossing Longest Paths and Cycles.

[BibT_eX]

[DOI]

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

2023

Angles of arc-polygons and Lombardi drawings of cacti.

[BibT_eX]

[DOI]

Martha C. Osegueda

Comput. Geom., June, 2023

A Stronger Lower Bound on Parametric Minimum Spanning Trees.

[BibT_eX]

[DOI]

Algorithmica, June, 2023

The Complexity of Iterated Reversible Computation.

[BibT_eX]

[DOI]

TheoretiCS, 2023

Quasipolynomiality of the Smallest Missing Induced Subgraph.

[BibT_eX]

[DOI]

Virginia Vassilevska Williams

Andrea Lincoln

J. Graph Algorithms Appl., 2023

Geometric dominating sets - a minimum version of the No-Three-In-Line Problem.

[BibT_eX]

[DOI]

Oswin Aichholzer

Eva-Maria Hainzl

Comput. Geom., 2023

Locked and Unlocked Smooth Embeddings of Surfaces.

[BibT_eX]

[DOI]

Comput. Geom. Topol., 2023

Lower Bounds for Non-adaptive Shortest Path Relaxation.

[BibT_eX]

[DOI]

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

Rapid Mixing for the Hardcore Glauber Dynamics and Other Markov Chains in Bounded-Treewidth Graphs.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Improved Mixing for the Convex Polygon Triangulation Flip Walk.

[BibT_eX]

[DOI]

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

Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs.

[BibT_eX]

[DOI]

Alvin Chiu

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

Geometric Graphs with Unbounded Flip-Width.

[BibT_eX]

Rose McCarty

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

A Parameterized Algorithm for Flat Folding.

[BibT_eX]

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

On the complexity of embedding in graph products.

[BibT_eX]

Therese Biedl

Torsten Ueckerdt

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

2022

On the treewidth of Hanoi graphs.

[BibT_eX]

[DOI]

William Maxwell

Theor. Comput. Sci., 2022

Geometric Dominating Sets.

[BibT_eX]

[DOI]

Oswin Aichholzer

Eva-Maria Hainzl

CoRR, 2022

Ununfoldable polyhedra with 6 vertices or 6 faces.

[BibT_eX]

[DOI]

Comput. Geom., 2022

Stack-Number is Not Bounded by Queue-Number.

[BibT_eX]

[DOI]

Comb., 2022

Distributed Construction of Lightweight Spanners for Unit Ball Graphs.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Brief Announcement: Distributed Lightweight Spanner Construction for Unit Ball Graphs in Doubling Metrics.

[BibT_eX]

[DOI]

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Finding Relevant Points for Nearest-Neighbor Classification.

[BibT_eX]

[DOI]

Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

Orthogonal Dissection into Few Rectangles.

[BibT_eX]

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

Reflections in an Octagonal Mirror Maze.

[BibT_eX]

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

2021

NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs.

[BibT_eX]

[DOI]

Vijay V. Vazirani

SIAM J. Comput., 2021

Cubic planar graphs that cannot be drawn on few lines.

[BibT_eX]

[DOI]

J. Comput. Geom., 2021

Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2021

On Polyhedral Realization with Isosceles Triangles.

[BibT_eX]

[DOI]

Graphs Comb., 2021

Optimal Spanners for Unit Ball Graphs in Doubling Metrics.

[BibT_eX]

[DOI]

CoRR, 2021

C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width.

[BibT_eX]

[DOI]

Algorithmica, 2021

The Graphs of Stably Matchable Pairs.

[BibT_eX]

[DOI]

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

Limitations on Realistic Hyperbolic Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes.

[BibT_eX]

[DOI]

Siddharth Gupta

Elham Havvaei

Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

On the Edge Crossings of the Greedy Spanner.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Minor-Closed Graph Classes with Bounded Layered Pathwidth.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Approximate greedy clustering and distance selection for graph metrics.

[BibT_eX]

[DOI]

Sariel Har-Peled

Anastasios Sidiropoulos

J. Comput. Geom., 2020

Stable-matching Voronoi diagrams: Combinatorial complexity and algorithms.

[BibT_eX]

[DOI]

J. Comput. Geom., 2020

Face flips in origami tessellations.

[BibT_eX]

[DOI]

J. Comput. Geom., 2020

Grid Peeling and the Affine Curve-Shortening Flow.

[BibT_eX]

[DOI]

Sariel Har-Peled

Gabriel Nivasch

Exp. Math., 2020

Counting Polygon Triangulations is Hard.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2020

Treetopes and Their Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2020

Existence and Hardness of Conveyor Belts.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Joshua P. Swanson

Electron. J. Comb., 2020

Parameterized Leaf Power Recognition via Embedding into Graph Products.

[BibT_eX]

[DOI]

Elham Havvaei

Algorithmica, 2020

Simplifying Activity-On-Edge Graphs.

[BibT_eX]

[DOI]

Elham Havvaei

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

Low-Stretch Spanning Trees of Graphs with Bounded Width.

[BibT_eX]

[DOI]

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

Dynamic Products of Ranks.

[BibT_eX]

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

Some Polycubes Have No Edge Zipper Unfolding.

[BibT_eX]

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

Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra.

[BibT_eX]

Erik D. Demaine

Martin L. Demaine

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

New Results in Sona Drawing: Hardness and TSP Separation.

[BibT_eX]

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

2019

Realization and connectivity of the graphs of origami flat foldings.

[BibT_eX]

[DOI]

J. Comput. Geom., 2019

Covering many points with a small-area box.

[BibT_eX]

[DOI]

J. Comput. Geom., 2019

Some Polycubes Have No Edge-Unzipping.

[BibT_eX]

[DOI]

CoRR, 2019

Euclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor Chains.

[BibT_eX]

[DOI]

CoRR, 2019

Maximum Plane Trees in Multipartite Geometric Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2019

Track Layouts, Layered Path Decompositions, and Leveled Planarity.

[BibT_eX]

[DOI]

Algorithmica, 2019

Reconfiguring Undirected Paths.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs.

[BibT_eX]

[DOI]

Vijay V. Vazirani

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time.

[BibT_eX]

[DOI]

Bruce A. Reed

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Tracking Paths in Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Algorithms and Computation, 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

2018

The Parametric Closure Problem.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Planar and poly-arc Lombardi drawings.

[BibT_eX]

[DOI]

J. Comput. Geom., 2018

Flat foldings of plane graphs with prescribed angles and edge lengths.

[BibT_eX]

[DOI]

J. Comput. Geom., 2018

Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2018

The Effect of Planarization on Width.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2018

Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2018

Parameterized Complexity of 1-Planarity.

[BibT_eX]

[DOI]

Sergio Cabello

J. Graph Algorithms Appl., 2018

Folding Polyominoes into (Poly)Cubes.

[BibT_eX]

[DOI]

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

NC Algorithms for Perfect Matching and Maximum Flow in One-Crossing-Minor-Free Graphs.

[BibT_eX]

[DOI]

Vijay V. Vazirani

CoRR, 2018

On the Planar Split Thickness of Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2018

From Discrepancy to Majority.

[BibT_eX]

[DOI]

Algorithmica, 2018

Spanning Trees in Multipartite Geometric Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2018

Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity.

[BibT_eX]

[DOI]

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

Reactive Proximity Data Structures for Graphs.

[BibT_eX]

[DOI]

Nil Mamano

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

The Parameterized Complexity of Finding Point Sets with Hereditary Properties.

[BibT_eX]

[DOI]

Daniel Lokshtanov

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

Optimally Sorting Evolving Data.

[BibT_eX]

[DOI]

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

Making Change in 2048.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

Faster Evaluation of Subtraction Games.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

Geometric Fingerprint Recognition via Oriented Point-Set Pattern Matching.

[BibT_eX]

[DOI]

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

Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2017

Structure of Graphs with Locally Restricted Crossings.

[BibT_eX]

[DOI]

Vida Dujmovic

David R. Wood

SIAM J. Discret. Math., 2017

Maximizing the sum of radii of disjoint balls or disks.

[BibT_eX]

[DOI]

J. Comput. Geom., 2017

Rooted Cycle Bases.

[BibT_eX]

[DOI]

J. Michael McCarthy

Brian E. Parrish

J. Graph Algorithms Appl., 2017

Brief Announcement: Using Multi-Level Parallelism and 2-3 Cuckoo Filters for Set Intersection Queries and Sparse Boolean Matrix Multiplication.

[BibT_eX]

[DOI]

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection.

[BibT_eX]

[DOI]

Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

K-Best Solutions of MSO Problems on Tree-Decomposable Graphs.

[BibT_eX]

[DOI]

Denis Kurz

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

Algorithms for Stable Matching and Clustering in a Grid.

[BibT_eX]

[DOI]

Nil Mamano

Proceedings of the Combinatorial Image Analysis - 18th International Workshop, 2017

Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Defining Equitable Geographic Districts in Road Networks via Stable Matching.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2017

Crossing Patterns in Nonplanar Road Networks.

[BibT_eX]

[DOI]

Siddharth Gupta

Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2017

Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count.

[BibT_eX]

[DOI]

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

Forbidden Configurations in Discrete Geometry.

[BibT_eX]

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

2016

k-Best Enumeration.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Strict confluent drawing.

[BibT_eX]

[DOI]

J. Comput. Geom., 2016

Adjacency-preserving spatial treemaps.

[BibT_eX]

[DOI]

J. Comput. Geom., 2016

Rigid origami vertices: conditions and forcing sets.

[BibT_eX]

[DOI]

J. Comput. Geom., 2016

Simple Recognition of Halin Graphs and Their Generalizations.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2016

Folding a paper strip to minimize thickness.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2016

Convex-Arc Drawings of Pseudolines.

[BibT_eX]

[DOI]

CoRR, 2016

Distance-sensitive planar point location.

[BibT_eX]

[DOI]

Comput. Geom., 2016

Cuckoo Filter: Simplification and Analysis.

[BibT_eX]

[DOI]

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Models and Algorithms for Graph Watermarking.

[BibT_eX]

[DOI]

Proceedings of the Information Security - 19th International Conference, 2016

Track Layout Is Hard.

[BibT_eX]

[DOI]

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

All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs.

[BibT_eX]

[DOI]

Amir Nayyeri

Christian Wulff-Nilsen

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

Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection.

[BibT_eX]

[DOI]

Proceedings of the 16th Workshop on Algorithmic Approaches for Transportation Modelling, 2016

2015

Erratum to: Antimatroids and Balanced Pairs.

[BibT_eX]

[DOI]

Veit Wiechert

Order, 2015

Metric Dimension Parameterized by Max Leaf Number.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Planar Induced Subgraphs of Sparse Graphs.

[BibT_eX]

[DOI]

Pingan Zhu

J. Graph Algorithms Appl., 2015

The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Improved Grid Map Layout by Point Set Matching.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2015

K-Best Enumeration.

[BibT_eX]

[DOI]

Bull. EATCS, 2015

Ramified Rectilinear Polygons: Coordinatization by Dendrons.

[BibT_eX]

[DOI]

Hans-Jürgen Bandelt

Victor Chepoi

Discret. Comput. Geom., 2015

D3-Reducible Graphs.

[BibT_eX]

[DOI]

CoRR, 2015

Contact Representations of Sparse Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2015

Near-linear-time deterministic plane Steiner spanners for well-spaced point sets.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Contact Graphs of Circular Arcs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Minimum Forcing Sets for Miura Folding Patterns.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Genus, Treewidth, and Local Crossing Number.

[BibT_eX]

[DOI]

Vida Dujmovic

David R. Wood

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

Confluent Orthogonal Drawings of Syntax Diagrams.

[BibT_eX]

[DOI]

David A. Brown

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

Finding All Maximal Subsequences with Hereditary Properties.

[BibT_eX]

[DOI]

Drago Bokal

Sergio Cabello

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

2014

Antimatroids and Balanced Pairs.

[BibT_eX]

[DOI]

Order, 2014

Steinitz Theorems for Simple Orthogonal Polyhedra.

[BibT_eX]

[DOI]

J. Comput. Geom., 2014

Drawing Arrangement Graphs In Small Grids, Or How To Play Planarity.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

Superpatterns and Universal Point Sets.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

Universal Point Sets for Drawing Planar Graphs with Circular Arcs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

Diamond-kite adaptive quadrilateral meshing.

[BibT_eX]

[DOI]

Eng. Comput., 2014

A Möbius-Invariant Power Diagram and Its Applications to Soap Bubbles and Planar Lombardi Drawing.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

ERGMs are Hard.

[BibT_eX]

[DOI]

William E. Devanny

CoRR, 2014

Grid Minors in Damaged Grids.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Linear-Time Algorithms for Proportional Apportionment.

[BibT_eX]

[DOI]

Zhanpeng Cheng

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Balanced Circle Packings for Planar Graphs.

[BibT_eX]

[DOI]

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

Small Superpatterns for Dominance Drawing.

[BibT_eX]

[DOI]

William E. Devanny

Proceedings of the 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, 2014

2013

Category-based routing in social networks: Membership dimension and the small-world phenomenon.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Confluent Hasse Diagrams.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2013

Optimal 3D Angular Resolution for Low-Degree Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2013

The Complexity of Bendless Three-Dimensional Orthogonal Graph Drawing.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2013

Flows in One-Crossing-Minor-Free Graphs.

[BibT_eX]

[DOI]

Erin W. Chambers

J. Graph Algorithms Appl., 2013

Listing All Maximal Cliques in Large Sparse Real-World Graphs.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2013

On 2-Site Voronoi Diagrams Under Geometric Distance Functions.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2013

Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

Drawing Trees with Perfect Angular Resolution and Polynomial Area.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

Combinatorial Pair Testing: Distinguishing Workers from Slackers.

[BibT_eX]

[DOI]

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

Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Fixed Parameter Tractability of Crossing Minimization of Almost-Trees.

[BibT_eX]

[DOI]

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

The graphs of planar soap bubbles.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Computational Geometry 2013, 2013

Set-Difference Range Queries.

[BibT_eX]

[DOI]

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

Universal Point Sets for Planar Graph Drawings with Circular Arcs.

[BibT_eX]

[DOI]

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

Projection, Decomposition, and Adaption of Learning Spaces.

[BibT_eX]

[DOI]

Proceedings of the Knowledge Spaces, Applications in Education, 2013

Learning Sequences: An Efficient Data Structure for Learning Spaces.

[BibT_eX]

[DOI]

Proceedings of the Knowledge Spaces, Applications in Education, 2013

2012

Extended dynamic subgraph statistics using h-index parameterized data structures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Area-Universal and Constrained Rectangular Layouts.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

The h-Index of a Graph and its Application to Dynamic Subgraph Statistics.

[BibT_eX]

[DOI]

Emma S. Spiro

J. Graph Algorithms Appl., 2012

Lombardi Drawings of Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2012

Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2012

Inapproximability of Orthogonal Compaction.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2012

UOBPRM: A uniformly distributed obstacle-based PRM.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2012

Diamond-Kite Meshes: Adaptive Quadrilateral Meshing and Orthogonal Circle Packing.

[BibT_eX]

[DOI]

Proceedings of the 21st International Meshing Roundtable, 2012

Planar Lombardi Drawings for Subcubic Graphs.

[BibT_eX]

[DOI]

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

On the Density of Maximal 1-Planar Graphs.

[BibT_eX]

[DOI]

Franz-Josef Brandenburg

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

Force-Directed Graph Drawing Using Social Gravity and Scaling.

[BibT_eX]

[DOI]

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

Solving Single-Digit Sudoku Subproblems.

[BibT_eX]

[DOI]

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

Near-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point Sets.

[BibT_eX]

[DOI]

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

Randomized Speedup of the Bellman-Ford Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics, 2012

2011

Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2011

Succinct Greedy Geometric Routing Using Hyperbolic Geometry.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2011

Optimally Fast Incremental Manhattan Plane Embedding and Planar Tight Span Construction.

[BibT_eX]

[DOI]

J. Comput. Geom., 2011

Optimal Angular Resolution for Face-Symmetric Drawings.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2011

Guest Editor's Foreword.

[BibT_eX]

[DOI]

Emden R. Gansner

J. Graph Algorithms Appl., 2011

Recognizing Partial Cubes in Quadratic Time.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2011

Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Full)

[BibT_eX]

[DOI]

CoRR, 2011

Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Short)

[BibT_eX]

[DOI]

CoRR, 2011

Privacy-Enhanced Methods for Comparing Compressed DNA Sequences

[BibT_eX]

[DOI]

Pierre Baldi

CoRR, 2011

The Fibonacci Dimension of a Graph.

[BibT_eX]

[DOI]

Sergio Cabello

Sandi Klavzar

Electron. J. Comb., 2011

Listing All Maximal Cliques in Large Sparse Real-World Graphs.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Tracking Moving Objects with Few Handovers.

[BibT_eX]

[DOI]

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

What's the difference?: efficient set reconciliation without prior context.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGCOMM 2011 Conference on Applications, 2011

Planar and Poly-arc Lombardi Drawings.

[BibT_eX]

[DOI]

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

Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings.

[BibT_eX]

[DOI]

Suresh Venkatasubramanian

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

2010

Questions answered. in theory.: http://cstheory.stackexchange.com/.

[BibT_eX]

[DOI]

SIGACT News, 2010

Combinatorics and Geometry of Finite and Infinite Squaregraphs.

[BibT_eX]

[DOI]

Hans-Jürgen Bandelt

Victor Chepoi

SIAM J. Discret. Math., 2010

Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings.

[BibT_eX]

[DOI]

SIAM J. Comput., 2010

Happy Endings for Flip Graphs.

[BibT_eX]

[DOI]

J. Comput. Geom., 2010

Approximate Weighted Farthest Neighbors and Minimum Dilation Stars.

[BibT_eX]

[DOI]

John Augustine

Discret. Math. Algorithms Appl., 2010

Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics

[BibT_eX]

[DOI]

CoRR, 2010

Densities of Minor-Closed Graph Families.

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

Paired Approximation Problems and Incompatible Inapproximabilities.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Planar Voronoi Diagrams for Sums of Convex Functions, Smoothed Distance and Dilation.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Symposium on Voronoi Diagrams in Science and Engineering, 2010

Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Regular Labelings and Geometric Structures.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Privacy-preserving data-oblivious geometric algorithms for geographic data.

[BibT_eX]

[DOI]

Roberto Tamassia

Proceedings of the 18th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2010

Cloning Voronoi Diagrams via Retroactive Data Structures.

[BibT_eX]

[DOI]

Matthew T. Dickerson

Proceedings of the Algorithms, 2010

Steinitz theorems for orthogonal polyhedra.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2010

Growth and Decay in Life-Like Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Game of Life Cellular Automata., 2010

2009

Approximate topological matching of quad meshes.

[BibT_eX]

[DOI]

Vis. Comput., 2009

All maximal independent sets and dynamic dominance for sparse graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2009

Squarepants in a tree: Sum of subtree clustering and hyperbolic pants decomposition.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2009

Testing bipartiteness of geometric intersection graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2009

Finding Large Clique Minors is Hard.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2009

Edges and switches, tunnels and bridges.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Curvature Aware Fundamental Cycles.

[BibT_eX]

[DOI]

Pablo Diaz-Gutierrez

Meenakshisundaram Gopi

Comput. Graph. Forum, 2009

Graph-Theoretic Solutions to Computational Geometry Problems.

[BibT_eX]

[DOI]

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

Optimal Embedding into Star Metrics.

[BibT_eX]

[DOI]

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

The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics.

[BibT_eX]

[DOI]

Emma S. Spiro

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

Orientation-Constrained Rectangular Layouts.

[BibT_eX]

[DOI]

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

On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem.

[BibT_eX]

[DOI]

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

Self-overlapping curves revisited.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Linear-time algorithms for geometric graphs with sublinearly many crossings.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Going off-road: transversal complexity in road networks.

[BibT_eX]

[DOI]

Lowell Trott

Proceedings of the 17th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2009

Area-universal rectangular layouts.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

Animating a continuous family of two-site Voronoi diagrams (and a proof of a bound on the number of regions).

[BibT_eX]

[DOI]

Matthew T. Dickerson

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008

Upright-Quad Drawing of st-Planar Learning Spaces.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2008

Skip Quadtrees: Dynamic Data Structures for Multidimensional Point Sets.

[BibT_eX]

[DOI]

Jonathan Z. Sun

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

Algorithms for media.

[BibT_eX]

[DOI]

Jean-Claude Falmagne

Discret. Appl. Math., 2008

Dilation, smoothed distance, and minimization diagrams of convex functions

[BibT_eX]

[DOI]

CoRR, 2008

Learning Sequences

[BibT_eX]

[DOI]

CoRR, 2008

Motorcycle Graphs: Canonical Quad Mesh Partitioning.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2008

Approximate topological matching of quadrilateral meshes.

[BibT_eX]

[DOI]

Proceedings of the 2008 International Conference on Shape Modeling and Applications (SMI 2008), 2008

Studying (non-planar) road networks through an algorithmic lens.

[BibT_eX]

[DOI]

Proceedings of the 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2008

Succinct Greedy Graph Drawing in the Hyperbolic Plane.

[BibT_eX]

[DOI]

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

Isometric Diamond Subgraphs.

[BibT_eX]

[DOI]

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

The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing.

[BibT_eX]

[DOI]

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

Straight Skeletons of Three-Dimensional Polyhedra.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2008

Media theory - interdisciplinary applied mathematics.

[BibT_eX]

Jean-Claude Falmagne

Sergei Ovchinnikov

Springer, ISBN: 978-3-540-71696-9, 2008

2007

Interconnect Criticality-Driven Delay Relaxation.

[BibT_eX]

[DOI]

Love Singhal

Elaheh Bozorgzadeh

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2007

Foreword to special issue on SODA 2002.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

Deterministic sampling and range counting in geometric data streams.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

The Traveling Salesman Problem for Cubic Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2007

On Verifying and Engineering the Well-gradedness of a Union-closed Family

[BibT_eX]

[DOI]

Jean-Claude Falmagne

Hasan Uzun

CoRR, 2007

Minimum dilation stars.

[BibT_eX]

[DOI]

Comput. Geom., 2007

Drawings of planar graphs with few slopes and segments.

[BibT_eX]

[DOI]

Comput. Geom., 2007

Confluent Layered Drawings.

[BibT_eX]

[DOI]

Jeremy Yu Meng

Algorithmica, 2007

Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton's Identities and Invertible Bloom Filters.

[BibT_eX]

[DOI]

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

Guard placement for efficient point-in-polygon proofs.

[BibT_eX]

[DOI]

Nodari Sitchinava

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

2006

Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2006

The Effect of Faults on Network Expansion.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2006

Guard Placement For Wireless Localization

[BibT_eX]

[DOI]

Nodari Sitchinava

CoRR, 2006

Cubic Partial Cubes from Simplicial Arrangements.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems.

[BibT_eX]

[DOI]

Josiah Carlson

Proceedings of the Algorithm Theory, 2006

Single Triangle Strip and Loop on Manifolds with Boundaries.

[BibT_eX]

[DOI]

Pablo Diaz-Gutierrez

M. Gopi

Proceedings of the 19th Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2006), 2006

Upright-Quad Drawing of st -Planar Learning Spaces.

[BibT_eX]

[DOI]

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

Choosing Colors for Geometric Graphs Via Color Space Embeddings.

[BibT_eX]

[DOI]

Michael B. Dillencourt

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

Trees with Convex Faces and Optimal Angles.

[BibT_eX]

[DOI]

Josiah Carlson

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

2005

Memory reference caching for activity reduction on address buses.

[BibT_eX]

[DOI]

Tony Givargis

Microprocess. Microsystems, 2005

Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2005

3-coloring in time O(1.3289n).

[BibT_eX]

[DOI]

Richard Beigel

J. Algorithms, 2005

The lattice dimension of a graph.

[BibT_eX]

[DOI]

Eur. J. Comb., 2005

Nonrepetitive Paths and Cycles in Graphs with Application to Sudoku

[BibT_eX]

[DOI]

CoRR, 2005

Hinged dissection of polyominoes and polyforms.

[BibT_eX]

[DOI]

Comput. Geom., 2005

Improved Combinatorial Group Testing for Real-World Problem Sizes.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Skip-webs: efficient distributed data structures for multi-dimensional data sets.

[BibT_eX]

[DOI]

Lars Arge

Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

Delta-Confluent Drawings.

[BibT_eX]

[DOI]

Jeremy Yu Meng

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

The skip quadtree: a simple dynamic data structure for multidimensional data.

[BibT_eX]

[DOI]

Jonathan Z. Sun

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004

Fast Approximation of Centrality.

[BibT_eX]

[DOI]

Joseph Wang

J. Graph Algorithms Appl., 2004

Quasiconvex Programming

[BibT_eX]

[DOI]

CoRR, 2004

Tiling space and slabs with acute tetrahedra.

[BibT_eX]

[DOI]

John M. Sullivan

Alper Üngör

Comput. Geom., 2004

Single-Strip Triangulation of Manifolds with Arbitrary Topology.

[BibT_eX]

[DOI]

M. Gopi

Comput. Graph. Forum, 2004

Quasiconvex analysis of backtracking algorithms.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Algorithms for Drawing Media.

[BibT_eX]

[DOI]

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

The geometric thickness of low degree graphs.

[BibT_eX]

[DOI]

Christian A. Duncan

Stephen G. Kobourov

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

Lazy Algorithms for Dynamic Closest Pair with Arbitary Distance Measures.

[BibT_eX]

Jean Cardinal

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003

Setting Parameters by Example.

[BibT_eX]

[DOI]

SIAM J. Comput., 2003

Small Maximal Independent Sets and Faster Exact Graph Coloring.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2003

Guest Editor's Foreword.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2003

Ununfoldable polyhedra with convex faces.

[BibT_eX]

[DOI]

Comput. Geom., 2003

Dynamic generators of topologically embedded graphs.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Möbius-invariant natural neighbor interpolation.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Selected Open Problems in Graph Drawing.

[BibT_eX]

[DOI]

Franz-Josef Brandenburg

Proceedings of the Graph Drawing, 11th International Symposium, 2003

Optimized color gamuts for tiled displays.

[BibT_eX]

[DOI]

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

2002

The minimum expectation selection problem.

[BibT_eX]

[DOI]

George S. Lueker

Random Struct. Algorithms, 2002

Flipping Cubical Meshes.

[BibT_eX]

[DOI]

Jeff Erickson

Eng. Comput., 2002

Multivariate Regression Depth.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2002

A steady state model for graph power laws

[BibT_eX]

[DOI]

Joseph Wang

CoRR, 2002

Moebius-Invariant Natural Neighbor Interpolation

[BibT_eX]

[DOI]

CoRR, 2002

Beta-skeletons have unbounded dilation.

[BibT_eX]

[DOI]

Comput. Geom., 2002

Algorithms for Coloring Quadtrees.

[BibT_eX]

[DOI]

Brad L. Hutchings

Algorithmica, 2002

A Steady State Model for Graph Power Law.

[BibT_eX]

[DOI]

Joseph Wang

Proceedings of the Second International Workshop on Web Dynamics, 2002

Separating Thickness from Geometric Thickness.

[BibT_eX]

[DOI]

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

Vertex-unfoldings of simplicial manifolds.

[BibT_eX]

[DOI]

Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

2001

The distribution of loop lengths in graphical models for turbo decoding.

[BibT_eX]

[DOI]

Xianping Ge

Padhraic Smyth

IEEE Trans. Inf. Theory, 2001

Tangent Spheres and Triangle Centers.

[BibT_eX]

[DOI]

Am. Math. Mon., 2001

Separating Geometric Thickness from Book Thickness

[BibT_eX]

[DOI]

CoRR, 2001

Vertex-Unfoldings of Simplicial Polyhedra

[BibT_eX]

[DOI]

CoRR, 2001

Hinged Kite Mirror Dissection

[BibT_eX]

[DOI]

CoRR, 2001

Optimal Moebius Transformations for Information Visualization and Meshing

[BibT_eX]

[DOI]

CoRR, 2001

Optimization over Zonotopes and Training Support Vector Machines.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Optimal Möbius Transformations for Information Visualization and Meshing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Internet packet filter management and rectangle geometry.

[BibT_eX]

[DOI]

S. Muthukrishnan

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Flipping Cubical Meshes.

[BibT_eX]

[DOI]

Proceedings of the 10th International Meshing Roundtable, 2001

2000

Clustering for faster network simplex pivots.

[BibT_eX]

[DOI]

Networks, 2000

Geometric Thickness of Complete Graphs.

[BibT_eX]

[DOI]

Michael B. Dillencourt

J. Graph Algorithms Appl., 2000

Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2000

Incremental and Decremental Maintenance of Planar Width.

[BibT_eX]

[DOI]

J. Algorithms, 2000

Quadrilateral Meshing by Circle Packing.

[BibT_eX]

[DOI]

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

Regression Depth and Center Points.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2000

One-Dimensional Peg Solitaire, and Duotaire

[BibT_eX]

[DOI]

Cristopher Moore

CoRR, 2000

One-Dimensional Peg Solitaire

[BibT_eX]

[DOI]

Cristopher Moore

CoRR, 2000

3-Coloring in Time O(1.3289^n)

[BibT_eX]

[DOI]

Richard Beigel

CoRR, 2000

Computing the Depth of a Flat

[BibT_eX]

[DOI]

CoRR, 2000

Phutball Endgames are Hard

[BibT_eX]

[DOI]

Erik D. Demaine

Martin L. Demaine

CoRR, 2000

Searching for Spaceships

[BibT_eX]

[DOI]

CoRR, 2000

Diameter and Treewidth in Minor-Closed Graph Families.

[BibT_eX]

[DOI]

Algorithmica, 2000

Spanning Trees and Spanners.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Computational Geometry, 2000

1999

Subgraph Isomorphism in Planar Graphs and Related Problems.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 1999

PREFACE: Festschrift for Zvi Galil.

[BibT_eX]

[DOI]

Giuseppe F. Italiano

J. Complex., 1999

Optimal Point Placement for Mesh Smoothing.

[BibT_eX]

[DOI]

Nina Amenta

J. Algorithms, 1999

Parallel Construction of Quadtrees and Quality Triangulations.

[BibT_eX]

[DOI]

Shang-Hua Teng

Int. J. Comput. Geom. Appl., 1999

Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions.

[BibT_eX]

[DOI]

Jeff Erickson

Discret. Comput. Geom., 1999

The Distribution of Cycle Lengths in Graphical Models for Iterative Decoding

[BibT_eX]

[DOI]

Xianping Ge

Padhraic Smyth

CoRR, 1999

Emerging Challenges in Computational Topology

[BibT_eX]

[DOI]

CoRR, 1999

Linear complexity hexahedral mesh generation.

[BibT_eX]

[DOI]

Comput. Geom., 1999

Shortest Paths in an Arrangement with k Line Orientations.

[BibT_eX]

[DOI]

David Hart

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

Hinged dissections of polyominoes and polyforms.

[BibT_eX]

[DOI]

Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

Ununfoldable polyhedra.

[BibT_eX]

[DOI]

Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

Dynamic Graph Algorithms.

[BibT_eX]

[DOI]

Zvi Galil

Giuseppe F. Italiano

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998

Separator-Based Sparsification II: Edge and Vertex Connectivity.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Finding the k Shortest Paths.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Geometric Lower Bounds for Parametric Matroid Optimization.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1998

The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction.

[BibT_eX]

[DOI]

Nina Amenta

Graph. Model. Image Process., 1998

On triangulating three-dimensional polygons.

[BibT_eX]

[DOI]

Gill Barequet

Comput. Geom., 1998

Parametric and Kinetic Minimum Spanning Trees.

[BibT_eX]

[DOI]

Pankaj K. Agarwal

Leonidas J. Guibas

Monika Rauch Henzinger

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997

Choosing Subsets with Maximum Weighted Average.

[BibT_eX]

[DOI]

J. Algorithms, 1997

Minimum Range Balanced Cuts via Dynamic Subset Sums.

[BibT_eX]

[DOI]

J. Algorithms, 1997

Sparsification - a technique for speeding up dynamic graph algorithms.

[BibT_eX]

[DOI]

J. ACM, 1997

Dynamic Connectivity in Digital Images.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Faster Circle Packing with Application to Non-Obtuse Triangulation.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1997

On Nearest-Neighbor Graphs.

[BibT_eX]

[DOI]

Mike Paterson

F. Frances Yao

Discret. Comput. Geom., 1997

Faster Geometric K-point MST Approximation.

[BibT_eX]

[DOI]

Comput. Geom., 1997

An Efficient Algorithm for Shortest Paths in Vertical and Horizontal Segments.

[BibT_eX]

[DOI]

David Hart

Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Faster Construction of Planar Two-Centers.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996

Computing the Discrepancy with Applications to Supersampling Patterns.

[BibT_eX]

[DOI]

David P. Dobkin

Don P. Mitchell

ACM Trans. Graph., 1996

Using Sparsification for Parametric Minimum Spanning Tree Problems.

[BibT_eX]

David Fernández-Baca

Giora Slutzki

Nord. J. Comput., 1996

Separator Based Sparsification. I. Planary Testing and Minimum Spanning Trees.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1996

Approximating center points with iterative Radon points.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1996

Average Case Analysis of Dynamic Geometric Optimization.

[BibT_eX]

[DOI]

Comput. Geom., 1996

1995

Triangulating polygons without large angles.

[BibT_eX]

[DOI]

David P. Dobkin

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

A Deterministic Linear Time Algorithm for Geometric Separators and its Applications.

[BibT_eX]

[DOI]

Gary L. Miller

Shang-Hua Teng

Fundam. Informaticae, 1995

3-Coloring in time O(1.3446n): A no-MIS Algorithm

[BibT_eX]

[DOI]

Richard Beigel

Electron. Colloquium Comput. Complex., 1995

Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1995

Algorithms for Proximity Problems in Higher Dimensions.

[BibT_eX]

[DOI]

Comput. Geom., 1995

Asymptotic Speed-Ups in Constructive Solid Geometry.

[BibT_eX]

[DOI]

Algorithmica, 1995

Dihedral Bounds for Mesh Generation in High Dimensions.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

The Centroid of Points with Approximate Weights.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1995

1994

Provably Good Mesh Generation.

[BibT_eX]

[DOI]

John R. Gilbert

J. Comput. Syst. Sci., 1994

Offline Algorithms for Dynamic Minimum Spanning Tree Problems.

[BibT_eX]

[DOI]

J. Algorithms, 1994

Arboricity and Bipartite Subgraph Listing Algorithms.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

Tree-weighted neighbors and geometric k smallest spanning trees.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1994

Iterated Nearest Neighbors and Finding Minimal Polytopes.

[BibT_eX]

[DOI]

Jeff Erickson

Discret. Comput. Geom., 1994

Approximating the Minimum Weight Steiner Triangulation.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1994

On the Number of Minimal 1-Steiner Trees.

[BibT_eX]

[DOI]

Boris Aronov

Discret. Comput. Geom., 1994

Visibility with a Moving Point of View.

[BibT_eX]

[DOI]

Algorithmica, 1994

1993

Connectivity, graph minors, and subgraph multiplicity.

[BibT_eX]

[DOI]

J. Graph Theory, 1993

Improved Bounds for Intersecting Triangles and Halving Planes.

[BibT_eX]

J. Comb. Theory A, 1993

Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph.

[BibT_eX]

J. Algorithms, 1993

Edge Insertion for Optimal Triangulations.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1993

Separator based sparsification for dynamic planar graph algorithms.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Computing the Discrepancy.

[BibT_eX]

[DOI]

David P. Dobkin

Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

Approximating Center Points with Iterated Radon Points.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

Worst-Case Bounds for Subadditive Geometric Graphs.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

1992

Parallel Recognition of Series-Parallel Graphs

[BibT_eX]

[DOI]

Inf. Comput., May, 1992

Simultaneous Strong Separations of Probabilistic and Unambiguous Complexity Classes.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1992

Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph.

[BibT_eX]

[DOI]

J. Algorithms, 1992

Sparse Dynamic Programming II: Convex and Concave Cost Functions.

[BibT_eX]

[DOI]

J. ACM, 1992

Sparse Dynamic Programming I: Linear Cost Functions.

[BibT_eX]

[DOI]

J. ACM, 1992

Dynamic Three-Dimensional Linear Programming.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1992

Erratum: Polynomial-size nonobtuse triangulation of polygons.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1992

Polynomial-size nonobtuse triangulation of polygons.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1992

Finding Minimum Area k-gons.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1992

Finding the k Smallest Spanning Trees.

[BibT_eX]

[DOI]

BIT, 1992

New Algorithms for Minimum Area k-gons.

[BibT_eX]

[DOI]

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

Approximating the Minimum Weight Triangulation.

[BibT_eX]

[DOI]

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

Edge Insertion for Optional Triangulations.

[BibT_eX]

[DOI]

Proceedings of the LATIN '92, 1992

Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees

[BibT_eX]

[DOI]

Pankaj K. Agarwal

Jirí Matousek

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

Planar Orientations with Low Out-degree and Compaction of Adjacency Matrices.

[BibT_eX]

[DOI]

Marek Chrobak

Theor. Comput. Sci., 1991

The expected extremes in a Delaunay triangulation.

[BibT_eX]

[DOI]

F. Frances Yao

Int. J. Comput. Geom. Appl., 1991

The Farthest Point Delaunay Triangulation Minimizes Angles.

[BibT_eX]

[DOI]

Comput. Geom., 1991

Efficient Sequential and Parallel Algorithms for Computing Recovery Points in Trees and Paths.

[BibT_eX]

[DOI]

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

1990

Reset Sequences for Monotonic Automata.

[BibT_eX]

[DOI]

SIAM J. Comput., 1990

Sequence Comparison with Mixed Convex and Concave Costs.

[BibT_eX]

[DOI]

J. Algorithms, 1990

Equipartitions of graphs.

[BibT_eX]

[DOI]

Joan Feigenbaum

Chung-Lun Li

Discret. Math., 1990

Finding the k Smallest Spanning Trees.

[BibT_eX]

[DOI]

Proceedings of the SWAT 90, 1990

Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph.

[BibT_eX]

[DOI]

Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

Sparse Dynamic Programming.

[BibT_eX]

[DOI]

Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

Horizon Theorems for Lines and Polygons.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry: Papers from the DIMACS Special Year, 1990

1989

Parallel Algorithmic Techniques for Combinatorial Computation.

[BibT_eX]

[DOI]

Zvi Galil

Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1988

Reset Sequences for Finite Automata with Application to Design of Parts Orienters.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

Speeding up Dynamic Programming

[BibT_eX]

[DOI]

Zvi Galil

Raffaele Giancarlo

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

1985

A Heuristic Approach to Program Inversion.

[BibT_eX]

[DOI]