Pável Valtr

1.4k total citations
74 papers, 509 citations indexed

About

Pável Valtr is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Computer Vision and Pattern Recognition. According to data from OpenAlex, Pável Valtr has authored 74 papers receiving a total of 509 indexed citations (citations by other indexed papers that have themselves been cited), including 55 papers in Computer Graphics and Computer-Aided Design, 28 papers in Computational Theory and Mathematics and 27 papers in Computer Vision and Pattern Recognition. Recurrent topics in Pável Valtr's work include Computational Geometry and Mesh Generation (55 papers), Advanced Graph Theory Research (25 papers) and Digital Image Processing Techniques (21 papers). Pável Valtr is often cited by papers focused on Computational Geometry and Mesh Generation (55 papers), Advanced Graph Theory Research (25 papers) and Digital Image Processing Techniques (21 papers). Pável Valtr collaborates with scholars based in Czechia, Germany and United States. Pável Valtr's co-authors include Imre Bárány, Martin Klazar, Emo Welzl, Gézá Tóth, Herbert Edelsbrunner, Stefan Felsner, S. Kannan, Jiřı́ Matoušek, Volkan Isler and Kostas Daniilidis and has published in prestigious journals such as IEEE Transactions on Pattern Analysis and Machine Intelligence, Theoretical Computer Science and Discrete Applied Mathematics.

In The Last Decade

Pável Valtr

62 papers receiving 469 citations

Peers

Pável Valtr
Gézá Tóth Hungary
Shakhar Smorodinsky Israel
János Pach Hungary
Michel Pocchiola France
F. Hurtado Spain
Hannes Krasser Austria
Hubert de Fraysseix France
R. Bruce Richter Canada
Vida Dujmović Canada
M. Sharir United States
Gézá Tóth Hungary
Pável Valtr
Citations per year, relative to Pável Valtr Pável Valtr (= 1×) peers Gézá Tóth

Countries citing papers authored by Pável Valtr

Since Specialization
Citations

This map shows the geographic impact of Pável Valtr's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Pável Valtr with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Pável Valtr more than expected).

Fields of papers citing papers by Pável Valtr

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Pável Valtr. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Pável Valtr. The network helps show where Pável Valtr may publish in the future.

Co-authorship network of co-authors of Pável Valtr

This figure shows the co-authorship network connecting the top 25 collaborators of Pável Valtr. A scholar is included among the top collaborators of Pável Valtr based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Pável Valtr. Pável Valtr is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Chaplick, Steven, et al.. (2024). Bounding and Computing Obstacle Numbers of Graphs. SIAM Journal on Discrete Mathematics. 38(2). 1537–1565.
2.
Hartman, David, et al.. (2023). On the connectivity and the diameter of betweenness-uniform graphs. Discrete Applied Mathematics. 342. 27–37. 3 indexed citations
3.
Hartman, David E., et al.. (2023). On the structure and values of betweenness centrality in dense betweenness-uniform graphs. 478–484. 1 indexed citations
4.
Aichholzer, Oswin, Thomas Hackl, Jan Kynčl, et al.. (2020). A superlinear lower bound on the number of 5-holes. Journal of Combinatorial Theory Series A. 173. 105236–105236. 2 indexed citations
5.
Aichholzer, Oswin, et al.. (2018). Holes in 2-convex point sets. Computational Geometry. 74. 38–49.
6.
Valtr, Pável, et al.. (2017). A SAT attack on the Erdős–Szekeres conjecture. European Journal of Combinatorics. 66. 13–23.
7.
Aichholzer, Oswin, Ruy Fabila‐Monroy, Thomas Hackl, et al.. (2014). On k-gons and k-holes in point sets. Computational Geometry. 48(7). 528–537. 5 indexed citations
8.
Felsner, Stefan, Michael Kaufmann, & Pável Valtr. (2013). Bend-optimal orthogonal graph drawing in the general position model. Computational Geometry. 47(3). 460–468. 4 indexed citations
9.
Vogtenhuber, Birgit, Oswin Aichholzer, Clemens Huemer, et al.. (2011). On k-Gons and k-Holes in Point Sets. Canadian Conference on Computational Geometry. 21–26. 8 indexed citations
10.
Hurtado, Ferrán, et al.. (2009). On triconnected and cubic plane graphs on given point sets. Computational Geometry. 42(9). 913–922. 5 indexed citations
11.
Bárány, Imre & Pável Valtr. (2004). Planar point sets with few empty convex polygons. UCL Discovery (University College London).
12.
Isler, Volkan, S. Kannan, Kostas Daniilidis, & Pável Valtr. (2004). Vc-dimension of exterior visibility. IEEE Transactions on Pattern Analysis and Machine Intelligence. 26(5). 667–671. 24 indexed citations
13.
Valtr, Pável. (1999). On an Extremal Problem for Colored Trees. European Journal of Combinatorics. 20(1). 115–121. 2 indexed citations
14.
Everett, Hazel, Ivan Stojmenović, Pável Valtr, & Sue Whitesides. (1998). The largest k-ball in a d-dimensional box. Computational Geometry. 11(2). 59–67. 4 indexed citations
15.
Nešetřil, Jaroslav & Pável Valtr. (1998). A Ramsey Property of Order Types. Journal of Combinatorial Theory Series A. 81(1). 88–107. 4 indexed citations
16.
Erdős, Paul, Źsolt Tuza, & Pável Valtr. (1996). Ramsey-remainder. European Journal of Combinatorics. 17(6). 519–532. 6 indexed citations
17.
Nešetřil, Jaroslav & Pável Valtr. (1994). A Ramsey-Type Theorem in the Plane. Combinatorics Probability Computing. 3(1). 127–135. 4 indexed citations
18.
Edelsbrunner, Herbert, Pável Valtr, & Emo Welzl. (1994). Cutting dense point sets in half. Refubium (Universitätsbibliothek der Freien Universität Berlin). 203–209. 5 indexed citations
19.
Valtr, Pável. (1992). Sets in Rd with no large empty convex subsets. Discrete Mathematics. 108(1-3). 115–124. 13 indexed citations
20.
Klazar, Martin, et al.. (1992). Generalized Davenport-Schinzel sequences with linear upper bound. Discrete Mathematics. 108(1-3). 219–229. 20 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Gézá Tóth Breakdown of academic impact, for papers by Shakhar Smorodinsky Breakdown of academic impact, for papers by János Pach Breakdown of academic impact, for papers by Michel Pocchiola Breakdown of academic impact, for papers by F. Hurtado Breakdown of academic impact, for papers by Hannes Krasser Breakdown of academic impact, for papers by Hubert de Fraysseix Breakdown of academic impact, for papers by R. Bruce Richter Breakdown of academic impact, for papers by Vida Dujmović Breakdown of academic impact, for papers by M. Sharir
Rankless by CCL
2026