János Pach

Morteza Saghafian

CoRR, July, 2025

Ruzsa's Problem on Bi-Sidon Sets.

[BibT_eX]

[DOI]

Dmitrii Zakharov

Comb., April, 2025

A Purely Geometric Variant of the Gale-Berlekamp Switching Game.

[BibT_eX]

[DOI]

CoRR, February, 2025

Two Trees Are Better than One.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2025

A structure theorem for pseudosegments and its applications.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2025

Immersions and Albertson's Conjecture.

[BibT_eX]

[DOI]

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

2024

A Farewell to Eli Goodman.

[BibT_eX]

[DOI]

Discret. Comput. Geom., September, 2024

Foreword.

[BibT_eX]

[DOI]

Kenneth L. Clarkson

Csaba D. Tóth

Discret. Comput. Geom., September, 2024

Where Have All the Grasshoppers Gone?

[BibT_eX]

[DOI]

Am. Math. Mon., March, 2024

Random Necklaces Require Fewer Cuts.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2024

Odd-sunflowers.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2024

Beyond-Planar Graphs: Models, Structures and Geometric Representations (Dagstuhl Seminar 24062).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2024

Partitioning complete geometric graphs into plane subgraphs.

[BibT_eX]

[DOI]

CoRR, 2024

Enumeration of Intersection Graphs of x-Monotone Curves.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

A Structure Theorem for Pseudo-Segments and Its Applications.

[BibT_eX]

[DOI]

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

Maximum Betti Numbers of Čech Complexes.

[BibT_eX]

[DOI]

Herbert Edelsbrunner

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

2023

Optimal Embedded and Enclosing Isosceles Triangles.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., November, 2023

Successive vertex orderings of fully regular graphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2023

Decomposition of Geometric Graphs into Star-Forests.

[BibT_eX]

[DOI]

Morteza Saghafian

Patrick Schnider

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

2022

Exchange Properties of Finite Set-Systems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2022

Weight balancing on boundaries.

[BibT_eX]

[DOI]

J. Comput. Geom., 2022

On Well-Connected Sets of Strings.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

Quasiplanar Graphs, String Graphs, and the Erdős-Gallai Problem.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

Disjointness Graphs of Short Polygonal Chains.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Erdős-Hajnal-type results for monotone paths.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

Disjointness graphs of segments in the space.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

On the Number of Edges of Separated Multigraphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

Sunflowers in Set Systems of Bounded Dimension.

[BibT_eX]

[DOI]

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

2020

Large Homogeneous Submatrices.

[BibT_eX]

[DOI]

Dániel Korándi

SIAM J. Discret. Math., 2020

Minimum Area Isosceles Containers.

[BibT_eX]

[DOI]

Gergely Kiss

Gábor Somlai

J. Inf. Process., 2020

A Farewell to Ricky Pollack.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2020

Crossings Between Non-homotopic Edges.

[BibT_eX]

[DOI]

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

Bounded VC-Dimension Implies the Schur-Erdős Conjecture.

[BibT_eX]

[DOI]

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

2019

Ordered graphs and large bi-cliques in intersection graphs of curves.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

Beyond-Planar Graphs: Combinatorics, Models and Algorithms (Dagstuhl Seminar 19092).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2019

On the Size of K-Cross-Free Families.

[BibT_eX]

[DOI]

Comb., 2019

Planar point sets determine many pairwise crossing segments.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Coloring Hasse Diagrams and Disjointness Graphs of Curves.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

On the Chromatic Number of Disjointness Graphs of Curves.

[BibT_eX]

[DOI]

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

Semi-Algebraic Colorings of Complete Graphs.

[BibT_eX]

[DOI]

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

2018

A stability theorem on cube tessellations.

[BibT_eX]

[DOI]

J. Comput. Geom., 2018

Tilings with noncongruent triangles.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

Note on k-planar crossing numbers.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Ramsey-Turán Numbers for Semi-Algebraic Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

