Vadim Lozin
About
In The Last Decade
Vadim Lozin
118 papers receiving 1.4k citations
Peers
Comparison fields: 5 of 53
- Computational Theory and Mathematics 1.4k
- Discrete Mathematics and Combinatorics 526
- Computer Networks and Communications 336
- Geometry and Topology 259
- Electrical and Electronic Engineering 165
Countries citing papers authored by Vadim Lozin
This map shows the geographic impact of Vadim Lozin'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 Vadim Lozin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Vadim Lozin more than expected).
Fields of papers citing papers by Vadim Lozin
This network shows the impact of papers produced by Vadim Lozin. 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 Vadim Lozin. The network helps show where Vadim Lozin may publish in the future.
Co-authorship network of co-authors of Vadim Lozin
This figure shows the co-authorship network connecting the top 25 collaborators of Vadim Lozin. A scholar is included among the top collaborators of Vadim Lozin 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 Vadim Lozin. Vadim Lozin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 2 | |
| 3 | 25 | |
| 4 | 8 | |
| 5 | 0 | |
| 6 | 26 | |
| 7 | 15 | |
| 8 | Vertex 3-colorability of claw-free graphs | 9 |
| 9 | 8 | |
| 10 | Minimal Universal Bipartite Graphs. | 17 |
| 11 | 17 | |
| 12 | The tree- and clique-width of bipartite graphs in special classes. | 13 |
| 13 | 4 | |
| 14 | On computing the dissociation number and the induced matching number of bipartite graphs. | 35 |
| 15 | 34 | |
| 16 | 23 | |
| 17 | On the linear structure and clique-width of bipartite permutation graphs. | 40 |
| 18 | 7 | |
| 19 | 12 | |
| 20 | 29 |
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.