2024
Spiraling and Folding: The Topological View.
Discret. Comput. Geom., July, 2024
Many Views of Planar Point Sets.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024
2023
Extending simple monotone drawings.
CoRR, 2023
Drawings of Complete Multipartite Graphs up to Triangle Flips.
Proceedings of the 39th International Symposium on Computational Geometry, 2023
2022
On the Maximum Number of Crossings in Star-Simple Drawings of K<sub>n</sub> with No Empty Lens.
J. Graph Algorithms Appl., 2022
The $\mathbb {Z}_2$-Genus of Kuratowski Minors.
Discret. Comput. Geom., 2022
On crossing-families in planar point sets.
Comput. Geom., 2022
2020
Minimal Representations of Order Types by Geometric Graphs.
,
,
,
,
,
,
,
,
,
,
J. Graph Algorithms Appl., 2020
A superlinear lower bound on the number of 5-holes.
J. Comb. Theory A, 2020
On the growth of the Möbius function of permutations.
J. Comb. Theory A, 2020
Simple Realizability of Complete Abstract Topological Graphs Simplified.
Discret. Comput. Geom., 2020
2019
Counterexample to an Extension of the Hanani-Tutte Theorem on the Surface of Genus 4.
Comb., 2019
Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices.
Proceedings of the 35th International Symposium on Computational Geometry, 2019
2018
The ℤ<sub>2</sub>-genus of Kuratowski minors.
CoRR, 2018
The Z_2-Genus of Kuratowski Minors.
Proceedings of the 34th International Symposium on Computational Geometry, 2018
Hanani-Tutte for Approximating Maps of Graphs.
Proceedings of the 34th International Symposium on Computational Geometry, 2018
2017
Peeling Potatoes Near-Optimally in Near-Linear Time.
SIAM J. Comput., 2017
Induced Ramsey-type results and binary predicates for point sets.
Electron. Notes Discret. Math., 2017
Irreversible 2-conversion set in graphs of bounded degree.
Discret. Math. Theor. Comput. Sci., 2017
Near equipartitions of colored point sets.
Comput. Geom., 2017
On the Nonexistence of <i>k</i>-Reptile Simplices in ℝ<sup>3</sup> and ℝ<sup>4</sup>.
Electron. J. Comb., 2017
Unified Hanani-Tutte Theorem.
Electron. J. Comb., 2017
Hardness of Permutation Pattern Matching.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Better upper bounds on the Füredi-Hajnal limits of permutations.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
2016
Füredi-Hajnal limits are typically subexponential.
CoRR, 2016
2015
Ramsey numbers of ordered graphs.
Electron. Notes Discret. Math., 2015
Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex.
Discret. Comput. Geom., 2015
Crossing Numbers and Combinatorial Characterization of Monotone Drawings of $$K_n$$ K n.
Discret. Comput. Geom., 2015
Saturated simple and k-simple topological graphs.
Comput. Geom., 2015
Clustered Planarity Testing Revisited.
Electron. J. Comb., 2015
2013
Graph sharing games: Complexity and connectivity.
Theor. Comput. Sci., 2013
Improvement on the Decay of Crossing Numbers.
Graphs Comb., 2013
Improved Enumeration of Simple Topological Graphs.
Discret. Comput. Geom., 2013
Efficient c-planarity testing algebraically
CoRR, 2013
Crossing numbers and combinatorial characterization of monotone drawings of $K_n$.
CoRR, 2013
On measurement of synchronous phasors in electrical grids.
Proceedings of the 2013 IEEE International Symposium on Circuits and Systems (ISCAS2013), 2013
On planar point sets with the pentagon property.
Proceedings of the Symposium on Computational Geometry 2013, 2013
2012
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension.
J. Comb. Theory A, 2012
2011
Simple Realizability of Complete Abstract Topological Graphs in P.
Discret. Comput. Geom., 2011
Universal Sets for Straight-Line Embeddings of Bicolored Graphs
CoRR, 2011
Education of Digital and Analog Circuits supported by computer algebra system.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2011), 2011
2010
On Three Parameters of Invisibility Graphs.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010
2009
6-Critical Graphs on the Klein Bottle.
SIAM J. Discret. Math., 2009
Logspace reduction of directed reachability for bounded genus graphs to the planar case.
Electron. Colloquium Comput. Complex., 2009
On edges crossing few other edges in simple topological complete graphs.
Discret. Math., 2009
Monochromatic triangles in two-colored plane.
Comb., 2009
Solution of Peter Winkler's Pizza Problem.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009
2008
Ramsey-type constructions for arrangements of segments.
Electron. Notes Discret. Math., 2008
Six-Critical Graphs on the Klein Bottle.
Electron. Notes Discret. Math., 2008
Long alternating paths in bicolored point sets.
Discret. Math., 2008
The Maximum Piercing Number for some Classes of Convex Sets with the (4, 3)-property.
Electron. J. Comb., 2008
Hamiltonian Alternating Paths on Bicolored Double-Chains.
Proceedings of the Graph Drawing, 16th International Symposium, 2008
2007
Probabilistic strategies for the partition and plurality problems.
Random Struct. Algorithms, 2007
Enumeration of simple complete topological graphs.
Electron. Notes Discret. Math., 2007
The Complexity of Several Realizability Problems for Abstract Topological Graphs.
Proceedings of the Graph Drawing, 15th International Symposium, 2007
2005
Three Optimal Algorithms for Balls of Three Colors.
Proceedings of the STACS 2005, 2005