Pavel Valtr - RankMe

166 papers A* 11A 16B 5C 6Misc 1Journal 111Unranked 15

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Simultaneous Embedding of Two Paths on the Grid. CoRR Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Daniel Perz, Pavel Valtr, Johannes Zink
2026	J	`jnl`	Three edge-disjoint plane spanning paths in a point set. Discret. Math. Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, Pavel Valtr
2025	C	`conf`	Guarding a 1.5D Terrain with Imprecise Viewpoints. IWOCA Vahideh Keikha, Maarten Löffler, Maria Saumell, Pavel Valtr
2025	J	`jnl`	Noncrossing Longest Paths and Cycles. Graphs Comb. Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr
2024	J	`jnl`	Bounding and Computing Obstacle Numbers of Graphs. SIAM J. Discret. Math. Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff
2024	J	`jnl`	Erdős-Szekeres-Type Problems in the Real Projective Plane. Discret. Comput. Geom. Martin Balko, Manfred Scheucher, Pavel Valtr
2024	J	`jnl`	Generalized Coloring of Permutations. Algorithmica Vít Jelínek, Michal Opler, Pavel Valtr
2024	A	`conf`	Noncrossing Longest Paths and Cycles. GD Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr
2024	J	`jnl`	Noncrossing Longest Paths and Cycles. CoRR Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr
2024	J	`jnl`	On the connectivity and the diameter of betweenness-uniform graphs. Discret. Appl. Math. David Hartman, Aneta Pokorná, Pavel Valtr
2024	J	`jnl`	The Crossing Tverberg Theorem. Discret. Comput. Geom. Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner
2023	—	`conf`	Improved Bounds for the Binary Paint Shop Problem. COCOON (2) Jaroslav Hancl, Adam Kabela, Michal Opler, Jakub Sosnovec, Robert Sámal, Pavel Valtr
2023	—	`conf`	Three Edge-Disjoint Plane Spanning Paths in a Point Set. GD (1) Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, Pavel Valtr
2023	J	`jnl`	Three Edge-disjoint Plane Spanning Paths in a Point Set. CoRR Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, Pavel Valtr
2023	J	`jnl`	Tight bounds on the expected number of holes in random point sets. Random Struct. Algorithms Martin Balko, Manfred Scheucher, Pavel Valtr
2022	A	`conf`	Bounding and Computing Obstacle Numbers of Graphs. ESA Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff
2022	J	`jnl`	Bounding and computing obstacle numbers of graphs. CoRR Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff
2022	J	`jnl`	Crossing numbers of beyond-planar graphs. Theor. Comput. Sci. Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr
2022	A*	`conf`	Erdős-Szekeres-Type Problems in the Real Projective Plane. SoCG Martin Balko, Manfred Scheucher, Pavel Valtr
2022	J	`jnl`	Erdős-Szekeres-type problems in the real projective plane. CoRR Martin Balko, Manfred Scheucher, Pavel Valtr
2022	J	`jnl`	Holes and islands in random point sets. Random Struct. Algorithms Martin Balko, Manfred Scheucher, Pavel Valtr
2022	J	`jnl`	On crossing-families in planar point sets. Comput. Geom. Oswin Aichholzer, Jan Kyncl, Manfred Scheucher, Birgit Vogtenhuber, Pavel Valtr
2021	J	`jnl`	Graph Drawing and Network Visualization GD2020. CoRR David Auber, Pavel Valtr
2021	A	`conf`	Linear Layouts of Complete Graphs. GD Stefan Felsner, Laura Merker, Torsten Ueckerdt, Pavel Valtr
2021	J	`jnl`	Linear Layouts of Complete Graphs. CoRR Stefan Felsner, Laura Merker, Torsten Ueckerdt, Pavel Valtr
2021	A	`conf`	Non-homotopic Loops with a Bounded Number of Pairwise Intersections. GD Václav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr
2021	J	`jnl`	Non-homotopic Loops with a Bounded Number of Pairwise Intersections. CoRR Václav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr
2021	J	`jnl`	On Crossing-Families in Planar Point Sets. CoRR Oswin Aichholzer, Jan Kyncl, Manfred Scheucher, Birgit Vogtenhuber, Pavel Valtr
2021	—	`conf`	On the Connectivity and the Diameter of Betweenness-Uniform Graphs. CALDAM David Hartman, Aneta Pokorná, Pavel Valtr
2021	J	`jnl`	On the Connectivity and the Diameter of Betweenness-Uniform Graphs. CoRR David Hartman, Aneta Pokorná, Pavel Valtr
2021	—	`conf`	On the Intersections of Non-homotopic Loops. CALDAM Václav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr
2021	A*	`conf`	Orientation Preserving Maps of the Square Grid. SoCG Imre Bárány, Attila Pór, Pavel Valtr
2021	J	`jnl`	Orientation preserving maps of the n × n grid. J. Comput. Geom. Imre Bárány, Attila Pór, Pavel Valtr
2021	J	`jnl`	The Stub Resolution of 1-planar Graphs. J. Graph Algorithms Appl. Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr
2021	J	`jnl`	Tight bounds on the expected number of holes in random point sets. CoRR Martin Balko, Manfred Scheucher, Pavel Valtr
2021	B	`conf`	Upward Point Set Embeddings of Paths and Trees. WALCOM Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada, Pavel Valtr
2020	J	`jnl`	A superlinear lower bound on the number of 5-holes. J. Comb. Theory A Oswin Aichholzer, Martin Balko, Thomas Hackl, Jan Kyncl, Irene Parada, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber
2020	J	`jnl`	Almost-Equidistant Sets. Graphs Comb. Martin Balko, Attila Pór, Manfred Scheucher, Konrad J. Swanepoel, Pavel Valtr
2020	A	`ed.`	Graph Drawing and Network Visualization - 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16-18, 2020, Revised Selected Papers GD David Auber, Pavel Valtr
2020	A*	`conf`	Holes and Islands in Random Point Sets. SoCG Martin Balko, Manfred Scheucher, Pavel Valtr
2020	J	`jnl`	Holes and islands in random point sets. CoRR Martin Balko, Manfred Scheucher, Pavel Valtr
2020	A*	`conf`	Long Alternating Paths Exist. SoCG Wolfgang Mulzer, Pavel Valtr
2020	J	`jnl`	Long Alternating Paths Exist. CoRR Wolfgang Mulzer, Pavel Valtr
2020	J	`jnl`	Minimal Representations of Order Types by Geometric Graphs. J. Graph Algorithms Appl. Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
2020	J	`jnl`	On Erdős-Szekeres-type problems for k-convex point sets. Eur. J. Comb. Martin Balko, Sujoy Bhore, Leonardo Martínez-Sandoval, Pavel Valtr
2020	J	`jnl`	On the Average Complexity of the k-Level. J. Comput. Geom. Raphael Steiner, Manfred Scheucher, Stefan Felsner, Pavel Valtr, Man-Kwun Chiu, Patrick Schnider
2020	B	`conf`	The Stub Resolution of 1-Planar Graphs. WALCOM Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr
2020	J	`jnl`	Upward Point Set Embeddings of Paths and Trees. CoRR Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada, Pavel Valtr
2019	J	`jnl`	Covering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences. Discret. Comput. Geom. Martin Balko, Josef Cibulka, Pavel Valtr
2019	A	`conf`	Crossing Numbers of Beyond-Planar Graphs. GD Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr
2019	J	`jnl`	Crossing Numbers of Beyond-Planar Graphs. CoRR Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr
2019	A	`conf`	Minimal Representations of Order Types by Geometric Graphs. GD Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
2019	J	`jnl`	Minimal Representations of Order Types by Geometric Graphs. CoRR Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
2019	C	`conf`	On Erdős-Szekeres-Type Problems for k-convex Point Sets. IWOCA Martin Balko, Sujoy Bhore, Leonardo Martínez-Sandoval, Pavel Valtr
2019	J	`jnl`	On ordered Ramsey numbers of bounded-degree graphs. J. Comb. Theory B Martin Balko, Vít Jelínek, Pavel Valtr
2019	J	`jnl`	On the Average Complexity of the k-Level. CoRR Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher, Patrick Schnider, Raphael Steiner, Pavel Valtr
2019	A*	`conf`	The Crossing Tverberg Theorem. SoCG Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner
2018	—	`conf`	Bounded Stub Resolution for Some Maximal 1-Planar Graphs. CALDAM Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr
2018	J	`jnl`	Drawing Graphs Using a Small Number of Obstacles. Discret. Comput. Geom. Martin Balko, Josef Cibulka, Pavel Valtr
2018	A	`conf`	Generalized Coloring of Permutations. ESA Vít Jelínek, Michal Opler, Pavel Valtr
2018	J	`jnl`	Holes in 2-convex point sets. Comput. Geom. Oswin Aichholzer, Martin Balko, Thomas Hackl, Alexander Pilz, Pedro Ramos, Pavel Valtr, Birgit Vogtenhuber
2018	J	`jnl`	On the Maximum Crossing Number. J. Graph Algorithms Appl. Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff
2018	J	`jnl`	The Crossing Tverberg Theorem. CoRR Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner
2018	J	`jnl`	The exact chromatic number of the convex segment disjointness graph. CoRR Ruy Fabila-Monroy, Jakob Jonsson, Pavel Valtr, David R. Wood
2017	J	`jnl`	A SAT attack on the Erdős-Szekeres conjecture. Eur. J. Comb. Martin Balko, Pavel Valtr
2017	A*	`conf`	A Superlinear Lower Bound on the Number of 5-Holes. SoCG Oswin Aichholzer, Martin Balko, Thomas Hackl, Jan Kyncl, Irene Parada, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber
2017	A*	`conf`	Covering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences. SoCG Martin Balko, Josef Cibulka, Pavel Valtr
2017	C	`conf`	Holes in 2-Convex Point Sets. IWOCA Oswin Aichholzer, Martin Balko, Thomas Hackl, Alexander Pilz, Pedro Ramos, Pavel Valtr, Birgit Vogtenhuber
2017	A	`conf`	Obstacle Numbers of Planar Graphs. GD John Gimbel, Patrice Ossona de Mendez, Pavel Valtr
2017	A	`conf`	On Vertex- and Empty-Ply Proximity Drawings. GD Patrizio Angelini, Steven Chaplick, Felice De Luca, Jirí Fiala, Jaroslav Hancl Jr., Niklas Heinsohn, Michael Kaufmann, Stephen G. Kobourov, Jan Kratochvíl, Pavel Valtr
2017	J	`jnl`	On Vertex- and Empty-Ply Proximity Drawings. CoRR Patrizio Angelini, Steven Chaplick, Felice De Luca, Jirí Fiala, Jan Hancl Jr., Niklas Heinsohn, Michael Kaufmann, Stephen G. Kobourov, Jan Kratochvíl, Pavel Valtr
2017	J	`jnl`	On the Beer Index of Convexity and Its Variants. Discret. Comput. Geom. Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak
2017	C	`conf`	On the Maximum Crossing Number. IWOCA Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff
2017	J	`jnl`	On the Maximum Crossing Number. CoRR Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff
2017	J	`jnl`	Peeling Potatoes Near-Optimally in Near-Linear Time. SIAM J. Comput. Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr
2016	A	`conf`	Low Ply Drawings of Trees. GD Patrizio Angelini, Michael A. Bekos, Till Bruckdorfer, Jaroslav Hancl Jr., Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis, Pavel Valtr
2016	J	`jnl`	Low Ply Drawings of Trees. CoRR Patrizio Angelini, Michael A. Bekos, Till Bruckdorfer, Jaroslav Hancl, Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis, Pavel Valtr
2016	J	`jnl`	On ordered Ramsey numbers of bounded-degree graphs. CoRR Martin Balko, Vít Jelínek, Pavel Valtr
2016	J	`jnl`	Reconstructing Point Set Order Types from Radial Orderings. Int. J. Comput. Geom. Appl. Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman, Pavel Valtr
2015	—	`conf`	A Note on the Number of General 4-holes in (Perturbed) Grids. JCDCGG Oswin Aichholzer, Thomas Hackl, Pavel Valtr, Birgit Vogtenhuber
2015	J	`jnl`	A SAT attack on the Erdős-Szekeres conjecture. Electron. Notes Discret. Math. Martin Balko, Pavel Valtr
2015	J	`jnl`	Cubic plane graphs on a given point set. Comput. Geom. Jens M. Schmidt, Pavel Valtr
2015	A	`conf`	Drawing Graphs Using a Small Number of Obstacles. GD Martin Balko, Josef Cibulka, Pavel Valtr
2015	J	`jnl`	Empty Pentagons in Point Sets with Collinearities. SIAM J. Discret. Math. János Barát, Vida Dujmovic, Gwenaël Joret, Michael S. Payne, Ludmila Scharf, Daria Schymura, Pavel Valtr, David R. Wood
2015	J	`jnl`	On k-gons and k-holes in point sets. Comput. Geom. Oswin Aichholzer, Ruy Fabila-Monroy, Hernán González-Aguilar, Thomas Hackl, Marco A. Heredia, Clemens Huemer, Jorge Urrutia, Pavel Valtr, Birgit Vogtenhuber
2015	A*	`conf`	On the Beer Index of Convexity and Its Variants. SoCG Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak
2015	J	`jnl`	On the Geometric Ramsey Number of Outerplanar Graphs. Discret. Comput. Geom. Josef Cibulka, Pu Gao, Marek Krcál, Tomás Valla, Pavel Valtr
2015	J	`jnl`	Splittings and Ramsey properties of permutation classes. Adv. Appl. Math. Vít Jelínek, Pavel Valtr
2014	J	`jnl`	Bend-optimal orthogonal graph drawing in the general position model. Comput. Geom. Stefan Felsner, Michael Kaufmann, Pavel Valtr
2014	J	`jnl`	Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. Discret. Math. Theor. Comput. Sci. Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
2014	J	`jnl`	On $k$-Gons and $k$-Holes in Point Sets. CoRR Oswin Aichholzer, Ruy Fabila-Monroy, Hernán González-Aguilar, Thomas Hackl, Marco A. Heredia, Clemens Huemer, Jorge Urrutia, Pavel Valtr, Birgit Vogtenhuber
2014	J	`jnl`	On k-convex point sets. Comput. Geom. Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Ferran Hurtado, Alexander Pilz, Pedro Ramos, Jorge Urrutia, Pavel Valtr, Birgit Vogtenhuber
2014	J	`jnl`	On the Beer index of convexity and its variants. CoRR Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak
2014	A*	`conf`	Peeling Potatoes Near-Optimally in Near-Linear Time. SoCG Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr
2014	J	`jnl`	Peeling potatoes near-optimally in near-linear time. CoRR Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr
2014	B	`conf`	Reconstructing Point Set Order Typesfrom Radial Orderings. ISAAC Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman, Pavel Valtr
2014	B	`conf`	The Happy End Theorem and Related Results. WALCOM Pavel Valtr
2013	J	`jnl`	Graph sharing games: Complexity and connectivity. Theor. Comput. Sci. Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr
2013	—	`ch.`	On Mutually Avoiding Sets. The Mathematics of Paul Erdős I Pavel Valtr
2013	A*	`conf`	On planar point sets with the pentagon property. SoCG Josef Cibulka, Jan Kyncl, Pavel Valtr
2013	J	`jnl`	On the Geometric Ramsey Number of Outerplanar Graphs. CoRR Josef Cibulka, Pu Gao, Marek Krcál, Tomás Valla, Pavel Valtr
2013	J	`jnl`	Splittings and Ramsey Properties of Permutation Classes. CoRR Vít Jelínek, Pavel Valtr
2012	—	`conf`	Cubic plane graphs on a given point set. SCG Jens M. Schmidt, Pavel Valtr
2012	J	`jnl`	Empty pentagons in point sets with collinearities CoRR János Barát, Vida Dujmovic, Gwenaël Joret, Michael S. Payne, Ludmila Scharf, Daria Schymura, Pavel Valtr, David R. Wood
2012	J	`jnl`	Graph sharing games: complexity and connectivity CoRR Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr
2012	—	`conf`	On empty pentagons and hexagons in planar point sets. CATS Pavel Valtr
2012	J	`jnl`	On the Connectivity of Visibility Graphs. Discret. Comput. Geom. Michael S. Payne, Attila Pór, Pavel Valtr, David R. Wood
2011	J	`jnl`	Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three. Algorithmica Marwan Al-Jubeh, Mashhood Ishaque, Kristóf Rédei, Diane L. Souvaine, Csaba D. Tóth, Pavel Valtr
2011	J	`jnl`	Coding and Counting Arrangements of Pseudolines. Discret. Comput. Geom. Stefan Felsner, Pavel Valtr
2011	J	`jnl`	On empty pentagons and hexagons in planar point sets CoRR Pavel Valtr
2011	—	`conf`	On k-Gons and k-Holes in Point Sets. CCCG Birgit Vogtenhuber, Oswin Aichholzer, Ruy Fabila-Monroy, Clemens Huemer, Jorge Urrutia, Marco A. Heredia, Hernán González-Aguilar, Thomas Hackl, Pavel Valtr
2011	J	`jnl`	Universal Sets for Straight-Line Embeddings of Bicolored Graphs CoRR Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr
2010	C	`conf`	Graph Sharing Games: Complexity and Connectivity. TAMC Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr
2010	J	`jnl`	Large Convexly Independent Subsets of Minkowski Sums. Electron. J. Comb. Konrad J. Swanepoel, Pavel Valtr
2010	Misc	`conf`	On Three Parameters of Invisibility Graphs. COCOON Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr
2009	J	`jnl`	On edges crossing few other edges in simple topological complete graphs. Discret. Math. Jan Kyncl, Pavel Valtr
2009	J	`jnl`	On triconnected and cubic plane graphs on given point sets. Comput. Geom. Alfredo García Olaverri, Ferran Hurtado, Clemens Huemer, Javier Tejel, Pavel Valtr
2009	J	`jnl`	Paths with No Small Angles. SIAM J. Discret. Math. Imre Bárány, Attila Pór, Pavel Valtr
2009	C	`conf`	Solution of Peter Winkler's Pizza Problem. IWOCA Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr
2009	J	`jnl`	Traversing a Set of Points with a Minimum Number of Turns. Discret. Comput. Geom. Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr
2008	A	`conf`	Hamiltonian Alternating Paths on Bicolored Double-Chains. GD Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr
2008	B	`conf`	Paths with no Small Angles. LATIN Imre Bárány, Attila Pór, Pavel Valtr
2008	J	`jnl`	Solution of Peter Winkler's Pizza Problem CoRR Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr
2007	J	`jnl`	Empty convex polygons in almost convex sets. Period. Math. Hung. Pavel Valtr, Gábor Lippner, Gyula Károlyi
2007	J	`jnl`	Labelings of Graphs with Fixed and Variable Edge-Weights. SIAM J. Discret. Math. Robert Babilon, Vít Jelínek, Daniel Král, Pavel Valtr
2007	J	`jnl`	On embedding triconnected cubic graphs on point sets. Electron. Notes Discret. Math. Alfredo García Olaverri, Ferran Hurtado, Clemens Huemer, Javier Tejel, Pavel Valtr
2007	J	`jnl`	Open Caps and Cups in Planar Point Sets. Discret. Comput. Geom. Pavel Valtr
2007	—	`conf`	Traversing a set of points with a minimum number of turns. SCG Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr
2006	J	`jnl`	On the positive fraction Erdos-Szekeres theorem for convex sets. Eur. J. Comb. Attila Pór, Pavel Valtr
2005	A	`conf`	On Edges Crossing Few Other Edges in Simple Topological Complete Graphs. GD Jan Kyncl, Pavel Valtr
2004	J	`jnl`	VC-Dimension of Exterior Visibility. IEEE Trans. Pattern Anal. Mach. Intell. Volkan Isler, Sampath Kannan, Kostas Daniilidis, Pavel Valtr
2003	J	`jnl`	Davenport-Schinzel Trees. Comb. Pavel Valtr
2003	J	`jnl`	Low-Distortion Embeddings of Trees. J. Graph Algorithms Appl. Robert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr
2003	J	`jnl`	Point Configurations in d-Space without Large Subsets in Convex Position. Discret. Comput. Geom. Gyula Károlyi, Pavel Valtr
2002	J	`jnl`	A Sufficient Condition for the Existence of Large Empty Convex Polygons. Discret. Comput. Geom. Pavel Valtr
2002	J	`jnl`	The Partitioned Version of the Erdös - Szekeres Theorem. Discret. Comput. Geom. Attila Pór, Pavel Valtr
2001	A	`conf`	Low-Distortion Embeddings of Trees. GD Robert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr
2001	A*	`conf`	One line and n points. STOC Bernd Gärtner, József Solymosi, Falk Tschirschnitz, Emo Welzl, Pavel Valtr
1999	J	`jnl`	Almost-Tiling the Plane by Ellipses. Discret. Comput. Geom. Krystyna Trybulec Kuperberg, Wlodzimierz Kuperberg, Jirí Matousek, Pavel Valtr
1999	J	`jnl`	Geometric Graphs with Few Disjoint Edges. Discret. Comput. Geom. Géza Tóth, Pavel Valtr
1999	J	`jnl`	On Galleries with No Bad Points. Discret. Comput. Geom. Pavel Valtr
1999	J	`jnl`	On an Extremal Problem for Colored Trees. Eur. J. Comb. Pavel Valtr
1998	J	`jnl`	A Positive Fraction Erdos - Szekeres Theorem. Discret. Comput. Geom. Imre Bárány, Pavel Valtr
1998	J	`jnl`	A Ramsey Property of Order Types. J. Comb. Theory A Jaroslav Nesetril, Pavel Valtr
1998	—	`conf`	Geometric Graphs with Few Disjoint Edges. SCG Géza Tóth, Pavel Valtr
1998	J	`jnl`	Note on the Erdos - Szekeres Theorem. Discret. Comput. Geom. Géza Tóth, Pavel Valtr
1998	J	`jnl`	On Geometric Graphs with No k Pairwise Parallel Edges. Discret. Comput. Geom. Pavel Valtr
1998	J	`jnl`	On the Density of Subgraphs in a Graph with Bounded Independence Number. J. Comb. Theory B Pavel Valtr
1998	J	`jnl`	Ramsey-Type Results for Geometric Graphs, II. Discret. Comput. Geom. Gyula Károlyi, János Pach, Géza Tóth, Pavel Valtr
1998	J	`jnl`	The largest k-ball in a d-dimensional box. Comput. Geom. Hazel Everett, Ivan Stojmenovic, Pavel Valtr, Sue Whitesides
1997	J	`jnl`	Cutting Dense Point Sets in Half. Discret. Comput. Geom. Herbert Edelsbrunner, Pavel Valtr, Emo Welzl
1997	—	`conf`	Generalizations of Davenport-Schinzel sequences. Contemporary Trends in Discrete Mathematics Pavel Valtr
1997	A	`conf`	Graph Drawings with no k Pairwise Crossing Edges. GD Pavel Valtr
1997	—	`conf`	Induced monochromatic subconfigurations. Contemporary Trends in Discrete Mathematics Jaroslav Nesetril, József Solymosi, Pavel Valtr
1997	—	`conf`	Ramsey-Type Results for Geometric Graphs II. SCG Gyula Károlyi, János Pach, Géza Tóth, Pavel Valtr
1996	J	`jnl`	Lines, Line-Point Incidences and Crossing Families in Dense Sets. Comb. Pavel Valtr
1996	J	`jnl`	Ramsey-remainder. Eur. J. Comb. Paul Erdös, Zsolt Tuza, Pavel Valtr
1996	J	`jnl`	The Probability that Comb. Pavel Valtr
1995	J	`jnl`	Probability that n Random Points are in Convex Position. Discret. Comput. Geom. Pavel Valtr
1994	J	`jnl`	A Ramsey-type Theorem in the Plane. Comb. Probab. Comput. Jaroslav Nesetril, Pavel Valtr
1994	—	`conf`	Cutting Dense Point Sets in Half. SCG Herbert Edelsbrunner, Pavel Valtr, Emo Welzl
1994	J	`jnl`	Generalized Davenport-Schinzel Sequences. Comb. Martin Klazar, Pavel Valtr
1994	J	`jnl`	Unit Squares Intersecting All Secants of a Square. Discret. Comput. Geom. Pavel Valtr
1992	J	`jnl`	Convex Independent Sets and 7-holes in Restricted Planar Point Sets. Discret. Comput. Geom. Pavel Valtr
1992	J	`jnl`	Generalized Davenport-Schinzel sequences with linear upper bound. Discret. Math. Radek Adamec, Martin Klazar, Pavel Valtr
1992	J	`jnl`	Sets in R Discret. Math. Pavel Valtr