János Pach

According to our database1, János Pach authored at least 242 papers between 1980 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Awards

ACM Fellow

ACM Fellow 2011, "For contributions to computational geometry.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Erdős-Hajnal Conjecture for Graphs with Bounded VC-Dimension.
Discrete & Computational Geometry, 2019

On the Size of K-Cross-Free Families.
Combinatorica, 2019

Planar point sets determine many pairwise crossing segments.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

On the Chromatic Number of Disjointness Graphs of Curves.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

Semi-Algebraic Colorings of Complete Graphs.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
A stability theorem on cube tessellations.
JoCG, 2018

Tilings with noncongruent triangles.
Eur. J. Comb., 2018

Note on k-planar crossing numbers.
Comput. Geom., 2018

More Distinct Distances Under Local Conditions.
Combinatorica, 2018

The Number of Crossings in Multigraphs with No Empty Lens.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

A Crossing Lemma for Multigraphs.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

Almost All String Graphs are Intersection Graphs of Plane Convex Sets.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017
Many Touchings Force Many Crossings.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Thrackles: An Improved Upper Bound.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Disjointness Graphs of Segments.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Erdös-Hajnal Conjecture for Graphs with Bounded VC-Dimension.
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.
SIAM J. Comput., 2016

Separation with restricted families of sets.
J. Comb. Theory, Ser. A, 2016

Thirtieth Anniversary Note from the Editors in Chief.
Discrete & Computational Geometry, 2016

Guest Editors' Foreword.
Discrete & Computational Geometry, 2016

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

Decomposition of Multiple Packings with Subquadratic Union Complexity.
Combinatorics, Probability & Computing, 2016

Beyond the Richter-Thomassen Conjecture.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Approximating the Rectilinear Crossing Number.
Proceedings of the Graph Drawing and Network Visualization, 2016

New Lower Bounds for epsilon-Nets.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

A Lower Bound on Opaque Sets.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
A Precise Threshold for Quasi-Ramsey Numbers.
SIAM J. Discrete Math., 2015

The Erdős-Hajnal conjecture for rainbow triangles.
J. Comb. Theory, Ser. B, 2015

Saturated simple and k-simple topological graphs.
Comput. Geom., 2015

Unsplittable Coverings in the Plane.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Density and regularity theorems for semi-algebraic hypergraphs.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Simultaneous Approximation of Polynomials.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

On the Zarankiewicz Problem for Intersection Hypergraphs.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014
Homogeneous selections from hyperplanes.
J. Comb. Theory, Ser. B, 2014

Applications of a New Separator Theorem for String Graphs.
Combinatorics, Probability & Computing, 2014

A Note on Coloring Line Arrangements.
Electr. J. Comb., 2014

Distinct distances on algebraic curves in the plane.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Weight Balancing on Boundaries and Skeletons.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
The Number of Edges in k-Quasi-planar Graphs.
SIAM J. Discrete Math., 2013

The number of distinct distances from a vertex of a convex polygon.
JoCG, 2013

On Schur's conjecture.
Electronic Notes in Discrete Mathematics, 2013

Monochromatic empty triangles in two-colored point sets.
Discrete Applied Mathematics, 2013

The Range of a Random Walk on a Comb.
Electr. J. Comb., 2013

Cross-Intersecting Families of Vectors.
Proceedings of the Discrete and Computational Geometry and Graphs, 2013

On the Upward Planarity of Mixed Plane Graphs.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

Ramsey-type results for semi-algebraic relations.
Proceedings of the Symposuim on Computational Geometry 2013, 2013

A Remark on Transversal Numbers.
Proceedings of the Mathematics of Paul Erdős I, 2013

2012
Piercing quasi-rectangles - On a problem of Danzer and Rogers.
J. Comb. Theory, Ser. A, 2012

Coloring Kk-free intersection graphs of geometric objects in the plane.
Eur. J. Comb., 2012

Lower Bounds on the Obstacle Number of Graphs.
Electr. J. Comb., 2012

Remarks on a Ramsey theory for trees.
Combinatorica, 2012

Remarks on Schur's Conjecture.
Proceedings of the Computational Geometry and Graphs - Thailand-Japan Joint Conference, 2012

How Many Potatoes Are in a Mesh?
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

The Visible Perimeter of an Arrangement of Disks.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

String graphs and incomparability graphs.
Proceedings of the Symposuim on Computational Geometry 2012, 2012

