Łászló A. Székely
About
In The Last Decade
Łászló A. Székely
73 papers receiving 996 citations
Peers
Comparison fields: 5 of 77
- Computational Theory and Mathematics 586
- Geometry and Topology 443
- Computer Graphics and Computer-Aided Design 241
- Discrete Mathematics and Combinatorics 234
- Molecular Biology 192
Countries citing papers authored by Łászló A. Székely
This map shows the geographic impact of Łászló A. Székely'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 Łászló A. Székely with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Łászló A. Székely more than expected).
Fields of papers citing papers by Łászló A. Székely
This network shows the impact of papers produced by Łászló A. Székely. 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 Łászló A. Székely. The network helps show where Łászló A. Székely may publish in the future.
Co-authorship network of co-authors of Łászló A. Székely
This figure shows the co-authorship network connecting the top 25 collaborators of Łászló A. Székely. A scholar is included among the top collaborators of Łászló A. Székely 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 Łászló A. Székely. Łászló A. Székely is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 16 | |
| 3 | 18 | |
| 4 | A note on full transversals and mixed orthogonal arrays | 1 |
| 5 | 1 | |
| 6 | 7 | |
| 7 | 37 | |
| 8 | Counting rooted spanning forests in complete multipartite graphs. | 5 |
| 9 | 78 | |
| 10 | 51 | |
| 11 | 2 | |
| 12 | 5 | |
| 13 | 8 | |
| 14 | Local quartet splits of a binary tree inferall quartet splits via one dyadic inference rule | 12 |
| 15 | 20 | |
| 16 | ON THE WIENER INDEX OF TREES FROM CERTAIN FAMILIES | 26 |
| 17 | 47 | |
| 18 | 42 | |
| 19 | Effective Lower Bounds for Crossing Number, Bisection Width and Balanced Vertex Separator in Terms of Symmetry. | 7 |
| 20 | Extremal problems for local properties of graphs. | 9 |
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.