Igor Razgon
Impact in
- Computational Theory and Mathematics top 0.5%
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
- semigroups and automata theory
-
- Limits and Structures in Graph Theory
Papers in
-
- Advanced Graph Theory Research 31
- Complexity and Algorithms in Graphs 25
- semigroups and automata theory 9
- Formal Methods in Verification 5
- Graph Labeling and Dimension Problems 4
-
- Constraint Satisfaction and Optimization 10
- Co-authors
- Barry O’Sullivan (10 shared papers)Dániel Marx (6 shared papers)Yang Liu (2 shared papers)Songjian Lu (2 shared papers)Jianer Chen (2 shared papers)Fedor V. Fomin (1 shared paper)A. V. Pyatkin (1 shared paper)Serge Gaspers (1 shared paper)
- Journals
- Theoretical Computer Science (3 papers)Lecture notes in computer science (20 papers)Algorithmica (2 papers)Journal of Combinatorial Theory Series B (1 paper)SIAM Journal on Computing (1 paper)
- Partner nations
- IrelandUnited KingdomHungary
In The Last Decade
Igor Razgon
44 papers receiving 841 citations
Peers
Comparison fields: 5 of 49
- Computational Theory and Mathematics 771
- Discrete Mathematics and Combinatorics 111
- Computer Networks and Communications 313
- Computer Graphics and Computer-Aided Design 44
- Geometry and Topology 49
Countries citing papers authored by Igor Razgon
This map shows the geographic impact of Igor Razgon'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 Igor Razgon with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Igor Razgon more than expected).
Fields of papers citing papers by Igor Razgon
This network shows the impact of papers produced by Igor Razgon. 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 Igor Razgon. The network helps show where Igor Razgon may publish in the future.
Co-authors
The 25 scholars most cited alongside Igor Razgon, 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 46 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2008 | 166 | |
| 2 | 2007 | 87 | |
| 3 | 2009 | 82 | |
| 4 | 2013 | 59 | |
| 5 | 2006 | 55 | |
| 6 | 2011 | 52 | |
| 7 | 2014 | 43 | |
| 8 | 2008 | 42 | |
| 9 | 2008 | 31 | |
| 10 | 2007 | 27 | |
| 11 | 2012 | 24 | |
| 12 | 2007 | 24 | |
| 13 | 2008 | 22 | |
| 14 | 2009 | 21 | |
| 15 | 2009 | 21 | |
| 16 | 2008 | 17 | |
| 17 | A Faster Solving of the Maximum Independent Set Problem for Graphs with Maximal Degree 3. | 2006 | 14 |
| 18 | 2012 | 11 | |
| 19 | 2007 | 9 | |
| 20 | 2015 | 8 |
About Igor Razgon
Igor Razgon is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Artificial Intelligence, Signal Processing and Discrete Mathematics and Combinatorics, having authored 46 papers that have together received 885 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (31 papers), Complexity and Algorithms in Graphs (25 papers), Constraint Satisfaction and Optimization (10 papers), semigroups and automata theory (9 papers), Data Management and Algorithms (6 papers), Formal Methods in Verification (5 papers), Algorithms and Data Compression (4 papers) and Graph Labeling and Dimension Problems (4 papers). The work is most often cited by research in Computational Theory and Mathematics (771 citations), Discrete Mathematics and Combinatorics (111 citations), Computer Networks and Communications (313 citations), Computer Graphics and Computer-Aided Design (44 citations) and Geometry and Topology (49 citations). Igor Razgon has collaborated with scholars based in Ireland, United Kingdom and Hungary. Frequent co-authors include Barry O’Sullivan, Dániel Marx, Yang Liu, Songjian Lu, Jianer Chen, Fedor V. Fomin, A. V. Pyatkin, Serge Gaspers, Gregory Gutin and Vadim Lozin. Their work appears in journals such as Theoretical Computer Science, Lecture notes in computer science, Algorithmica, Journal of Combinatorial Theory Series B and SIAM Journal on Computing.
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.