2011
Conway's Conjecture for Monotone Thrackles.
The American Mathematical Monthly, 2011

Intersection patterns of curves.
J. London Math. Society, 2011

On the Structure of Graphs with Low Obstacle Number.
Graphs and Combinatorics, 2011

Minimum Clique Partition in Unit Disk Graphs.
Graphs and Combinatorics, 2011

Letter from the New Editors-in-Chief.
Discrete & Computational Geometry, 2011

Disjoint homometric sets in graphs.
Ars Math. Contemp., 2011

Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Computing the Independence Number of Intersection Graphs.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Overlap properties of geometric expanders.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

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

Monotone Crossing Number.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

Every Graph Admits an Unambiguous Bold Drawing.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

Tight lower bounds for the size of epsilon-nets.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

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

2010
Crossing numbers of imbalanced graphs.
Journal of Graph Theory, 2010

"square trisection". dissection of a square in three congruent partitions.
BIAA, 2010

Graphs with Large Obstacle Numbers.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Crossings between Curves with Many Tangencies.
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

Drawing Planar Graphs of Bounded Degree with Few Slopes.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

A Computational Approach to Conway's Thrackle Conjecture.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

On the Queue Number of Planar Graphs.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Tangencies between families of disjoint regions in the plane.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009
A bipartite analogue of Dilworth's theorem for multiple partial orders.
Eur. J. Comb., 2009

On Regular Vertices of the Union of Planar Convex Objects.
Discrete & Computational Geometry, 2009

Conflict-Free Colourings of Graphs and Hypergraphs.
Combinatorics, Probability & Computing, 2009

A Separator Theorem for String Graphs and Its Applications.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Why Are String Graphs So Beautiful?
Proceedings of the Graph Drawing, 17th International Symposium, 2009

Drawing Hamiltonian Cycles with No Large Angles.
Proceedings of the Graph Drawing, 17th International Symposium, 2009

On grids in topological graphs.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008
On planar intersection graphs with forbidden subgraphs.
Journal of Graph Theory, 2008

On Simplices Embracing a Point.
Electronic Notes in Discrete Mathematics, 2008

Guest Editors' Foreword.
Discrete Mathematics, 2008

Foreword.
Discrete & Computational Geometry, 2008

Convexly Independent Subsets of the Minkowski Sum of Planar Point Sets.
Electr. J. Comb., 2008

Points surrounding the origin.
Combinatorica, 2008

Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Cubic Graphs Have Bounded Slope Parameter.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

Intersecting convex sets by rays.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

Coloring kk-free intersection graphs of geometric objects in the plane.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007
Online Conflict-Free Coloring for Intervals.
SIAM J. Comput., 2007

Opposite-Quadrant Depth in the Plane.
Graphs and Combinatorics, 2007

Foreword.
Discrete & Computational Geometry, 2007

Guest Editors' Foreword.
Algorithmica, 2007

Coloring Axis-Parallel Rectangles.
Proceedings of the Computational Geometry and Graph Theory, 2007

A Bipartite Strengthening of the Crossing Lemma.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

Decomposition of multiple coverings into many parts.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

On regular vertices on the union of planar objects.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

2006
Planar Crossing Numbers of Graphs Embeddable in Another Surface.
Int. J. Found. Comput. Sci., 2006

On the diameter of separated point sets with many nearly equal distances.
Eur. J. Comb., 2006

Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs.
Discrete & Computational Geometry, 2006

Nearly equal distances and Szemerédi's regularity lemma.
Comput. Geom., 2006

Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers.
Electr. J. Comb., 2006

Reconfigurations in Graphs and Grids.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Drawing Cubic Graphs with at Most Five Slopes.
Proceedings of the Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, 2006

Degenerate crossing numbers.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005
Guest Editor's Foreword.
J. Graph Algorithms Appl., 2005

Crossing patterns of semi-algebraic sets.
J. Comb. Theory, Ser. A, 2005

Topological Graphs with No Large Grids.
Graphs and Combinatorics, 2005

Online conflict-free coloring for intervals.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Crossing Number of Toroidal Graphs.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

Forbidden patterns and unit distances.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

Indecomposable Coverings.
Proceedings of the Discrete Geometry, 2005

Research problems in discrete geometry.
Springer, 2005

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

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

On the number of directions determined by a three-dimensional points set.
J. Comb. Theory, Ser. A, 2004

Lenses in arrangements of pseudo-circles and their applications.
J. ACM, 2004

Sliding Disks in the Plane.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

