Dániel Marx

Cited by

	All	Since 2018
Citations	10680	6171
h-index	50	35
i10-index	129	100

1400

700

350

1050

200520062007200820092010201120122013201420152016201720182019202020212022202334 60 82 112 130 189 270 415 486 452 524 700 830 881 987 1166 1196 1310 626

Public access

View all

94 articles

1 article

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 LokshtanovProfessor of 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
Lukasz KowalikUniversity of WarsawVerified email at mimuw.edu.pl
Igor RazgonLecturer, Department of Computer Science and Information Systems, Birkbeck, University of LondonVerified email at dcs.bbk.ac.uk
Holger DellGoethe University FrankfurtVerified email at uni-frankfurt.de
Philip KleinProfessor of Computer Science, Brown UniversityVerified email at brown.edu
Magnus WahlströmRoyal Holloway, University of LondonVerified email at rhul.ac.uk
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyVerified email at mit.edu
Rajesh ChitnisUniversity of BirminghamVerified email at bham.ac.uk
Stefan KratschProfessor at Humboldt University BerlinVerified email at informatik.hu-berlin.de
Mohammad Hossein BateniResearch scientist, GoogleVerified email at cs.princeton.edu
Édouard BonnetENS Lyon, LIP, FranceVerified email at ens-lyon.fr
Andrei BulatovSimon Fraser UniversityVerified email at sfu.ca
Radu CurticapeanIT University of 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	2375	2015
Lower bounds based on the exponential time hypothesis D Lokshtanov, D Marx, S Saurabh Bulletin of EATCS 3 (105), 2013	363	2013
Size bounds and query plans for relational joins A Atserias, M Grohe, D Marx SIAM Journal on Computing 42 (4), 1737-1767, 2013	304*	2013
Graph colouring problems and their applications in scheduling D Marx Periodica Polytechnica, Electrical Engineering 48 (1-2), 11-16, 2004	298	2004
Parameterized graph separation problems D Marx Theoretical Computer Science 351 (3), 394-406, 2006	287	2006
Constraint solving via fractional edge covers M Grohe, D Marx ACM Transactions on Algorithms (TALG) 11 (1), 1-20, 2014	279	2014
Parameterized complexity and approximation algorithms D Marx The Computer Journal 51 (1), 60-78, 2008	273	2008
Can you beat treewidth? D Marx 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 169-179, 2007	233	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	219	2016
Tractable hypergraph properties for constraint satisfaction and conjunctive queries D Marx Journal of the ACM (JACM) 60 (6), 1-51, 2013	198	2013
Fixed-parameter tractability of multicut parameterized by the size of the cutset D Marx, I Razgon Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011	171	2011
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	161	2011
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	151	2011
Chordal deletion is fixed-parameter tractable D Marx Algorithmica 57 (4), 747-768, 2010	144*	2010
Slightly superexponential parameterized problems D Lokshtanov, D Marx, S Saurabh SIAM Journal on Computing 47 (3), 675-702, 2018	142*	2018
Structure theorem and isomorphism test for graphs with excluded topological subgraphs M Grohe, D Marx Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012	127	2012
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	113	2011
Homomorphisms are a good basis for counting small subgraphs R Curticapean, H Dell, D Marx Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017	111	2017
Bin packing with fixed number of bins revisited K Jansen, S Kratsch, D Marx, I Schlotter Journal of Computer and System Sciences 79 (1), 39-49, 2013	111	2013
Kernelization of packing problems H Dell, D Marx Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012	107	2012

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

Follow

Cited by

Co-authors