| Publication | Date of Publication | Type |
|---|
Progressions in Euclidean Ramsey theory
European Journal of Combinatorics | 2025-01-16 | Paper |
A breakthrough in the Erdős-Szekeres problem
Matematikai Lapok. (New Series) | 2024-09-11 | Paper |
Corrigendum to: ``An algorithm to find maximum area polygons circumscribed about a convex polygon
Discrete Applied Mathematics | 2024-05-29 | Paper |
Disjointness graphs of short polygonal chains
| 2024-05-14 | Paper |
Monochromatic spanning trees and matchings in ordered complete graphs
Journal of Graph Theory | 2024-02-23 | Paper |
Disjointness graphs of short polygonal chains
Journal of Combinatorial Theory. Series B | 2024-01-29 | Paper |
Helly-type theorems for the ordering of the vertices of a hypergraph
Order | 2023-12-19 | Paper |
1-planar unit distance graphs
| 2023-10-02 | Paper |
Saturated 2-plane drawings with few edges
Ars Mathematica Contemporanea | 2023-09-13 | Paper |
Monochromatic infinite sets in Minkowski planes
| 2023-08-17 | Paper |
Entanglement and extreme spin squeezing of unpolarized states
New Journal of Physics | 2023-05-12 | Paper |
Disjointness graphs of segments in the space
Combinatorics, Probability and Computing | 2023-03-30 | Paper |
scientific article; zbMATH DE number 7662683 (Why is no real title available?)
| 2023-03-13 | Paper |
Peeling Sequences
| 2022-11-10 | Paper |
Crossing lemma for the odd-crossing number
Computational Geometry | 2022-10-06 | Paper |
Quantum Wasserstein distance based on an optimization over separable states
| 2022-09-20 | Paper |
Scaling in income inequalities and its dynamical origin
Physica A | 2022-08-18 | Paper |
Crossings between non-homotopic edges
Journal of Combinatorial Theory. Series B | 2022-06-10 | Paper |
Improvement on the crossing number of crossing-critical graphs
Discrete & Computational Geometry | 2022-03-21 | Paper |
Wealth distribution in modern societies: collected data and a master equation approach
Physica A | 2022-03-01 | Paper |
Crossings Between Non-homotopic Edges
Lecture Notes in Computer Science | 2021-12-01 | Paper |
Improvement on the Crossing Number of Crossing-Critical Graphs
Lecture Notes in Computer Science | 2021-12-01 | Paper |
A slightly better bound on the crossing number in terms of the pair-crossing number
| 2021-05-29 | Paper |
On the hollow enclosed by convex sets
| 2021-03-16 | Paper |
Detecting metrologically useful entanglement in the vicinity of Dicke states
New Journal of Physics | 2021-02-19 | Paper |
Permutationally invariant state reconstruction
New Journal of Physics | 2020-12-02 | Paper |
A crossing lemma for multigraphs
| 2020-08-18 | Paper |
Petruska's question on planar convex sets
Discrete Mathematics | 2020-07-08 | Paper |
Crossings between non-homotopic edges
| 2020-06-26 | Paper |
A crossing lemma for multigraphs
Discrete & Computational Geometry | 2020-06-16 | Paper |
Improvement on the crossing number of crossing-critical graphs
| 2020-03-03 | Paper |
Many touchings force many crossings
Journal of Combinatorial Theory. Series B | 2019-07-17 | Paper |
Entanglement between two spatially separated atomic modes
Science | 2019-07-03 | Paper |
Many touchings force many crossings
Lecture Notes in Computer Science | 2019-02-20 | Paper |
An algorithm to find maximum area polygons circumscribed about a convex polygon
Discrete Applied Mathematics | 2019-02-20 | Paper |
The number of crossings in multigraphs with no empty lens
| 2018-08-30 | Paper |
Disjointness graphs of segments
| 2018-08-13 | Paper |
Block partitions: an extended view
Acta Mathematica Hungarica | 2018-07-23 | Paper |
Improvements on the density of maximal 1-planar graphs
Journal of Graph Theory | 2018-07-13 | Paper |
Note on \(k\)-planar crossing numbers
Computational Geometry | 2018-02-19 | Paper |
Improving the crossing lemma by finding more crossings in sparse graphs
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Monotone paths in line arrangement
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Point sets with many k -sets
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Separation with restricted families of sets
Journal of Combinatorial Theory. Series A | 2016-08-18 | Paper |
Erdős-Szekeres theorem for lines
Discrete & Computational Geometry | 2015-10-14 | Paper |
Survey on decomposition of multiple coverings
Bolyai Society Mathematical Studies | 2015-06-24 | Paper |
Saturated simple and \(k\)-simple topological graphs
Computational Geometry | 2015-05-12 | Paper |
Quantum metrology from a quantum information science perspective
Journal of Physics A: Mathematical and Theoretical | 2014-11-11 | Paper |
A note on coloring line arrangements
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Matrix variances with projections
| 2014-02-17 | Paper |
Monochromatic empty triangles in two-colored point sets
Discrete Applied Mathematics | 2013-11-29 | Paper |
A better bound for the pair-crossing number
Thirty Essays on Geometric Graph Theory | 2013-09-25 | Paper |
Separating families of convex sets
Computational Geometry | 2013-09-03 | Paper |
Improvement on the decay of crossing numbers
Graphs and Combinatorics | 2013-06-26 | Paper |
Monotone crossing number
Moscow Journal of Combinatorics and Number Theory | 2013-04-15 | Paper |
scientific article; zbMATH DE number 6140066 (Why is no real title available?)
| 2013-02-28 | Paper |
Tangled thrackles
Lecture Notes in Computer Science | 2013-01-07 | Paper |
Simulating continuous quantum systems by mean field fluctuations
| 2012-11-09 | Paper |
Erdős-Szekeres theorem for point sets with forbidden subconfigurations
Discrete & Computational Geometry | 2012-09-19 | Paper |
Drawing Hamiltonian cycles with no large angles
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
Monotone Crossing Number
Graph Drawing | 2012-03-09 | Paper |
Entanglement witnesses in spin models
Physical Review A | 2011-12-04 | Paper |
Graph unique-maximum and conflict-free colorings
Journal of Discrete Algorithms | 2011-08-23 | Paper |
Disjoint edges in topological graphs
Journal of Combinatorics | 2011-06-27 | Paper |
QUBIT4MATLAB V3.0: A program package for quantum information science and quantum optics for MATLAB
Computer Physics Communications | 2010-10-25 | Paper |
Towards the Albertson conjecture
The Electronic Journal of Combinatorics | 2010-06-16 | Paper |
Graph unique-maximum and conflict-free colorings
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Drawing Hamiltonian cycles with no large angles
Graph Drawing | 2010-04-27 | Paper |
Convex polygons are cover-decomposable
Discrete & Computational Geometry | 2010-04-12 | Paper |
Discrete and Computational Geometry
Lecture Notes in Computer Science | 2010-02-05 | Paper |
Cubic graphs have bounded slope parameter
Journal of Graph Algorithms and Applications | 2010-02-04 | Paper |
Monochromatic empty triangles in two-colored point sets
| 2010-01-13 | Paper |
Indecomposable Coverings
Canadian Mathematical Bulletin | 2009-10-15 | Paper |
Generalized spin squeezing criteria: entanglement detection with collective measurements
| 2009-08-17 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Degenerate crossing numbers
Discrete & Computational Geometry | 2009-04-27 | Paper |
Cubic Graphs Have Bounded Slope Parameter
Graph Drawing | 2009-03-03 | Paper |
Decomposition of multiple coverings into many parts
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
scientific article; zbMATH DE number 5506215 (Why is no real title available?)
| 2009-02-10 | Paper |
Decomposition of multiple coverings into many parts
Computational Geometry | 2008-11-19 | Paper |
Long alternating paths in bicolored point sets
Discrete Mathematics | 2008-09-04 | Paper |
Note on the pair-crossing number and the odd-crossing number
Discrete & Computational Geometry | 2008-08-19 | Paper |
Crossing Stars in Topological Graphs
SIAM Journal on Discrete Mathematics | 2008-08-13 | Paper |
The discharging method in combinatorial geometry and the Pach-Sharir conjecture
| 2008-07-21 | Paper |
Drawing cubic graphs with at most five slopes
Computational Geometry | 2008-04-28 | Paper |
The shortest distance among points in general position.
Computational Geometry | 2008-04-25 | Paper |
Improvement on the Decay of Crossing Numbers
Graph Drawing | 2008-03-25 | Paper |
Crossing Stars in Topological Graphs
Discrete and Computational Geometry | 2008-03-18 | Paper |
Multiple coverings of the plane with triangles
Discrete & Computational Geometry | 2007-12-19 | Paper |
Drawing Cubic Graphs with at Most Five Slopes
Graph Drawing | 2007-08-28 | Paper |
Indecomposable Coverings
Lecture Notes in Computer Science | 2007-08-28 | Paper |
How many ways can one draw a graph?
Combinatorica | 2007-05-08 | Paper |
scientific article; zbMATH DE number 5130834 (Why is no real title available?)
| 2007-03-05 | Paper |
The maximum number of empty congruent triangles determined by a point set
| 2007-01-26 | Paper |
Improving the crossing lemma by finding more crossings in sparse graphs
Discrete & Computational Geometry | 2006-12-06 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
PLANAR CROSSING NUMBERS OF GRAPHS EMBEDDABLE IN ANOTHER SURFACE
International Journal of Foundations of Computer Science | 2006-10-16 | Paper |
Combinatorial Geometry and Graph Theory
Lecture Notes in Computer Science | 2006-10-10 | Paper |
scientific article; zbMATH DE number 5035595 (Why is no real title available?)
| 2006-06-26 | Paper |
scientific article; zbMATH DE number 5019923 (Why is no real title available?)
| 2006-04-28 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Topological graphs with no large grids
Graphs and Combinatorics | 2005-11-24 | Paper |
scientific article; zbMATH DE number 2209737 (Why is no real title available?)
| 2005-09-28 | Paper |
scientific article; zbMATH DE number 2209739 (Why is no real title available?)
| 2005-09-28 | Paper |
scientific article; zbMATH DE number 2145240 (Why is no real title available?)
| 2005-03-14 | Paper |
Geometric graphs with no self-intersecting path of length three
European Journal of Combinatorics | 2004-10-04 | Paper |
Monotone drawings of planar graphs
Journal of Graph Theory | 2004-08-06 | Paper |
scientific article; zbMATH DE number 2084281 (Why is no real title available?)
| 2004-08-06 | Paper |
scientific article; zbMATH DE number 2080111 (Why is no real title available?)
| 2004-08-04 | Paper |
Unavoidable configurations in complete topological graphs
Discrete & Computational Geometry | 2004-03-07 | Paper |
scientific article; zbMATH DE number 1979538 (Why is no real title available?)
| 2003-09-14 | Paper |
scientific article; zbMATH DE number 1974129 (Why is no real title available?)
| 2003-09-03 | Paper |
Monotone paths in line arrangements
Computational Geometry | 2003-04-28 | Paper |
Crossing numbers of random graphs
Random Structures & Algorithms | 2003-03-19 | Paper |
Recognizing string graphs is decidable
Discrete & Computational Geometry | 2003-03-17 | Paper |
A modular version of the Erdős– Szekeres theorem
Studia Scientiarum Mathematicarum Hungarica | 2003-02-18 | Paper |
Which crossing number is it anyway?
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
Modeling nematohydrodynamics in liquid crystal devices
Computer Physics Communications | 2002-09-12 | Paper |
Domain motion in confined liquid crystals
Journal of Statistical Physics | 2002-08-21 | Paper |
Ramsey-type results for unions of comparability graphs
Graphs and Combinatorics | 2002-07-29 | Paper |
Point sets with many \(k\)-sets
Discrete & Computational Geometry | 2002-07-10 | Paper |
Convex sets in the plane with three of every four meeting
Combinatorica | 2002-02-13 | Paper |
New bounds on crossing numbers
Discrete & Computational Geometry | 2001-06-28 | Paper |
Finding convex sets in convex positions
Combinatorica | 2001-06-13 | Paper |
An Erdős-Szekeres type problem in the plane
Periodica Mathematica Hungarica | 2001-06-12 | Paper |
Erdős-Szekeres-type theorems for segments and noncrossing convex sets
Geometriae Dedicata | 2001-04-23 | Paper |
scientific article; zbMATH DE number 1452728 (Why is no real title available?)
| 2001-03-15 | Paper |
Note on geometric graphs
Journal of Combinatorial Theory. Series A | 2000-12-11 | Paper |
Geometric graphs with few disjoint edges
Discrete & Computational Geometry | 2000-06-27 | Paper |
CNNUM stereo architecture and 3D template design techniques
| 1999-06-20 | Paper |
Ramsey-type results for geometric graphs. II
Discrete & Computational Geometry | 1999-05-16 | Paper |
scientific article; zbMATH DE number 1241845 (Why is no real title available?)
| 1999-01-18 | Paper |
Note on the Erdős-Szekeres theorem
Discrete & Computational Geometry | 1998-12-15 | Paper |
A generalisation of the Erdős-Szekeres theorem to disjoint convex sets
Discrete & Computational Geometry | 1998-12-15 | Paper |
Graphs drawn with few crossings per edge
Combinatorica | 1998-11-24 | Paper |
Note on an art gallery problem
Computational Geometry | 1998-10-01 | Paper |
Ramsey-type results for geometric graphs. I
Discrete & Computational Geometry | 1998-04-22 | Paper |
scientific article; zbMATH DE number 1054783 (Why is no real title available?)
| 1998-03-02 | Paper |
A ramsey-type bound for rectangles
| 1997-04-07 | Paper |
A Ramsey-type problem on right-angled triangles in space
Discrete Mathematics | 1996-09-01 | Paper |
scientific article; zbMATH DE number 903282 (Why is no real title available?)
| 1996-07-15 | Paper |
Note on a Ramsey-type problem in geometry
Journal of Combinatorial Theory. Series A | 1994-12-01 | Paper |
Two trees are better than one
| N/A | Paper |
Progressions in Euclidean Ramsey theory
| N/A | Paper |
Canonical theorems in geometric Ramsey theory
| N/A | Paper |