More Distinct Distances Under Local Conditions.

[BibT_eX]

[DOI]

Comb., 2018

The Number of Crossings in Multigraphs with No Empty Lens.

[BibT_eX]

[DOI]

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

A Crossing Lemma for Multigraphs.

[BibT_eX]

[DOI]

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

Almost All String Graphs are Intersection Graphs of Plane Convex Sets.

[BibT_eX]

[DOI]

Bruce A. Reed

Yelena Yuditsky

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

2017

From Tarski's Plank Problem to Simultaneous Approximation.

[BibT_eX]

[DOI]

Am. Math. Mon., 2017

Decomposition of a Cube into Nearly Equal Smaller Cubes.

[BibT_eX]

[DOI]

Amram Meir

Am. Math. Mon., 2017

Tilings of the plane with unit area triangles of bounded diameter.

[BibT_eX]

[DOI]

CoRR, 2017

A Crossing Lemma for Jordan Curves.

[BibT_eX]

[DOI]

CoRR, 2017

Controlling Lipschitz functions.

[BibT_eX]

[DOI]

CoRR, 2017

Many Touchings Force Many Crossings.

[BibT_eX]

[DOI]

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

Thrackles: An Improved Upper Bound.

[BibT_eX]

[DOI]

Radoslav Fulek

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

Disjointness Graphs of Segments.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Erdös-Hajnal Conjecture for Graphs with Bounded VC-Dimension.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016

A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing.

[BibT_eX]

[DOI]

SIAM J. Comput., 2016

Separation with restricted families of sets.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2016

Thirtieth Anniversary Note from the Editors in Chief.

[BibT_eX]

[DOI]

Kenneth L. Clarkson

Günter M. Ziegler

Discret. Comput. Geom., 2016

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Lars Arge

Discret. Comput. Geom., 2016

Beyond-Planar Graphs: Algorithmics and Combinatorics (Dagstuhl Seminar 16452).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2016

Decomposition of Multiple Packings with Subquadratic Union Complexity.

[BibT_eX]

[DOI]

Bartosz Walczak

Comb. Probab. Comput., 2016

Beyond the Richter-Thomassen Conjecture.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Approximating the Rectilinear Crossing Number.

[BibT_eX]

[DOI]

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

New Lower Bounds for epsilon-Nets.

[BibT_eX]

[DOI]

Nabil H. Mustafa

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

A Lower Bound on Opaque Sets.

[BibT_eX]

[DOI]

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

2015

A Precise Threshold for Quasi-Ramsey Numbers.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

The Erdős-Hajnal conjecture for rainbow triangles.

[BibT_eX]

[DOI]

Andrey Grinshpun

J. Comb. Theory B, 2015

A polynomial regularity lemma for semi-algebraic hypergraphs and its applications in geometry and property testing.

[BibT_eX]

[DOI]

CoRR, 2015

Saturated simple and k-simple topological graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Unsplittable Coverings in the Plane.

[BibT_eX]

[DOI]

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

On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Density and regularity theorems for semi-algebraic hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Simultaneous Approximation of Polynomials.

[BibT_eX]

[DOI]

Andrei Kupavskii

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

On the Zarankiewicz Problem for Intersection Hypergraphs.

[BibT_eX]

[DOI]

Nabil H. Mustafa

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

2014

Homogeneous selections from hyperplanes.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2014

Applications of a New Separator Theorem for String Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2014

A Note on Coloring Line Arrangements.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

Distinct distances on algebraic curves in the plane.

[BibT_eX]

[DOI]

Frank de Zeeuw

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

Weight Balancing on Boundaries and Skeletons.

[BibT_eX]

[DOI]

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

2013

The Number of Edges in k-Quasi-planar Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

The number of distinct distances from a vertex of a convex polygon.

[BibT_eX]

[DOI]

J. Comput. Geom., 2013

On Schur's conjecture.

[BibT_eX]

[DOI]

Filip Moric

