Pavel Valtr

ORCID

Publication Activity (10 Years)

Years Active: 1992-2022
Publications (10 Years): 74

Top Venues

Publications

Martin Balko, Manfred Scheucher, Pavel Valtr
Erdős-Szekeres-type problems in the real projective plane. CoRR (2022)
Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff
Bounding and Computing Obstacle Numbers of Graphs. ESA (2022)
Martin Balko, Manfred Scheucher, Pavel Valtr
Erdős-Szekeres-Type Problems in the Real Projective Plane. SoCG (2022)
Oswin Aichholzer, Jan Kyncl, Manfred Scheucher, Birgit Vogtenhuber, Pavel Valtr
On crossing-families in planar point sets. Comput. Geom. 107 (2022)
Martin Balko, Manfred Scheucher, Pavel Valtr
Holes and islands in random point sets. Random Struct. Algorithms 60 (3) (2022)
Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr
Crossing numbers of beyond-planar graphs. Theor. Comput. Sci. 898 (2022)
Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff
Bounding and computing obstacle numbers of graphs. CoRR (2022)
Stefan Felsner, Laura Merker, Torsten Ueckerdt, Pavel Valtr
Linear Layouts of Complete Graphs. CoRR (2021)
David Hartman, Aneta Pokorná, Pavel Valtr
On the Connectivity and the Diameter of Betweenness-Uniform Graphs. CoRR (2021)
David Hartman, Aneta Pokorná, Pavel Valtr
On the Connectivity and the Diameter of Betweenness-Uniform Graphs. CALDAM (2021)
Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada, Pavel Valtr
Upward Point Set Embeddings of Paths and Trees. WALCOM (2021)
Václav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr
Non-homotopic Loops with a Bounded Number of Pairwise Intersections. Graph Drawing (2021)
Imre Bárány, Attila Pór, Pavel Valtr
Orientation Preserving Maps of the Square Grid. SoCG (2021)
Stefan Felsner, Laura Merker, Torsten Ueckerdt, Pavel Valtr
Linear Layouts of Complete Graphs. Graph Drawing (2021)
Martin Balko, Manfred Scheucher, Pavel Valtr
Tight bounds on the expected number of holes in random point sets. CoRR (2021)
Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr
The Stub Resolution of 1-planar Graphs. J. Graph Algorithms Appl. 25 (2) (2021)
Václav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr
On the Intersections of Non-homotopic Loops. CALDAM (2021)
Oswin Aichholzer, Jan Kyncl, Manfred Scheucher, Birgit Vogtenhuber, Pavel Valtr
On Crossing-Families in Planar Point Sets. CoRR (2021)
David Auber, Pavel Valtr
Graph Drawing and Network Visualization GD2020. CoRR (2021)
Václav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr
Non-homotopic Loops with a Bounded Number of Pairwise Intersections. CoRR (2021)
Juan Andrés Vásquez-Peralvo, Jose-Manuel Fernandez-Gonzalez, Jonathan Michael Rigelsford, Pavel Valtr
Interwoven Hexagonal Frequency Selective Surface: An Application for WiFi Propagation Control. IEEE Access 9 (2021)
Juan Andrés Vásquez-Peralvo, Jose-Manuel Fernandez-Gonzalez, Pavel Valtr, Jonathan Michael Rigelsford
Inductive Frequency Selective Surface: An Application for Dichroic Sub-Reflectors. IEEE Access 8 (2020)
Martin Balko, Manfred Scheucher, Pavel Valtr
Holes and islands in random point sets. CoRR (2020)
Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr
The Stub Resolution of 1-Planar Graphs. WALCOM (2020)
Martin Balko, Sujoy Bhore, Leonardo Martínez-Sandoval, Pavel Valtr
On Erdős-Szekeres-type problems for k-convex point sets. Eur. J. Comb. 89 (2020)
Martin Balko, Attila Pór, Manfred Scheucher, Konrad J. Swanepoel, Pavel Valtr
Almost-Equidistant Sets. Graphs Comb. 36 (3) (2020)
Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada, Pavel Valtr
Upward Point Set Embeddings of Paths and Trees. CoRR (2020)
Wolfgang Mulzer, Pavel Valtr
Long Alternating Paths Exist. CoRR (2020)
Wolfgang Mulzer, Pavel Valtr
Long Alternating Paths Exist. SoCG (2020)
Martin Balko, Manfred Scheucher, Pavel Valtr
Holes and Islands in Random Point Sets. SoCG (2020)
Raphael Steiner, Manfred Scheucher, Stefan Felsner, Pavel Valtr, Man-Kwun Chiu, Patrick Schnider
On the Average Complexity of the k-Level. J. Comput. Geom. 11 (1) (2020)
Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
Minimal Representations of Order Types by Geometric Graphs. J. Graph Algorithms Appl. 24 (4) (2020)
Oswin Aichholzer, Martin Balko, Thomas Hackl, Jan Kyncl, Irene Parada, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber
A superlinear lower bound on the number of 5-holes. J. Comb. Theory, Ser. A 173 (2020)
Martin Fencl, Pavel Valtr, Milan Kvicera, Vojtech Bares
Quantifying Wet Antenna Attenuation in 38-GHz Commercial Microwave Links of Cellular Backhaul. IEEE Geosci. Remote. Sens. Lett. 16 (4) (2019)
Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
Minimal Representations of Order Types by Geometric Graphs. CoRR (2019)
Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher, Patrick Schnider, Raphael Steiner, Pavel Valtr
On the Average Complexity of the k-Level. CoRR (2019)
Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner
The Crossing Tverberg Theorem. SoCG (2019)
Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr
Crossing Numbers of Beyond-Planar Graphs. CoRR (2019)
Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
Minimal Representations of Order Types by Geometric Graphs. Graph Drawing (2019)
Martin Balko, Sujoy Bhore, Leonardo Martínez-Sandoval, Pavel Valtr
On Erdős-Szekeres-Type Problems for k-convex Point Sets. IWOCA (2019)
Martin Balko, Vít Jelínek, Pavel Valtr
On ordered Ramsey numbers of bounded-degree graphs. J. Comb. Theory, Ser. B 134 (2019)
Martin Balko, Josef Cibulka, Pavel Valtr
Covering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences. Discret. Comput. Geom. 61 (2) (2019)
Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr
Crossing Numbers of Beyond-Planar Graphs. Graph Drawing (2019)
Ruy Fabila Monroy, Jakob Jonsson, Pavel Valtr, David R. Wood
The exact chromatic number of the convex segment disjointness graph. CoRR (2018)
Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff
On the Maximum Crossing Number. J. Graph Algorithms Appl. 22 (1) (2018)
Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner
The Crossing Tverberg Theorem. CoRR (2018)
Oswin Aichholzer, Martin Balko, Thomas Hackl, Alexander Pilz, Pedro Ramos, Pavel Valtr, Birgit Vogtenhuber
Holes in 2-convex point sets. Comput. Geom. 74 (2018)
Martin Balko, Josef Cibulka, Pavel Valtr
Drawing Graphs Using a Small Number of Obstacles. Discret. Comput. Geom. 59 (1) (2018)
Vít Jelínek, Michal Opler, Pavel Valtr
Generalized Coloring of Permutations. ESA (2018)
Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr
Bounded Stub Resolution for Some Maximal 1-Planar Graphs. CALDAM (2018)
Patrizio Angelini, Steven Chaplick, Felice De Luca, Jirí Fiala, Jaroslav Hancl Jr., Niklas Heinsohn, Michael Kaufmann, Stephen G. Kobourov, Jan Kratochvíl, Pavel Valtr
On Vertex- and Empty-Ply Proximity Drawings. Graph Drawing (2017)
Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff
On the Maximum Crossing Number. CoRR (2017)
Martin Balko, Josef Cibulka, Pavel Valtr
Covering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences. SoCG (2017)
Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak
On the Beer Index of Convexity and Its Variants. Discret. Comput. Geom. 57 (1) (2017)
John Gimbel, Patrice Ossona de Mendez, Pavel Valtr
Obstacle Numbers of Planar Graphs. Graph Drawing (2017)
Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr
Peeling Potatoes Near-Optimally in Near-Linear Time. SIAM J. Comput. 46 (5) (2017)
Oswin Aichholzer, Martin Balko, Thomas Hackl, Alexander Pilz, Pedro Ramos, Pavel Valtr, Birgit Vogtenhuber
Holes in 2-Convex Point Sets. IWOCA (2017)
Martin Balko, Pavel Valtr
A SAT attack on the Erdős-Szekeres conjecture. Eur. J. Comb. 66 (2017)
Patrizio Angelini, Steven Chaplick, Felice De Luca, Jirí Fiala, Jan Hancl Jr., Niklas Heinsohn, Michael Kaufmann, Stephen G. Kobourov, Jan Kratochvíl, Pavel Valtr
On Vertex- and Empty-Ply Proximity Drawings. CoRR (2017)
Oswin Aichholzer, Martin Balko, Thomas Hackl, Jan Kyncl, Irene Parada, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber
A Superlinear Lower Bound on the Number of 5-Holes. SoCG (2017)
Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff
On the Maximum Crossing Number. IWOCA (2017)
Patrizio Angelini, Michael A. Bekos, Till Bruckdorfer, Jaroslav Hancl, Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis, Pavel Valtr
Low Ply Drawings of Trees. CoRR (2016)
Martin Balko, Vít Jelínek, Pavel Valtr
On ordered Ramsey numbers of bounded-degree graphs. CoRR (2016)
Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman, Pavel Valtr
Reconstructing Point Set Order Types from Radial Orderings. Int. J. Comput. Geom. Appl. 26 (3-4) (2016)
Patrizio Angelini, Michael A. Bekos, Till Bruckdorfer, Jaroslav Hancl Jr., Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis, Pavel Valtr
Low Ply Drawings of Trees. Graph Drawing (2016)
Josef Cibulka, Pu Gao, Marek Krcál, Tomás Valla, Pavel Valtr
On the Geometric Ramsey Number of Outerplanar Graphs. Discret. Comput. Geom. 53 (1) (2015)
Vít Jelínek, Pavel Valtr
Splittings and Ramsey properties of permutation classes. Adv. Appl. Math. 63 (2015)
Martin Balko, Josef Cibulka, Pavel Valtr
Drawing Graphs Using a Small Number of Obstacles. Graph Drawing (2015)
Jens M. Schmidt, Pavel Valtr
Cubic plane graphs on a given point set. Comput. Geom. 48 (1) (2015)
Martin Balko, Pavel Valtr
A SAT attack on the Erdős-Szekeres conjecture. Electron. Notes Discret. Math. 49 (2015)
Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak
On the Beer Index of Convexity and Its Variants. SoCG (2015)
Oswin Aichholzer, Ruy Fabila Monroy, Hernán González-Aguilar, Thomas Hackl, Marco A. Heredia, Clemens Huemer, Jorge Urrutia, Pavel Valtr, Birgit Vogtenhuber
On k-gons and k-holes in point sets. Comput. Geom. 48 (7) (2015)
János Barát, Vida Dujmovic, Gwenaël Joret, Michael S. Payne, Ludmila Scharf, Daria Schymura, Pavel Valtr, David R. Wood
Empty Pentagons in Point Sets with Collinearities. SIAM J. Discret. Math. 29 (1) (2015)
Oswin Aichholzer, Thomas Hackl, Pavel Valtr, Birgit Vogtenhuber
A Note on the Number of General 4-holes in (Perturbed) Grids. JCDCGG (2015)
Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. Discret. Math. Theor. Comput. Sci. 16 (3) (2014)
Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr
Peeling potatoes near-optimally in near-linear time. CoRR (2014)
Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman, Pavel Valtr
Reconstructing Point Set Order Typesfrom Radial Orderings. ISAAC (2014)
Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak
On the Beer index of convexity and its variants. CoRR (2014)
Pavel Valtr
The Happy End Theorem and Related Results. WALCOM (2014)
Stefan Felsner, Michael Kaufmann, Pavel Valtr
Bend-optimal orthogonal graph drawing in the general position model. Comput. Geom. 47 (3) (2014)
Oswin Aichholzer, Ruy Fabila Monroy, Hernán González-Aguilar, Thomas Hackl, Marco A. Heredia, Clemens Huemer, Jorge Urrutia, Pavel Valtr, Birgit Vogtenhuber
On $k$-Gons and $k$-Holes in Point Sets. CoRR (2014)
Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr
Peeling Potatoes Near-Optimally in Near-Linear Time. SoCG (2014)
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Ferran Hurtado, Alexander Pilz, Pedro Ramos, Jorge Urrutia, Pavel Valtr, Birgit Vogtenhuber
On k-convex point sets. Comput. Geom. 47 (8) (2014)
Josef Cibulka, Jan Kyncl, Pavel Valtr
On planar point sets with the pentagon property. SoCG (2013)
Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr
Graph sharing games: Complexity and connectivity. Theor. Comput. Sci. 494 (2013)
Vít Jelínek, Pavel Valtr
Splittings and Ramsey Properties of Permutation Classes. CoRR (2013)
Josef Cibulka, Pu Gao, Marek Krcál, Tomás Valla, Pavel Valtr
On the Geometric Ramsey Number of Outerplanar Graphs. CoRR (2013)
Michael S. Payne, Attila Pór, Pavel Valtr, David R. Wood
On the Connectivity of Visibility Graphs. Discret. Comput. Geom. 48 (3) (2012)
Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr
Graph sharing games: complexity and connectivity CoRR (2012)
János Barát, Vida Dujmovic, Gwenaël Joret, Michael S. Payne, Ludmila Scharf, Daria Schymura, Pavel Valtr, David R. Wood
Empty pentagons in point sets with collinearities CoRR (2012)
Jens M. Schmidt, Pavel Valtr
Cubic plane graphs on a given point set. SCG (2012)
Pavel Valtr
On empty pentagons and hexagons in planar point sets. CATS (2012)
Stefan Felsner, Pavel Valtr
Coding and Counting Arrangements of Pseudolines. Discret. Comput. Geom. 46 (3) (2011)
Pavel Valtr
On empty pentagons and hexagons in planar point sets CoRR (2011)
Fernando Pérez-Fontán, Veikko Hovinen, Michael Schönhuber, Roberto Prieto-Cerdeira, Franz Teschl, Jukka Kyröläinen, Pavel Valtr
A wideband, directional model for the satellite-to-indoor propagation channel at S-band. Int. J. Satell. Commun. Netw. 29 (1) (2011)
Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr
Universal Sets for Straight-Line Embeddings of Bicolored Graphs CoRR (2011)
Birgit Vogtenhuber, Oswin Aichholzer, Ruy Fabila Monroy, Clemens Huemer, Jorge Urrutia, Marco A. Heredia, Hernán González-Aguilar, Thomas Hackl, Pavel Valtr
On k-Gons and k-Holes in Point Sets. CCCG (2011)
Marwan Al-Jubeh, Mashhood Ishaque, Kristóf Rédei, Diane L. Souvaine, Csaba D. Tóth, Pavel Valtr
Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three. Algorithmica 61 (4) (2011)
Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr
Graph Sharing Games: Complexity and Connectivity. TAMC (2010)
Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr
On Three Parameters of Invisibility Graphs. COCOON (2010)

Pavel Valtr.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Pavel Valtr