Vadim Lozin

3.3k total citations
121 papers, 1.5k citations indexed

About

Vadim Lozin is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Vadim Lozin has authored 121 papers receiving a total of 1.5k indexed citations (citations by other indexed papers that have themselves been cited), including 115 papers in Computational Theory and Mathematics, 39 papers in Discrete Mathematics and Combinatorics and 29 papers in Geometry and Topology. Recurrent topics in Vadim Lozin's work include Advanced Graph Theory Research (108 papers), Complexity and Algorithms in Graphs (50 papers) and Graph Labeling and Dimension Problems (44 papers). Vadim Lozin is often cited by papers focused on Advanced Graph Theory Research (108 papers), Complexity and Algorithms in Graphs (50 papers) and Graph Labeling and Dimension Problems (44 papers). Vadim Lozin collaborates with scholars based in United Kingdom, United States and Russia. Vadim Lozin's co-authors include Marcin Kamiński, Martin Milanič, Dieter Rautenbach, Andreas Brandstädt, Raffaele Mosca, V. E. Alekseev, Konrad K. Dabrowski, Domingos M. Cardoso, D. S. Malyshev and Sergey Kitaev and has published in prestigious journals such as European Journal of Operational Research, SIAM Journal on Computing and Annals of Operations Research.

In The Last Decade

Vadim Lozin

118 papers receiving 1.4k citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Vadim Lozin United Kingdom	23	1.4k	526	336	259	165	121	1.5k
Frédéric Maffray France	16	1.0k 0.7×	480 0.9×	162 0.5×	186 0.7×	148 0.9×	111	1.1k
Maria Chudnovsky United States	21	1.7k 1.2×	937 1.8×	225 0.7×	494 1.9×	277 1.7×	135	1.9k
Petr A. Golovach Norway	17	922 0.7×	277 0.5×	296 0.9×	88 0.3×	110 0.7×	149	1.0k
Udi Rotics Israel	13	1.0k 0.7×	241 0.5×	292 0.9×	200 0.8×	72 0.4×	26	1.1k
Martin Farber Canada	15	1.0k 0.7×	237 0.5×	239 0.7×	222 0.9×	180 1.1×	17	1.1k
Renu Laskar United States	15	773 0.6×	201 0.4×	234 0.7×	191 0.7×	161 1.0×	52	932
Zs. Tuza Hungary	19	868 0.6×	575 1.1×	149 0.4×	264 1.0×	169 1.0×	65	1.1k
Jan Arne Telle Norway	16	720 0.5×	131 0.2×	343 1.0×	82 0.3×	71 0.4×	69	864
Bjarne Toft Denmark	12	610 0.4×	319 0.6×	117 0.3×	129 0.5×	187 1.1×	33	762
Tommy R. Jensen Germany	7	481 0.3×	223 0.4×	143 0.4×	71 0.3×	148 0.9×	20	627

Countries citing papers authored by Vadim Lozin

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

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

Dabrowski, Konrad K., et al.. (2015). Combinatorics and Algorithms for Augmenting Graphs. Graphs and Combinatorics. 32(4). 1339–1352. 2 indexed citations

Kitaev, Sergey & Vadim Lozin. (2015). Words and Graphs. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 25 indexed citations

Lozin, Vadim, et al.. (2013). Dominating induced matchings in graphs without a skew star. Journal of Discrete Algorithms. 26. 45–55. 8 indexed citations

Dabrowski, Konrad K., et al.. (2013). Stable-Π partitions of graphs. Discrete Applied Mathematics. 182. 104–114.

Dabrowski, Konrad K., Vadim Lozin, Rajiv Raman, & Bernard Ries. (2012). Colouring vertices of triangle-free graphs without forests. Discrete Mathematics. 312(7). 1372–1385. 26 indexed citations

Lozin, Vadim, et al.. (2011). Two forbidden induced subgraphs and well-quasi-ordering. Discrete Mathematics. 311(16). 1813–1822. 15 indexed citations

Kamiński, Marcin & Vadim Lozin. (2007). Vertex 3-colorability of claw-free graphs. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 2(1). 15–21. 9 indexed citations

Lozin, Vadim & Martin Milanič. (2007). Maximum independent sets in graphs of low degree. Symposium on Discrete Algorithms. 874–880. 8 indexed citations

10.

Lozin, Vadim & Gábor Rudolf. (2007). Minimal Universal Bipartite Graphs.. Ars Combinatoria. 84. 17 indexed citations

11.

Lozin, Vadim & Dieter Rautenbach. (2007). The relative clique-width of a graph. Journal of Combinatorial Theory Series B. 97(5). 846–858. 17 indexed citations

12.

Lozin, Vadim & Dieter Rautenbach. (2006). The tree- and clique-width of bipartite graphs in special classes.. Australas. J Comb.. 34. 57–68. 13 indexed citations

13.

Lozin, Vadim & Martin Milanič. (2006). A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. Symposium on Discrete Algorithms. 26–30. 4 indexed citations

14.

Cameron, Kathie, et al.. (2004). On computing the dissociation number and the induced matching number of bipartite graphs.. Ars Combinatoria. 72. 35 indexed citations

15.

Lozin, Vadim & Raffaele Mosca. (2004). Independent sets in extensions of 2K2-free graphs. Discrete Applied Mathematics. 146(1). 74–80. 34 indexed citations

16.

Alekseev, V. E., et al.. (2004). Boundary classes of graphs for the dominating set problem. Discrete Mathematics. 285(1-3). 1–6. 23 indexed citations

17.

Brandstädt, Andreas & Vadim Lozin. (2003). On the linear structure and clique-width of bipartite permutation graphs.. Ars Combinatoria. 67. 40 indexed citations

18.

Lozin, Vadim & D. de Werra. (2003). Special issue on stability in graphs and related topics. Discrete Applied Mathematics. 132(1-3). 1–2. 7 indexed citations

19.

Alexe, Gabriela, Peter L. Hammer, Vadim Lozin, & D. de Werra. (2003). Struction revisited. Discrete Applied Mathematics. 132(1-3). 27–46. 12 indexed citations

20.

Lozin, Vadim, et al.. (2002). On the stable set problem in special P5-free graphs. Discrete Applied Mathematics. 125(2-3). 215–224. 29 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