Eyal Ackerman

CoRR, March, 2025

The Maximum Number of Digons Formed by Pairwise Intersecting Pseudocircles.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Computational Geometry, 2025

2024

On partitions of two-dimensional discrete boxes.

[BibT_eX]

[DOI]

Discret. Math., April, 2024

On tangencies among planar curves with an application to coloring L-shapes.

[BibT_eX]

[DOI]

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

Eur. J. Comb., 2024

On the number of tangencies among 1-intersecting x-monotone curves.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

The maximum number of digons formed by pairwise crossing pseudocircles.

[BibT_eX]

[DOI]

CoRR, 2024

On the Number of Digons in Arrangements of Pairwise Intersecting Circles.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

The maximum size of adjacency-crossing graphs.

[BibT_eX]

[DOI]

CoRR, 2023

On the number of tangencies among 1-intersecting curves.

[BibT_eX]

[DOI]

CoRR, 2023

2021

Coloring Delaunay-edges and their generalizations.

[BibT_eX]

[DOI]

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

Comput. Geom., 2021

2020

Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs.

[BibT_eX]

[DOI]

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

SIAM J. Discret. Math., 2020

An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons.

[BibT_eX]

[DOI]

Günter Rote

Proceedings of the 36th International Symposium on Computational Geometry, 2020

Quasi-planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Beyond Planar Graphs, Communications of NII Shonan Meetings., 2020

2019

On topological graphs with at most four crossings per edge.

[BibT_eX]

[DOI]

Comput. Geom., 2019

2016

On the Size of Planarly Connected Crossing Graphs.

[BibT_eX]

[DOI]

Máté Vizer

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

Coloring Points with Respect to Squares.

[BibT_eX]

[DOI]

Máté Vizer

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2014

The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges.

[BibT_eX]

[DOI]

Noa Nitzan

Graphs Comb., 2014

A note on 1-planar graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

A Note on Coloring Line Arrangements.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

The Flip Diameter of Rectangulations and Convex Subdivisions.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

A Crossing Lemma for the Pair-Crossing Number.

[BibT_eX]

[DOI]

Marcus Schaefer

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

2013

On coloring points with respect to rectangles.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2013

Covering a chessboard with staircase walks.

[BibT_eX]

[DOI]

Discret. Math., 2013

A note on light geometric graphs.

[BibT_eX]

[DOI]

Jacob Fox

Discret. Math., 2013

On the Degenerate Crossing Number.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

Ice-creams and wedge graphs.

[BibT_eX]

[DOI]

Tsachik Gelander

Comput. Geom., 2013

2012

Graphs That Admit Polyline Drawings with Few Crossing Angles.

[BibT_eX]

[DOI]

Radoslav Fulek

Csaba D. Tóth

SIAM J. Discret. Math., 2012

On the light side of geometric graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

A note on coloring line arrangements

[BibT_eX]

[DOI]

CoRR, 2012

2011

Every Simple Arrangement of n Lines Contains an Inducing Simple n-gon.

[BibT_eX]

[DOI]

Am. Math. Mon., 2011

2010

Combinatorial model and bounds for target set selection.

[BibT_eX]

[DOI]

Oren Ben-Zwi

Guy Wolfovitz

Theor. Comput. Sci., 2010

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

[BibT_eX]

[DOI]

Radoslav Fulek

Csaba D. Tóth

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

2009

On sets of points that determine only acute angles.

[BibT_eX]

[DOI]

Oren Ben-Zwi

Eur. J. Comb., 2009

On Inducing Polygons and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2009

On grids in topological graphs.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2007

On the maximum number of edges in quasi-planar graphs.

[BibT_eX]

[DOI]

Gábor Tardos

J. Comb. Theory A, 2007

There are not too many magic configurations.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

Improved Upper Bounds on the Reflexivity of Point Sets.

[BibT_eX]

[DOI]

Oswin Aichholzer

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Counting problems for geometric structures: rectangulations, floorplans, and quasi-planar graphs.

[BibT_eX]

[DOI]

PhD thesis, 2006

On the number of rectangulations of a planar point set.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2006

The number of guillotine partitions in d dimensions.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

A bijection between permutations and floorplans, and its applications.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Acyclic Orientation of Drawings.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2006

On the maximum number of edges in topological graphs with no four pairwise crossing edges.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005

An Upper Bound on the Number of Rectangulations of a Point Set.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

On the number of rectangular partitions.

[BibT_eX]

[DOI]