Igor Razgon

1.5k total citations
24 papers, 424 citations indexed

About

Igor Razgon is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Igor Razgon has authored 24 papers receiving a total of 424 indexed citations (citations by other indexed papers that have themselves been cited), including 20 papers in Computational Theory and Mathematics, 7 papers in Computer Networks and Communications and 6 papers in Artificial Intelligence. Recurrent topics in Igor Razgon's work include Advanced Graph Theory Research (18 papers), Complexity and Algorithms in Graphs (16 papers) and semigroups and automata theory (5 papers). Igor Razgon is often cited by papers focused on Advanced Graph Theory Research (18 papers), Complexity and Algorithms in Graphs (16 papers) and semigroups and automata theory (5 papers). Igor Razgon collaborates with scholars based in Ireland, United Kingdom and Hungary. Igor Razgon's co-authors include Barry O’Sullivan, Dániel Marx, Yang Liu, Jianer Chen, Songjian Lu, Serge Gaspers, Fedor V. Fomin, A. V. Pyatkin, Gregory Gutin and Eun Jung Kim and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Igor Razgon

20 papers receiving 394 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Igor Razgon Ireland	11	370	141	51	48	48	24	424
Yngve Villanger Norway	17	604 1.6×	233 1.7×	97 1.9×	81 1.7×	61 1.3×	46	675
Ioan Todinca France	11	325 0.9×	153 1.1×	43 0.8×	36 0.8×	25 0.5×	39	371
Leizhen Cai Hong Kong	12	474 1.3×	170 1.2×	49 1.0×	98 2.0×	33 0.7×	30	535
Naomi Nishimura Canada	12	300 0.8×	180 1.3×	79 1.5×	31 0.6×	18 0.4×	34	385
Jochen Alber Germany	11	373 1.0×	193 1.4×	74 1.5×	22 0.5×	30 0.6×	17	455
Arash Rafiey Canada	10	176 0.5×	78 0.6×	53 1.0×	59 1.2×	44 0.9×	35	303
Jesper Nederlof Netherlands	9	337 0.9×	132 0.9×	71 1.4×	45 0.9×	9 0.2×	35	373
Luděk Kučera Czechia	8	177 0.5×	75 0.5×	102 2.0×	37 0.8×	20 0.4×	35	303
Ignasi Sau France	9	222 0.6×	87 0.6×	31 0.6×	65 1.4×	7 0.1×	77	294
Gwenaël Joret Belgium	10	182 0.5×	47 0.3×	37 0.7×	66 1.4×	15 0.3×	55	242

Countries citing papers authored by Igor Razgon

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Igor Razgon

This figure shows the co-authorship network connecting the top 25 collaborators of Igor Razgon. A scholar is included among the top collaborators of Igor Razgon 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 Igor Razgon. Igor Razgon 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

Lozin, Vadim, et al.. (2024). The Treewidth and Pathwidth of Graph Unions. SIAM Journal on Discrete Mathematics. 38(1). 261–276. 1 indexed citations

Gottlob, Georg, et al.. (2023). Fractional covers of hypergraphs with bounded multi-intersection. Theoretical Computer Science. 979. 114204–114204. 1 indexed citations

Lozin, Vadim, et al.. (2018). Linear read-once and related Boolean functions. Discrete Applied Mathematics. 250. 16–27. 1 indexed citations

Lozin, Vadim, et al.. (2017). Well-quasi-ordering versus clique-width. Journal of Combinatorial Theory Series B. 130. 1–18. 4 indexed citations

Califano, Andrea, et al.. (2017). Querying the deep web: Back to the foundations. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 1912. 1–4.

Razgon, Igor. (2015). On the Read-Once Property of Branching Programs and CNFs of Bounded Treewidth. Algorithmica. 75(2). 277–294. 5 indexed citations

Marx, Dániel & Igor Razgon. (2014). Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset. SIAM Journal on Computing. 43(2). 355–388. 28 indexed citations

Razgon, Igor & Ronen I. Brafman. (2014). A Forward Search Planning Algorith with a Goal Ordering Heuristic.

O’Sullivan, Barry, et al.. (2013). Finding small separators in linear time via treewidth reduction. ACM Transactions on Algorithms. 9(4). 1–35. 41 indexed citations

10.

Lozin, Vadim, et al.. (2012). Boundary Properties of Well-Quasi-Ordered Sets of Graphs. Order. 30(3). 723–735. 8 indexed citations

11.

Marx, Dániel & Igor Razgon. (2011). Fixed-parameter tractability of multicut parameterized by the size of the cutset. Leicester Research Archive (University of Leicester). 469–478. 27 indexed citations

12.

Hébrard, Emmanuel, Dániel Marx, Barry O’Sullivan, & Igor Razgon. (2011). Soft Constraints of Difference and Equality. Journal of Artificial Intelligence Research. 41. 97–130. 3 indexed citations

13.

Gutin, Gregory, Igor Razgon, & Eun Jung Kim. (2009). Minimum leaf out-branching and related problems. Theoretical Computer Science. 410(45). 4571–4579. 12 indexed citations

14.

Razgon, Igor & Barry O’Sullivan. (2009). Almost 2-SAT is fixed-parameter tractable. Journal of Computer and System Sciences. 75(8). 435–450. 56 indexed citations

15.

Marx, Dániel & Igor Razgon. (2009). Constant ratio fixed-parameter approximation of the edge multicut problem. Information Processing Letters. 109(20). 1161–1166. 15 indexed citations

16.

Razgon, Igor. (2008). Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3. Journal of Discrete Algorithms. 7(2). 191–212. 16 indexed citations

17.

Chen, Jianer, Yang Liu, Songjian Lu, Barry O’Sullivan, & Igor Razgon. (2008). A fixed-parameter algorithm for the directed feedback vertex set problem. Journal of the ACM. 55(5). 1–19. 105 indexed citations

18.

Chen, Jianer, Yang Liu, Songjian Lu, Barry O’Sullivan, & Igor Razgon. (2008). A fixed-parameter algorithm for the directed feedback vertex set problem. 177–186. 23 indexed citations

19.

Fomin, Fedor V., Serge Gaspers, A. V. Pyatkin, & Igor Razgon. (2007). On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms. Algorithmica. 52(2). 293–307. 56 indexed citations

20.

Razgon, Igor. (2007). A algorithm for the parameterized Convex Recoloring problem. Information Processing Letters. 104(2). 53–58. 4 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