| Publication | Date of Publication | Type |
|---|
Coloring hypergraphs defined by stabbed pseudo-disks and \(ABAB\)-free hypergraphs
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
On tangencies among planar curves with an application to coloring L-shapes
European Journal of Combinatorics | 2024-09-30 | Paper |
On tangencies among planar curves with an application to coloring L-shapes
| 2024-09-13 | Paper |
On the number of tangencies among 1-intersecting \(x\)-monotone curves
European Journal of Combinatorics | 2024-03-26 | Paper |
On partitions of two-dimensional discrete boxes
Discrete Mathematics | 2024-02-19 | Paper |
An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons.
| 2023-11-02 | Paper |
The maximum size of adjacency-crossing graphs
| 2023-09-12 | Paper |
On the number of tangencies among 1-intersecting curves
| 2023-05-23 | Paper |
An almost optimal bound on the number of intersections of two simple polygons
Discrete & Computational Geometry | 2022-12-08 | Paper |
Coloring Delaunay-edges and their generalizations
Computational Geometry | 2021-09-16 | Paper |
Quasi-planar Graphs
Beyond Planar Graphs | 2021-07-22 | Paper |
On tangencies among planar curves with an application to coloring L-shapes
| 2021-03-04 | Paper |
Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs
SIAM Journal on Discrete Mathematics | 2020-12-04 | Paper |
On topological graphs with at most four crossings per edge
Computational Geometry | 2020-04-29 | Paper |
Coloring points with respect to squares
| 2018-01-30 | Paper |
On the size of planarly connected crossing graphs
Journal of Graph Algorithms and Applications | 2018-01-12 | Paper |
Coloring points with respect to squares
Discrete & Computational Geometry | 2018-01-11 | Paper |
On grids in topological graphs
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
The flip diameter of rectangulations and convex subdivisions
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2017-03-03 | Paper |
On the Size of Planarly Connected Crossing Graphs
Lecture Notes in Computer Science | 2017-02-21 | Paper |
scientific article; zbMATH DE number 6469215 (Why is no real title available?)
| 2015-08-03 | Paper |
A crossing lemma for the pair-crossing number
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
The maximum number of edges in geometric graphs with pairwise virtually avoiding edges
Graphs and Combinatorics | 2014-09-19 | Paper |
A note on coloring line arrangements
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
A note on 1-planar graphs
Discrete Applied Mathematics | 2014-08-26 | Paper |
On grids in topological graphs
Computational Geometry | 2014-06-27 | Paper |
The flip diameter of rectangulations and convex subdivisions
Lecture Notes in Computer Science | 2014-03-31 | Paper |
Covering a chessboard with staircase walks
Discrete Mathematics | 2014-01-24 | Paper |
A note on light geometric graphs
Discrete Mathematics | 2014-01-20 | Paper |
The maximum number of tangencies among convex regions with a triangle-free intersection graph
Thirty Essays on Geometric Graph Theory | 2013-09-25 | Paper |
On inducing polygons and related problems
Computational Geometry | 2013-08-22 | Paper |
On the degenerate crossing number
Discrete & Computational Geometry | 2013-06-07 | Paper |
On coloring points with respect to rectangles
Journal of Combinatorial Theory. Series A | 2013-04-15 | Paper |
Ice-creams and wedge graphs
Computational Geometry | 2013-01-25 | Paper |
Graphs that admit polyline drawings with few crossing angles
SIAM Journal on Discrete Mathematics | 2012-08-22 | Paper |
On the light side of geometric graphs
Discrete Mathematics | 2012-04-13 | Paper |
Combinatorial model and bounds for target set selection
Theoretical Computer Science | 2012-04-03 | Paper |
Every simple arrangement of \(n\) lines contains an inducing simple \(n\)-gon
The American Mathematical Monthly | 2011-03-08 | Paper |
Acyclic orientation of drawings
Journal of Graph Algorithms and Applications | 2011-02-16 | Paper |
On the size of graphs that admit polyline drawings with few bends and crossing angles
Graph Drawing | 2011-02-11 | Paper |
The number of guillotine partitions in \(d\) dimensions
Information Processing Letters | 2010-01-18 | Paper |
On Inducing Polygons and Related Problems
Lecture Notes in Computer Science | 2009-10-29 | Paper |
On sets of points that determine only acute angles
European Journal of Combinatorics | 2009-06-17 | Paper |
On the maximum number of edges in topological graphs with no four pairwise crossing edges
Discrete & Computational Geometry | 2009-04-27 | Paper |
scientific article; zbMATH DE number 5542483 (Why is no real title available?)
| 2009-04-14 | Paper |
Improved upper bounds on the reflexivity of point sets
Computational Geometry | 2009-02-12 | Paper |
scientific article; zbMATH DE number 5507813 (Why is no real title available?)
| 2009-02-12 | Paper |
On the maximum number of edges in topological graphs with no four pairwise crossing edges
| 2009-02-10 | Paper |
There are not too many magic configurations
Discrete & Computational Geometry | 2008-04-16 | Paper |
Acyclic Orientation of Drawings
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
On the maximum number of edges in quasi-planar graphs
Journal of Combinatorial Theory. Series A | 2007-05-04 | Paper |
On the number of rectangulations of a planar point set
Journal of Combinatorial Theory. Series A | 2006-08-17 | Paper |
A bijection between permutations and floorplans, and its applications
Discrete Applied Mathematics | 2006-08-14 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
