Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: János
    Last name: Pach
    DBLP: 18/2119
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 101 to 200 of 296  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Radoslav Fulek, János Pach.
    A Computational Approach to Conway's Thrackle Conjecture.
    Graph Drawing - 18th International Symposium, GD 2010, Konstanz, Germany, September 21-24, 2010. Revised Selected Papers 2011 (0) 2010
    Journal article
    Christian Blanvillain, János Pach.
    "square trisection". dissection of a square in three congruent partitions.
    BIAA 2010, Volume 86 (0) 2010
    Conference paper
    Jacob Fox, János Pach, Csaba D. Tóth.
    A bipartite strengthening of the Crossing Lemma.
    J. Comb. Theory, Ser. B 2010, Volume 100 (0) 2010
    Journal article
    Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth.
    Cubic graphs have bounded slope parameter.
    J. Graph Algorithms Appl. 2010, Volume 14 (0) 2010
    Conference paper
    Jacob Fox, Fabrizio Frati, János Pach, Rom Pinchasi.
    Crossings between Curves with Many Tangencies.
    WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings 2010 (0) 2010
    Conference paper
    Adrian Dumitrescu, János Pach, Géza Tóth.
    Drawing Hamiltonian Cycles with No Large Angles.
    Graph Drawing, 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers 2010 (0) 2009
    Conference paper
    János Pach.
    Why Are String Graphs So Beautiful?
    Graph Drawing, 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers 2010 (0) 2009
    Conference paper
    Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk.
    On grids in topological graphs.
    Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009 2009 (0) 2009
    Conference paper
    Jacob Fox, János Pach.
    A Separator Theorem for String Graphs and Its Applications.
    WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings 2009 (0) 2009
    Conference paper
    János Pach, Géza Tóth.
    Decomposition of multiple coverings into many parts.
    Comput. Geom. 2009, Volume 42 (0) 2009
    Conference paper
    Adrian Dumitrescu, János Pach.
    Minimum clique partition in unit disk graphs
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    János Pach, Gábor Tardos.
    Conflict-Free Colourings of Graphs and Hypergraphs.
    Combinatorics, Probability Computing 2009, Volume 18 (0) 2009
    Conference paper
    Esther Ezra, János Pach, Micha Sharir.
    On Regular Vertices of the Union of Planar Convex Objects.
    Discrete Computational Geometry 2009, Volume 41 (0) 2009
    Conference paper
    János Pach, Géza Tóth.
    Degenerate Crossing Numbers.
    Discrete Computational Geometry 2009, Volume 41 (0) 2009
    Conference paper
    Radoslav Fulek, Andreas Holmsen, János Pach.
    Intersecting Convex Sets by Rays.
    Discrete Computational Geometry 2009, Volume 42 (0) 2009
    Conference paper
    Xiaomin Chen, János Pach, Mario Szegedy, Gábor Tardos.
    Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles.
    Random Struct. Algorithms 2009, Volume 34 (0) 2009
    Conference paper
    Jacob Fox, János Pach.
    A bipartite analogue of Dilworth's theorem for multiple partial orders.
    Eur. J. Comb. 2009, Volume 30 (0) 2009
    Journal article
    Friedrich Eisenbrand, János Pach, Thomas Rothvoß, Nir B. Sopher.
    Convexly Independent Subsets of the Minkowski Sum of Planar Point Sets.
    Electr. J. Comb. 2008, Volume 15 (0) 2008
    Conference paper
    Jacob Fox, János Pach.
    Coloring
    Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008 2008 (0) 2008
    Conference paper
    Radoslav Fulek, Andreas Holmsen, János Pach.
    Intersecting convex sets by rays.
    Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008 2008 (0) 2008
    Conference paper
    Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth.
    Cubic Graphs Have Bounded Slope Parameter.
    Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers 2009 (0) 2008
    Conference paper
    Xiaomin Chen, János Pach, Mario Szegedy, Gábor Tardos.
    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, SODA 2008, San Francisco, California, USA, January 20-22, 2008 2008 (0) 2008
    Conference paper
    Andreas Holmsen, János Pach, Helge Tverberg.
    Points surrounding the origin.
    Combinatorica 2008, Volume 28 (0) 2008
    Conference paper
    Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth.
    Drawing cubic graphs with at most five slopes.
    Comput. Geom. 2008, Volume 40 (0) 2008
    Conference paper
    Jacob E. Goodman, János Pach, Richard Pollack.
    Foreword.
    Discrete Computational Geometry 2008, Volume 39 (0) 2008
    Conference paper
    Jan Kyncl, János Pach, Géza Tóth.
    Long alternating paths in bicolored point sets.
    Discrete Mathematics 2008, Volume 308 (0) 2008
    Conference paper
    Zoltán Füredi, Ervin Györi, János Pach, Attila Sali.
    Guest Editors' Foreword.
    Discrete Mathematics 2008, Volume 308 (0) 2008
    Conference paper
    Sergey Bereg, Adrian Dumitrescu, János Pach.
    Sliding Disks in the Plane.
    Int. J. Comput. Geometry Appl. 2008, Volume 18 (0) 2008
    Conference paper
    Gruia Calinescu, Adrian Dumitrescu, János Pach.
    Reconfigurations in Graphs and Grids.
    SIAM J. Discrete Math. 2008, Volume 22 (0) 2008
    Conference paper
    János Pach, Micha Sharir.
    On planar intersection graphs with forbidden subgraphs.
    Journal of Graph Theory 2008, Volume 59 (0) 2008
    Conference paper
    János Pach.
    On Simplices Embracing a Point.
    Electronic Notes in Discrete Mathematics 2008, Volume 31 (0) 2008
    Conference paper
    János Pach, Gábor Tardos.
    Coloring Axis-Parallel Rectangles.
    Computational Geometry and Graph Theory - International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers 2008 (0) 2007
    Conference paper
    Hervé Brönnimann, Jonathan Lenchner, János Pach.
    Opposite-Quadrant Depth in the Plane.
    Graphs and Combinatorics 2007, Volume 23 (0) 2007
    Conference paper
    János Pach, Géza Tóth.
    Decomposition of multiple coverings into many parts.
    Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007 2007 (0) 2007
    Conference paper
    Esther Ezra, János Pach, Micha Sharir.
    On regular vertices on the union of planar objects.
    Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007 2007 (0) 2007
    Conference paper
    Jacob Fox, János Pach, Csaba D. Tóth.
    A Bipartite Strengthening of the Crossing Lemma.
    Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers 2008 (0) 2007
    Conference paper
    János Pach, Farhad Shahrokhi.
    Guest Editors' Foreword.
    Algorithmica 2007, Volume 47 (0) 2007
    Conference paper
    János Pach, Rom Pinchasi, Micha Sharir.
    Solution of Scott's Problem on the Number of Directions Determined by a Point Set in 3-Space.
    Discrete Computational Geometry 2007, Volume 38 (0) 2007
    Conference paper
    Imre Bárány, János Pach.
    Foreword.
    Discrete Computational Geometry 2007, Volume 38 (0) 2007
    Conference paper
    Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl.
    Online Conflict-Free Coloring for Intervals.
    SIAM J. Comput. 2006, Volume 36 (0) 2007
    Conference paper
    János Pach, Géza Tóth.
    Degenerate crossing numbers.
    Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, Arizona, USA, June 5-7, 2006 2006 (0) 2006
    Conference paper
    Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth.
    Drawing Cubic Graphs with at Most Five Slopes.
    Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised Papers 2007 (0) 2006
    Conference paper
    Gruia Calinescu, Adrian Dumitrescu, János Pach.
    Reconfigurations in Graphs and Grids.
    LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings 2006 (0) 2006
    Conference paper
    János Pach, Géza Tóth.
    How Many Ways Can One Draw A Graph?
    Combinatorica 2006, Volume 26 (0) 2006
    Conference paper
    János Pach, Dömötör Pálvölgyi.
    Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers.
    Electr. J. Comb. 2006, Volume 13 (0) 2006
    Conference paper
    János Pach, Rados Radoicic, Jan Vondrák.
    Nearly equal distances and Szemerédi's regularity lemma.
    Comput. Geom. 2006, Volume 34 (0) 2006
    Conference paper
    János Pach, Rados Radoicic, Gábor Tardos, Géza Tóth.
    Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs.
    Discrete Computational Geometry 2006, Volume 36 (0) 2006
    Conference paper
    János Pach, Rados Radoicic, Jan Vondrák.
    On the diameter of separated point sets with many nearly equal distances.
    Eur. J. Comb. 2006, Volume 27 (0) 2006
    Conference paper
    Adrian Dumitrescu, János Pach.
    Pushing Squares Around.
    Graphs and Combinatorics 2006, Volume 22 (0) 2006
    Conference paper
    Károly J. Börözky, János Pach, Géza Tóth.
    Planar Crossing Numbers of Graphs Embeddable in Another Surface.
    Int. J. Found. Comput. Sci. 2006, Volume 17 (0) 2006
    Conference paper
    János Pach, Gábor Tardos.
    Forbidden patterns and unit distances.
    Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005 2005 (0) 2005
    Conference paper
    János Pach, Géza Tóth.
    Crossing Number of Toroidal Graphs.
    Graph Drawing, 13th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers 2006 (0) 2005
    Conference paper
    Amos Fiat, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl.
    Online conflict-free coloring for intervals.
    Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005 2005 (0) 2005
    Conference paper
    János Pach, Gábor Tardos, Géza Tóth.
    Indecomposable Coverings.
    Discrete Geometry, Combinatorics and Graph Theory, 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, Xi'an, China, November 22-24, 2005, Revised Selected Papers 2007 (0) 2005
    Conference paper
    János Pach, Rom Pinchasi, Micha Sharir, Géza Tóth.
    Topological Graphs with No Large Grids.
    Graphs and Combinatorics 2005, Volume 21 (0) 2005
    Conference paper
    Noga Alon, János Pach, Rom Pinchasi, Rados Radoicic, Micha Sharir.
    Crossing patterns of semi-algebraic sets.
    J. Comb. Theory, Ser. A 2005, Volume 111 (0) 2005
    Conference paper
    Emden R. Gansner, János Pach.
    Guest Editor's Foreword.
    J. Graph Algorithms Appl. 2005, Volume 9 (0) 2005
    Book chapter
    János Pach.
    Finite Point Configurations.
    Handbook of Discrete and Computational Geometry, Second Edition. 2004 (0) 2004
    Book chapter
    János Pach.
    Geometric Graph Theory.
    Handbook of Discrete and Computational Geometry, Second Edition. 2004 (0) 2004
    Conference paper
    Adrian Dumitrescu, János Pach.
    Pushing squares around.
    Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004 2004 (0) 2004
    Conference paper
    János Pach, Rom Pinchasi, Micha Sharir.
    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, Brooklyn, New York, USA, June 8-11, 2004 2004 (0) 2004
    Conference paper
    János Pach, Rados Radoicic, Gábor Tardos, Géza Tóth.
    Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract].
    Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004 2004 (0) 2004
    Conference paper
    Jan Kyncl, János Pach, Géza Tóth.
    Long Alternating Paths in Bicolored Point Sets.
    Graph Drawing, 12th International Symposium, GD 2004, New York, NY, USA, September 29 - October 2, 2004, Revised Selected Papers 2004 (0) 2004
    Conference paper
    Sergey Bereg, Adrian Dumitrescu, János Pach.
    Sliding Disks in the Plane.
    Discrete and Computational Geometry, Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers 2005 (0) 2004
    Conference paper
    Boris Aronov, János Pach, Micha Sharir, Gábor Tardos.
    Distinct Distances in Three and Higher Dimensions.
    Combinatorics, Probability Computing 2004, Volume 13 (0) 2004
    Conference paper
    János Pach, Rom Pinchasi, Gábor Tardos, Géza Tóth.
    Geometric graphs with no self-intersecting path of length three.
    Eur. J. Comb. 2004, Volume 25 (0) 2004
    Conference paper
    Pankaj K. Agarwal, Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky.
    Lenses in arrangements of pseudo-circles and their applications.
    J. ACM 2004, Volume 51 (0) 2004
    Conference paper
    János Pach, Rom Pinchasi, Micha Sharir.
    On the number of directions determined by a three-dimensional points set.
    J. Comb. Theory, Ser. A 2004, Volume 108 (0) 2004
    Conference paper
    János Pach, Géza Tóth.
    Monotone drawings of planar graphs.
    Journal of Graph Theory 2004, Volume 46 (0) 2004
    Journal article
    János Pach, Rom Pinchasi.
    How Many Unit Equilateral Triangles Can Be Generated by N Points in Convex Position?
    The American Mathematical Monthly 2003, Volume 110 (0) 2003
    Conference paper
    János Pach, Rom Pinchasi, Micha Sharir.
    A tight bound for the number of different directions in three dimensions.
    Proceedings of the 19th ACM Symposium on Computational Geometry, San Diego, CA, USA, June 8-10, 2003 2003 (0) 2003
    Conference paper
    János Pach, Géza Tóth.
    How Many Ways Can One Draw a Graph?
    Graph Drawing, 11th International Symposium, GD 2003, Perugia, Italy, September 21-24, 2003, Revised Papers 2004 (0) 2003
    Conference paper
    János Pach, Géza Tóth.
    Disjoint Edges in Topological Graphs.
    Combinatorial Geometry and Graph Theory, Indonesia-Japan Joint Conference,IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers 2005 (0) 2003
    Conference paper
    Boris Aronov, János Pach, Micha Sharir, Gábor Tardos.
    Distinct distances in three and higher dimensions.
    Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA 2003 (0) 2003
    Conference paper
    János Pach, Ido Safruti, Micha Sharir.
    The Union of Congruent Cubes in Three Dimensions.
    Discrete Computational Geometry 2003, Volume 30 (0) 2003
    Conference paper
    János Pach, József Solymosi, Géza Tóth.
    Unavoidable Configurations in Complete Topological Graphs.
    Discrete Computational Geometry 2003, Volume 30 (0) 2003
    Journal article
    Imre Bárány, Gergely Harcos, János Pach, Gábor Tardos.
    Covering lattice points by subspaces.
    Periodica Mathematica Hungarica 2002, Volume 43 (0) 2002
    Conference paper
    Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky.
    Lenses in arrangements of pseudo-circles and their applications.
    Symposium on Computational Geometry 2002 (0) 2002
    Conference paper
    János Pach, Rom Pinchasi, Gábor Tardos, Géza Tóth.
    Geometric Graphs with No Self-intersecting Path of Length Three.
    Graph Drawing, 10th International Symposium, GD 2002, Irvine, CA, USA, August 26-28, 2002, Revised Papers 2002 (0) 2002
    Conference paper
    János Pach, Géza Tóth.
    Monotone Drawings of Planar Graphs.
    Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings 2002 (0) 2002
    Conference paper
    János Pach, Rados Radoicic, Géza Tóth.
    Relaxing Planarity for Topological Graphs.
    Discrete and Computational Geometry, Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers 2003 (0) 2002
    Conference paper
    János Pach, Gábor Tardos.
    Untangling a Polygon.
    Discrete Computational Geometry 2002, Volume 28 (0) 2002
    Conference paper
    János Pach, Géza Tóth.
    Recognizing String Graphs Is Decidable.
    Discrete Computational Geometry 2002, Volume 28 (0) 2002
    Conference paper
    János Pach, Gábor Tardos.
    Isosceles Triangles Determined by a Planar Point Set.
    Graphs and Combinatorics 2002, Volume 18 (0) 2002
    Conference paper
    Adrian Dumitrescu, János Pach.
    Partitioning Colored Point Sets into Monochromatic Parts.
    Int. J. Comput. Geometry Appl. 2002, Volume 12 (0) 2002
    Conference paper
    János Pach, Gábor Tardos.
    On the Boundary Complexity of the Union of Fat Triangles.
    SIAM J. Comput. 2001, Volume 31 (0) 2002
    Conference paper
    János Pach, Ido Safruti, Micha Sharir.
    The union of congruent cubes in three dimensions.
    Symposium on Computational Geometry 2001 (0) 2001
    Conference paper
    János Pach, Gábor Tardos.
    Untangling a Polygon.
    Graph Drawing, 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers 2002 (0) 2001
    Conference paper
    János Pach, Géza Tóth.
    Recognizing String Graphs Is Decidable.
    Graph Drawing, 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers 2002 (0) 2001
    Conference paper
    Adrian Dumitrescu, János Pach.
    Partitioning Colored Point Sets into Monochromatic Parts.
    Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings 2001 (0) 2001
    Conference paper
    Noga Alon, János Pach, József Solymosi.
    Ramsey-type Theorems with Forbidden Subgraphs.
    Combinatorica 2001, Volume 21 (0) 2001
    Conference paper
    I. G. Macdonald, János Pach, Thorsten Theobald.
    Common Tangents to Four Unit Balls in
    Discrete Computational Geometry 2001, Volume 26 (0) 2001
    Conference paper
    János Pach, Rom Pinchasi.
    On the Number of Balanced Lines.
    Discrete Computational Geometry 2001, Volume 25 (0) 2001
    Conference paper
    János Pach, Gábor Tardos.
    Separating convex sets by straight lines.
    Discrete Mathematics 2001, Volume 241 (0) 2001
    Conference paper
    János Pach, Micha Sharir.
    Radial Points in the Plane.
    Eur. J. Comb. 2001, Volume 22 (0) 2001
    Conference paper
    János Pach, Rephael Wenger.
    Embedding Planar Graphs at Fixed Vertex Locations.
    Graphs and Combinatorics 2001, Volume 17 (0) 2001
    Conference paper
    Peter Braß, János Pach.
    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, Volume 94 (0) 2001
    Conference paper
    János Pach, József Solymosi.
    Crossing Patterns of Segments.
    J. Comb. Theory, Ser. A 2001, Volume 96 (0) 2001
    Conference paper
    János Pach, Gábor Tardos.
    Cutting glass.
    Symposium on Computational Geometry 2000 (0) 2000
    Conference paper
    János Pach, Gábor Tardos.
    On the boundary complexity of the union of fat triangles.
    FOCS 2000 (0) 2000
    Show item 101 to 200 of 296  

    Your query returned 296 matches in the database.