H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 38 Citations 6,418 279 World Ranking 5115 National Ranking 4
Mathematics H-index 38 Citations 6,383 281 World Ranking 1179 National Ranking 6

Overview

What is he best known for?

The fields of study he is best known for:

  • Combinatorics
  • Discrete mathematics
  • Algebra

Zsolt Tuza spends much of his time researching Combinatorics, Discrete mathematics, Graph, Chordal graph and Split graph. Bipartite graph, Complete coloring, Edge, Vertex and Graph power are the core of his Combinatorics study. His Discrete mathematics study combines topics in areas such as Chromatic scale and Order.

His work in the fields of Graph, such as Vertex, Rainbow connection, Strongly chordal graph and Rainbow connection number, overlaps with other areas such as Algorithmic complexity. His Chordal graph research integrates issues from Time complexity and Indifference graph. In his research, Clique problem and Treewidth is intimately related to K-tree, which falls under the overarching field of Split graph.

His most cited work include:

  • On Rainbow Connection (178 citations)
  • Complexity of Coloring Graphs without Forbidden Induced Subgraphs (176 citations)
  • Semi on-line algorithms for the partition problem (145 citations)

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

Zsolt Tuza focuses on Combinatorics, Discrete mathematics, Graph, Vertex and Hypergraph. His study brings together the fields of Upper and lower bounds and Combinatorics. The concepts of his Upper and lower bounds study are interwoven with issues in Bin and Bin packing problem.

His work in Split graph, Neighbourhood, 1-planar graph, Time complexity and Edge coloring are all subfields of Discrete mathematics research. His Edge coloring research also works with subjects such as

  • Fractional coloring and related List coloring,
  • Graph coloring most often made with reference to Complete coloring. His Graph study incorporates themes from Bounded function and Conjecture.

He most often published in these fields:

  • Combinatorics (101.64%)
  • Discrete mathematics (71.51%)
  • Graph (24.11%)

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

  • Combinatorics (101.64%)
  • Graph (24.11%)
  • Vertex (16.16%)

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

His primary areas of investigation include Combinatorics, Graph, Vertex, Conjecture and Bipartite graph. His study in Upper and lower bounds extends to Combinatorics with its themes. As part of one scientific family, Zsolt Tuza deals mainly with the area of Graph, narrowing it down to issues related to the Bounded function, and often Dominator, Graph property and Treewidth.

His research in Vertex intersects with topics in Spanning forest and Multigraph. His research on Conjecture concerns the broader Discrete mathematics. His Discrete mathematics study frequently draws connections between related disciplines such as Function.

Between 2017 and 2021, his most popular works were:

  • Safe sets in graphs: Graph classes and structural parameters (12 citations)
  • Safe sets, network majority on weighted trees (8 citations)
  • Fractional Domination Game (7 citations)

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

  • Combinatorics
  • Discrete mathematics
  • Algebra

Zsolt Tuza mostly deals with Combinatorics, Graph, Mathematical optimization, Job shop scheduling and Upper and lower bounds. His research related to Vertex, Parameterized complexity and Time complexity might be considered part of Combinatorics. His work on Domination analysis as part of general Graph study is frequently connected to Rainbow, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them.

Zsolt Tuza has researched Mathematical optimization in several fields, including Graph coloring and Infimum and supremum. His studies in Upper and lower bounds integrate themes in fields like Game theoretic, Mathematical economics, Nash equilibrium and Bin. Dominator is a subfield of Discrete mathematics that he studies.

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

Rankings of graphs

Hans L. Bodlaender;Jitender S. Deogun;Klaus Jansen;Ton Kloks.
workshop on graph theoretic concepts in computer science (1994)

216 Citations

Semi on-line algorithms for the partition problem

Hans Kellerer;Vladimir Kotov;Maria Grazia Speranza;Zsolt Tuza.
Operations Research Letters (1997)

213 Citations

On Rainbow Connection

Yair Caro;Arieh Lev;Yehuda Roditty;Zsolt Tuza.
Electronic Journal of Combinatorics (2008)

201 Citations

Maximum cuts and largest bipartite subgraphs.

Svatopluk Poljak;Zsolt Tuza.
Combinatorial Optimization (1993)

185 Citations

Complexity of Coloring Graphs without Forbidden Induced Subgraphs

Daniel Král;Jan Kratochvíl;Zsolt Tuza;Gerhard J. Woeginger.
workshop on graph theoretic concepts in computer science (2001)

180 Citations

On the b-Chromatic Number of Graphs

Jan Kratochvíl;Zsolt Tuza;Margit Voigt.
workshop on graph theoretic concepts in computer science (2002)

173 Citations

Induced matchings in bipartite graphs

R. Faudree;A. Gyárfas;R. H. Schelp;Z. Tuza.
Discrete Mathematics (1989)

144 Citations

Covering all cliques of a graph

Zsolt Tuza.
Discrete Mathematics (1991)

142 Citations

Saturated graphs with minimal number of edges

L. Kászonyi;Zsolt Tuza.
Journal of Graph Theory (1986)

138 Citations

The number of maximal independent sets in triangle-free graphs

Mihály Hjuter;Zsolt Tuza.
SIAM Journal on Discrete Mathematics (1993)

116 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 Zsolt Tuza

Michael A. Henning

Michael A. Henning

University of Johannesburg

Publications: 79

Anders Yeo

Anders Yeo

University of Johannesburg

Publications: 36

Benny Sudakov

Benny Sudakov

ETH Zurich

Publications: 32

Vadim V. Lozin

Vadim V. Lozin

University of Warwick

Publications: 24

Leah Epstein

Leah Epstein

University of Haifa

Publications: 23

Sandi Klavžar

Sandi Klavžar

University of Ljubljana

Publications: 19

Xuding Zhu

Xuding Zhu

Zhejiang Normal University

Publications: 17

Michael Krivelevich

Michael Krivelevich

Tel Aviv University

Publications: 17

Noga Alon

Noga Alon

Tel Aviv University

Publications: 16

Dieter Kratsch

Dieter Kratsch

University of Lorraine

Publications: 15

Pavol Hell

Pavol Hell

Simon Fraser University

Publications: 14

András Gyárfás

András Gyárfás

Hungarian Academy of Sciences

Publications: 14

Douglas B. West

Douglas B. West

University of Illinois at Urbana-Champaign

Publications: 14

Béla Bollobás

Béla Bollobás

University of Memphis

Publications: 14

Gerard J. Chang

Gerard J. Chang

National Taiwan University

Publications: 13

Something went wrong. Please try again later.