Electron. Notes Discret. Math., 2013

Monochromatic empty triangles in two-colored point sets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

The Range of a Random Walk on a Comb.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

Cross-Intersecting Families of Vectors.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry and Graphs, 2013

On the Upward Planarity of Mixed Plane Graphs.

[BibT_eX]

[DOI]

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

Ramsey-type results for semi-algebraic relations.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Computational Geometry 2013, 2013

A Remark on Transversal Numbers.

[BibT_eX]

[DOI]

Proceedings of the Mathematics of Paul Erdős I, 2013

2012

Coloring Kk-free intersection graphs of geometric objects in the plane.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

Lower Bounds on the Obstacle Number of Graphs.

[BibT_eX]

[DOI]

Padmini Mukkamala

Electron. J. Comb., 2012

Remarks on a Ramsey theory for trees.

[BibT_eX]

[DOI]

Comb., 2012

Remarks on Schur's Conjecture.

[BibT_eX]

[DOI]

Filip Moric

Proceedings of the Computational Geometry and Graphs - Thailand-Japan Joint Conference, 2012

How Many Potatoes Are in a Mesh?

[BibT_eX]

[DOI]

Marc J. van Kreveld

Maarten Löffler

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

The Visible Perimeter of an Arrangement of Disks.

[BibT_eX]

[DOI]

Gabriel Nivasch

Proceedings of the Graph Drawing - 20th International Symposium, 2012

String graphs and incomparability graphs.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011

Conway's Conjecture for Monotone Thrackles.

[BibT_eX]

[DOI]

Ethan Sterling

Am. Math. Mon., 2011

Intersection patterns of curves.

[BibT_eX]

[DOI]

Csaba D. Tóth

J. Lond. Math. Soc., 2011

On the Structure of Graphs with Low Obstacle Number.

[BibT_eX]

[DOI]

Deniz Sariöz

Graphs Comb., 2011

Minimum Clique Partition in Unit Disk Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2011

Letter from the New Editors-in-Chief.

[BibT_eX]

[DOI]

Herbert Edelsbrunner

Günter M. Ziegler

Discret. Comput. Geom., 2011

Disjoint homometric sets in graphs.

[BibT_eX]

[DOI]

Michael O. Albertson

Michael E. Young

Ars Math. Contemp., 2011

Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Computing the Independence Number of Intersection Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Overlap properties of geometric expanders.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Tangled Thrackles.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Monotone Crossing Number.

[BibT_eX]

[DOI]

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

Every Graph Admits an Unambiguous Bold Drawing.

[BibT_eX]

[DOI]

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

Tight lower bounds for the size of epsilon-nets.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

Opaque Sets.

[BibT_eX]

[DOI]

Minghui Jiang

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010

Crossing numbers of imbalanced graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2010

Small (2,s)-colorable graphs without 1-obstacle representations

[BibT_eX]

[DOI]

Deniz Sariöz

CoRR, 2010

Opaque sets

[BibT_eX]

[DOI]

CoRR, 2010

"square trisection". dissection of a square in three congruent partitions.

[BibT_eX]

Christian Blanvillain

Bull. dInformatique Approfondie et Appl., 2010

Graphs with Large Obstacle Numbers.

[BibT_eX]

[DOI]

Padmini Mukkamala

Deniz Sariöz

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Crossings between Curves with Many Tangencies.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

Drawing Planar Graphs of Bounded Degree with Few Slopes.

[BibT_eX]

[DOI]

Balázs Keszegh

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

A Computational Approach to Conway's Thrackle Conjecture.

[BibT_eX]

[DOI]

Radoslav Fulek

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

On the Queue Number of Planar Graphs.

[BibT_eX]

[DOI]

Giuseppe Di Battista

Fabrizio Frati

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Tangencies between families of disjoint regions in the plane.

[BibT_eX]

[DOI]

Miroslav Treml

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009

A bipartite analogue of Dilworth's theorem for multiple partial orders.

