H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 30 Citations 3,132 145 World Ranking 8900 National Ranking 514
Mathematics H-index 30 Citations 3,153 145 World Ranking 2227 National Ranking 145

Overview

What is he best known for?

The fields of study he is best known for:

  • Graph theory
  • Combinatorics
  • Discrete mathematics

Combinatorics, Discrete mathematics, Chordal graph, Indifference graph and Maximal independent set are his primary areas of study. His Combinatorics study focuses mostly on Forbidden graph characterization, Treewidth, Vertex, Induced subgraph and Line graph. All of his Discrete mathematics and Cograph, Bipartite graph, Independent set, Split graph and Partial k-tree investigations are sub-components of the entire Discrete mathematics study.

The study incorporates disciplines such as Pathwidth and Vertex cover in addition to Chordal graph. His Modular decomposition research extends to the thematically linked field of Indifference graph. His Maximal independent set study typically links adjacent topics like Strong perfect graph theorem.

His most cited work include:

  • Deciding k -Colorability of P 5 -Free Graphs in Polynomial Time (121 citations)
  • Recent developments on graphs of bounded clique-width (100 citations)
  • A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (86 citations)

What are the main themes of his work throughout his whole career to date?

His primary areas of study are Combinatorics, Discrete mathematics, Chordal graph, Indifference graph and Independent set. Maximal independent set, Graph, Bipartite graph, Pathwidth and Induced subgraph are the primary areas of interest in his Combinatorics study. His study in Maximal independent set is interdisciplinary in nature, drawing from both Longest path problem, Vertex cover and Metric dimension.

Cograph, Split graph, 1-planar graph, Forbidden graph characterization and Clique-width are subfields of Discrete mathematics in which his conducts study. As a member of one scientific family, Vadim V. Lozin mostly works in the field of Chordal graph, focusing on Treewidth and, on occasion, Partial k-tree. The various areas that Vadim V. Lozin examines in his Indifference graph study include Modular decomposition, Clique-sum and Trapezoid graph.

He most often published in these fields:

  • Combinatorics (92.82%)
  • Discrete mathematics (66.99%)
  • Chordal graph (33.49%)

What were the highlights of his more recent work (between 2015-2021)?

  • Combinatorics (92.82%)
  • Discrete mathematics (66.99%)
  • Graph (17.70%)

In recent papers he was focusing on the following fields of study:

Combinatorics, Discrete mathematics, Graph, Conjecture and Clique-width are his primary areas of study. His Combinatorics study is mostly concerned with Induced subgraph, Independent set, Well-quasi-ordering, Time complexity and Bipartite graph. Many of his studies on Discrete mathematics apply to Graph as well.

His work in Graph addresses subjects such as Ramsey theory, which are connected to disciplines such as Neighbourhood, Vertex cover, Exponential function and Entropy. His Maximal independent set research includes themes of Matching, Dense graph and Metric dimension. His research brings together the fields of Indifference graph and Cograph.

Between 2015 and 2021, his most popular works were:

  • Words and Graphs (44 citations)
  • Vertex coloring of graphs with few obstructions (41 citations)
  • New results on word-representable graphs (16 citations)

In his most recent research, the most cited papers focused on:

  • Graph theory
  • Combinatorics
  • Discrete mathematics

The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Clique-width, Induced subgraph and Graph. His Combinatorics study focuses mostly on Time complexity, Dominating set, Conjecture, Bell number and Coloring problem. The Cograph, Independent set and Maximal independent set research he does as part of his general Discrete mathematics study is frequently linked to other disciplines of science, such as Atlas and Zoom, therefore creating a link between diverse domains of science.

In the field of Chordal graph and Pathwidth Vadim V. Lozin studies Cograph. His research on Maximal independent set often connects related topics like Indifference graph. His Clique-width study which covers Well-quasi-ordering that intersects with Triangle-free graph and Distance-hereditary graph.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Top Publications

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

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

150 Citations

Recent developments on graphs of bounded clique-width

Marcin Kamiński;Vadim V. Lozin;Martin Milanič.
Discrete Applied Mathematics (2009)

129 Citations

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

Vadim V. Lozin;Martin Milanič.
Journal of Discrete Algorithms (2008)

121 Citations

On maximum induced matchings in bipartite graphs

Vadim V. Lozin.
Information Processing Letters (2002)

103 Citations

Coloring edges and vertices of graphs without short or long cycles

Vadim V. Lozin;Marcin Kaminski.
Contributions to Discrete Mathematics (2007)

97 Citations

NP-hard graph problems and boundary classes of graphs

V. E. Alekseev;R. Boliac;D. V. Korobitsyn;V. V. Lozin.
Theoretical Computer Science (2007)

90 Citations

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

V. Lozin;D. Rautenbach.
SIAM Journal on Discrete Mathematics (2005)

88 Citations

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

Andreas Brandstädt;Vadim V. Lozin.
Ars Combinatoria (2003)

88 Citations

Some results on graphs without long induced paths

Vadim Lozin;Dieter Rautenbach.
Information Processing Letters (2003)

74 Citations

Clique-Width for 4-Vertex Forbidden Subgraphs

Andreas Brandstadt;Joost Engelfriet;Hoang-Oanh Le;Vadim V. Lozin.
Theory of Computing Systems / Mathematical Systems Theory (2006)

71 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us

Top Scientists Citing Vadim V. Lozin

Andreas Brandstädt

Andreas Brandstädt

University of Rostock

Publications: 51

Pavol Hell

Pavol Hell

Simon Fraser University

Publications: 19

Maria Chudnovsky

Maria Chudnovsky

Princeton University

Publications: 18

Saket Saurabh

Saket Saurabh

University of Bergen

Publications: 10

Stefan Szeider

Stefan Szeider

TU Wien

Publications: 9

Bruno Courcelle

Bruno Courcelle

University of Bordeaux

Publications: 9

Daniel Lokshtanov

Daniel Lokshtanov

University of California, Santa Barbara

Publications: 8

Michael A. Henning

Michael A. Henning

University of Johannesburg

Publications: 8

Andrzej Skowron

Andrzej Skowron

University of Warsaw

Publications: 7

Venkatesh Raman

Venkatesh Raman

Institute of Mathematical Sciences

Publications: 6

Michel Habib

Michel Habib

Université Paris Cité

Publications: 6

Dániel Marx

Dániel Marx

Saarland University

Publications: 5

Anders Yeo

Anders Yeo

University of Johannesburg

Publications: 5

Fedor V. Fomin

Fedor V. Fomin

University of Bergen

Publications: 5

Gregory Gutin

Gregory Gutin

Royal Holloway University of London

Publications: 5

Something went wrong. Please try again later.