Attila Pór

468 total citations
36 papers, 185 citations indexed

About

Attila Pór is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Attila Pór has authored 36 papers receiving a total of 185 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Computational Theory and Mathematics, 19 papers in Computer Graphics and Computer-Aided Design and 11 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Attila Pór's work include Computational Geometry and Mesh Generation (19 papers), Advanced Graph Theory Research (18 papers) and Limits and Structures in Graph Theory (9 papers). Attila Pór is often cited by papers focused on Computational Geometry and Mesh Generation (19 papers), Advanced Graph Theory Research (18 papers) and Limits and Structures in Graph Theory (9 papers). Attila Pór collaborates with scholars based in United States, Czechia and Hungary. Attila Pór's co-authors include David R. Wood, Imre Bárány, Jean‐Sébastien Sereni, Vida Dujmović, Nicolas Lichiardopol, Peter Hamburger, Jan Kára, Daniel Král͏̌, Tobias Müller and Jan Kratochvı́l and has published in prestigious journals such as SHILAP Revista de lepidopterología, Advances in Mathematics and Games and Economic Behavior.

In The Last Decade

Attila Pór

33 papers receiving 173 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Attila Pór United States	8	118	76	59	45	37	36	185
Balázs Keszegh Hungary	8	108 0.9×	75 1.0×	69 1.2×	35 0.8×	50 1.4×	38	176
Gyula Károlyi Hungary	9	133 1.1×	74 1.0×	118 2.0×	45 1.0×	60 1.6×	33	220
Ruy Fabila‐Monroy Mexico	8	79 0.7×	89 1.2×	32 0.5×	26 0.6×	40 1.1×	39	172
Michael J. Pelsmajer United States	9	185 1.6×	74 1.0×	56 0.9×	24 0.5×	26 0.7×	33	215
Raul Cordovil Portugal	9	130 1.1×	39 0.5×	105 1.8×	62 1.4×	55 1.5×	30	222
Jan Kynčl Czechia	7	75 0.6×	70 0.9×	26 0.4×	29 0.6×	17 0.5×	44	143
Nora Hartsfield United States	7	199 1.7×	25 0.3×	33 0.6×	50 1.1×	41 1.1×	19	255
Vít Jelínek Czechia	9	104 0.9×	32 0.4×	120 2.0×	36 0.8×	25 0.7×	30	187
John Philip Huneke United States	8	156 1.3×	59 0.8×	45 0.8×	40 0.9×	85 2.3×	14	243
Radoslav Fulek Switzerland	7	57 0.5×	79 1.0×	10 0.2×	20 0.4×	10 0.3×	29	108

Countries citing papers authored by Attila Pór

Since Specialization

Citations

This map shows the geographic impact of Attila Pór'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 Attila Pór with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Attila Pór more than expected).

Fields of papers citing papers by Attila Pór

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Attila Pór. 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 Attila Pór. The network helps show where Attila Pór may publish in the future.

Co-authorship network of co-authors of Attila Pór

This figure shows the co-authorship network connecting the top 25 collaborators of Attila Pór. A scholar is included among the top collaborators of Attila Pór 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 Attila Pór. Attila Pór is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Bárány, Imre, Gil Kalai, & Attila Pór. (2022). Erdős–Szekeres Theorem for k-Flats. Discrete & Computational Geometry. 69(4). 1232–1240. 1 indexed citations

Edelman, Paul H. & Attila Pór. (2021). A new axiomatic approach to the impartial nomination problem. Games and Economic Behavior. 130. 443–451. 2 indexed citations

Pór, Attila, et al.. (2017). An Improvement on the Rado Bound for the Centerline Depth. Discrete & Computational Geometry. 59(2). 477–505.

Bárány, Imre, Jiřı́ Matoušek, & Attila Pór. (2016). Curves in $\mathbb R^d$ intersecting every hyperplane at most $d+1$ times. Journal of the European Mathematical Society. 18(11). 2469–2482. 1 indexed citations

Pór, Attila, et al.. (2016). An improvement on the trivial lower bound for the depth of a centerline. arXiv (Cornell University).

Bíró, Csaba, Peter Hamburger, Attila Pór, & William T. Trotter. (2015). Forcing Posets with Large Dimension to Contain Large Standard Examples. Graphs and Combinatorics. 32(3). 861–880. 1 indexed citations

Bárány, Imre, et al.. (2014). A fractional Helly theorem for boxes. Computational Geometry. 48(3). 221–224. 1 indexed citations

Bíró, Csaba, Peter Hamburger, & Attila Pór. (2014). Standard Examples as Subposets of Posets. Order. 32(2). 293–299. 1 indexed citations

Aichholzer, Oswin, Thomas Hackl, Michael M. Hoffmann, et al.. (2012). Maximizing maximal angles for plane straight-line graphs. Computational Geometry. 46(1). 17–28. 4 indexed citations

10.

Ernst, Claus & Attila Pór. (2011). AVERAGE CROSSING NUMBER, TOTAL CURVATURE AND ROPELENGTH OF THICK KNOTS. Journal of Knot Theory and Its Ramifications. 21(3). 1250028–1250028. 2 indexed citations

11.

Müller, Tobias, Attila Pór, & Jean‐Sébastien Sereni. (2011). Graphs with Four Boundary Vertices. The Electronic Journal of Combinatorics. 18(1). 4 indexed citations

12.

Müller, Tobias, Attila Pór, & Jean‐Sébastien Sereni. (2008). Lower bounding the boundary of a graph in terms of its maximum or minimum degree. Discrete Mathematics. 308(24). 6581–6583. 5 indexed citations

13.

Fiala, Jiřı́, Jan Kratochvı́l, & Attila Pór. (2007). On the computational complexity of partial covers of Theta graphs. Discrete Applied Mathematics. 156(7). 1143–1149. 9 indexed citations

14.

Král͏̌, Daniel, Edita Máčajová, Attila Pór, & Jean‐Sébastien Sereni. (2007). Characterization of affine Steiner triple systems and Hall triple systems. Electronic Notes in Discrete Mathematics. 29. 17–21. 3 indexed citations

15.

Pór, Attila & David R. Wood. (2007). No-Three-in-Line-in-3D. Algorithmica. 47(4). 481–488. 7 indexed citations

16.

Pór, Attila & David R. Wood. (2007). Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets. Electronic Notes in Discrete Mathematics. 28. 33–40. 2 indexed citations

17.

Pór, Attila & Pável Valtr. (2006). On the positive fraction Erdős–Szekeres theorem for convex sets. European Journal of Combinatorics. 27(7). 1199–1205.

18.

Montellano‐Ballesteros, Juan José, et al.. (2006). Tverberg-Type Theorems for Separoids. Discrete & Computational Geometry. 35(3). 513–523. 4 indexed citations

19.

Fiala, Jiřı́, Jan Kratochvı́l, & Attila Pór. (2005). On the computational complexity of partial covers of Theta graphs. Electronic Notes in Discrete Mathematics. 19. 79–85. 1 indexed citations

20.

Bárány, Imre & Attila Pór. (2001). On 0-1 Polytopes with Many Facets. Advances in Mathematics. 161(2). 209–228. 19 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