Dániel Marx

Cited by

	All	Since 2019
Citations	12578	7096
h-index	52	38
i10-index	136	104

1400

700

350

1050

200620072008200920102011201220132014201520162017201820192020202120222023202467 81 109 126 182 279 404 459 457 533 699 855 920 1037 1139 1142 1190 1301 1274

Public access

View all

98 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
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiVerified email at mimuw.edu.pl
Daniel LokshtanovProfessor of Computer Science, UCSBVerified email at ucsb.edu
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
Stefan KratschProfessor at Humboldt University BerlinVerified email at informatik.hu-berlin.de
Lukasz KowalikUniversity of WarsawVerified email at mimuw.edu.pl
Magnus WahlströmRoyal Holloway, University of LondonVerified email at rhul.ac.uk
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
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
Philip KleinProfessor of Computer Science, Brown UniversityVerified email at brown.edu
Mohammad Hossein BateniResearch scientist, GoogleVerified email at cs.princeton.edu
Radu CurticapeanIT University of CopenhagenVerified email at itu.dk
Édouard BonnetENS Lyon, LIP, FranceVerified email at ens-lyon.fr
Paweł RzążewskiWarsaw University of Technology, Faculty of Mathematics and Information ScienceVerified email at mini.pw.edu.pl

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	3017	2015
Lower bounds based on the exponential-time hypothesis M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Parameterized Algorithms, 467-521, 2015	403	2015
Size bounds and query plans for relational joins A Atserias, M Grohe, D Marx SIAM Journal on Computing 42 (4), 1737-1767, 2013	380	2013
Graph colouring problems and their applications in scheduling D Marx Periodica Polytechnica, Electrical Engineering 48 (1-2), 11-16, 2004	340	2004
Parameterized graph separation problems D Marx Theoretical Computer Science 351 (3), 394-406, 2006	323	2006
Constraint solving via fractional edge covers M Grohe, D Marx ACM Transactions on Algorithms (TALG) 11 (1), 1-20, 2014	311	2014
Parameterized complexity and approximation algorithms D Marx The Computer Journal 51 (1), 60-78, 2008	306	2008
Can you beat treewidth? D Marx 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 169-179, 2007	264	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	252	2016
Tractable hypergraph properties for constraint satisfaction and conjunctive queries D Marx Journal of the ACM (JACM) 60 (6), 1-51, 2013	230	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	184	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	169	2011
Slightly superexponential parameterized problems D Lokshtanov, D Marx, S Saurabh SIAM Journal on Computing 47 (3), 675-702, 2018	168*	2018
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	159	2011
Chordal deletion is fixed-parameter tractable D Marx Algorithmica 57 (4), 747-768, 2010	156*	2010
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	155	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	143	2013
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	141	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	130	2011
A parameterized view on matroid optimization problems D Marx Theoretical Computer Science 410 (44), 4471-4479, 2009	128	2009

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