[BibT_eX]

[DOI]

Eur. J. Comb., 2009

On Regular Vertices of the Union of Planar Convex Objects.

[BibT_eX]

[DOI]

Esther Ezra

Discret. Comput. Geom., 2009

Conflict-Free Colourings of Graphs and Hypergraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2009

A Separator Theorem for String Graphs and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Why Are String Graphs So Beautiful?

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 17th International Symposium, 2009

Drawing Hamiltonian Cycles with No Large Angles.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 17th International Symposium, 2009

On grids in topological graphs.

[BibT_eX]

[DOI]

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

2008

On planar intersection graphs with forbidden subgraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2008

On Simplices Embracing a Point.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Discret. Math., 2008

Foreword.

[BibT_eX]

[DOI]

Jacob E. Goodman

Discret. Comput. Geom., 2008

Convexly Independent Subsets of the Minkowski Sum of Planar Point Sets.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

Points surrounding the origin.

[BibT_eX]

[DOI]

Andreas F. Holmsen

Helge Tverberg

Comb., 2008

Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Cubic Graphs Have Bounded Slope Parameter.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 16th International Symposium, 2008

Intersecting convex sets by rays.

[BibT_eX]

[DOI]

Radoslav Fulek

Andreas F. Holmsen

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

Coloring kk-free intersection graphs of geometric objects in the plane.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007

Online Conflict-Free Coloring for Intervals.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

Opposite-Quadrant Depth in the Plane.

[BibT_eX]

[DOI]

Hervé Brönnimann

Jonathan Lenchner

Graphs Comb., 2007

Foreword.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2007

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Farhad Shahrokhi

Algorithmica, 2007

Coloring Axis-Parallel Rectangles.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry and Graph Theory, 2007

A Bipartite Strengthening of the Crossing Lemma.

[BibT_eX]

[DOI]

Csaba D. Tóth

Proceedings of the Graph Drawing, 15th International Symposium, 2007

Decomposition of multiple coverings into many parts.

[BibT_eX]

[DOI]

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

On regular vertices on the union of planar objects.

[BibT_eX]

[DOI]

Esther Ezra

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

2006

Planar Crossing Numbers of Graphs Embeddable in Another Surface.

[BibT_eX]

[DOI]

Károly J. Böröczky

Int. J. Found. Comput. Sci., 2006

On the diameter of separated point sets with many nearly equal distances.

[BibT_eX]

[DOI]

Jan Vondrák

Eur. J. Comb., 2006

Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2006

Nearly equal distances and Szemerédi's regularity lemma.

[BibT_eX]

[DOI]

Jan Vondrák

Comput. Geom., 2006

Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

Reconfigurations in Graphs and Grids.

[BibT_eX]

[DOI]

Gruia Calinescu

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Drawing Cubic Graphs with at Most Five Slopes.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 14th International Symposium, 2006

Degenerate crossing numbers.

[BibT_eX]

[DOI]

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

2005

Guest Editor's Foreword.

[BibT_eX]

[DOI]

Emden R. Gansner

J. Graph Algorithms Appl., 2005

Crossing patterns of semi-algebraic sets.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2005

Topological Graphs with No Large Grids.

[BibT_eX]

[DOI]

Graphs Comb., 2005

Online conflict-free coloring for intervals.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Crossing Number of Toroidal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 13th International Symposium, 2005

Forbidden patterns and unit distances.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

Indecomposable Coverings.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry, 2005

Research problems in discrete geometry.

[BibT_eX]

Peter Brass

William O. J. Moser

Springer, 2005

2004

Geometric Graph Theory.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Finite Point Configurations.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

On the number of directions determined by a three-dimensional points set.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2004

Lenses in arrangements of pseudo-circles and their applications.

[BibT_eX]

[DOI]

J. ACM, 2004

Sliding Disks in the Plane.

[BibT_eX]

[DOI]

Sergey Bereg

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

Long Alternating Paths in Bicolored Point Sets.