Long Alternating Paths in Bicolored Point Sets.
Proceedings of the Graph Drawing, 12th International Symposium, 2004

Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract].
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.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Pushing squares around.
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?
The American Mathematical Monthly, 2003

Unavoidable Configurations in Complete Topological Graphs.
Discrete & Computational Geometry, 2003

Distinct distances in three and higher dimensions.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Disjoint Edges in Topological Graphs.
Proceedings of the Combinatorial Geometry and Graph Theory, 2003

How Many Ways Can One Draw a Graph?
Proceedings of the Graph Drawing, 11th International Symposium, 2003

A tight bound for the number of different directions in three dimensions.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002
Covering lattice points by subspaces.
Periodica Mathematica Hungarica, 2002

Isosceles Triangles Determined by a Planar Point Set.
Graphs and Combinatorics, 2002

Relaxing Planarity for Topological Graphs.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

Monotone Drawings of Planar Graphs.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Geometric Graphs with No Self-intersecting Path of Length Three.
Proceedings of the Graph Drawing, 10th International Symposium, 2002

Lenses in arrangements of pseudo-circles and their applications.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002

2001
Crossing Patterns of Segments.
J. Comb. Theory, Ser. 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).
J. Comb. Theory, Ser. A, 2001

Radial Points in the Plane.
Eur. J. Comb., 2001

Separating convex sets by straight lines.
Discrete Mathematics, 2001

On the Number of Balanced Lines.
Discrete & Computational Geometry, 2001

Common Tangents to Four Unit Balls in R3.
Discrete & Computational Geometry, 2001

Ramsey-type Theorems with Forbidden Subgraphs.
Combinatorica, 2001

Partitioning Colored Point Sets into Monochromatic Parts.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Recognizing String Graphs Is Decidable.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

Untangling a Polygon.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

The union of congruent cubes in three dimensions.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

2000
Which Crossing Number Is It Anyway?
J. Comb. Theory, Ser. B, 2000

Bichromatic Lines with Few Points.
J. Comb. Theory, Ser. A, 2000

Cellular telephone networks and random maps in hypergraphs.
Discrete Applied Mathematics, 2000

Structure Theorems for Systems of Segments.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

On the Complexity of the Union of Geometric Objects.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

Unavoidable Configurations in Complete Topological Graphs.
Proceedings of the Graph Drawing, 8th International Symposium, 2000

On the boundary complexity of the union of fat triangles.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

Cutting glass.
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999
Discrete And Computational Geometry.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Popular distances in 3-space.
Discrete Mathematics, 1999

On the Boundary of the Union of Planar Convex Sets.
Discrete & Computational Geometry, 1999

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

New Bounds on Crossing Numbers.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998
A Generalization of the Erdos - Szekeres Theorem to Disjoint Convex Sets.
Discrete & Computational Geometry, 1998

Canonical Theorems for Convex Sets.
Discrete & Computational Geometry, 1998

Guest Editor's Foreword.
Discrete & Computational Geometry, 1998

Ramsey-Type Results for Geometric Graphs, II.
Discrete & Computational Geometry, 1998

On the Number of Incidences Between Points and Curves.
Combinatorics, Probability & Computing, 1998

On circumscribing polygons for line segments.
Comput. Geom., 1998

A Tverberg-type result on multicolored simplices.
Comput. Geom., 1998

Crossing Numbers.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

Embedding Planar Graphs at Fixed Vertex Locations.
Proceedings of the Graph Drawing, 6th International Symposium, 1998

Which Crossing Number is it, Anyway?
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997
Ramsey-Type Results for Geometric Graphs, I.
Discrete & Computational Geometry, 1997

Three-dimensional Grid Drawings of Graphs.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

Ramsey-Type Results for Geometric Graphs II.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
Extremal Problems for Geometric Hypergraphs.
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

Graphs Drawn with Few Crossings Per Edge.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

Ramsey-Type Results for Geometric Graphs.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995
A Left-First Search Algorithm for Planar Graphs.
Discrete & Computational Geometry, 1995

Guest Editor's Forword.
Discrete & Computational Geometry, 1995

Quasi-Planar Graphs Have a Linear Number of Edges.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, GD '95, Passau, 1995

On Conway's Thrackle Conjecture.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

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

1994
Fat Triangles Determine Linearly Many Holes.
SIAM J. Comput., 1994

The Complexity of a Class of Infinite Graphs.
Combinatorica, 1994

