| Publication | Date of Publication | Type |
|---|
Corrigendum to: ``Orthogonal tree-decompositions of graphs
SIAM Journal on Discrete Mathematics | 2025-01-08 | Paper |
The Grid-Minor theorem revisited
| 2024-11-28 | Paper |
The excluded tree minor theorem revisited
Combinatorics, Probability and Computing | 2024-11-05 | Paper |
Min-\(k\)-planar drawings of graphs
Journal of Graph Algorithms and Applications | 2024-10-08 | Paper |
Bounded-degree planar graphs do not have bounded-degree product structure
The Electronic Journal of Combinatorics | 2024-07-18 | Paper |
Product structure extension of the Alon-Seymour-Thomas theorem
SIAM Journal on Discrete Mathematics | 2024-07-16 | Paper |
Min-\(k\)-planar drawings of graphs
| 2024-06-21 | Paper |
Graph product structure for non-minor-closed classes
Journal of Combinatorial Theory. Series B | 2023-08-10 | Paper |
The grid-minor theorem revisited
| 2023-07-06 | Paper |
Proof of the Clustered Hadwiger Conjecture
| 2023-06-09 | Paper |
Separating layered treewidth and row treewidth
Discrete Mathematics & Theoretical Computer Science | 2023-05-30 | Paper |
Clustered 3-colouring graphs of bounded degree
Combinatorics, Probability and Computing | 2023-03-31 | Paper |
Dual circumference and collinear sets
Discrete & Computational Geometry | 2023-01-23 | Paper |
Adjacency Labelling for Planar Graphs (and Beyond)
Journal of the ACM | 2022-12-08 | Paper |
Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure
| 2022-12-05 | Paper |
Geodesic obstacle representation of graphs
Computational Geometry | 2022-11-16 | Paper |
\(2\times n\) grids have unbounded anagram-free chromatic number
The Electronic Journal of Combinatorics | 2022-09-06 | Paper |
Dual circumference and collinear sets
| 2022-07-18 | Paper |
Stack-number is not bounded by queue-number
Combinatorica | 2022-06-30 | Paper |
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers
| 2022-05-11 | Paper |
Odd Colourings of Graph Products
| 2022-02-25 | Paper |
Geodesic obstacle representation of graphs
| 2021-07-28 | Paper |
Every collinear set in a planar graph is free
Discrete & Computational Geometry | 2021-04-29 | Paper |
Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers
Algorithmica | 2021-04-19 | Paper |
Local routing in WSPD-based spanners
| 2021-03-17 | Paper |
On dispersable book embeddings
Theoretical Computer Science | 2021-03-09 | Paper |
Two results on layered pathwidth and linear layouts
Journal of Graph Algorithms and Applications | 2021-01-19 | Paper |
Face flips in origami tessellations
| 2020-11-12 | Paper |
Planar graphs have bounded queue-number
Journal of the ACM | 2020-11-11 | Paper |
Stack-number is not bounded by queue-number
| 2020-11-09 | Paper |
Minor-Closed Graph Classes with Bounded Layered Pathwidth
SIAM Journal on Discrete Mathematics | 2020-10-28 | Paper |
Planar graphs have bounded nonrepetitive chromatic number
Advances in Combinatorics | 2020-10-20 | Paper |
Asymptotically Optimal Vertex Ranking of Planar Graphs
| 2020-07-13 | Paper |
Clustered 3-Colouring Graphs of Bounded Degree
| 2020-02-26 | Paper |
Notes on growing a tree in a graph
Random Structures & Algorithms | 2019-11-07 | Paper |
Every collinear set in a planar graph is free
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
A characterization of the degree sequences of 2-trees
2007 Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
Pole dancing: 3D morphs for tree drawings
Journal of Graph Algorithms and Applications | 2019-09-16 | Paper |
scientific article; zbMATH DE number 7051217 (Why is no real title available?)
| 2019-05-06 | Paper |
Track layouts, layered path decompositions, and leveled planarity
Algorithmica | 2019-04-25 | Paper |
More Turán-type theorems for triangles in convex point sets
The Electronic Journal of Combinatorics | 2019-03-05 | Paper |
Thickness and Antithickness of Graphs
| 2019-02-27 | Paper |
Drawing planar graphs with many collinear vertices
| 2019-02-27 | Paper |
EPG-representations with Small Grid-Size
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Pole dancing: 3D morphs for tree drawings
| 2019-02-15 | Paper |
Queue Layouts of Graphs with Bounded Degree and Bounded Genus
| 2019-01-16 | Paper |
Corrigendum: Orthogonal Tree Decompositions of Graphs
SIAM Journal on Discrete Mathematics | 2018-12-19 | Paper |
Anagram-free chromatic number is not pathwidth-bounded
| 2018-11-22 | Paper |
Dual Circumference and Collinear Sets
| 2018-11-08 | Paper |
Pole Dancing: 3D Morphs for Tree Drawings
| 2018-08-31 | Paper |
Tight Upper Bounds on the Crossing Number in a Minor-Closed Class
| 2018-07-30 | Paper |
Orthogonal tree decompositions of graphs
SIAM Journal on Discrete Mathematics | 2018-04-11 | Paper |
Anagram-Free Chromatic Number is not Pathwidth-Bounded
| 2018-02-05 | Paper |
Stack and queue layouts via layered separators
Journal of Graph Algorithms and Applications | 2018-01-12 | Paper |
New bounds for facial nonrepetitive colouring
Graphs and Combinatorics | 2017-10-11 | Paper |
Compatible connectivity-augmentation of planar disconnected graphs
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Layered separators in minor-closed graph classes with applications
Journal of Combinatorial Theory. Series B | 2017-09-29 | Paper |
The number of lines tangent to arbitrary convex polyhedra in 3D
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Local routing in spanners based on WSPDs
| 2017-09-22 | Paper |
Structure of graphs with locally restricted crossings
SIAM Journal on Discrete Mathematics | 2017-05-24 | Paper |
Nonrepetitive colouring via entropy compression
Combinatorica | 2017-04-25 | Paper |
The utility of untangling
Journal of Graph Algorithms and Applications | 2017-04-05 | Paper |
Track layout is hard
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Stack and queue layouts via layered separators
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Drawing planar graphs with many collinear vertices
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Genus, treewidth, and local crossing number
Lecture Notes in Computer Science | 2017-02-10 | Paper |
The utility of untangling
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Layouts of Expander Graphs
Chicago Journal of Theoretical Computer Science | 2016-02-01 | Paper |
Compatible connectivity augmentation of planar disconnected graphs
Discrete & Computational Geometry | 2015-12-02 | Paper |
Empty pentagons in point sets with collinearities
SIAM Journal on Discrete Mathematics | 2015-11-27 | Paper |
Visibility-monotonic polygon deflation
| 2015-08-28 | Paper |
On obstacle numbers
The Electronic Journal of Combinatorics | 2015-08-27 | Paper |
Average stretch factor: how low does it go?
Discrete & Computational Geometry | 2015-04-16 | Paper |
Robust geometric spanners
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Graph layouts via layered separators
Journal of Combinatorial Theory. Series B | 2014-11-21 | Paper |
Entropy, triangulation, and point location in planar subdivisions
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Crossings in grid drawings
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Notes on large angle crossing graphs
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
On the book thickness of $k$-trees
| 2014-03-25 | Paper |
Triangulating and guarding realistic polygons
Computational Geometry | 2014-01-22 | Paper |
Robust geometric spanners
SIAM Journal on Computing | 2013-11-14 | Paper |
A Polynomial Bound for Untangling Geometric Planar Graphs
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
Ghost chimneys
International Journal of Computational Geometry & Applications | 2013-06-24 | Paper |
Proximity graphs: {\(E, \delta\)}, {\(\Delta\)}, {\(\chi\)} and {\(\omega\)}
International Journal of Computational Geometry & Applications | 2013-06-24 | Paper |
Nonrepetitive colourings of planar graphs with \(O(\log n)\) colours
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
Coverage with \(k\)-transmitters in the presence of obstacles
Journal of Combinatorial Optimization | 2013-03-25 | Paper |
A center transversal theorem for hyperplanes and applications to graph drawing
Discrete & Computational Geometry | 2013-03-18 | Paper |
Meshes preserving minimum feature size
Lecture Notes in Computer Science | 2013-01-07 | Paper |
An improved bound for first-fit on posets without two long incomparable chains
SIAM Journal on Discrete Mathematics | 2013-01-04 | Paper |
Fast local searches and updates in bounded universes
Computational Geometry | 2012-12-04 | Paper |
On point-sets that support planar graphs
Computational Geometry | 2012-10-12 | Paper |
An affine invariant \(k\)-nearest neighbor regression estimate
Journal of Multivariate Analysis | 2012-09-26 | Paper |
Memoryless routing in convex subdivisions: random walks are optimal
Computational Geometry | 2012-05-18 | Paper |
Biased range trees
Algorithmica | 2012-04-26 | Paper |
Layered working-set trees
Algorithmica | 2012-04-26 | Paper |
On point-sets that support planar graphs
Graph Drawing | 2012-03-09 | Paper |
Every large point set contains many collinear points or an empty pentagon
Graphs and Combinatorics | 2012-01-24 | Paper |
On the maximum number of cliques in a graph embedded in a surface
European Journal of Combinatorics | 2011-11-29 | Paper |
Common unfoldings of polyominoes and polycubes
Lecture Notes in Computer Science | 2011-11-11 | Paper |
On graphs supported by line sets
Graph Drawing | 2011-02-11 | Paper |
Coverage with \(k\)-transmitters in the presence of obstacles
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
A note on the perimeter of fat objects
Computational Geometry | 2010-10-15 | Paper |
scientific article; zbMATH DE number 5764827 (Why is no real title available?)
| 2010-08-06 | Paper |
An \(O(\log \log n)\)-competitive binary search tree with optimal worst-case access times
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Layered working-set trees
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Tree-partitions of \(k\)-trees with applications in graph layout.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
A polynomial bound for untangling geometric planar graphs
Discrete & Computational Geometry | 2009-12-14 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Distinct distances in graph drawings
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Improved upper bounds on the crossing number
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
On the parameterized complexity of layered graph drawing
Algorithmica | 2008-12-02 | Paper |
A characterization of the degree sequences of 2-trees
Journal of Graph Theory | 2008-09-04 | Paper |
Fixed parameter algorithms for one-sided crossing minimization revisited
Journal of Discrete Algorithms | 2008-08-08 | Paper |
Stacks, queues and tracks: layouts of graph subdivisions
| 2008-05-27 | Paper |
MAINTAINING VISIBILITY INFORMATION OF PLANAR POINT SETS WITH A MOVING VIEWPOINT
International Journal of Computational Geometry & Applications | 2008-05-14 | Paper |
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra
SIAM Journal on Computing | 2008-04-22 | Paper |
Graph drawings with few slopes
Computational Geometry | 2007-10-12 | Paper |
Drawings of planar graphs with few slopes and segments
Computational Geometry | 2007-10-12 | Paper |
Graph treewidth and geometric thickness parameters
Discrete & Computational Geometry | 2007-06-21 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Upward three-dimensional grid drawings of graphs
Order | 2006-09-14 | Paper |
A fixed-parameter approach to 2-layer planarization
Algorithmica | 2006-08-11 | Paper |
Induced subgraphs of bounded degree and bounded treewidth
| 2006-08-03 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Layout of Graphs with Bounded Tree-Width
SIAM Journal on Computing | 2005-09-16 | Paper |
scientific article; zbMATH DE number 2159644 (Why is no real title available?)
| 2005-04-20 | Paper |
scientific article; zbMATH DE number 2159655 (Why is no real title available?)
| 2005-04-20 | Paper |
scientific article; zbMATH DE number 2145229 (Why is no real title available?)
| 2005-03-14 | Paper |
A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation
Algorithmica | 2004-10-01 | Paper |
scientific article; zbMATH DE number 2084262 (Why is no real title available?)
| 2004-08-06 | Paper |
The Expected Number of 3D Visibility Events Is Linear
SIAM Journal on Computing | 2004-01-08 | Paper |
scientific article; zbMATH DE number 1979514 (Why is no real title available?)
| 2003-09-14 | Paper |
scientific article; zbMATH DE number 1974106 (Why is no real title available?)
| 2003-09-03 | Paper |
scientific article; zbMATH DE number 1974113 (Why is no real title available?)
| 2003-09-03 | Paper |
Flipturning Polygons
Discrete & Computational Geometry | 2003-03-17 | Paper |
scientific article; zbMATH DE number 1875438 (Why is no real title available?)
| 2003-03-02 | Paper |
On validating planar worlds
| 2002-07-22 | Paper |
Linear versus centred chromatic numbers
| N/A | Paper |
Product structure extension of the Alon--Seymour--Thomas theorem
| N/A | Paper |
The Excluded Tree Minor Theorem Revisited
| N/A | Paper |
Connected Dominating Sets in Triangulations
| N/A | Paper |
Grid Minors and Products
| N/A | Paper |
Rectilinear Crossing Number of Graphs Excluding Single-Crossing Graphs as Minors
| N/A | Paper |
Tight bound for the Erd\H{o}s-P\'osa property of tree minors
| N/A | Paper |
Free Sets in Planar Graphs: History and Applications
| N/A | Paper |
