| Publication | Date of Publication | Type |
|---|
Switches in Eulerian graphs
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
On Compatible Matchings
Journal of Graph Algorithms and Applications | 2022-11-14 | Paper |
Extending the centerpoint theorem to multiple points
(available as arXiv preprint) | 2022-07-21 | Paper |
Arrangements of approaching pseudo-lines
Discrete & Computational Geometry | 2022-03-21 | Paper |
Augmenting Geometric Graphs with Matchings
Lecture Notes in Computer Science | 2021-12-01 | Paper |
On plane subgraphs of complete topological drawings
Ars Mathematica Contemporanea | 2021-10-14 | Paper |
On compatible matchings
(available as arXiv preprint) | 2021-10-04 | Paper |
Bisecting three classes of lines
Computational Geometry | 2021-09-17 | Paper |
Convex quadrangulations of bichromatic point sets
International Journal of Computational Geometry & Applications | 2021-02-11 | Paper |
From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
Discrete & Computational Geometry | 2020-10-23 | Paper |
From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
Discrete & Computational Geometry | 2020-10-23 | Paper |
| Planar 3-SAT with a clause/variable cycle | 2020-08-25 | Paper |
Transition operations over plane trees
Discrete Mathematics | 2020-06-08 | Paper |
Transition operations over plane trees
Lecture Notes in Computer Science | 2020-02-12 | Paper |
A new lower bound on the maximum number of plane graphs using production matrices
Computational Geometry | 2019-10-25 | Paper |
Packing plane spanning graphs with short edges in complete geometric graphs
Computational Geometry | 2019-10-25 | Paper |
Planar 3-SAT with a clause/variable cycle
(available as arXiv preprint) | 2019-08-01 | Paper |
| Planar 3-SAT with a clause/variable cycle | 2019-08-01 | Paper |
| Switches in Eulerian graphs | 2019-05-08 | Paper |
Holes in 2-convex point sets
Computational Geometry | 2018-10-31 | Paper |
| From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices | 2018-08-13 | Paper |
Order on order types
Discrete & Computational Geometry | 2018-07-13 | Paper |
Holes in 2-convex point sets
Lecture Notes in Computer Science | 2018-06-15 | Paper |
Linear transformation distance for bichromatic matchings
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Packing short plane spanning trees in complete geometric graphs
(available as arXiv preprint) | 2018-04-19 | Paper |
Ham-sandwich cuts for abstract order types
Algorithmica | 2018-02-28 | Paper |
Linear transformation distance for bichromatic matchings
Computational Geometry | 2018-02-19 | Paper |
The dual diameter of triangulations
Computational Geometry | 2018-02-19 | Paper |
| An improved lower bound on the minimum number of triangulations | 2018-01-30 | Paper |
| Characteristic polynomials of production matrices for geometric graphs | 2018-01-18 | Paper |
Induced Ramsey-type results and binary predicates for point sets
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
Induced Ramsey-type results and binary predicates for point sets
The Electronic Journal of Combinatorics | 2017-10-24 | Paper |
An optimal algorithm for reconstructing point set order types from radial orderings
International Journal of Computational Geometry & Applications | 2017-10-20 | Paper |
| Order on order types | 2017-10-10 | Paper |
Minimization and maximization versions of the quadratic travelling salesman problem
Optimization | 2017-07-12 | Paper |
Packing plane spanning trees and paths in complete geometric graphs
Information Processing Letters | 2017-06-13 | Paper |
| Two-component link maps in manifolds | 2017-06-08 | Paper |
| Two-component link maps in manifolds | 2017-06-08 | Paper |
| Production matrices for geometric graphs | 2017-02-13 | Paper |
3-colorability of pseudo-triangulations
International Journal of Computational Geometry & Applications | 2016-03-14 | Paper |
An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings
Algorithms and Computation | 2016-01-11 | Paper |
Flip distance between triangulations of a simple polygon is NP-complete
Discrete & Computational Geometry | 2015-12-02 | Paper |
Ham-sandwich cuts for abstract order types
Lecture Notes in Computer Science | 2015-09-11 | Paper |
Geodesic-preserving polygon simplification
International Journal of Computational Geometry & Applications | 2015-07-01 | Paper |
Empty triangles in good drawings of the complete graph
Graphs and Combinatorics | 2015-05-22 | Paper |
Flips in combinatorial pointed pseudo-triangulations with face degree at most four
International Journal of Computational Geometry & Applications | 2015-04-22 | Paper |
Monotone simultaneous embeddings of upward planar digraphs
Journal of Graph Algorithms and Applications | 2015-03-04 | Paper |
| Cell-paths in mono- and bichromatic line arrangements in the plane | 2015-02-09 | Paper |
Geodesic order types
Algorithmica | 2015-01-19 | Paper |
New results on stabbing segments with a polygon
Computational Geometry | 2014-11-24 | Paper |
On \(k\)-convex point sets
Computational Geometry | 2014-06-27 | Paper |
Lower bounds for the number of small convex \(k\)-holes
Computational Geometry | 2014-04-09 | Paper |
Flip distance between triangulations of a planar point set is APX-hard
Computational Geometry | 2014-04-09 | Paper |
Reprint of: Extreme point and halving edge search in abstract order types
Computational Geometry | 2014-01-22 | Paper |
Geodesic-preserving polygon simplification
Algorithms and Computation | 2014-01-14 | Paper |
Flip distance between triangulations of a simple polygon is NP-complete
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Extreme point and halving edge search in abstract order types
Computational Geometry | 2013-07-31 | Paper |
New results on stabbing segments with a polygon
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Blocking Delaunay triangulations
Computational Geometry | 2012-12-04 | Paper |
Geodesic order types
Lecture Notes in Computer Science | 2012-09-25 | Paper |
