2026 Vadim V. Lozin: Mathematics Researcher – H-Index, Publications & Awards

D-Index & Metrics

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	35	11841	11504	750	738	188	3898
Mathematics	35	2823	2524	184	165	189	3897

Discipline name

D-Index

World Ranking

Current World Ranking

National Ranking

Current National Ranking

Publications

Citations

Computer Science

11841

11504

750

738

188

3898

Mathematics

2823

2524

184

165

189

3897

Computer Science

D-Index

Citations

3898

World Ranking

11841

National Ranking

750

Mathematics

D-Index

Citations

3897

World Ranking

2823

National Ranking

184

Overview

Vadim V. Lozin is affiliated with the University of Warwick in the United Kingdom. Their research spans areas within computer science and mathematics, with a particular focus on computational theory, discrete mathematics, and graph theory.

The main fields of study in which Vadim V. Lozin is active include:

Computer Science
Mathematics

Their research within subfields concentrates on:

Computational Theory and Mathematics
Discrete Mathematics and Combinatorics
Geometry and Topology
Artificial Intelligence
Electrical and Electronic Engineering

Vadim V. Lozin's work covers a range of topics, notably related to graph theory, including:

Advanced Graph Theory Research
Graph Labeling and Dimension Problems
Limits and Structures in Graph Theory
Graph theory and applications
Graph theory and CDMA systems
Semigroups and automata theory
Coding theory and cryptography

Frequent publication venues where Vadim V. Lozin's research appears include:

arXiv (Cornell University)
Discrete Applied Mathematics
SIAM Journal on Discrete Mathematics
Discrete Mathematics
Algorithmica

Several recent papers illustrate their research interests and contributions:

Letter graphs and geometric grid classes of permutations: Characterization and recognition (2020), Discrete Applied Mathematics
Clique-Width for Graph Classes Closed under Complementation (2020), SIAM Journal on Discrete Mathematics
Graph functionality (2020), Journal of Combinatorial Theory Series B
Letter Graphs and Geometric Grid Classes of Permutations (2022), SIAM Journal on Discrete Mathematics
Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs (2021), Discrete Applied Mathematics

Collaboration is an important aspect of their research, with frequent coauthors including:

Bogdan Alecu
Viktor Zamaraev
Aistis Atminas
D. S. Malyshev
D. de Werra

Best Publications

Deciding k -Colorability of P 5 -Free Graphs in Polynomial Time

Chính T. Hoàng;Marcin Kamiński;Vadim Lozin;Joe Sawada

184
Citations
Recent developments on graphs of bounded clique-width

Marcin Kamiński;Vadim V. Lozin;Martin Milanič

145
Citations
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph

Vadim V. Lozin;Martin Milanič

142
Citations
On maximum induced matchings in bipartite graphs

Vadim V. Lozin

122
Citations
NP-hard graph problems and boundary classes of graphs

V. E. Alekseev;R. Boliac;D. V. Korobitsyn;V. V. Lozin

121
Citations
Coloring edges and vertices of graphs without short or long cycles

Vadim V. Lozin;Marcin Kaminski

112
Citations
On the linear structure and clique-width of bipartite permutation graphs.

Andreas Brandstädt;Vadim V. Lozin

93
Citations
On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree

V. Lozin;D. Rautenbach

91
Citations
Some results on graphs without long induced paths

Vadim Lozin;Dieter Rautenbach

86
Citations
Words and Graphs

Sergey Kitaev;Vadim Lozin

82
Citations
Clique-Width for 4-Vertex Forbidden Subgraphs

Andreas Brandstadt;Joost Engelfriet;Hoang-Oanh Le;Vadim V. Lozin

80
Citations
On the Clique-Width of Graphs in Hereditary Classes

Rodica Boliac;Vadim V. Lozin

77
Citations
On computing the dissociation number and the induced matching number of bipartite graphs.

Rodica Boliac;Kathie Cameron;Vadim V. Lozin

69
Citations
Independent Sets of Maximum Weight in Apple-Free Graphs

Andreas Brandstädt;Vadim V. Lozin;Raffaele Mosca

67
Citations
Independent sets in extensions of 2K 2 -free graphs

Vadim V. Lozin;Raffaele Mosca

67
Citations
Vertex coloring of graphs with few obstructions

Vadim V. Lozin;Dmitriy S. Malyshev

66
Citations
Minimal Classes of Graphs of Unbounded Clique-Width ∗

Vadim V. Lozin

66
Citations
THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES

Vadim V. Lozin;Jordan Volz

61
Citations
Bipartite graphs without a skew star

Vadim V. Lozin

60
Citations
Maximum k-regular induced subgraphs

Domingos Moreira Cardoso;Marcin Kaminski;Vadim V. Lozin

59
Citations
Deciding k-colourability of P_5-free graphs in polynomial time

Chính T. Hoàng;Marcin Kaminski;Vadim V. Lozin;Joe Sawada

2
Citations

Frequent Co-Authors

Andreas Brandstädt University of Rostock

D. de Werra École Polytechnique Fédérale de Lausanne

Alain Hertz Polytechnique Montréal

Daniël Paulusma Durham University

Andrzej Skowron University of Warsaw

Joost Engelfriet Leiden University

Peter L. Hammer Rutgers, The State University of New Jersey

Arie M. C. A. Koster RWTH Aachen University

External Links

Personal website of Vadim V. Lozin Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

For students studying Mathematics in the USA, expanding into related online degrees can open diverse career opportunities. Many aspiring professionals consider pursuing an MBA to complement their analytical skills. When exploring options, it’s helpful to know about can you transfer mba programs, which allows flexibility in managing your education by transferring credits from previous studies.

Data-driven roles are increasingly important, making a master in data analytics a popular choice for those looking to leverage their math background in practical, technology-focused environments.

For those seeking affordability and faster access to degree completion, understanding mba programs easy to get into can be crucial. Such programs often have more flexible admissions criteria while maintaining quality education standards.

Additionally, online learning options have expanded, with many students opting for easy online mba programs that provide convenience without compromising on career advancement opportunities.