László A. Végh
Impact in
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
-
- Advanced Optimization Algorithms Research
Papers in
-
- Complexity and Algorithms in Graphs 21
- Advanced Graph Theory Research 14
-
- Optimization and Search Problems 14
- Co-authors
- Joseph Cheriyan (2 shared papers)Ola Svensson (2 shared papers)András A. Benczúr (2 shared papers)Neil Olver (2 shared papers)András Frank (1 shared paper)Jugal Garg (4 shared papers)Dániel Marx (1 shared paper)Daniel Dadush (5 shared papers)
- Journals
- Mathematics of Operations Research (5 papers)Mathematical Programming (4 papers)ACM Transactions on Algorithms (2 papers)SIAM Journal on Computing (2 papers)Theory of Computing Systems (1 paper)
- Partner nations
- United KingdomUnited StatesHungary
In The Last Decade
László A. Végh
33 papers receiving 201 citations
Peers
Comparison fields: 5 of 49
- Computational Theory and Mathematics 120
- Numerical Analysis 22
- Computer Graphics and Computer-Aided Design 12
- Management Science and Operations Research 39
- Computer Networks and Communications 69
Countries citing papers authored by László A. Végh
This map shows the geographic impact of László A. Végh'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 László A. Végh with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites László A. Végh more than expected).
Fields of papers citing papers by László A. Végh
This network shows the impact of papers produced by László A. Végh. 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 László A. Végh. The network helps show where László A. Végh may publish in the future.
Co-authors
The 25 scholars most cited alongside László A. Végh, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 39 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2016 | 20 | |
| 2 | 2012 | 18 | |
| 3 | 2020 | 17 | |
| 4 | 2016 | 12 | |
| 5 | 2013 | 12 | |
| 6 | 2011 | 11 | |
| 7 | 2016 | 10 | |
| 8 | 2014 | 10 | |
| 9 | 2022 | 9 | |
| 10 | 2015 | 8 | |
| 11 | 2017 | 7 | |
| 12 | 2010 | 7 | |
| 13 | 2008 | 7 | |
| 14 | 2008 | 6 | |
| 15 | 2020 | 6 | |
| 16 | 2014 | 6 | |
| 17 | 2023 | 5 | |
| 18 | 2013 | 5 | |
| 19 | 2012 | 5 | |
| 20 | 2023 | 4 |
About László A. Végh
László A. Végh is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Economics and Econometrics, Numerical Analysis and Management Science and Operations Research, having authored 39 papers that have together received 215 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (21 papers), Optimization and Search Problems (14 papers), Advanced Graph Theory Research (14 papers), Game Theory and Voting Systems (7 papers), Advanced Optimization Algorithms Research (7 papers), Game Theory and Applications (5 papers), Computational Geometry and Mesh Generation (5 papers) and Auction Theory and Applications (4 papers). The work is most often cited by research in Computational Theory and Mathematics (120 citations), Numerical Analysis (22 citations), Computer Graphics and Computer-Aided Design (12 citations), Management Science and Operations Research (39 citations) and Computer Networks and Communications (69 citations). László A. Végh has collaborated with scholars based in United Kingdom, United States and Hungary. Frequent co-authors include Joseph Cheriyan, Ola Svensson, András A. Benczúr, Neil Olver, András Frank, Jugal Garg, Dániel Marx, Daniel Dadush, Bernhard von Stengel and Nikhil R. Devanur. Their work appears in journals such as Mathematics of Operations Research, Mathematical Programming, ACM Transactions on Algorithms, SIAM Journal on Computing and Theory of Computing Systems.
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.