Applications of the Crossing Number.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993
Extremal problems in graph drawings (abstract).
SIGACT News, 1993

The grid revisted.
Discrete Mathematics, 1993

How Hard Is Half-Space Range Searching.
Discrete & Computational Geometry, 1993

An Invariant Property of Balls in Arrangements of Hyperplanes.
Discrete & Computational Geometry, 1993

Nearly Equal Distances in the Plane.
Combinatorics, Probability & Computing, 1993

Weaving Patterns of Lines and Line Segments in Space.
Algorithmica, 1993

Some Geometric Applications of Dilworth's Theorem.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

1992
Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms.
Theor. Comput. Sci., 1992

Repeated Angles in the Plane and Related Problems.
J. Comb. Theory, Ser. A, 1992

A turán-type theorem on chords of a convex polygon.
J. Comb. Theory, Ser. B, 1992

An Upper Bound on the Number of Planar K-Sets.
Discrete & Computational Geometry, 1992

Almost Tight Bounds for epsilon-Nets.
Discrete & Computational Geometry, 1992

On the Number of Convex Lattice Polygons.
Combinatorics, Probability & Computing, 1992

1991
On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm.
SIAM J. Comput., 1991

On the maximal number of certain subgraphs inKr-free graphs.
Graphs and Combinatorics, 1991

On the Average Volume of Subsets in Euclidean d-Space.
Eur. J. Comb., 1991

Universal elements and the complexity of certain classes of infinite graphs.
Discrete Mathematics, 1991

Distinct Distances Determined By Subsets of a Point Set in Space.
Comput. Geom., 1991

Fat Triangles Determine Linearly Many Holes
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Layout of Rooted Trees.
Proceedings of the Planar Graphs, 1991

Crossing Families.
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990
Note on vertex-partitions of infinite graphs.
Discrete Mathematics, 1990

Special issue dedicated to discrete and computational geometry.
Combinatorica, 1990

How to draw a planar graph on a grid.
Combinatorica, 1990

Variation on the theme of repeated distances.
Combinatorica, 1990

Weaving Patterns of Lines and Segments in Space.
Proceedings of the Algorithms, 1990

Notes on Geometric Graph Theory.
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.
Proceedings of the Applied Geometry And Discrete Mathematics, 1990

On the Perimeter of a Point Set in the Plane.
Proceedings of the Discrete and Computational Geometry: Papers from the DIMACS Special Year, 1990

Some New Bounds for Epsilon-Nets.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

The Combinatorial Complexity of Hyperplane Transversals.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989
Radius, diameter, and minimum degree.
J. Comb. Theory, Ser. B, 1989

The Upper Envelope of Piecewise Linear Functions and the Boundary of a Region Enclosed by Convex Plates: Combinatorial Analysis.
Discrete & Computational Geometry, 1989

On Arrangement of Jordan Arcs with Three Intersection per Pair.
Discrete & Computational Geometry, 1989

An Upper Bound on the Number of Planar k-Sets
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.
IEEE Trans. Information Theory, 1988

An extremal problem on Kr-free graphs.
Journal of Graph Theory, 1988

Cutting a graph into two dissimilar halves.
Journal of Graph Theory, 1988

How to make a graph bipartite.
J. Comb. Theory, Ser. B, 1988

Repeated distances in space.
Graphs and Combinatorics, 1988

Small Sets Supporting Fáry Embeddings of Planar Graphs
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

On Arrangements of Jordan Arcs with Three Intersections per Pair.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987
Bounding one-way differences.
Graphs and Combinatorics, 1987

On the Lower Envelope of Bivariate Functions and its Applications
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986
Maximal volume enclosed by plates and proof of the chessboard conjecture.
Discrete Mathematics, 1986

Covering the Plane with Convex Polygons.
Discrete & Computational Geometry, 1986

On the Union of Jordan Regions and Collision-Free Translational Motion Amidst Polygonal Obstacles.
Discrete & Computational Geometry, 1986

1984
On disjointly representable sets.
Combinatorica, 1984

1983
On a Quasi-Ramsey problem.
Journal of Graph Theory, 1983

On the Number of Sets in a Null t-Design.
Eur. J. Comb., 1983

1981
A Problem of Ulam on Planar Graphs.
Eur. J. Comb., 1981

Graphs whose every independent set has a common neighbour.
Discrete Mathematics, 1981

1980
On a problem of L. Fejes Tóth.
Discrete Mathematics, 1980


  Loading...