Leonid Zosin

415 total citations
8 papers, 208 citations indexed

About

Leonid Zosin is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Computer Graphics and Computer-Aided Design. According to data from OpenAlex, Leonid Zosin has authored 8 papers receiving a total of 208 indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Computational Theory and Mathematics, 5 papers in Computer Networks and Communications and 2 papers in Computer Graphics and Computer-Aided Design. Recurrent topics in Leonid Zosin's work include Complexity and Algorithms in Graphs (7 papers), Optimization and Search Problems (4 papers) and Advanced Graph Theory Research (4 papers). Leonid Zosin is often cited by papers focused on Complexity and Algorithms in Graphs (7 papers), Optimization and Search Problems (4 papers) and Advanced Graph Theory Research (4 papers). Leonid Zosin collaborates with scholars based in Israel, Germany and United States. Leonid Zosin's co-authors include Joseph Naor, Chandra Chekuri, Sanjeev Khanna, Guy Even, Michael J. Saks, Alex Samorodnitsky and Baruch Schieber and has published in prestigious journals such as SIAM Journal on Computing, COMBINATORICA and SIAM Journal on Discrete Mathematics.

In The Last Decade

Leonid Zosin

8 papers receiving 185 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Leonid Zosin Israel	7	120	79	61	47	27	8	208
Virginia Vassilevska United States	8	120 1.0×	78 1.0×	46 0.8×	20 0.4×	19 0.7×	13	186
Yang P. Liu United States	7	101 0.8×	58 0.7×	49 0.8×	13 0.3×	11 0.4×	20	152
Amir Nayyeri United States	10	106 0.9×	92 1.2×	33 0.5×	35 0.7×	35 1.3×	35	231
Yann Vaxès France	9	171 1.4×	71 0.9×	17 0.3×	14 0.3×	33 1.2×	36	271
Jonathan F. Buss Canada	8	215 1.8×	98 1.2×	96 1.6×	15 0.3×	33 1.2×	20	314
Peter van Emde Boas Netherlands	9	128 1.1×	78 1.0×	120 2.0×	24 0.5×	9 0.3×	25	229
S. Mitchell United States	8	181 1.5×	128 1.6×	21 0.3×	33 0.7×	47 1.7×	9	282
Arnab Bhattacharyya United States	9	160 1.3×	56 0.7×	130 2.1×	9 0.2×	15 0.6×	34	220
Jan Kára Czechia	8	154 1.3×	132 1.7×	62 1.0×	10 0.2×	6 0.2×	16	222
Gregory E. Shannon United States	7	185 1.5×	150 1.9×	76 1.2×	23 0.5×	20 0.7×	16	261

Countries citing papers authored by Leonid Zosin

Since Specialization

Citations

This map shows the geographic impact of Leonid Zosin'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 Leonid Zosin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Leonid Zosin more than expected).

Fields of papers citing papers by Leonid Zosin

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Leonid Zosin. 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 Leonid Zosin. The network helps show where Leonid Zosin may publish in the future.

Co-authorship network of co-authors of Leonid Zosin

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

8 of 8 papers shown

1.

Chekuri, Chandra, Sanjeev Khanna, Joseph Naor, & Leonid Zosin. (2004). A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem. SIAM Journal on Discrete Mathematics. 18(3). 608–625. 55 indexed citations

2.

Saks, Michael J., Alex Samorodnitsky, & Leonid Zosin. (2004). A Lower Bound On The Integrality Gap For Minimum Multicut In Directed Networks. COMBINATORICA. 24(3). 525–530. 20 indexed citations

3.

Naor, Joseph & Leonid Zosin. (2002). A 2-approximation algorithm for the directed multiway cut problem. 548–553. 12 indexed citations

4.

Even, Guy, Joseph Naor, & Leonid Zosin. (2002). An 8-approximation algorithm for the subset feedback vertex set problem. 310–319. 11 indexed citations

5.

Chekuri, Chandra, Sanjeev Khanna, Joseph Naor, & Leonid Zosin. (2001). Approximation algorithms for the metric labeling problem via a new linear programming formulation. Symposium on Discrete Algorithms. 109–118. 68 indexed citations

6.

Naor, Joseph & Leonid Zosin. (2001). A 2-Approximation Algorithm for the Directed Multiway Cut Problem. SIAM Journal on Computing. 31(2). 477–482. 14 indexed citations

7.

Even, Guy, Joseph Naor, & Leonid Zosin. (2000). An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem. SIAM Journal on Computing. 30(4). 1231–1252. 25 indexed citations

8.

Even, Guy, Joseph Naor, Baruch Schieber, & Leonid Zosin. (2000). Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications. SIAM Journal on Discrete Mathematics. 13(2). 255–267. 3 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