[BibT_eX]

[DOI]

Jan Kyncl

Proceedings of the Graph Drawing, 12th International Symposium, 2004

Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract].

[BibT_eX]

[DOI]

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Solution of Scott's problem on the number of directions determined by a point set in 3-space.

[BibT_eX]

[DOI]

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Pushing squares around.

[BibT_eX]

[DOI]

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003

How Many Unit Equilateral Triangles Can Be Generated by N Points in Convex Position?

[BibT_eX]

[DOI]

Am. Math. Mon., 2003

Unavoidable Configurations in Complete Topological Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2003

Distinct distances in three and higher dimensions.

[BibT_eX]

[DOI]

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Disjoint Edges in Topological Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Geometry and Graph Theory, 2003

How Many Ways Can One Draw a Graph?

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 11th International Symposium, 2003

A tight bound for the number of different directions in three dimensions.

[BibT_eX]

[DOI]

Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002

Covering lattice points by subspaces.

[BibT_eX]

[DOI]

Period. Math. Hung., 2002

Isosceles Triangles Determined by a Planar Point Set.

[BibT_eX]

[DOI]

Graphs Comb., 2002

Relaxing Planarity for Topological Graphs.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

Monotone Drawings of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Geometric Graphs with No Self-intersecting Path of Length Three.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 10th International Symposium, 2002

Lenses in arrangements of pseudo-circles and their applications.

[BibT_eX]

[DOI]

Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

2001

Crossing Patterns of Segments.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2001

The Maximum Number of Times the Same Distance Can Occur among the Vertices of a Convex n-gon Is O(n log n).

[BibT_eX]

[DOI]

Peter Braß

J. Comb. Theory A, 2001

Radial Points in the Plane.

[BibT_eX]

[DOI]

Eur. J. Comb., 2001

Separating convex sets by straight lines.

[BibT_eX]

[DOI]

Discret. Math., 2001

On the Number of Balanced Lines.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2001

Common Tangents to Four Unit Balls in R3.

[BibT_eX]

[DOI]

I. G. MacDonald

Thorsten Theobald

Discret. Comput. Geom., 2001

Ramsey-type Theorems with Forbidden Subgraphs.

[BibT_eX]

[DOI]

Noga Alon

Comb., 2001

Partitioning Colored Point Sets into Monochromatic Parts.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Recognizing String Graphs Is Decidable.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 9th International Symposium, 2001

Untangling a Polygon.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 9th International Symposium, 2001

The union of congruent cubes in three dimensions.

[BibT_eX]

[DOI]

Ido Safruti

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

2000

Bichromatic Lines with Few Points.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2000

Cellular telephone networks and random maps in hypergraphs.

[BibT_eX]

[DOI]

Ariel Halpert

Flórián Lengyel

Discret. Appl. Math., 2000

Structure Theorems for Systems of Segments.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

On the Complexity of the Union of Geometric Objects.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

Unavoidable Configurations in Complete Topological Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 8th International Symposium, 2000

On the boundary complexity of the union of fat triangles.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

Cutting glass.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999

Discrete And Computational Geometry.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Popular distances in 3-space.

[BibT_eX]

[DOI]

Gergely Harcos

Discret. Math., 1999

On the Boundary of the Union of Planar Convex Sets.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1999

Uniformly Distributed Distances - a Geometric Application of Janson's Inequality.

[BibT_eX]

[DOI]

Joel Spencer

Comb., 1999

New Bounds on Crossing Numbers.

[BibT_eX]

[DOI]

Joel Spencer

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998

A Generalization of the Erdos - Szekeres Theorem to Disjoint Convex Sets.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1998

Canonical Theorems for Convex Sets.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1998

Guest Editor's Foreword.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1998

On the Number of Incidences Between Points and Curves.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1998

On circumscribing polygons for line segments.

[BibT_eX]

[DOI]

Eduardo Rivera-Campo

Comput. Geom., 1998

A Tverberg-type result on multicolored simplices.

