Radoslav Fulek

Discret. Comput. Geom., 2022

2021

Saturation Problems about Forbidden 0-1 Submatrices.

[BibT_eX]

[DOI]

Balázs Keszegh

SIAM J. Discret. Math., 2021

Strong Hanani-Tutte for the Torus.

[BibT_eX]

[DOI]

Michael J. Pelsmajer

Marcus Schaefer

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Computing β-Stretch Paths in Drawings of Graphs.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

Atomic Embeddability, Clustered Planarity, and Thickenability.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Polygons with Prescribed Angles in 2D and 3D.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

2019

Counterexample to an Extension of the Hanani-Tutte Theorem on the Surface of Genus 4.

[BibT_eX]

[DOI]

Comb., 2019

Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

The Crossing Tverberg Theorem.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

The ℤ<sub>2</sub>-genus of Kuratowski minors.

[BibT_eX]

[DOI]

CoRR, 2018

Recognizing Weak Embeddings of Graphs.

[BibT_eX]

[DOI]

Hugo A. Akitaya

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Crossing Minimization in Perturbed Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

The Z_2-Genus of Kuratowski Minors.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Computational Geometry, 2018

Hanani-Tutte for Approximating Maps of Graphs.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

On the existence of ordinary triangles.

[BibT_eX]

[DOI]

Hossein Nassajian Mojarrad

Comput. Geom., 2017

Unified Hanani-Tutte Theorem.

[BibT_eX]

[DOI]

Dömötör Pálvölgyi

Electron. J. Comb., 2017

Embedding Graphs into Embedded Graphs.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Thrackles: An Improved Upper Bound.

[BibT_eX]

[DOI]

János Pach

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016

Bounded Embeddings of Graphs in the Plane.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Hanani-Tutte for Radial Planarity II.

[BibT_eX]

[DOI]

Michael J. Pelsmajer

Marcus Schaefer

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

C-Planarity of Embedded Cyclic c-Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

2015

Crossing Numbers and Combinatorial Characterization of Monotone Drawings of $$K_n$$ K n.

[BibT_eX]

[DOI]

Martin Balko

Discret. Comput. Geom., 2015

Vertical Visibility Among Parallel Polygons in Three Dimensions.

[BibT_eX]

[DOI]

Rados Radoicic

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Hanani-Tutte for Radial Planarity.

[BibT_eX]

[DOI]

Michael J. Pelsmajer

Marcus Schaefer

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014

Estimating the Number of Disjoint Edges in Simple Topological Graphs via Cylindrical Drawings.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

Homometric sets in trees.

[BibT_eX]

[DOI]

Slobodan Mitrovic

Eur. J. Comb., 2014

Toward the Hanani-Tutte Theorem for Clustered Graphs.

[BibT_eX]

[DOI]

CoRR, 2014

Towards the Hanani-Tutte Theorem for Clustered Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

Clustered Planarity Testing Revisited.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 22nd International Symposium, 2014

Free Edge Lengths in Plane Graphs.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013

Efficient c-planarity testing algebraically

[BibT_eX]

[DOI]

CoRR, 2013

Crossing numbers and combinatorial characterization of monotone drawings of $K_n$.

[BibT_eX]

[DOI]

Martin Balko

CoRR, 2013

Universal Point Sets for Planar Three-Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Extending Partial Representations of Circle Graphs.

[BibT_eX]

[DOI]

Steven Chaplick

Pavel Klavík

Proceedings of the Graph Drawing - 21st International Symposium, 2013

Topological graphs: empty triangles and disjoint matchings.

[BibT_eX]

[DOI]

Andres J. Ruiz-Vargas

Proceedings of the Symposium on Computational Geometry 2013, 2013

2012

Graphs That Admit Polyline Drawings with Few Crossing Angles.

[BibT_eX]

[DOI]

Eyal Ackerman

SIAM J. Discret. Math., 2012

Universal point sets for planar three-tree

[BibT_eX]

[DOI]

CoRR, 2012

2011

On disjoint crossing families in geometric graphs.

[BibT_eX]

[DOI]

Andrew Suk

Electron. Notes Discret. Math., 2011

Diameter bounds for planar graphs.

[BibT_eX]

[DOI]

Filip Moric

David Pritchard

Discret. Math., 2011

Convex obstacle numbers of outerplanar graphs and bipartite permutation graphs

[BibT_eX]

[DOI]

Noushin Saeedi

Deniz Sariöz

CoRR, 2011

On Sets of Lines Not-Supporting Trees

[BibT_eX]

[DOI]

Daniel Neuwirth

CoRR, 2011

Hanani-Tutte and Monotone Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Orthogeodesic Point-Set Embedding of Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 19th International Symposium, 2011

Adjacent Crossings Do Matter.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 19th International Symposium, 2011

On the Page Number of Upward Planar Directed Acyclic Graphs.

[BibT_eX]

[DOI]

Fabrizio Frati

Andres J. Ruiz-Vargas

Proceedings of the Graph Drawing - 19th International Symposium, 2011

2010

A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets.

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

Graphs that Admit Right Angle Crossing Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

A Computational Approach to Conway's Thrackle Conjecture.

[BibT_eX]

[DOI]

János Pach

Proceedings of the Graph Drawing - 18th International Symposium, 2010

On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles.

[BibT_eX]

[DOI]

Eyal Ackerman

Proceedings of the Graph Drawing - 18th International Symposium, 2010

On polygons excluding point sets.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Coloring geometric hypergraph defined by an arrangement of half-planes.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009

Linear bound on extremal functions of some forbidden patterns in 0-1 matrices.

[BibT_eX]

[DOI]

Discret. Math., 2009

2008

Intersecting convex sets by rays.

[BibT_eX]

[DOI]