János Pach - Citegraph

Author Info

Name	Affiliation	Papers
JÁNOS PACH	Hungarian Academy of Sciences, Rényi Institute, Budapest, Hungary and EPFL, Lausanne, Switzerland	39
Collaborators	Citations	PageRank
52	451	49.34
Referers	Referees	References
598	227	206

Search Limit

100598

Publications (39 rows)

Collaborators (52 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
On the Size of K-Cross-Free Families	0	0.34	2019
A stability theorem on cube tessellations.	0	0.34	2018
Almost All String Graphs are Intersection Graphs of Plane Convex Sets	1	0.36	2018
On Schur's conjecture.	1	0.48	2013
The number of edges in k-quasi-planar graphs	28	0.94	2013
Remarks on a Ramsey theory for trees.	2	0.44	2012
Intersection patterns of curves.	0	0.34	2011
A bipartite strengthening of the Crossing Lemma	6	0.57	2010
Notes: Coloring axis-parallel rectangles	9	0.72	2010
Tangencies Between Families Of Disjoint Regions In The Plane	0	0.34	2010
Degenerate Crossing Numbers	2	0.43	2009
A bipartite analogue of Dilworth's theorem for multiple partial orders	3	0.52	2009
On Regular Vertices of the Union of Planar Convex Objects	2	0.37	2009
Coloring Kk-free intersection graphs of geometric objects in the plane	23	1.07	2008
Sliding Disks in the Plane	3	0.47	2008
Points surrounding the origin	10	0.68	2008
Online conflict-free coloring for intervals	26	2.28	2005
Geometric graphs with no self-intersecting path of length three	10	1.43	2004
Graph Drawing, 12th International Symposium, GD 2004, New York, NY, USA, September 29 - October 2, 2004, Revised Selected Papers	47	5.45	2004
Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract]	6	0.62	2004
Disjoint edges in topological graphs	13	0.85	2003
Unavoidable Configurations in Complete Topological Graphs	7	0.62	2003
The Maximum Number of Times the Same Distance Can Occur among the Vertices of a Convex n-gon Is O(nlogn)	8	0.78	2001
Common Tangents to Four Unit Balls in R3	21	2.05	2001
Uniformly Distributed Distances - a Geometric Application of Janson's Inequality	0	0.34	1999
Ramsey-type results for geometric graphs	32	2.80	1996
Quasi-Planar Graphs Have a Linear Number of Edges	35	3.86	1995
Guest Editor's Forword	0	0.34	1994
An upper bound on the number of planar K-sets	37	5.12	1992
A Tura´n-type theorem on chords of a convex polygon	33	4.87	1992
Almost tight bounds for &egr;-nets	30	3.04	1992
Fat triangles determine linearly many holes	47	3.21	1991
On the maximal number of certain subgraphs inKr-free graphs	4	0.72	1991
Layout of Rooted Trees.	0	0.34	1991
On the Perimeter of a Point Set in the Plane.	0	0.34	1990
Special issue dedicated to discrete and computational geometry	0	0.34	1990
Weaving Patterns of Lines and Segments in Space	4	0.81	1990
Gaps in Difference Sets, and the Graph of Nearly Equal Distances.	0	0.34	1990
An extremal problem on Kr-free graphs.	1	0.38	1988