[BibT_eX]

[DOI]

Comput. Geom., 1998

Crossing Numbers.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

Embedding Planar Graphs at Fixed Vertex Locations.

[BibT_eX]

[DOI]

Rephael Wenger

Proceedings of the Graph Drawing, 6th International Symposium, 1998

Which Crossing Number is it, Anyway?

[BibT_eX]

[DOI]

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997

Ramsey-Type Results for Geometric Graphs, I.

[BibT_eX]

[DOI]

Gyula Károlyi

Discret. Comput. Geom., 1997

Three-dimensional Grid Drawings of Graphs.

[BibT_eX]

[DOI]

Torsten Thiele

Proceedings of the Graph Drawing, 5th International Symposium, 1997

Ramsey-Type Results for Geometric Graphs II.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

Extremal Problems for Geometric Hypergraphs.

[BibT_eX]

[DOI]

Tamal K. Dey

Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

Graphs Drawn with Few Crossings Per Edge.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

Ramsey-Type Results for Geometric Graphs.

[BibT_eX]

[DOI]

Gyula Károlyi

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

A Left-First Search Algorithm for Planar Graphs.

[BibT_eX]

[DOI]

Hubert de Fraysseix

Patrice Ossona de Mendez

Discret. Comput. Geom., 1995

Guest Editor's Forword.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1995

Quasi-Planar Graphs Have a Linear Number of Edges.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995

On Conway's Thrackle Conjecture.

[BibT_eX]

[DOI]

László Lovász

Mario Szegedy

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

Combinatorial geometry.

[BibT_eX]

Pankaj K. Agarwal

Wiley-Interscience series in discrete mathematics and optimization, Wiley, ISBN: 978-0-471-58890-0, 1995

1994

Fat Triangles Determine Linearly Many Holes.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

The Complexity of a Class of Infinite Graphs.

[BibT_eX]

[DOI]

Péter Komjáth

Comb., 1994

Applications of the Crossing Number.

[BibT_eX]

[DOI]

Farhad Shahrokhi

Mario Szegedy

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993

Extremal problems in graph drawings (abstract).

[BibT_eX]

[DOI]

SIGACT News, 1993

The grid revisted.

[BibT_eX]

[DOI]

Discret. Math., 1993

How Hard Is Half-Space Range Searching.

[BibT_eX]

[DOI]

Hervé Brönnimann

Bernard Chazelle

Discret. Comput. Geom., 1993

An Invariant Property of Balls in Arrangements of Hyperplanes.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1993

Nearly Equal Distances in the Plane.

[BibT_eX]

[DOI]

Endre Makai

Comb. Probab. Comput., 1993

Weaving Patterns of Lines and Line Segments in Space.

[BibT_eX]

[DOI]

Emo Welzl

Algorithmica, 1993

Some Geometric Applications of Dilworth's Theorem.

[BibT_eX]

[DOI]

Jenö Töröcsik

Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

1992

Repeated Angles in the Plane and Related Problems.

[BibT_eX]

J. Comb. Theory A, 1992

A turán-type theorem on chords of a convex polygon.

[BibT_eX]

[DOI]

Vasilis Capoyleas

J. Comb. Theory B, 1992

Almost Tight Bounds for epsilon-Nets.

[BibT_eX]

[DOI]

János Komlós

Gerhard J. Woeginger

Discret. Comput. Geom., 1992

On the Number of Convex Lattice Polygons.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1992

1991

On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm.

[BibT_eX]

[DOI]

SIAM J. Comput., 1991

On the maximal number of certain subgraphs inKr-free graphs.

[BibT_eX]

[DOI]

Ervin Györi

Miklós Simonovits

Graphs Comb., 1991

On the Average Volume of Subsets in Euclidean d-Space.

[BibT_eX]

[DOI]

Norbert Sauer

Eur. J. Comb., 1991

Universal elements and the complexity of certain classes of infinite graphs.

[BibT_eX]

