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 1 to 100 of 295  
    Select a publication
    Show Title Venue Rating Date
    Journal article
    János Pach, László A. Székely, Csaba D. Tóth, Géza Tóth.
    Note on k-planar crossing numbers.
    Comput. Geom. 2018, Volume 68 (0) 2018
    Journal article
    János Pach, Frank de Zeeuw.
    Distinct Distances on Algebraic Curves in the Plane.
    Combinatorics, Probability Computing 2017, Volume 26 (0) 2017
    Conference paper
    Jacob Fox, János Pach, Andrew Suk.
    Erdös-Hajnal Conjecture for Graphs with Bounded VC-Dimension.
    33rd International Symposium on Computational Geometry, SoCG 2017, July 4-7, 2017, Brisbane, Australia 2017 (0) 2017
    Conference paper
    János Pach, Gábor Tardos, Géza Tóth.
    Disjointness Graphs of Segments.
    33rd International Symposium on Computational Geometry, SoCG 2017, July 4-7, 2017, Brisbane, Australia 2017 (0) 2017
    Conference paper
    János Pach, Natan Rubin, Gábor Tardos.
    A Crossing Lemma for Jordan Curves.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Andrey Kupavskii, János Pach, Gábor Tardos.
    Tilings with noncongruent triangles.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    János Pach, Natan Rubin, Gábor Tardos.
    Beyond the Richter-Thomassen Conjecture.
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016
    Journal article
    János Pach, Bartosz Walczak.
    Decomposition of Multiple Packings with Subquadratic Union Complexity.
    Combinatorics, Probability Computing 2016, Volume 25 (0) 2016
    Journal article
    Nabil H. Mustafa, János Pach.
    On the Zarankiewicz problem for intersection hypergraphs.
    J. Comb. Theory, Ser. A 2016, Volume 141 (0) 2016
    Conference paper
    Kenneth L. Clarkson, János Pach, Günter M. Ziegler.
    Thirtieth Anniversary Note from the Editors in Chief.
    Discrete Computational Geometry 2016, Volume 55 (0) 2016
    Conference paper
    Andrey Kupavskii, Nabil H. Mustafa, János Pach.
    New Lower Bounds for epsilon-Nets.
    32nd International Symposium on Computational Geometry, SoCG 2016, June 14-18, 2016, Boston, MA, USA 2016 (0) 2016
    Conference paper
    Jacob Fox, János Pach, Andrew Suk.
    Approximating the rectilinear crossing number.
    CoRR 2016, Volume 0 (0) 2016
    Journal article
    Zsolt Lángi, Márton Naszódi, János Pach, Gábor Tardos, Géza Tóth.
    Separation with restricted families of sets.
    J. Comb. Theory, Ser. A 2016, Volume 144 (0) 2016
    Conference paper
    Lars Arge, János Pach.
    Guest Editors' Foreword.
    Discrete Computational Geometry 2016, Volume 56 (0) 2016
    Conference paper
    János Pach, Natan Rubin, Gábor Tardos.
    On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves
    Combinatorics, Probability Computing 2016, Volume 25 (0) 2016
    Conference paper
    Jacob Fox, János Pach, Andrew Suk.
    Approximating the Rectilinear Crossing Number.
    Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers 2016 (0) 2016
    Conference paper
    Jacob Fox, János Pach, Andrew Suk.
    A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing.
    SIAM J. Comput. 2016, Volume 45 (0) 2016
    Conference paper
    Seok-Hee Hong, Michael Kaufmann 0001, Stephen G. Kobourov, János Pach.
    Beyond-Planar Graphs: Algorithmics and Combinatorics (Dagstuhl Seminar 16452).
    Dagstuhl Reports 2016, Volume 6 (0) 2016
    Conference paper
    Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach.
    A Lower Bound on Opaque Sets.
    32nd International Symposium on Computational Geometry, SoCG 2016, June 14-18, 2016, Boston, MA, USA 2016 (0) 2016
    Conference paper
    Jan Kyncl, János Pach, Rados Radoicic, Géza Tóth.
    Saturated simple and k-simple topological graphs.
    Comput. Geom. 2015, Volume 48 (0) 2015
    Conference paper
    János Pach, Natan Rubin, Gábor Tardos.
    On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves.
    Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015 2015 (0) 2015
    Conference paper
    Jacob Fox, János Pach, Andrew Suk.
    Density and regularity theorems for semi-algebraic hypergraphs.
    Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015 2015 (0) 2015
    Journal article
    Jacob Fox, János Pach, Andrew Suk.
    A polynomial regularity lemma for semi-algebraic hypergraphs and its applications in geometry and property testing.
    CoRR 2015, Volume 0 (0) 2015
    Journal article
    Jacob Fox, Andrey Grinshpun, János Pach.
    The ErdÅ?s-Hajnal conjecture for rainbow triangles.
    J. Comb. Theory, Ser. B 2015, Volume 111 (0) 2015
    Conference paper
    János Pach, Gábor Tardos.
    Cross-Intersecting Families of Vectors.
    Graphs and Combinatorics 2015, Volume 31 (0) 2015
    Journal article
    János Pach, Natan Rubin, Gábor Tardos.
    Beyond the Richter-Thomassen Conjecture.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Filip Moric, János Pach.
    Remarks on Schur's conjecture.
    Comput. Geom. 2015, Volume 48 (0) 2015
    Conference paper
    Jacob Fox, János Pach, Andrew Suk.
    Semi-algebraic colorings of complete graphs.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Ross J. Kang, János Pach, Viresh Patel, Guus Regts.
    A Precise Threshold for Quasi-Ramsey Numbers.
    SIAM J. Discrete Math. 2015, Volume 29 (0) 2015
    Conference paper
    Luis Barba, Otfried Cheong, Jean-Lou De Carufel, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot, Tianhao Wang.
    Weight Balancing on Boundaries and Skeletons.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    János Pach.
    Every graph admits an unambiguous bold drawing.
    J. Graph Algorithms Appl. 2015, Volume 19 (0) 2015
    Conference paper
    János Pach, Dömötör Pálvölgyi.
    Unsplittable Coverings in the Plane.
    Graph-Theoretic Concepts in Computer Science - 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers 2016 (0) 2015
    Conference paper
    Andrey Kupavskii, János Pach.
    Simultaneous Approximation of Polynomials.
    Discrete and Computational Geometry and Graphs - 18th Japan Conference, JCDCGG 2015, Kyoto, Japan, September 14-16, 2015, Revised Selected Papers 2016 (0) 2015
    Conference paper
    Nabil H. Mustafa, János Pach.
    On the Zarankiewicz Problem for Intersection Hypergraphs.
    Graph Drawing and Network Visualization - 23rd International Symposium, GD 2015, Los Angeles, CA, USA, September 24-26, 2015, Revised Selected Papers 2015 (0) 2015
    Journal article
    Gabriel Nivasch, János Pach, Gábor Tardos.
    The visible perimeter of an arrangement of disks.
    Comput. Geom. 2014, Volume 47 (0) 2014
    Journal article
    Jacob Fox, János Pach.
    Applications of a New Separator Theorem for String Graphs.
    Combinatorics, Probability Computing 2014, Volume 23 (0) 2014
    Journal article
    Imre Bárány, János Pach.
    Homogeneous selections from hyperplanes.
    J. Comb. Theory, Ser. B 2014, Volume 104 (0) 2014
    Conference paper
    Adrian Dumitrescu, Minghui Jiang 0001, János Pach.
    Opaque Sets.
    Algorithmica 2014, Volume 69 (0) 2014
    Journal article
    Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach.
    A lower bound on opaque sets.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk.
    On grids in topological graphs.
    Comput. Geom. 2014, Volume 47 (0) 2014
    Conference paper
    Fabrizio Frati, Michael Kaufmann 0001, János Pach, Csaba D. Tóth, David R. Wood.
    On the Upward Planarity of Mixed Plane Graphs.
    J. Graph Algorithms Appl. 2014, Volume 18 (0) 2014
    Conference paper
    János Pach, Frank de Zeeuw.
    Distinct distances on algebraic curves in the plane.
    30th Annual Symposium on Computational Geometry, SOCG'14, Kyoto, Japan, June 08 - 11, 2014 2014 (0) 2014
    Conference paper
    Luis Barba, Otfried Cheong, Jean-Lou De Carufel, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot, Tianhao Wang.
    Weight Balancing on Boundaries and Skeletons.
    30th Annual Symposium on Computational Geometry, SOCG'14, Kyoto, Japan, June 08 - 11, 2014 2014 (0) 2014
    Conference paper
    Eyal Ackerman, János Pach, Rom Pinchasi, Rados Radoicic, Géza Tóth.
    A Note on Coloring Line Arrangements.
    Electr. J. Comb. 2014, Volume 21 (0) 2014
    Journal article
    János Pach, Natan Rubin, Gábor Tardos.
    On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves.
    CoRR 2014, Volume 0 (0) 2014
    Journal article
    Gabriel Nivasch, János Pach, Rom Pinchasi, Shira Zerbib.
    The number of distinct distances from a vertex of a convex polygon.
    JoCG 2013, Volume 4 (0) 2013
    Journal article
    Jacob Fox, János Pach.
    Applications of a new separator theorem for string graphs
    CoRR 2013, Volume 0 (0) 2013
    Journal article
    Jacob Fox, János Pach, Andrew Suk.
    The Number of Edges in k-Quasi-planar Graphs.
    SIAM J. Discrete Math. 2013, Volume 27 (0) 2013
    Conference paper
    János Pach, Géza Tóth.
    Monochromatic empty triangles in two-colored point sets.
    Discrete Applied Mathematics 2013, Volume 161 (0) 2013
    Conference paper
    Balázs Keszegh, János Pach, Dömötör Pálvölgyi.
    Drawing Planar Graphs of Bounded Degree with Few Slopes.
    SIAM J. Discrete Math. 2013, Volume 27 (0) 2013
    Journal article
    Filip Moric, János Pach.
    On Schur's conjecture.
    Electronic Notes in Discrete Mathematics 2013, Volume 44 (0) 2013
    Conference paper
    Fabrizio Frati, Michael Kaufmann, János Pach, Csaba D. Tóth, David R. Wood.
    On the Upward Planarity of Mixed Plane Graphs.
    Graph Drawing - 21st International Symposium, GD 2013, Bordeaux, France, September 23-25, 2013, Revised Selected Papers 2013 (0) 2013
    Conference paper
    Giuseppe Di Battista, Fabrizio Frati, János Pach.
    On the Queue Number of Planar Graphs.
    SIAM J. Comput. 2013, Volume 42 (0) 2013
    Conference paper
    János Pach, Bartosz Walczak.
    Decomposition of multiple packings with subquadratic union complexity.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    János Pach, Gábor Tardos.
    The Range of a Random Walk on a Comb.
    Electr. J. Comb. 2013, Volume 20 (0) 2013
    Conference paper
    David Conlon, Jacob Fox, János Pach, Benny Sudakov, Andrew Suk.
    Ramsey-type results for semi-algebraic relations.
    Symposuim on Computational Geometry 2013, SoCG '13, Rio de Janeiro, Brazil, June 17-20, 2013 2013 (0) 2013
    Conference paper
    János Pach, Gábor Tardos.
    Cross-Intersecting Families of Vectors.
    Discrete and Computational Geometry and Graphs - 16th Japanese Conference, JCDCGG 2013, Tokyo, Japan, September 17-19, 2013, Revised Selected Papers 2014 (0) 2013
    Book chapter
    János Pach.
    A Remark on Transversal Numbers.
    The Mathematics of Paul ErdÅ?s I 2013 (0) 2013
    Conference paper
    János Pach, Andrew Suk, Miroslav Treml.
    Tangencies between families of disjoint regions in the plane.
    Comput. Geom. 2012, Volume 45 (0) 2012
    Conference paper
    Jacob Fox, János Pach.
    Coloring K
    Eur. J. Comb. 2012, Volume 33 (0) 2012
    Conference paper
    János Pach, Gábor Tardos.
    Piercing quasi-rectangles - On a problem of Danzer and Rogers.
    J. Comb. Theory, Ser. A 2012, Volume 119 (0) 2012
    Conference paper
    Jacob Fox, János Pach.
    String graphs and incomparability graphs.
    Symposuim on Computational Geometry 2012, SoCG '12, Chapel Hill, NC, USA, June 17-20, 2012 2012 (0) 2012
    Conference paper
    János Pach, Gábor Tardos, József Solymosi.
    Remarks on a Ramsey theory for trees.
    Combinatorica 2012, Volume 32 (0) 2012
    Conference paper
    Gabriel Nivasch, János Pach, Gábor Tardos.
    The visible perimeter of an arrangement of disks
    CoRR 2012, Volume 0 (0) 2012
    Journal article
    Marc J. van Kreveld, Maarten Löffler, János Pach.
    How Many Potatoes are in a Mesh?
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Gabriel Nivasch, János Pach, Rom Pinchasi, Shira Zerbib.
    The number of distinct distances from a vertex of a convex polygon
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Marc J. van Kreveld, Maarten Löffler, János Pach.
    How Many Potatoes Are in a Mesh?
    Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Gabriel Nivasch, János Pach, Gábor Tardos.
    The Visible Perimeter of an Arrangement of Disks.
    Graph Drawing - 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers 2013 (0) 2012
    Journal article
    Padmini Mukkamala, János Pach, Dömötör Pálvölgyi.
    Lower Bounds on the Obstacle Number of Graphs.
    Electr. J. Comb. 2012, Volume 19 (0) 2012
    Journal article
    Adrian Dumitrescu, János Pach, Géza Tóth.
    Drawing Hamiltonian Cycles with no Large Angles.
    Electr. J. Comb. 2012, Volume 19 (0) 2012
    Conference paper
    Filip Moric, János Pach.
    Remarks on Schur's Conjecture.
    Computational Geometry and Graphs - Thailand-Japan Joint Conference, TJJCCGG 2012, Bangkok, Thailand, December 6-8, 2012, Revised Selected Papers 2013 (0) 2012
    Journal article
    Herbert Edelsbrunner, János Pach, Günter M. Ziegler.
    Letter from the New Editors-in-Chief.
    Discrete Computational Geometry 2011, Volume 45 (0) 2011
    Journal article
    Padmini Mukkamala, János Pach, Dömötör Pálvölgyi.
    Lower bounds on the obstacle number of graphs
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Radoslav Fulek, János Pach.
    A computational approach to Conway's thrackle conjecture.
    Comput. Geom. 2011, Volume 44 (0) 2011
    Conference paper
    János Pach, Deniz Sariöz.
    On the Structure of Graphs with Low Obstacle Number.
    Graphs and Combinatorics 2011, Volume 27 (0) 2011
    Conference paper
    Adrian Dumitrescu, János Pach.
    Minimum Clique Partition in Unit Disk Graphs.
    Graphs and Combinatorics 2011, Volume 27 (0) 2011
    Conference paper
    Jacob Fox, János Pach.
    Computing the Independence Number of Intersection Graphs.
    Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011 2011 (0) 2011
    Conference paper
    Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assaf Naor, János Pach.
    Overlap properties of geometric expanders.
    Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011 2011 (0) 2011
    Conference paper
    János Pach, Gábor Tardos.
    Tight lower bounds for the size of epsilon-nets.
    Proceedings of the 27th ACM Symposium on Computational Geometry, Paris, France, June 13-15, 2011 2011 (0) 2011
    Conference paper
    Adrian Dumitrescu, Minghui Jiang 0001, János Pach.
    Opaque Sets.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings 2011 (0) 2011
    Conference paper
    János Pach, Gábor Tardos.
    Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers.
    Algorithms and Data Structures - 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings 2011 (0) 2011
    Conference paper
    János Pach, Géza Tóth.
    Monotone Crossing Number.
    Graph Drawing - 19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21-23, 2011, Revised Selected Papers 2012 (0) 2011
    Conference paper
    János Pach.
    Every Graph Admits an Unambiguous Bold Drawing.
    Graph Drawing - 19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21-23, 2011, Revised Selected Papers 2012 (0) 2011
    Conference paper
    Jacob Fox, János Pach, Andrew Suk.
    The number of edges in k-quasi-planar graphs
    CoRR 2011, Volume 0 (0) 2011
    Journal article
    János Pach, Ethan Sterling.
    Conway's Conjecture for Monotone Thrackles.
    The American Mathematical Monthly 2011, Volume 118 (0) 2011
    Conference paper
    János Pach, Rados Radoicic, Géza Tóth.
    Tangled Thrackles.
    Computational Geometry - XIV Spanish Meeting on Computational Geometry, EGC 2011, Dedicated to Ferran Hurtado on the Occasion of His 60th Birthday, Alcalá de Henares, Spain, June 27-30, 2011, Revised Selected Papers 2012 (0) 2011
    Journal article
    Jacob Fox, János Pach, Csaba D. Tóth.
    Intersection patterns of curves.
    J. London Math. Society 2011, Volume 83 (0) 2011
    Conference paper
    János Pach, Gábor Tardos.
    Coloring axis-parallel rectangles.
    J. Comb. Theory, Ser. A 2010, Volume 117 (0) 2010
    Journal article
    János Pach, József Solymosi, Gábor Tardos.
    Crossing numbers of imbalanced graphs.
    Journal of Graph Theory 2010, Volume 64 (0) 2010
    Journal article
    Adrian Dumitrescu, János Pach.
    Opaque sets
    CoRR 2010, Volume 0 (0) 2010
    Conference paper
    Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assaf Naor, János Pach.
    Overlap properties of geometric expanders
    CoRR 2010, Volume 0 (0) 2010
    Conference paper
    János Pach, Andrew Suk, Miroslav Treml.
    Tangencies between families of disjoint regions in the plane.
    Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010 2010 (0) 2010
    Journal article
    Balázs Keszegh, János Pach, Dömötör Pálvölgyi.
    Drawing planar graphs of bounded degree with few slopes
    CoRR 2010, Volume 0 (0) 2010
    Conference paper
    Padmini Mukkamala, János Pach, Deniz Sariöz.
    Graphs with Large Obstacle Numbers.
    Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers 2010 (0) 2010
    Conference paper
    Jacob Fox, János Pach.
    A Separator Theorem for String Graphs and its Applications.
    Combinatorics, Probability Computing 2010, Volume 19 (0) 2010
    Conference paper
    Giuseppe Di Battista, Fabrizio Frati, János Pach.
    On the Queue Number of Planar Graphs.
    51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA 2010 (0) 2010
    Journal article
    János Pach, Gábor Tardos.
    Tight lower bounds for the size of epsilon-nets
    CoRR 2010, Volume 0 (0) 2010
    Journal article
    János Pach, Deniz Sariöz.
    Small (2,s)-colorable graphs without 1-obstacle representations
    CoRR 2010, Volume 0 (0) 2010
    Conference paper
    Balázs Keszegh, János Pach, Dömötör Pálvölgyi.
    Drawing Planar Graphs of Bounded Degree with Few Slopes.
    Graph Drawing - 18th International Symposium, GD 2010, Konstanz, Germany, September 21-24, 2010. Revised Selected Papers 2011 (0) 2010
    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
    Show item 1 to 100 of 295  

    Your query returned 295 matches in the database.