Vladimir Gurvich
-
- Limits and Structures in Graph Theory 7
-
- Advanced Graph Theory Research 27
- Complexity and Algorithms in Graphs 12
- Geometry and Topology top 5%
- Graph theory and applications 5
-
- Computational Geometry and Mesh Generation 6
-
- Game Theory and Applications 9
-
- Artificial Intelligence in Games 9
-
- Game Theory and Voting Systems 9
- Co-authors
- Endre BorosLeonid KhachiyanKhaled ElbassioniKazuhisa MakinoА. Д. ГвишианиM. VyalyiGábor RudolfLeonid Libkin
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsGeometry and Topology
- Journals
- European Journal of Operational Research (1 paper)Annals of Operations Research (2 papers)Theoretical Computer Science (1 paper)
- Partner nations
- United StatesRussiaGermany
In The Last Decade
Vladimir Gurvich
52 papers receiving 410 citations
Peers
Comparison fields: 5 of 57
- Discrete Mathematics and Combinatorics 80
- Computational Theory and Mathematics 255
- Geometry and Topology 98
- Computer Graphics and Computer-Aided Design 18
- Management Science and Operations Research 62
Countries citing papers authored by Vladimir Gurvich
This map shows the geographic impact of Vladimir Gurvich'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 Vladimir Gurvich with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Vladimir Gurvich more than expected).
Fields of papers citing papers by Vladimir Gurvich
This network shows the impact of papers produced by Vladimir Gurvich. 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 Vladimir Gurvich. The network helps show where Vladimir Gurvich may publish in the future.
Co-authorship network
The 18 scholars most cited alongside Vladimir Gurvich, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2025 | 0 | |
| 2 | 2024 | 1 | |
| 3 | 2023 | 1 | |
| 4 | 2023 | 2 | |
| 5 | 2018 | 2 | |
| 6 | 2017 | 4 | |
| 7 | 2012 | 23 | |
| 8 | 2012 | 6 | |
| 9 | 2010 | 15 | |
| 10 | On split and almost CIS-graphs. | 2009 | 8 |
| 11 | 2008 | 0 | |
| 12 | 2007 | 3 | |
| 13 | MATHEMATICAL ENGINEERING TECHNICAL REPORTS Generating vertices of polyhedra and related problems of monotone generation | 2007 | 1 |
| 14 | 2006 | 12 | |
| 15 | 2006 | 6 | |
| 16 | 2006 | 53 | |
| 17 | A stronger version of Bárány's theorem in the plane. | 2004 | 0 |
| 18 | 2004 | 22 | |
| 19 | 1998 | 4 | |
| 20 | On Minimally Imperfect Graphs with Circular Symmetry | 1997 | 11 |
About Vladimir Gurvich
Vladimir Gurvich is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Computer Graphics and Computer-Aided Design, having authored 61 papers that have together received 453 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (27 papers), Complexity and Algorithms in Graphs (12 papers), Game Theory and Applications (9 papers), Artificial Intelligence in Games (9 papers), Game Theory and Voting Systems (9 papers), Limits and Structures in Graph Theory (7 papers), Computational Geometry and Mesh Generation (6 papers) and Graph theory and applications (5 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (80 citations), Computational Theory and Mathematics (255 citations) and Geometry and Topology (98 citations). Vladimir Gurvich has collaborated with scholars based in United States, Russia and Germany. Frequent co-authors include Endre Boros, Leonid Khachiyan, Khaled Elbassioni, Kazuhisa Makino, А. Д. Гвишиани, M. Vyalyi, Gábor Rudolf, Leonid Libkin, Myriam Preissmann and Gábor Bacsó. Their work appears in journals such as European Journal of Operational Research, Annals of Operations Research and Theoretical Computer Science.
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.