H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 49 Citations 9,063 153 World Ranking 3038 National Ranking 138

Overview

What is he best known for?

The fields of study he is best known for:

  • Combinatorics
  • Discrete mathematics
  • Algorithm

Dániel Marx focuses on Combinatorics, Discrete mathematics, Parameterized complexity, Exponential time hypothesis and Treewidth. While working on this project, Dániel Marx studies both Combinatorics and Constraint satisfaction problem. His research on Discrete mathematics often connects related topics like Bounded function.

His research in Parameterized complexity intersects with topics in Disjoint sets, Function and Graph. His Exponential time hypothesis research includes elements of Linear programming, Homomorphism, Hamiltonian path and Dominating set. He has included themes like Partial k-tree and Tree-depth in his Treewidth study.

His most cited work include:

  • Parameterized Algorithms (908 citations)
  • Lower bounds based on the Exponential Time Hypothesis (278 citations)
  • Parameterized graph separation problems (230 citations)

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

His primary scientific interests are in Combinatorics, Discrete mathematics, Parameterized complexity, Treewidth and Exponential time hypothesis. His research investigates the connection with Combinatorics and areas like Bounded function which intersect with concerns in Function. Dániel Marx integrates Discrete mathematics with Constraint satisfaction problem in his study.

The concepts of his Parameterized complexity study are interwoven with issues in Independent set, Approximation algorithm, Directed graph and Open problem. His Treewidth study which covers Partial k-tree that intersects with Clique-sum and Tree-depth. His Exponential time hypothesis study combines topics in areas such as Computable function, Dimension, Exponent and Dominating set.

He most often published in these fields:

  • Combinatorics (71.91%)
  • Discrete mathematics (50.17%)
  • Parameterized complexity (43.14%)

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

  • Combinatorics (71.91%)
  • Parameterized complexity (43.14%)
  • Exponential time hypothesis (15.72%)

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

The scientist’s investigation covers issues in Combinatorics, Parameterized complexity, Exponential time hypothesis, Upper and lower bounds and Treewidth. In Combinatorics, Dániel Marx works on issues like Bounded function, which are connected to Time complexity. His biological study spans a wide range of topics, including Feedback vertex set, Discrete mathematics, Open problem and Approximation algorithm.

His Discrete mathematics study combines topics from a wide range of disciplines, such as Lattice problem and Generator matrix. His Exponential time hypothesis research is multidisciplinary, incorporating elements of Surface and Genus. The various areas that Dániel Marx examines in his Treewidth study include Function, Theoretical computer science and Tree decomposition.

Between 2017 and 2021, his most popular works were:

  • Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal (25 citations)
  • Slightly Superexponential Parameterized Problems (22 citations)
  • Covering a tree with rooted subtrees: parameterized and approximation algorithms (19 citations)

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

  • Combinatorics
  • Algorithm
  • Algebra

His main research concerns Combinatorics, Parameterized complexity, Exponential time hypothesis, Treewidth and Vertex. The Combinatorics study combines topics in areas such as Current and Upper and lower bounds. His research in Parameterized complexity intersects with topics in Time complexity, Discrete mathematics, Lattice problem and Approximation algorithm.

His Approximation algorithm research is multidisciplinary, incorporating perspectives in Travelling salesman problem and Planar graph. His Exponential time hypothesis research incorporates themes from Bounded function and Independent set. His Vertex research is multidisciplinary, relying on both Tree decomposition, Homomorphism, Computable function, Exponent and Interval 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

Parameterized Algorithms

Marek Cygan;Fedor V. Fomin;Lukasz Kowalik;Daniel Lokshtanov.
(2015)

1586 Citations

Lower bounds based on the Exponential Time Hypothesis

Daniel Lokshtanov;Dániel Marx;Saket Saurabh.
Bulletin of The European Association for Theoretical Computer Science (2015)

307 Citations

Parameterized Complexity and Approximation Algorithms

Dániel Marx.
The Computer Journal (2008)

248 Citations

Parameterized graph separation problems

Dániel Marx.
Theoretical Computer Science (2006)

243 Citations

GRAPH COLOURING PROBLEMS AND THEIR APPLICATIONS IN SCHEDULING

Dániel Marx.
Periodica Polytechnica Electrical Engineering (2004)

237 Citations

Can You Beat Treewidth

Dániel Marx.
Theory of Computing (2010)

213 Citations

On the Optimality of Planar and Geometric Approximation Schemes

D. Marx.
foundations of computer science (2007)

200 Citations

On Problems as Hard as CNF-SAT

Marek Cygan;Holger Dell;Daniel Lokshtanov;Dániel Marx.
ACM Transactions on Algorithms (2016)

183 Citations

Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries

Dániel Marx.
Journal of the ACM (2013)

162 Citations

Constraint solving via fractional edge covers

Martin Grohe;Dániel Marx.
symposium on discrete algorithms (2006)

148 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 Dániel Marx

Saket Saurabh

Saket Saurabh

University of Bergen

Publications: 186

Daniel Lokshtanov

Daniel Lokshtanov

University of California, Santa Barbara

Publications: 123

Fedor V. Fomin

Fedor V. Fomin

University of Bergen

Publications: 90

Rolf Niedermeier

Rolf Niedermeier

Technical University of Berlin

Publications: 83

Dimitrios M. Thilikos

Dimitrios M. Thilikos

National and Kapodistrian University of Athens

Publications: 79

Stefan Szeider

Stefan Szeider

TU Wien

Publications: 54

Hans L. Bodlaender

Hans L. Bodlaender

Utrecht University

Publications: 46

Michael R. Fellows

Michael R. Fellows

University of Bergen

Publications: 42

Venkatesh Raman

Venkatesh Raman

Institute of Mathematical Sciences

Publications: 36

Gregory Gutin

Gregory Gutin

Royal Holloway University of London

Publications: 32

Christopher Ré

Christopher Ré

Stanford University

Publications: 30

Martin Grohe

Martin Grohe

RWTH Aachen University

Publications: 28

Ken-ichi Kawarabayashi

Ken-ichi Kawarabayashi

National Institute of Informatics

Publications: 27

Dan Olteanu

Dan Olteanu

University of Zurich

Publications: 27

Dan Suciu

Dan Suciu

University of Washington

Publications: 26

Something went wrong. Please try again later.