| Publication | Date of Publication | Type |
|---|
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 |
On the expansion of Hanoi graphs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2026-10-02 | Paper |
| Diamond-kite meshes: adaptive quadrilateral meshing and orthogonal circle packing | 2026-09-25 | Paper |
Fast Schulze voting using quickselect
Journal of Graph Algorithms and Applications | 2026-09-25 | Paper |
Visualizing treewidth
Journal of Graph Algorithms and Applications | 2026-09-25 | Paper |
| Visualizing treewidth | 2026-09-21 | Paper |
| String graph obstacles of high girth and of bounded degree | 2026-09-21 | Paper |
| Stabbing faces by a convex curve | 2026-09-21 | Paper |
| Bandwidth vs BFS width in matrix reordering, graph reconstruction, and graph drawing | 2026-08-31 | Paper |
Hamiltonian cycles in subdivided doubles
Ars Mathematica Contemporanea | 2026-08-27 | Paper |
| Computational geometry with probabilistically noisy primitive operations | 2026-08-11 | Paper |
| Non-Euclidean Erdős-Anning theorems | 2026-08-11 | Paper |
| 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 |
scientific article; zbMATH DE number 7759283 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-02 | Paper |
Simplifying Activity-On-Edge Graphs
(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 |
| C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. | 2023-02-03 | 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 |
| 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 |
| Cubic Planar Graphs that cannot be Drawn on few Lines | 2022-07-18 | Paper |
| scientific article; zbMATH DE number 7559233 (Why is no real title available?) | 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 |
Reconfiguring undirected paths
(available as arXiv preprint) | 2020-01-16 | Paper |
| Reconfiguring undirected paths | 2020-01-16 | Paper |
Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect
Theoretical Computer Science | 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 |
