Dániel Marx

Cited by

	All	Since 2016
Citations	8519	5464
h-index	47	36
i10-index	121	92

1400

700

350

1050

20042005200620072008200920102011201220132014201520162017201820192020202131 30 64 80 111 141 194 277 420 491 479 544 709 841 916 1042 1306 641

Public access

View all

85 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
Michał PilipczukUniversity of WarsawVerified email at mimuw.edu.pl
Marek CyganUniversity of WarsawVerified email at mimuw.edu.pl
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Daniel LokshtanovAssociate Professor in Computer Science, UCSBVerified email at ucsb.edu
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiVerified email at mimuw.edu.pl
MohammadTaghi HajiaghayiACM Fellow, Jack and Rita Minker Professor of Computer Science, University of Maryland, College ParkVerified email at cs.umd.edu
Martin GroheProfessor of Computer Science, RWTH Aachen UniversityVerified email at informatik.rwth-aachen.de
Igor RazgonLecturer, Department of Computer Science and Information Systems, Birkbeck, University of LondonVerified email at dcs.bbk.ac.uk
Lukasz KowalikUniversity of WarsawVerified email at mimuw.edu.pl
Holger DellGoethe University FrankfurtVerified email at uni-frankfurt.de
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyVerified email at mit.edu
Philip KleinProfessor of Computer Science, Brown UniversityVerified email at brown.edu
Stefan KratschProfessor at Humboldt University BerlinVerified email at informatik.hu-berlin.de
Rajesh ChitnisUniversity of BirminghamVerified email at bham.ac.uk
Andrei BulatovSimon Fraser UniversityVerified email at sfu.ca
Mohammad Hossein BateniResearch scientist, GoogleVerified email at cs.princeton.edu
Magnus WahlströmRoyal Holloway, University of LondonVerified email at rhul.ac.uk
Paul WollanProfessor of Computer Science, University of Rome La SapienzaVerified email at di.uniroma1.it
Radu CurticapeanIT University of Copenhagen, Basic Algorithms Research CopenhagenVerified email at itu.dk

Dániel Marx

CISPA Helmholtz Center for Information Security

Verified email at cispa.saarland - Homepage

theoretical computer science


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Parameterized algorithms M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Springer 5 (4), 16, 2015	1602	2015
Lower bounds based on the exponential time hypothesis D Lokshtanov, D Marx, S Saurabh Bulletin of EATCS 3 (105), 2013	304	2013
Parameterized complexity and approximation algorithms D Marx The Computer Journal 51 (1), 60-78, 2008	247	2008
Constraint solving via fractional edge covers M Grohe, D Marx ACM Transactions on Algorithms (TALG) 11 (1), 1-20, 2014	242	2014
Parameterized graph separation problems D Marx Theoretical Computer Science 351 (3), 394-406, 2006	239	2006
Graph colouring problems and their applications in scheduling D Marx Periodica Polytechnica, Electrical Engineering 48 (1-2), 11-16, 2004	235	2004
Size bounds and query plans for relational joins A Atserias, M Grohe, D Marx SIAM Journal on Computing 42 (4), 1737-1767, 2013	209*	2013
Can you beat treewidth? D Marx 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 169-179, 2007	188	2007
On problems as hard as CNF-SAT M Cygan, H Dell, D Lokshtanov, D Marx, J Nederlof, Y Okamoto, R Paturi, ... ACM Transactions on Algorithms (TALG) 12 (3), 1-24, 2016	182	2016
Tractable hypergraph properties for constraint satisfaction and conjunctive queries D Marx Journal of the ACM (JACM) 60 (6), 1-51, 2013	160	2013
Known algorithms on graphs of bounded treewidth are probably optimal D Lokshtanov, D Marx, S Saurabh Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete …, 2011	145	2011
Fixed-parameter tractability of multicut parameterized by the size of the cutset D Marx, I Razgon SIAM Journal on Computing 43 (2), 355-388, 2014	143	2014
Chordal deletion is fixed-parameter tractable D Marx Algorithmica 57 (4), 747-768, 2010	133*	2010
Finding topological subgraphs is fixed-parameter tractable M Grohe, K Kawarabayashi, D Marx, P Wollan Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011	131	2011
Structure theorem and isomorphism test for graphs with excluded topological subgraphs M Grohe, D Marx SIAM Journal on Computing 44 (1), 114-159, 2015	118	2015
Slightly superexponential parameterized problems D Lokshtanov, D Marx, S Saurabh SIAM Journal on Computing 47 (3), 675-702, 2018	115*	2018
Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth MH Bateni, MT Hajiaghayi, D Marx Journal of the ACM (JACM) 58 (5), 1-37, 2011	98	2011
A parameterized view on matroid optimization problems D Marx Theoretical Computer Science 410 (44), 4471-4479, 2009	92	2009
Kernelization of packing problems H Dell, D Marx Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012	91	2012
Finding small separators in linear time via treewidth reduction D Marx, B O'sullivan, I Razgon ACM Transactions on Algorithms (TALG) 9 (4), 1-35, 2013	90	2013

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors