| Publication | Date of Publication | Type |
|---|
| Setting parameters by example | 2026-05-06 | Paper |
| On the edge crossings of the greedy spanner | 2026-04-27 | Paper |
Non-Euclidean Erdős-Anning theorems
Journal of Computational Geometry | 2026-04-23 | Paper |
Noncrossing longest paths and cycles
Graphs and Combinatorics | 2026-01-29 | Paper |
| Geodesic paths passing through all faces on a polyhedron | 2026-01-28 | Paper |
What is \dots{} treewidth?
Notices of the American Mathematical Society | 2025-12-05 | Paper |
Princ-wiki-a mathematica: Wikipedia editing and mathematics
Notices of the American Mathematical Society | 2025-12-02 | Paper |
| Parametric and kinetic minimum spanning trees | 2025-10-29 | Paper |
On the complexity of embedding in graph products
CGT. Computing in Geometry and Topology | 2025-10-21 | Paper |
| Drawing planar graphs and 1-planar graphs using cubic Bézier curves with bounded curvature | 2025-10-07 | Paper |
| Noncrossing longest paths and cycles | 2025-10-07 | Paper |
| Rapid mixing for the hardcore Glauber dynamics and other Markov chains in bounded-treewidth graphs | 2025-07-24 | Paper |
The widths of strict outerconfluent graphs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2025-05-07 | Paper |
Orthogonal dissection into few rectangles
Discrete & Computational Geometry | 2025-01-14 | Paper |
| Improved mixing for the convex polygon triangulation flip walk | 2024-11-14 | Paper |
On the biplanarity of blowups
Journal of Graph Algorithms and Applications | 2024-11-12 | Paper |
| Non-crossing Hamiltonian paths and cycles in output-polynomial time | 2024-10-16 | Paper |
| Manipulating weights to improve stress-graph drawings of 3-connected planar graphs | 2024-10-14 | Paper |
Non-crossing Hamiltonian paths and cycles in output-polynomial time
Algorithmica | 2024-10-07 | Paper |
Product structure extension of the Alon-Seymour-Thomas theorem
SIAM Journal on Discrete Mathematics | 2024-07-16 | Paper |
The complexity of iterated reversible computation
TheoretiCS | 2024-07-03 | Paper |
| Finding relevant points for nearest-neighbor classification | 2024-05-14 | Paper |
| Multifold tiles of polyominoes and convex lattice polygons | 2024-04-09 | Paper |
Lower bounds for non-adaptive shortest path relaxation
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Locked and unlocked smooth embeddings of surfaces
(available as arXiv preprint) | 2023-12-16 | Paper |
Simplifying Activity-On-Edge Graphs
(available as arXiv preprint) | 2023-11-02 | Paper |
scientific article; zbMATH DE number 7759283 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-02 | Paper |
Quasipolynomiality of the Smallest Missing Induced Subgraph
Journal of Graph Algorithms and Applications | 2023-09-20 | Paper |
| The Widths of Strict Outerconfluent Graphs | 2023-08-07 | Paper |
Angles of arc-polygons and lombardi drawings of cacti
Computational Geometry | 2023-06-26 | Paper |
| Geometric Graphs with Unbounded Flip-Width | 2023-06-21 | Paper |
A stronger lower bound on parametric minimum spanning trees
Algorithmica | 2023-06-05 | Paper |
The centroid of points with approximate weights
Lecture Notes in Computer Science | 2023-05-08 | Paper |
| On the treewidth of Hanoi graphs | 2023-02-07 | Paper |
| scientific article; zbMATH DE number 7650284 (Why is no real title available?) | 2023-02-03 | Paper |
scientific article; zbMATH DE number 7650287 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. | 2023-02-03 | Paper |
| On the Biplanarity of Blowups | 2023-01-22 | Paper |
Parallel construction of quadtrees and quality triangulations
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Using sparsification for parametric minimum spanning tree problems
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
Finding the k smallest spanning trees
SWAT 90 | 2022-12-09 | Paper |
Geometric dominating sets -- a minimum version of the no-three-in-line problem
Computational Geometry | 2022-10-06 | Paper |
Some polycubes have no edge zipper unfolding
(available as arXiv preprint) | 2022-09-09 | Paper |
An efficient algorithm for shortest paths in vertical and horizontal segments
Lecture Notes in Computer Science | 2022-08-19 | Paper |
| Improved mixing for the convex polygon triangulation flip walk | 2022-07-20 | Paper |
| scientific article; zbMATH DE number 7559233 (Why is no real title available?) | 2022-07-18 | Paper |
| Cubic Planar Graphs that cannot be Drawn on few Lines | 2022-07-18 | Paper |
Limitations on realistic hyperbolic graph drawing
(available as arXiv preprint) | 2022-07-01 | Paper |
Stack-number is not bounded by queue-number
Combinatorica | 2022-06-30 | Paper |
Bipartite and series-parallel graphs without planar Lombardi drawings
Journal of Graph Algorithms and Applications | 2022-06-28 | Paper |
The graphs of stably matchable pairs
(available as arXiv preprint) | 2022-06-08 | Paper |
Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes
(available as arXiv preprint) | 2022-05-20 | Paper |
Algorithms for stable matching and clustering in a grid
Lecture Notes in Computer Science | 2022-05-18 | Paper |
Cubic planar graphs that cannot be drawn on few lines
(available as arXiv preprint) | 2022-05-13 | Paper |
Ununfoldable polyhedra with \(6\) vertices or \(6\) faces
Computational Geometry | 2022-04-08 | Paper |
A stronger lower bound on parametric minimum spanning trees
(available as arXiv preprint) | 2022-03-25 | Paper |
| Geometric Dominating Sets | 2022-03-24 | Paper |
On the treewidth of Hanoi graphs
Theoretical Computer Science | 2022-02-21 | Paper |
| Three-dimensional graph products with unbounded stack-number | 2022-02-10 | Paper |
Egyptian Fractions with Denominators from Sequences Closed Under Doubling
(available as arXiv preprint) | 2021-10-05 | Paper |
| Egyptian Fractions with Denominators from Sequences Closed Under Doubling | 2021-10-05 | Paper |
The parameterized complexity of finding point sets with hereditary properties
(available as arXiv preprint) | 2021-08-04 | Paper |
Parameterized leaf power recognition via embedding into graph products
(available as arXiv preprint) | 2021-08-04 | Paper |
On polyhedral realization with isosceles triangles
Graphs and Combinatorics | 2021-07-28 | Paper |
| Stable-matching Voronoi diagrams: combinatorial complexity and algorithms | 2021-07-28 | Paper |
C-planarity testing of embedded clustered graphs with bounded dual carving-width
Algorithmica | 2021-07-26 | Paper |
NC algorithms for computing a perfect matching and a maximum flow in one-crossing-minor-free graphs
SIAM Journal on Computing | 2021-06-22 | Paper |
Grid Peeling and the Affine Curve-Shortening Flow
Experimental Mathematics | 2021-04-01 | Paper |
Counting polygon triangulations is hard
Discrete & Computational Geometry | 2021-01-29 | Paper |
Counting polygon triangulations is hard
Discrete & Computational Geometry | 2021-01-29 | Paper |
Approximate greedy clustering and distance selection for graph metrics
(available as arXiv preprint) | 2021-01-12 | Paper |
Face flips in origami tessellations
(available as arXiv preprint) | 2020-11-12 | Paper |
Stack-number is not bounded by queue-number
(available as arXiv preprint) | 2020-11-09 | Paper |
Existence and hardness of conveyor belts
The Electronic Journal of Combinatorics | 2020-11-05 | Paper |
Minor-Closed Graph Classes with Bounded Layered Pathwidth
SIAM Journal on Discrete Mathematics | 2020-10-28 | Paper |
Homotopy height, grid-major height and graph-drawing height
(available as arXiv preprint) | 2020-10-26 | Paper |
Treetopes and their graphs
Discrete & Computational Geometry | 2020-09-01 | Paper |
Parameterized leaf power recognition via embedding into graph products
Algorithmica | 2020-08-12 | Paper |
Faster evaluation of subtraction games
(available as arXiv preprint) | 2020-08-11 | Paper |
Making change in 2048
(available as arXiv preprint) | 2020-08-11 | Paper |
Stable-matching Voronoi diagrams: combinatorial complexity and algorithms
(available as arXiv preprint) | 2020-08-04 | Paper |
\(k\)-best solutions of MSO problems on tree-decomposable graphs
(available as arXiv preprint) | 2020-05-27 | Paper |
On the treewidth of Hanoi graphs
(available as arXiv preprint) | 2020-04-30 | Paper |
Reactive proximity data structures for graphs
(available as arXiv preprint) | 2020-02-12 | Paper |
Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect
Theoretical Computer Science | 2020-01-16 | Paper |
Reconfiguring undirected paths
(available as arXiv preprint) | 2020-01-16 | Paper |
| Reconfiguring undirected paths | 2020-01-16 | Paper |
Scheduling autonomous vehicle platoons through an unregulated intersection
(available as arXiv preprint) | 2019-10-24 | Paper |
Randomized Speedup of the Bellman–Ford Algorithm
2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | Paper |
Small superpatterns for dominance drawing
2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | Paper |
Grid peeling and the affine curve-shortening flow
2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Covering many points with a small-area box
(available as arXiv preprint) | 2019-09-10 | Paper |
Realization and connectivity of the graphs of origami flat foldings
(available as arXiv preprint) | 2019-09-10 | Paper |
| scientific article; zbMATH DE number 7075879 (Why is no real title available?) | 2019-07-03 | Paper |
scientific article; zbMATH DE number 7075879 (Why is no real title available?)
(available as arXiv preprint) | 2019-07-03 | Paper |
Windows into relational events: data structures for contiguous subsequences of edges
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Self-overlapping curves revisited | 2019-05-06 | Paper |
| Linear-time algorithms for geometric graphs with sublinearly many crossings | 2019-05-06 | Paper |
Maximum plane trees in multipartite geometric graphs
Algorithmica | 2019-04-25 | Paper |
Track layouts, layered path decompositions, and leveled planarity
Algorithmica | 2019-04-25 | Paper |
Planar and poly-arc Lombardi drawings
Journal of Computational Geometry | 2019-02-27 | Paper |
Flat foldings of plane graphs with prescribed angles and edge lengths
(available as arXiv preprint) | 2019-02-27 | Paper |
Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count
Lecture Notes in Computer Science | 2019-02-20 | Paper |
The effect of planarization on width
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Realization and connectivity of the graphs of origami flat foldings
(available as arXiv preprint) | 2019-02-15 | Paper |
Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
Journal of Graph Algorithms and Applications | 2019-01-18 | Paper |
Spanning trees in multipartite geometric graphs
Algorithmica | 2019-01-11 | Paper |
Folding Polyominoes into (Poly)Cubes
International Journal of Computational Geometry & Applications | 2018-11-26 | Paper |
Vertex-unfoldings of simplicial manifolds
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Subexponential-time and FPT algorithms for embedded flat clustered planarity
(available as arXiv preprint) | 2018-11-22 | Paper |
The parametric closure problem
ACM Transactions on Algorithms | 2018-11-12 | Paper |
Testing bipartiteness of geometric intersection graphs
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs
Journal of Graph Algorithms and Applications | 2018-10-25 | Paper |
The effect of planarization on width
Journal of Graph Algorithms and Applications | 2018-10-25 | Paper |
Models and algorithms for graph watermarking
(available as arXiv preprint) | 2018-10-18 | Paper |
Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect
Lecture Notes in Computer Science | 2018-10-04 | Paper |
Treetopes and their Graphs
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Forbidden configurations in discrete geometry | 2018-06-27 | Paper |
Maximizing the sum of radii of disjoint balls or disks
(available as arXiv preprint) | 2018-06-05 | Paper |
From discrepancy to majority
Algorithmica | 2018-05-23 | Paper |
On the planar split thickness of graphs
Algorithmica | 2018-04-11 | Paper |
All-pairs minimum cuts in near-linear time for surface-embedded graphs
(available as arXiv preprint) | 2018-01-30 | Paper |
Parameterized complexity of 1-planarity
Journal of Graph Algorithms and Applications | 2018-01-12 | Paper |
The skip quadtree
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Minimum dilation stars
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Area-universal rectangular layouts
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Cuckoo filter: simplification and analysis
(available as arXiv preprint) | 2017-10-17 | Paper |
| Finding all maximal subsequences with hereditary properties | 2017-10-10 | Paper |
Minimum forcing sets for Miura folding patterns
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
The geometric thickness of low degree graphs
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Multivariate regression depth
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Optimized color gamuts for tiled displays
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Deterministic sampling and range counting in geometric data streams
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Maximum plane trees in multipartite geometric graphs
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Succinct Greedy Geometric Routing Using Hyperbolic Geometry
IEEE Transactions on Computers | 2017-07-27 | Paper |
Rooted cycle bases
Journal of Graph Algorithms and Applications | 2017-07-13 | Paper |
Listing all maximal cliques in large sparse real-world graphs
ACM Journal of Experimental Algorithmics | 2017-06-16 | Paper |
Structure of graphs with locally restricted crossings
SIAM Journal on Discrete Mathematics | 2017-05-24 | Paper |
Rigid Origami Vertices: Conditions and Forcing Sets
(available as arXiv preprint) | 2017-03-30 | Paper |
| Adjacency-preserving spatial treemaps | 2017-03-30 | Paper |
Strict Confluent Drawing
(available as arXiv preprint) | 2017-03-30 | Paper |
Happy endings for flip graphs
Journal of Computational Geometry | 2017-03-09 | Paper |
Steinitz theorems for simple orthogonal polyhedra
Journal of Computational Geometry | 2017-03-09 | Paper |
| Optimally fast incremental Manhattan plane embedding and planar tight span construction | 2017-03-09 | Paper |
Track layout is hard
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Genus, treewidth, and local crossing number
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Simple recognition of Halin graphs and their generalizations
Journal of Graph Algorithms and Applications | 2016-07-05 | Paper |
Dynamic connectivity in digital images
Information Processing Letters | 2016-06-01 | Paper |
Distance-sensitive planar point location
Computational Geometry | 2016-05-17 | Paper |
On the planar split thickness of graphs
Lecture Notes in Computer Science | 2016-05-03 | Paper |
From discrepancy to majority
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Folding a paper strip to minimize thickness
Journal of Discrete Algorithms | 2016-02-18 | Paper |
Ramified rectilinear polygons: coordinatization by dendrons
Discrete & Computational Geometry | 2016-02-03 | Paper |
Near-linear-time deterministic plane Steiner spanners for well-spaced point sets
Computational Geometry | 2016-01-29 | Paper |
The Galois complexity of graph drawing: why numerical solutions are ubiquitous for force-directed, spectral, and circle packing drawings
Journal of Graph Algorithms and Applications | 2016-01-07 | Paper |
Improved Grid Map Layout by Point Set Matching
International Journal of Computational Geometry & Applications | 2015-11-03 | Paper |
The parametric closure problem
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Contact Graphs of Circular Arcs
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Rooted cycle bases
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Linear-time algorithms for proportional apportionment
Algorithms and Computation | 2015-09-11 | Paper |
Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Deterministic sampling and range counting in geometric data streams
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Metric dimension parameterized by max leaf number
Journal of Graph Algorithms and Applications | 2015-08-25 | Paper |
| scientific article; zbMATH DE number 6472586 (Why is no real title available?) | 2015-08-14 | Paper |
| scientific article; zbMATH DE number 6472629 (Why is no real title available?) | 2015-08-14 | Paper |
| Testing bipartiteness of geometric intersection graphs | 2015-08-03 | Paper |
Quasiconvex analysis of backtracking algorithms
(available as arXiv preprint) | 2015-08-03 | Paper |
Planar induced subgraphs of sparse graphs
Journal of Graph Algorithms and Applications | 2015-05-18 | Paper |
Separator based sparsification for dynamic planar graph algorithms
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Skip-webs, efficient distributed data structures for multi-dimensional data sets
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Folding a paper strip to minimize thickness
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
The graphs of planar soap bubbles
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Flat foldings of plane graphs with prescribed angles and edge lengths
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Planar induced subgraphs of sparse graphs
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Balanced circle packings for planar graphs
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
The Galois complexity of graph drawing: why numerical solutions are ubiquitous for force-directed, spectral, and circle packing drawings
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
| Squarepants in a tree: sum of subtree clustering and hyperbolic pants decomposition | 2014-12-18 | Paper |
All maximal independent sets and dynamic dominance for sparse graphs
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Squarepants in a tree, sum of subtree clustering and hyperbolic pants decomposition
ACM Transactions on Algorithms | 2014-11-18 | Paper |
A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing
Discrete & Computational Geometry | 2014-11-14 | Paper |
| All maximal independent sets and dynamic dominance for sparse graphs | 2014-10-13 | Paper |
Wear minimization for cuckoo hashing: how not to throw a lot of eggs into one basket
Experimental Algorithms | 2014-09-30 | Paper |
Wear minimization for cuckoo hashing: how not to throw a lot of eggs into one basket
Experimental Algorithms | 2014-09-30 | Paper |
Grid minors in damaged grids
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Grid minors in damaged grids
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Antimatroids and balanced pairs
Order | 2014-06-12 | Paper |
Universal Point Sets for Drawing Planar Graphs with Circular Arcs
Journal of Graph Algorithms and Applications | 2014-06-10 | Paper |
Superpatterns and universal point sets
Journal of Graph Algorithms and Applications | 2014-05-22 | Paper |
Drawing arrangement graphs in small grids, or how to play Planarity
Journal of Graph Algorithms and Applications | 2014-05-22 | Paper |
| Paired approximation problems and incompatible inapproximabilities | 2014-05-22 | Paper |
Steinitz theorems for orthogonal polyhedra
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
On 2-site Voronoi diagrams under geometric distance functions
Journal of Computer Science and Technology | 2014-02-06 | Paper |
Drawing arrangement graphs in small grids, or how to play planarity
Graph Drawing | 2013-12-20 | Paper |
Fixed Parameter Tractability of Crossing Minimization of Almost-Trees
Graph Drawing | 2013-12-20 | Paper |
Superpatterns and universal point sets
Graph Drawing | 2013-12-20 | Paper |
Strict confluent drawing
Graph Drawing | 2013-12-20 | Paper |
Category-based routing in social networks: membership dimension and the small-world phenomenon
Theoretical Computer Science | 2013-12-11 | Paper |
Category-based routing in social networks: membership dimension and the small-world phenomenon
Theoretical Computer Science | 2013-12-11 | Paper |
Confluent Hasse diagrams
Journal of Graph Algorithms and Applications | 2013-11-28 | Paper |
Optimal angular resolution for face-symmetric drawings
Journal of Graph Algorithms and Applications | 2013-11-28 | Paper |
Parameterized complexity of 1-planarity
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Combinatorial pair testing: distinguishing workers from slackers
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
Discrete & Computational Geometry | 2013-08-05 | Paper |
Optimal 3D angular resolution for low-degree graphs
Journal of Graph Algorithms and Applications | 2013-04-09 | Paper |
Flows in one-crossing-minor-free graphs
Journal of Graph Algorithms and Applications | 2013-04-09 | Paper |
On the density of maximal 1-planar graphs
Graph Drawing | 2013-04-03 | Paper |
Planar Lombardi Drawings for Subcubic Graphs
Graph Drawing | 2013-04-03 | Paper |
Force-directed graph drawing using social gravity and scaling
Graph Drawing | 2013-04-03 | Paper |
Drawing trees with perfect angular resolution and polynomial area
Discrete & Computational Geometry | 2013-03-20 | Paper |
The complexity of bendless three-dimensional orthogonal graph drawing
Journal of Graph Algorithms and Applications | 2013-03-19 | Paper |
Inapproximability of orthogonal compaction
Journal of Graph Algorithms and Applications | 2012-12-07 | Paper |
The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
Journal of Graph Algorithms and Applications | 2012-12-04 | Paper |
Drawing graphs in the plane with a prescribed outer face and polynomial area
Journal of Graph Algorithms and Applications | 2012-12-04 | Paper |
Area-universal and constrained rectangular layouts
SIAM Journal on Computing | 2012-09-12 | Paper |
Extended dynamic subgraph statistics using h-index parameterized data structures
Theoretical Computer Science | 2012-08-13 | Paper |
Planar and poly-arc Lombardi drawings
Lecture Notes in Computer Science | 2012-03-09 | Paper |
Hardness of approximate compaction for nonplanar orthogonal graph drawings
Graph Drawing | 2012-03-09 | Paper |
Confluent Hasse Diagrams
Graph Drawing | 2012-03-09 | Paper |
Lombardi drawings of graphs
Journal of Graph Algorithms and Applications | 2012-01-12 | Paper |
Adjacency-preserving spatial treemaps
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Tracking moving objects with few handovers
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Combinatorics and geometry of finite and infinite squaregraphs
SIAM Journal on Discrete Mathematics | 2011-07-18 | Paper |
The Fibonacci dimension of a graph
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
The Fibonacci dimension of a graph
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
Linear-time algorithms for geometric graphs with sublinearly many edge crossings
SIAM Journal on Computing | 2011-04-04 | Paper |
Approximate weighted farthest neighbors and minimum dilation stars
Discrete Mathematics, Algorithms and Applications | 2011-03-25 | Paper |
Drawing Trees with Perfect Angular Resolution and Polynomial Area
Graph Drawing | 2011-02-11 | Paper |
Drawing graphs in the plane with a prescribed outer face and polynomial area
Graph Drawing | 2011-02-11 | Paper |
Optimal 3D angular resolution for low-degree graphs
Graph Drawing | 2011-02-11 | Paper |
Lombardi Drawings of Graphs
Graph Drawing | 2011-02-11 | Paper |
Extended dynamic subgraph statistics using \(h\)-index parameterized data structures
Combinatorial Optimization and Applications | 2011-01-08 | Paper |
Densities of minor-closed graph families
The Electronic Journal of Combinatorics | 2010-12-16 | Paper |
Densities of minor-closed graph families
The Electronic Journal of Combinatorics | 2010-12-16 | Paper |
Densities of minor-closed graph families
The Electronic Journal of Combinatorics | 2010-12-16 | Paper |
Flows in one-crossing-minor-free graphs
Algorithms and Computation | 2010-12-09 | Paper |
Listing all maximal cliques in sparse graphs in near-optimal time
Algorithms and Computation | 2010-12-09 | Paper |
Cloning Voronoi diagrams via retroactive data structures
Algorithms – ESA 2010 | 2010-09-06 | Paper |
| Recognizing partial cubes in quadratic time | 2010-08-06 | Paper |
Approximate weighted farthest neighbors and minimum dilation stars
Lecture Notes in Computer Science | 2010-07-20 | Paper |
| Regular Labelings and Geometric Structures | 2010-07-01 | Paper |
The traveling salesman problem for cubic graphs.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Graph-Theoretic Solutions to Computational Geometry Problems
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Manhattan orbifolds
Topology and its Applications | 2009-12-15 | Paper |
On verifying and engineering the wellgradedness of a union-closed family
Journal of Mathematical Psychology | 2009-12-07 | Paper |
Finding Large Clique Minors is Hard
Journal of Graph Algorithms and Applications | 2009-10-21 | Paper |
On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem
Lecture Notes in Computer Science | 2009-10-20 | Paper |
The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Orientation-Constrained Rectangular Layouts
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Optimal Embedding into Star Metrics
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Edges and switches, tunnels and bridges
Computational Geometry | 2009-06-30 | Paper |
Succinct Greedy Graph Drawing in the Hyperbolic Plane
Graph Drawing | 2009-03-03 | Paper |
The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing
Graph Drawing | 2009-03-03 | Paper |
Isometric Diamond Subgraphs
Graph Drawing | 2009-03-03 | Paper |
Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton’s Identities and Invertible Bloom Filters
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Edges and Switches, Tunnels and Bridges
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Guard placement for efficient point-in-polygon proofs
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
Happy endings for flip graphs
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
The Traveling Salesman Problem for Cubic Graphs
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
The Traveling Salesman Problem for Cubic Graphs
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Upright-Quad Drawing of st-Planar Learning Spaces
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Upright-Quad Drawing of st-Planar Learning Spaces
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Straight Skeletons of Three-Dimensional Polyhedra
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Algorithms for media
Discrete Applied Mathematics | 2008-09-29 | Paper |
SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS
International Journal of Computational Geometry & Applications | 2008-08-26 | Paper |
| scientific article; zbMATH DE number 5264898 (Why is no real title available?) | 2008-04-16 | Paper |
Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes
SIAM Journal on Computing | 2007-10-22 | Paper |
Drawings of planar graphs with few slopes and segments
Computational Geometry | 2007-10-12 | Paper |
The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Choosing Colors for Geometric Graphs Via Color Space Embeddings
Graph Drawing | 2007-08-28 | Paper |
Trees with Convex Faces and Optimal Angles
Graph Drawing | 2007-08-28 | Paper |
Upright-Quad Drawing of st-Planar Learning Spaces
Graph Drawing | 2007-08-28 | Paper |
Confluent layered drawings
Algorithmica | 2007-05-10 | Paper |
Minimum dilation stars
Computational Geometry | 2007-03-15 | Paper |
Cubic partial cubes from simplicial arrangements
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
Cubic partial cubes from simplicial arrangements
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
Cubic partial cubes from simplicial arrangements
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
The effect of faults on network expansion
Theory of Computing Systems | 2007-01-25 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
| Quasiconvex programming | 2006-04-28 | Paper |
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
Journal of Graph Algorithms and Applications | 2006-04-03 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Hinged dissection of polyominoes and polyforms
Computational Geometry | 2005-08-05 | Paper |
Fast hierarchical clustering and other applications of dynamic closest pairs
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
Fast hierarchical clustering and other applications of dynamic closest pairs
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
QUADRILATERAL MESHING BY CIRCLE PACKING
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
Fast Approximation of Centrality
Journal of Graph Algorithms and Applications | 2005-05-25 | Paper |
The lattice dimension of a graph
European Journal of Combinatorics | 2005-05-04 | Paper |
| scientific article; zbMATH DE number 2145231 (Why is no real title available?) | 2005-03-14 | Paper |
3-coloring in time
Journal of Algorithms | 2005-02-22 | Paper |
| scientific article; zbMATH DE number 2079390 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 2079330 (Why is no real title available?) | 2004-07-28 | Paper |
scientific article; zbMATH DE number 2068109 (Why is no real title available?)
(available as arXiv preprint) | 2004-05-27 | Paper |
| scientific article; zbMATH DE number 2068107 (Why is no real title available?) | 2004-05-27 | Paper |
Tiling space and slabs with acute tetrahedra.
Computational Geometry | 2004-03-29 | Paper |
Small Maximal Independent Sets and Faster Exact Graph Coloring
Journal of Graph Algorithms and Applications | 2003-11-30 | Paper |
Small Maximal Independent Sets and Faster Exact Graph Coloring
Journal of Graph Algorithms and Applications | 2003-11-30 | Paper |
| scientific article; zbMATH DE number 1944407 (Why is no real title available?) | 2003-11-10 | Paper |
scientific article; zbMATH DE number 1944407 (Why is no real title available?)
(available as arXiv preprint) | 2003-11-10 | Paper |
| scientific article; zbMATH DE number 1974116 (Why is no real title available?) | 2003-09-03 | Paper |
scientific article; zbMATH DE number 1974116 (Why is no real title available?)
(available as arXiv preprint) | 2003-09-03 | Paper |
Setting Parameters by Example
SIAM Journal on Computing | 2003-06-19 | Paper |
The minimum expectation selection problem
Random Structures & Algorithms | 2003-03-19 | Paper |
Multivariate regression depth
Discrete & Computational Geometry | 2002-11-18 | Paper |
| scientific article; zbMATH DE number 1830718 (Why is no real title available?) | 2002-11-18 | Paper |
| scientific article; zbMATH DE number 1830726 (Why is no real title available?) | 2002-11-18 | Paper |
| scientific article; zbMATH DE number 1830756 (Why is no real title available?) | 2002-11-18 | Paper |
Algorithms for coloring quadtrees
Algorithmica | 2002-10-23 | Paper |
Tangent Spheres and Triangle Centers
(available as arXiv preprint) | 2002-09-12 | Paper |
Beta-skeletons have unbounded dilation
Computational Geometry | 2002-09-03 | Paper |
The distribution of loop lengths in graphical models for turbo decoding
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
| Computing the depth of a flat | 2002-07-22 | Paper |
| Fast approximation of centrality | 2002-03-24 | Paper |
| Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. | 2002-01-30 | Paper |
| Internet packet filter management and rectangle geometry | 2002-01-30 | Paper |
| scientific article; zbMATH DE number 1256643 (Why is no real title available?) | 2002-01-21 | Paper |
| scientific article; zbMATH DE number 1256641 (Why is no real title available?) | 2002-01-17 | Paper |
| scientific article; zbMATH DE number 1944408 (Why is no real title available?) | 2002-01-01 | Paper |
| scientific article; zbMATH DE number 1944414 (Why is no real title available?) | 2002-01-01 | Paper |
| scientific article; zbMATH DE number 1471729 (Why is no real title available?) | 2001-08-20 | Paper |
Incremental and Decremental Maintenance of Planar Width
Journal of Algorithms | 2000-12-19 | Paper |
Geometric Thickness of Complete Graphs
Journal of Graph Algorithms and Applications | 2000-12-14 | Paper |
Geometric Thickness of Complete Graphs
Journal of Graph Algorithms and Applications | 2000-12-14 | Paper |
Geometric Thickness of Complete Graphs
Journal of Graph Algorithms and Applications | 2000-12-14 | Paper |
Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions
Discrete & Computational Geometry | 2000-10-17 | Paper |
| scientific article; zbMATH DE number 1424297 (Why is no real title available?) | 2000-09-24 | Paper |
Subgraph Isomorphism in Planar Graphs and Related Problems
Journal of Graph Algorithms and Applications | 2000-09-19 | Paper |
Diameter and treewidth in minor-closed graph families
Algorithmica | 2000-08-27 | Paper |
| scientific article; zbMATH DE number 1306877 (Why is no real title available?) | 2000-04-26 | Paper |
Regression depth and center points.
Discrete & Computational Geometry | 2000-01-01 | Paper |
| scientific article; zbMATH DE number 1263243 (Why is no real title available?) | 1999-09-15 | Paper |
Geometric lower bounds for parametric matroid optimization
Discrete & Computational Geometry | 1999-07-12 | Paper |
| scientific article; zbMATH DE number 1303605 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1305420 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1305508 (Why is no real title available?) | 1999-06-17 | Paper |
Optimal Point Placement for Mesh Smoothing
Journal of Algorithms | 1999-05-31 | Paper |
Linear complexity hexahedral mesh generation
Computational Geometry | 1999-05-03 | Paper |
Finding the k Shortest Paths
SIAM Journal on Computing | 1998-09-21 | Paper |
Separator-Based Sparsification II: Edge and Vertex Connectivity
SIAM Journal on Computing | 1998-09-21 | Paper |
On triangulating three-dimensional polygons
Computational Geometry | 1998-08-02 | Paper |
Faster Circle Packing with Application to Nonobtuse Triangulation
International Journal of Computational Geometry & Applications | 1998-02-26 | Paper |
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM | 1998-02-17 | Paper |
Minimum Range Balanced Cuts via Dynamic Subset Sums
Journal of Algorithms | 1997-11-10 | Paper |
Faster geometric \(k\)-point MST approximation
Computational Geometry | 1997-10-28 | Paper |
Choosing Subsets with Maximum Weighted Average
Journal of Algorithms | 1997-08-25 | Paper |
| scientific article; zbMATH DE number 1003237 (Why is no real title available?) | 1997-08-04 | Paper |
| scientific article; zbMATH DE number 1002204 (Why is no real title available?) | 1997-05-28 | Paper |
| scientific article; zbMATH DE number 1003246 (Why is no real title available?) | 1997-04-23 | Paper |
| scientific article; zbMATH DE number 910922 (Why is no real title available?) | 1997-03-23 | Paper |
Algorithms for proximity problems in higher dimensions
Computational Geometry | 1997-01-14 | Paper |
APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
International Journal of Computational Geometry & Applications | 1996-12-16 | Paper |
Average case analysis of dynamic geometric optimization
Computational Geometry | 1996-11-04 | Paper |
| scientific article; zbMATH DE number 910874 (Why is no real title available?) | 1996-11-04 | Paper |
Separator based sparsification. I: Planarity testing and minimum spanning trees
Journal of Computer and System Sciences | 1996-07-16 | Paper |
| scientific article; zbMATH DE number 826057 (Why is no real title available?) | 1995-12-13 | Paper |
Offline Algorithms for Dynamic Minimum Spanning Tree Problems
Journal of Algorithms | 1995-11-22 | Paper |
TREE-WEIGHTED NEIGHBORS AND GEOMETRIC k SMALLEST SPANNING TREES
International Journal of Computational Geometry & Applications | 1995-08-27 | Paper |
Asymptotic speed-ups in constructive solid geometry
Algorithmica | 1995-08-09 | Paper |
Sparse dynamic programming II
Journal of the ACM | 1995-07-13 | Paper |
TRIANGULATING POLYGONS WITHOUT LARGE ANGLES
International Journal of Computational Geometry & Applications | 1995-05-17 | Paper |
| scientific article; zbMATH DE number 742951 (Why is no real title available?) | 1995-04-11 | Paper |
| scientific article; zbMATH DE number 742947 (Why is no real title available?) | 1995-04-11 | Paper |
| scientific article; zbMATH DE number 741006 (Why is no real title available?) | 1995-04-05 | Paper |
Dynamic Euclidean minimum spanning trees and extrema of binary functions
Discrete & Computational Geometry | 1995-03-20 | Paper |
Iterated nearest neighbors and finding minimal polytopes
Discrete & Computational Geometry | 1995-03-01 | Paper |
| scientific article; zbMATH DE number 437530 (Why is no real title available?) | 1994-11-29 | Paper |
Provably good mesh generation
Journal of Computer and System Sciences | 1994-11-01 | Paper |
Approximating the minimum weight Steiner triangulation
Discrete & Computational Geometry | 1994-10-19 | Paper |
Arboricity and bipartite subgraph listing algorithms
Information Processing Letters | 1994-09-25 | Paper |
Sparse dynamic programming I
Journal of the ACM | 1994-08-21 | Paper |
On the number of minimal 1-Steiner trees
Discrete & Computational Geometry | 1994-08-10 | Paper |
Visibility with a moving point of view
Algorithmica | 1994-05-05 | Paper |
| scientific article; zbMATH DE number 432745 (Why is no real title available?) | 1994-01-02 | Paper |
| scientific article; zbMATH DE number 432756 (Why is no real title available?) | 1994-01-02 | Paper |
| scientific article; zbMATH DE number 432798 (Why is no real title available?) | 1993-12-15 | Paper |
| scientific article; zbMATH DE number 432816 (Why is no real title available?) | 1993-10-20 | Paper |
Connectivity, graph minors, and subgraph multiplicity
Journal of Graph Theory | 1993-08-24 | Paper |
| scientific article; zbMATH DE number 176773 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 177564 (Why is no real title available?) | 1993-05-18 | Paper |
Improved bounds for intersecting triangles and halving planes
Journal of Combinatorial Theory. Series A | 1993-05-16 | Paper |
POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
International Journal of Computational Geometry & Applications | 1993-04-01 | Paper |
Dynamic Three-Dimensional Linear Programming
ORSA Journal on Computing | 1993-02-25 | Paper |
Parallel recognition of series-parallel graphs
Information and Computation | 1993-01-17 | Paper |
Finding the \(k\) smallest spanning trees
BIT | 1992-12-14 | Paper |
The farthest point Delaunay triangulation minimizes angles
Computational Geometry | 1992-08-13 | Paper |
Maintenance of a minimum spanning forest in a dynamic plane graph
Journal of Algorithms | 1992-06-28 | Paper |
Simultaneous strong separations of probabilistic and unambiguous complexity classes
Mathematical Systems Theory | 1992-06-28 | Paper |
Finding minimum area \(k\)-gons
Discrete & Computational Geometry | 1992-06-28 | Paper |
Equipartitions of graphs
Discrete Mathematics | 1992-06-28 | Paper |
Planar orientations with low out-degree and compaction of adjacency matrices
Theoretical Computer Science | 1992-06-26 | Paper |
THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION
International Journal of Computational Geometry & Applications | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4213489 (Why is no real title available?) | 1991-01-01 | Paper |
Sequence comparison with mixed convex and concave costs
Journal of Algorithms | 1990-01-01 | Paper |
Reset Sequences for Monotonic Automata
SIAM Journal on Computing | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4126696 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4131653 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4082982 (Why is no real title available?) | 1988-01-01 | Paper |
Product structure extension of the Alon--Seymour--Thomas theorem
(available as arXiv preprint) | N/A | Paper |
Non-Euclidean Erd\H{o}s-Anning Theorems
(available as arXiv preprint) | N/A | Paper |