[DOI]

Péter Komjáth

Discret. Math., 1991

Distinct Distances Determined By Subsets of a Point Set in Space.

[BibT_eX]

[DOI]

David Avis

Comput. Geom., 1991

Fat Triangles Determine Linearly Many Holes

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Layout of Rooted Trees.

[BibT_eX]

[DOI]

Jenö Töröcsik

Proceedings of the Planar Graphs, 1991

Crossing Families.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990

Note on vertex-partitions of infinite graphs.

[BibT_eX]

[DOI]

Joel H. Spencer

Discret. Math., 1990

Special issue dedicated to discrete and computational geometry.

[BibT_eX]

Gábor Fejes Tóth

Comb., 1990

How to draw a planar graph on a grid.

[BibT_eX]

[DOI]

Hubert de Fraysseix

Comb., 1990

Variation on the theme of repeated distances.

[BibT_eX]

[DOI]

Comb., 1990

Weaving Patterns of Lines and Segments in Space.

[BibT_eX]

[DOI]

Emo Welzl

Proceedings of the Algorithms, 1990

Notes on Geometric Graph Theory.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry: Papers from the DIMACS Special Year, 1990

Gaps in Difference Sets, and the Graph of Nearly Equal Distances.

[BibT_eX]

[DOI]

Proceedings of the Applied Geometry And Discrete Mathematics, 1990

On the Perimeter of a Point Set in the Plane.

[BibT_eX]

[DOI]

Vasilis Capoyleas

Proceedings of the Discrete and Computational Geometry: Papers from the DIMACS Special Year, 1990

Some New Bounds for Epsilon-Nets.

[BibT_eX]

[DOI]

Gerhard J. Woeginger

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

The Combinatorial Complexity of Hyperplane Transversals.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989

Radius, diameter, and minimum degree.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1989

The Upper Envelope of Piecewise Linear Functions and the Boundary of a Region Enclosed by Convex Plates: Combinatorial Analysis.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1989

On Arrangement of Jordan Arcs with Three Intersection per Pair.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1989

An Upper Bound on the Number of Planar k-Sets

[BibT_eX]

[DOI]

William L. Steiger

Endre Szemerédi

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988

Explicit codes with low covering radius.

[BibT_eX]

[DOI]

Joel Spencer

IEEE Trans. Inf. Theory, 1988

An extremal problem on Kr-free graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1988

Cutting a graph into two dissimilar halves.

[BibT_eX]

[DOI]

J. Graph Theory, 1988

How to make a graph bipartite.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1988

Repeated distances in space.

[BibT_eX]

[DOI]

David Avis

Graphs Comb., 1988

Small Sets Supporting Fáry Embeddings of Planar Graphs

[BibT_eX]

[DOI]

Hubert de Fraysseix

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

On Arrangements of Jordan Arcs with Three Intersections per Pair.

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987

Bounding one-way differences.

[BibT_eX]

[DOI]

Zoltán Füredi

Graphs Comb., 1987

On the Lower Envelope of Bivariate Functions and its Applications

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986

Maximal volume enclosed by plates and proof of the chessboard conjecture.

[BibT_eX]

[DOI]

Discret. Math., 1986

Covering the Plane with Convex Polygons.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1986

On the Union of Jordan Regions and Collision-Free Translational Motion Amidst Polygonal Obstacles.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1986

1984

On disjointly representable sets.

[BibT_eX]

[DOI]

Comb., 1984

1983

On a Quasi-Ramsey problem.

[BibT_eX]

[DOI]

J. Graph Theory, 1983

On the Number of Sets in a Null t-Design.

[BibT_eX]

[DOI]

Eur. J. Comb., 1983

1981

A Problem of Ulam on Planar Graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1981

Graphs whose every independent set has a common neighbour.

[BibT_eX]

[DOI]

Discret. Math., 1981

1980

On a problem of L. Fejes Tóth.

[BibT_eX]

[DOI]