Obserwuj
Dániel Marx
Dániel Marx
CISPA Helmholtz Center for Information Security
Zweryfikowany adres z cispa.saarland - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Parameterized algorithms
M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ...
Springer 5 (4), 16, 2015
29772015
Lower bounds based on the exponential-time hypothesis
M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ...
Parameterized Algorithms, 467-521, 2015
4002015
Size bounds and query plans for relational joins
A Atserias, M Grohe, D Marx
SIAM Journal on Computing 42 (4), 1737-1767, 2013
3772013
Graph colouring problems and their applications in scheduling
D Marx
Periodica Polytechnica, Electrical Engineering 48 (1-2), 11-16, 2004
3382004
Parameterized graph separation problems
D Marx
Theoretical Computer Science 351 (3), 394-406, 2006
3212006
Constraint solving via fractional edge covers
M Grohe, D Marx
ACM Transactions on Algorithms (TALG) 11 (1), 1-20, 2014
3092014
Parameterized complexity and approximation algorithms
D Marx
The Computer Journal 51 (1), 60-78, 2008
3022008
Can you beat treewidth?
D Marx
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 169-179, 2007
2622007
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
2512016
Tractable hypergraph properties for constraint satisfaction and conjunctive queries
D Marx
Journal of the ACM (JACM) 60 (6), 1-51, 2013
2282013
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
1812011
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
1682011
Slightly superexponential parameterized problems
D Lokshtanov, D Marx, S Saurabh
SIAM Journal on Computing 47 (3), 675-702, 2018
167*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
1582011
Chordal deletion is fixed-parameter tractable
D Marx
Algorithmica 57 (4), 747-768, 2010
155*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
1492017
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
1392013
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
1392012
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
1282011
A parameterized view on matroid optimization problems
D Marx
Theoretical Computer Science 410 (44), 4471-4479, 2009
1252009
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20