| Publication | Date of Publication | Type |
|---|
Trees and co-trees in planar 3-connected planar graphs An easier proof via Schnyder woods
(available as arXiv preprint) | N/A | Paper |
"Toward Gr\""unbaum's Conjecture"
(available as arXiv preprint) | N/A | Paper |
| Toward Grünbaum's conjecture | 2025-12-02 | Paper |
Shortness parameters of polyhedral graphs with few distinct vertex degrees
Discrete Mathematics | 2025-05-26 | Paper |
Dynamics of cycles in polyhedra. I: The isolation lemma
Journal of Combinatorial Theory. Series B | 2025-05-07 | Paper |
Structural parameters of Schnyder woods
Discrete Mathematics | 2024-12-02 | Paper |
Rooted minors and locally spanning subgraphs
Journal of Graph Theory | 2024-01-24 | Paper |
Generalized cut trees for edge-connectivity
Journal of Combinatorial Theory. Series B | 2024-01-15 | Paper |
Contractible edges in longest cycles
Journal of Graph Theory | 2023-10-12 | Paper |
| Computing vertex-disjoint paths in large graphs using MAOs | 2022-07-21 | Paper |
| A cut tree representation for pendant pairs | 2022-07-21 | Paper |
Cycle spectra of contraction-critically 4-connected planar graphs
Graphs and Combinatorics | 2021-11-30 | Paper |
| On short fastest paths in temporal graphs | 2021-10-04 | Paper |
Compact cactus representations of all non-trivial min-cuts
Discrete Applied Mathematics | 2021-09-15 | Paper |
Computing Tutte paths
(available as arXiv preprint) | 2021-07-28 | Paper |
Circumference of essentially 4-connected planar triangulations
Journal of Graph Algorithms and Applications | 2021-03-29 | Paper |
| Edge-orders | 2020-05-27 | Paper |
| Dynamics of Cycles in Polyhedra I: The Isolation Lemma | 2020-02-18 | Paper |
Shortness coefficient of cyclically 4-edge-connected cubic graphs
The Electronic Journal of Combinatorics | 2020-02-10 | Paper |
On the circumference of essentially 4-connected planar graphs
Journal of Graph Algorithms and Applications | 2020-01-22 | Paper |
Computing vertex-disjoint paths in large graphs using MAOs
Algorithmica | 2020-01-16 | Paper |
Longer cycles in essentially 4-connected planar graphs
Discussiones Mathematicae Graph Theory | 2020-01-08 | Paper |
Edge-orders
Algorithmica | 2019-05-07 | Paper |
Simple computation of \textit{st}-edge- and \textit{st}-numberings from ear decompositions
Information Processing Letters | 2019-03-11 | Paper |
| Longest cycles in cyclically 4-edge-connected cubic planar graphs | 2019-02-13 | Paper |
Computing 2-walks in polynomial time
ACM Transactions on Algorithms | 2018-11-13 | Paper |
More on foxes
Journal of Graph Theory | 2018-10-31 | Paper |
Linear-time recognition of map graphs with outerplanar witness
Discrete Optimization | 2018-08-17 | Paper |
Tight bounds for the vertices of degree k in minimally k‐connected graphs
Journal of Graph Theory | 2018-07-13 | Paper |
| Linear-time recognition of map graphs with outerplanar witness | 2017-10-17 | Paper |
| Cut Tree Structures with Applications on Contraction-Based Sparsification | 2017-07-03 | Paper |
Which point sets admit a \(k\)-angulation?
(available as arXiv preprint) | 2017-03-09 | Paper |
Certifying 3-edge-connectivity
Algorithmica | 2017-03-03 | Paper |
Small-area orthogonal drawings of 3-connected graphs
Lecture Notes in Computer Science | 2017-02-10 | Paper |
| Computing 2-walks in polynomial time | 2017-01-24 | Paper |
Lower bounds for locally highly connected graphs
Graphs and Combinatorics | 2016-11-29 | Paper |
Mondshein sequences (a.k.a. (2,1)-orders)
SIAM Journal on Computing | 2016-11-15 | Paper |
Thoughts on Barnette's conjecture
The Australasian Journal of Combinatorics | 2016-04-18 | Paper |
Thoughts on Barnette's conjecture
The Australasian Journal of Combinatorics | 2016-04-18 | Paper |
| A Tight Bound for Minimal Connectivity | 2016-03-30 | Paper |
Counting \(K_4\)-subdivisions
Discrete Mathematics | 2015-08-05 | Paper |
Cubic plane graphs on a given point set
Computational Geometry | 2014-11-24 | Paper |
Cubic plane graphs on a given point set
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Computing minimum cycle bases in weighted partial 2-trees in linear time
Journal of Graph Algorithms and Applications | 2014-07-30 | Paper |
The Mondshein Sequence
Automata, Languages, and Programming | 2014-07-01 | Paper |
Computing minimum cycle bases in weighted partial 2-trees in linear time
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Certifying 3-edge-connectivity
Lecture Notes in Computer Science | 2013-12-06 | Paper |
A Planarity Test via Construction Sequences
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Certifying 3-connectivity in linear time
Automata, Languages, and Programming | 2013-08-12 | Paper |
Contractions, removals, and certifying 3-connectivity in linear time
SIAM Journal on Computing | 2013-07-24 | Paper |
A simple test on 2-vertex- and 2-edge-connectivity
Information Processing Letters | 2013-03-20 | Paper |
Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge
Journal of Graph Theory | 2013-03-07 | Paper |
Largest inscribed rectangles in convex polygons
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Construction sequences and certifying 3-connectivity
Algorithmica | 2012-04-26 | Paper |
An O(n+m) certifying triconnnectivity algorithm for Hamiltonian graphs
Algorithmica | 2012-04-26 | Paper |
| Construction sequences and certifying 3-connectedness | 2012-01-23 | Paper |
Interval Stabbing Problems in Small Integer Ranges
Algorithms and Computation | 2009-12-17 | Paper |
Efficient Extraction of Multiple Kuratowski Subdivisions
Graph Drawing | 2008-03-25 | Paper |
