| 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 |
Nonplanar Graph Drawings with k Vertices per Face
| 2024-05-03 | Paper |
Stabbing pairwise intersecting disks by four points
Discrete \& Computational Geometry | 2023-12-21 | Paper |
Sparse universal graphs for planarity
Journal of the London Mathematical Society | 2023-12-02 | Paper |
Local certification of geometric graph classes
| 2023-11-28 | 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 |
Drawing graphs as spanners
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | 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 |
Drawing graphs as spanners
Discrete \& Computational Geometry | 2022-09-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 |
Odd Colourings of Graph Products
| 2022-02-25 | Paper |
An Optimal Algorithm for Product Structure in Planar Graphs
| 2022-02-17 | Paper |
Approximating maximum diameter-bounded subgraph in unit disk graphs
Discrete \& Computational Geometry | 2021-11-18 | 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 |
A fast algorithm for the product structure of planar graphs
Algorithmica | 2021-04-19 | Paper |
Two results on layered pathwidth and linear layouts
Journal of Graph Algorithms and Applications | 2021-01-19 | 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 |
Approximating maximum diameter-bounded subgraph in unit disk graphs
| 2020-08-18 | Paper |
Asymptotically Optimal Vertex Ranking of Planar Graphs
| 2020-07-13 | Paper |
A Fast Algorithm for the Product Structure of Planar Graphs
| 2020-04-06 | 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 |
On the average number of edges in theta graphs
2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | 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 |
scientific article; zbMATH DE number 7051217 (Why is no real title available?)
| 2019-05-06 | Paper |
Succinct geometric indexes supporting point location queries
| 2019-05-06 | Paper |
More Turán-type theorems for triangles in convex point sets
The Electronic Journal of Combinatorics | 2019-03-05 | Paper |
EPG-representations with Small Grid-Size
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Queue Layouts of Graphs with Bounded Degree and Bounded Genus
| 2019-01-16 | Paper |
Spanning trees in multipartite geometric graphs
Algorithmica | 2019-01-11 | 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 |
Array layouts for comparison-based searching
ACM Journal of Experimental Algorithmics | 2018-08-06 | Paper |
scientific article; zbMATH DE number 6876065 (Why is no real title available?)
| 2018-05-29 | Paper |
Orthogonal tree decompositions of graphs
SIAM Journal on Discrete Mathematics | 2018-04-11 | Paper |
A note on interference in random networks
Computational Geometry | 2018-02-12 | Paper |
Anagram-Free Chromatic Number is not Pathwidth-Bounded
| 2018-02-05 | 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 |
Geodesic ham-sandwich cuts
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
The price of order
International Journal of Computational Geometry & Applications | 2017-05-19 | Paper |
Biased predecessor search
Algorithmica | 2016-12-21 | Paper |
Reprint of: Approximating majority depth
Computational Geometry | 2016-01-29 | Paper |
Towards tight bounds on theta-graphs: more is not always better
Theoretical Computer Science | 2016-01-21 | Paper |
Compatible connectivity augmentation of planar disconnected graphs
Discrete \& Computational Geometry | 2015-12-02 | Paper |
The price of order
Algorithms and Computation | 2015-09-11 | 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 |
The \(\varTheta_5\)-graph is a spanner
Computational Geometry | 2015-03-06 | Paper |
Robust geometric spanners
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Randomized rendezvous with limited memory
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Entropy, triangulation, and point location in planar subdivisions
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Succinct geometric indexes supporting point location queries
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 |
Planar visibility, testing and counting
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Biased predecessor search
Lecture Notes in Computer Science | 2014-03-31 | Paper |
The \(\theta_5\)-graph is a spanner
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Robust geometric spanners
SIAM Journal on Computing | 2013-11-14 | Paper |
A history of distribution-sensitive data structures
Lecture Notes in Computer Science | 2013-09-13 | Paper |
Approximating majority depth
Computational Geometry | 2013-09-03 | 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 |
Coverage with \(k\)-transmitters in the presence of obstacles
Journal of Combinatorial Optimization | 2013-03-25 | Paper |
Absolute approximation of Tukey depth: theory and experiments
Computational Geometry | 2013-03-12 | Paper |
Fast local searches and updates in bounded universes
Computational Geometry | 2012-12-04 | Paper |
Oja centers and centers of gravity
Computational Geometry | 2012-12-04 | Paper |
Skip lift: a probabilistic alternative to red-black trees
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Memoryless routing in convex subdivisions: random walks are optimal
Computational Geometry | 2012-05-18 | Paper |
A distribution-sensitive dictionary with low space overhead
Journal of Discrete Algorithms | 2012-05-11 | Paper |
Biased range trees
Algorithmica | 2012-04-26 | Paper |
A generalized Winternitz theorem
Journal of Geometry | 2012-01-13 | Paper |
Common unfoldings of polyominoes and polycubes
Lecture Notes in Computer Science | 2011-11-11 | Paper |
Preprocessing imprecise points for Delaunay triangulation: simplified and extended
Algorithmica | 2011-11-07 | Paper |
Algorithms for marketing-mix optimization
Algorithmica | 2011-07-01 | Paper |
Skip lift: a probabilistic alternative to red-black trees
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Coverage with \(k\)-transmitters in the presence of obstacles
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
Simultaneous diagonal flips in plane triangulations
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
scientific article; zbMATH DE number 5764827 (Why is no real title available?)
| 2010-08-06 | Paper |
Centerpoint theorems for wedges
| 2010-07-27 | Paper |
Improved methods for generating quasi-Gray codes
Lecture Notes in Computer Science | 2010-06-22 | Paper |
On the false-positive rate of Bloom filters
Information Processing Letters | 2010-06-09 | Paper |
On the expected maximum degree of Gabriel and Yao graphs
Advances in Applied Probability | 2010-05-11 | Paper |
Output-sensitive algorithms for computing nearest-neighbour decision boundaries.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Sigma-local graphs
Journal of Discrete Algorithms | 2010-02-26 | Paper |
Succinct data structures for approximating convex functions with applications
Lecture Notes in Computer Science | 2010-02-05 | Paper |
A polynomial bound for untangling geometric planar graphs
Discrete \& Computational Geometry | 2009-12-14 | Paper |
Spanners of Complete k-Partite Geometric Graphs
SIAM Journal on Computing | 2009-11-06 | Paper |
Clamshell casting
Algorithmica | 2009-10-23 | Paper |
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Delaunay Triangulation of Imprecise Points Simplified and Extended
Lecture Notes in Computer Science | 2009-10-20 | Paper |
A Distribution-Sensitive Dictionary with Low Space Overhead
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Algorithms for optimal outlier removal
Journal of Discrete Algorithms | 2009-06-24 | Paper |
Rotationally monotone polygons
Computational Geometry | 2009-06-18 | Paper |
scientific article; zbMATH DE number 5542484 (Why is no real title available?)
| 2009-04-14 | Paper |
Distinct distances in graph drawings
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Cuckoo hashing: Further analysis
Information Processing Letters | 2009-03-23 | Paper |
Realizing partitions respecting full and partial order information
Journal of Discrete Algorithms | 2008-11-18 | Paper |
A characterization of the degree sequences of 2-trees
Journal of Graph Theory | 2008-09-04 | Paper |
Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
Discrete \& Computational Geometry | 2008-04-16 | Paper |
Randomized Rendez-Vous with Limited Memory
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Spanners of Complete k-Partite Geometric Graphs
Lecture Notes in Computer Science | 2008-04-15 | Paper |
An optimal randomized algorithm for \(d\)-variate zonoid depth
Computational Geometry | 2008-03-13 | Paper |
Algorithms for bivariate zonoid depth
Computational Geometry | 2007-10-19 | Paper |
Edge-unfolding nested polyhedral bands
Computational Geometry | 2007-10-19 | Paper |
Space-efficient geometric divide-and-conquer algorithms
Computational Geometry | 2007-06-04 | Paper |
Simultaneous diagonal flips in plane triangulations
Journal of Graph Theory | 2007-05-11 | Paper |
Reconfiguring triangulations with edge flips and point moves
Algorithmica | 2007-05-10 | Paper |
Geodesic ham-sandwich cuts
Discrete \& Computational Geometry | 2007-04-26 | Paper |
Packing two disks into a polygonal environment.
Journal of Discrete Algorithms | 2007-04-25 | Paper |
Three-Dimensional 1-Bend Graph Drawings
Journal of Graph Algorithms and Applications | 2006-04-03 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
scientific article; zbMATH DE number 2226802 (Why is no real title available?)
| 2005-11-08 | Paper |
Layout of Graphs with Bounded Tree-Width
SIAM Journal on Computing | 2005-09-16 | Paper |
Covering things with things
Discrete \& Computational Geometry | 2005-08-02 | Paper |
Output-sensitive algorithms for computing nearest-neighbour decision boundaries
Discrete \& Computational Geometry | 2005-08-02 | Paper |
scientific article; zbMATH DE number 2185609 (Why is no real title available?)
| 2005-07-04 | Paper |
The Maximum Number of Edges in a Three-Dimensional Grid-Drawing
Journal of Graph Algorithms and Applications | 2005-05-25 | Paper |
The geometry of carpentry and joinery
Discrete Applied Mathematics | 2005-02-23 | Paper |
On Worst-Case Robin Hood Hashing
SIAM Journal on Computing | 2005-02-21 | Paper |
Online Routing in Triangulations
SIAM Journal on Computing | 2005-02-21 | Paper |
Asymmetric communication protocols via hotlink assignments
Theory of Computing Systems | 2005-02-11 | Paper |
Testing the quality of manufactured disks and balls
Algorithmica | 2004-12-02 | Paper |
Competitive online routing in geometric graphs
Theoretical Computer Science | 2004-11-23 | Paper |
COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
ONLINE ROUTING IN CONVEX SUBDIVISIONS
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
scientific article; zbMATH DE number 2086390 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2086251 (Why is no real title available?)
| 2004-08-11 | Paper |
Space-efficient planar convex hull algorithms
Theoretical Computer Science | 2004-08-10 | Paper |
Ordered theta graphs
Computational Geometry | 2004-08-06 | Paper |
scientific article; zbMATH DE number 2080267 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2080234 (Why is no real title available?)
| 2004-08-04 | Paper |
On simplifying dot maps.
Computational Geometry | 2004-01-23 | Paper |
scientific article; zbMATH DE number 1974106 (Why is no real title available?)
| 2003-09-03 | Paper |
scientific article; zbMATH DE number 1947430 (Why is no real title available?)
| 2003-07-08 | Paper |
Translating a regular grid over a point set
Computational Geometry | 2003-05-19 | Paper |
Fast approximations for sums of distances, clustering and the Fermat-Weber problem
Computational Geometry | 2003-04-28 | Paper |
scientific article; zbMATH DE number 1830732 (Why is no real title available?)
| 2002-11-18 | Paper |
scientific article; zbMATH DE number 1796962 (Why is no real title available?)
| 2002-09-05 | Paper |
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks | 2002-01-14 | Paper |
scientific article; zbMATH DE number 1552835 (Why is no real title available?)
| 2001-12-12 | Paper |
Simple polygons with an infinite sequence of deflations
Beiträge zur Algebra und Geometrie | 2001-11-18 | Paper |
scientific article; zbMATH DE number 1522924 (Why is no real title available?)
| 2000-10-30 | 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 |
Patricia's Bad Distributions
| 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 |
Vertex Ranking of Degenerate Graphs
| N/A | Paper |
