2026 Dániel Marx: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	60	3287	3193	153	149	261	11999

Overview

Dániel Marx is affiliated with Saarland University in Germany and specializes in the field of Computer Science, with a primary focus on Computational Theory and Mathematics. Their scholarly work extends across several subfields including Computer Networks and Communications, Artificial Intelligence, Discrete Mathematics and Combinatorics, and Electrical and Electronic Engineering.

Their research topics cover a range of areas related to graph theory and algorithmic complexity. Specifically, these include:

Advanced Graph Theory Research
Complexity and Algorithms in Graphs
Optimization and Search Problems
Algorithms and Data Compression
Graph Labeling and Dimension Problems
Limits and Structures in Graph Theory
Constraint Satisfaction and Optimization

Dániel Marx has contributed to several recent publications in reputable venues. Noteworthy papers include:

Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams, 2022, ACM Transactions on Algorithms
A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs, 2020, SIAM Journal on Computing
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering, 2022, SIAM Journal on Computing
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions), 2020, SIAM Journal on Computing
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs, 2021, Journal of the ACM

The scientist frequently publishes in various venues, with multiple contributions to:

arXiv (Cornell University)
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Algorithmica
SIAM Journal on Computing
ACM Transactions on Algorithms

Collaborative work is a significant part of their research activity. Frequent co-authors include:

Philipp Schepper
Roohani Sharma
Daniel Neuen
Jacob Focke
Barış Can Esmer

Best Publications

Parameterized Algorithms

Marek Cygan;Fedor V. Fomin;Lukasz Kowalik;Daniel Lokshtanov

2673
Citations
Lower bounds based on the Exponential Time Hypothesis

Daniel Lokshtanov;Dániel Marx;Saket Saurabh

359
Citations
Parameterized graph separation problems

Dániel Marx

304
Citations
Parameterized Complexity and Approximation Algorithms

Dániel Marx

292
Citations
GRAPH COLOURING PROBLEMS AND THEIR APPLICATIONS IN SCHEDULING

Dániel Marx

280
Citations
Can You Beat Treewidth

Dániel Marx

247
Citations
On Problems as Hard as CNF-SAT

Marek Cygan;Holger Dell;Daniel Lokshtanov;Dániel Marx

233
Citations
On the Optimality of Planar and Geometric Approximation Schemes

D. Marx

230
Citations
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries

Dániel Marx

210
Citations
A parameterized view on matroid optimization problems

Dániel Marx

162
Citations
Size Bounds and Query Plans for Relational Joins

A. Atserias;M. Grohe;D. Marx

161
Citations
Size Bounds and Query Plans for Relational Joins

Albert Atserias;Martin Grohe;Dániel Marx

155
Citations
Finding topological subgraphs is fixed-parameter tractable

Martin Grohe;Ken-ichi Kawarabayashi;Dániel Marx;Paul Wollan

153
Citations
Constraint solving via fractional edge covers

Martin Grohe;Dániel Marx

153
Citations
Approximating fractional hypertree width

Dániel Marx

134
Citations
On tree width, bramble size, and expansion

Martin Grohe;Dániel Marx

133
Citations
Bin packing with fixed number of bins revisited

Klaus Jansen;Stefan Kratsch;DáNiel Marx;Ildikó Schlotter

131
Citations
Finding small separators in linear time via treewidth reduction

Dáaniel Marx;Barry O'sullivan;Igor Razgon

126
Citations
Known algorithms on graphs of bounded treewidth are probably optimal

Daniel Lokshtanov;Dániel Marx;Saket Saurabh

124
Citations
Constraint Solving via Fractional Edge Covers

Martin Grohe;Dániel Marx

124
Citations
Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset

Dániel Marx;Igor Razgon

82
Citations
Slightly Superexponential Parameterized Problems

Daniel Lokshtanov;Dániel Marx;Saket Saurabh

46
Citations

Frequent Co-Authors

MohammadTaghi Hajiaghayi University of Maryland, College Park

Daniel Lokshtanov University of California, Santa Barbara

Michał Pilipczuk University of Warsaw

Marek Cygan University of Warsaw

Saket Saurabh Institute of Mathematical Sciences

Martin Grohe RWTH Aachen University

Fedor V. Fomin University of Bergen

Erik D. Demaine MIT

Philip N. Klein Brown University

Hans L. Bodlaender Utrecht University

External Links

Personal website of Dániel Marx Google Scholar page

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

Related Online Degrees & Career Pathways

Exploring computer science in the USA opens numerous doors, especially through flexible online programs. Many students interested in tech fields also consider highly ranked options like the best masters in data science online to boost skills in data analytics and machine learning. These programs are designed for those who want to stay at the forefront of the digital revolution.

For those looking to branch into project-driven sectors, an online construction management program offers a combination of leadership, technical, and business skills critical in today’s infrastructure development.

Career advancement often requires management expertise. If you’re seeking cost-effective options, look into the cheapest mba programs available. These accredited MBAs build a strong foundation in business administration without a hefty price tag.

Additionally, students aiming for rapid upskilling should explore 1 year master programs that offer accelerated learning and quicker entry to the workforce.

Each pathway supports distinct career goals and is ideal for busy professionals or those seeking flexibility while balancing other commitments.