×
Compute Distance To:
Author ID: marx.daniel Recent zbMATH articles by "Marx, Dániel"
Published as: Marx, Dániel; Marx, Daniel; Marx, D.
Homepage: http://people.mpi-inf.mpg.de/~dmarx/
External Links: MGP · ORCID · Google Scholar · dblp
all top 5

Co-Authors

39 single-authored
13 Schlotter, Ildikó
11 Hajiaghayi, Mohammad Taghi
10 Lokshtanov, Daniel
10 Pilipczuk, Marcin L.
9 Grohe, Martin
8 Chitnis, Rajesh Hemant
8 Cygan, Marek
8 Pilipczuk, Michał
7 Razgon, Igor
7 Saurabh, Saket
6 Bonnet, Edouard
6 Kratsch, Stefan
5 Bulatov, Andrei A.
5 Wahlström, Magnus
4 Bateni, MohammadHossein
4 Brettell, Nick
4 Cao, Yixin
4 Dell, Holger
4 Egri, László
4 Feldmann, Andreas Emil
4 Wollan, Paul
3 Bodlaender, Hans L.
3 Demaine, Erik D.
3 Fomin, Fedor V.
3 Guillemot, Sylvain
3 Kwon, Ojoung
3 Miltzow, Tillmann
3 O’Sullivan, Barry
3 Rzążewski, Paweł
2 Akhoondian Amiri, Saeed
2 Bacsó, Gábor
2 Bíró, Csaba
2 Chen, Lin
2 Curticapean, Radu
2 Dalmau, Víctor
2 de Berg, Mark Theodoor
2 Giannopoulos, Panos
2 Heggernes, Pinar
2 Jansen, Klaus
2 Kawarabayashi, Ken-ichi
2 Kisfaludi-Bak, Sándor
2 Klein, Philip N.
2 Knauer, Christian
2 Kreutzer, Stephan
2 Krokhin, Andrei A.
2 Li, Shaohua
2 Misra, Neeldhara
2 Rabinovich, Roman
2 Sidiropoulos, Anastasios
2 Tuza, Zsolt
2 van der Zanden, Tom C.
2 van ’t Hof, Pim
2 Végh, László A.
2 Villanger, Yngve
1 Aboulker, Pierre
1 Alon, Noga M.
1 Atserias, Albert
1 Berendsohn, Benjamin Aram
1 Cabello, Sergio
1 Chatzigiannakis, Ioannis
1 Chekuri, Chandra S.
1 Chen, Hubie
1 Cohen-Addad, Vincent
1 Cohen, David A.
1 Colin, De Verdière Éric
1 Cooper, Martin C.
1 Creed, Páidí
1 De Mesmay, Arnaud
1 Downey, Rodney Graham
1 Ene, Alina
1 Göke, Alexander
1 Hajiaghayi, Mohammataghi
1 Havet, Frédéric
1 Hebrard, Emmanuel
1 Husfeldt, Thore
1 Jansen, Bart M. P.
1 Kakimura, Naonori
1 Kaklamanis, Christos
1 Klein, Rolf-Dieter
1 Korula, Nitish
1 Kowalik, Łukasz
1 Kozma, Laszlo
1 Kuetz, Martin
1 Künnemann, Marvin
1 Mitsou, Valia
1 Mnich, Matthias
1 Nederlof, Jesper
1 Okamoto, Yoshio
1 Paturi, Ramamohan
1 Rossmanith, Peter
1 Rote, Günter
1 Salamon, András Z.
1 Salmasi, Ario
1 Sandeep, R. B.
1 Sannella, Donald T.
1 Schaefer, Marcus
1 Seymour, Paul D.
1 Taslaman, Nina
1 Trotignon, Nicolas
1 Van Leeuwen, Erik Jan
...and 5 more Co-Authors

Publications by Year

Citations contained in zbMATH Open

149 Publications have been cited 2,151 times in 1,370 Documents Cited by Year
Parameterized algorithms. Zbl 1334.90001
Cygan, Marek; Fomin, Fedor V.; Kowalik, Łukasz; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
526
2015
Lower bounds based on the exponential time hypothesis. Zbl 1258.68068
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
100
2011
Parameterized graph separation problems. Zbl 1086.68104
Marx, Dániel
78
2006
Can you beat treewidth? Zbl 1213.68316
Marx, Dániel
50
2010
Known algorithms on graphs of bounded treewidth are probably optimal. Zbl 1373.68242
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
47
2011
Chordal deletion is fixed-parameter tractable. Zbl 1220.05066
Marx, Dániel
41
2010
Finding topological subgraphs is fixed-parameter tractable. Zbl 1288.05058
Grohe, Martin; Kawarabayashi, Ken-ichi; Marx, Dániel; Wollan, Paul
38
2011
On problems as hard as CNF-SAT. Zbl 1442.68064
Cygan, Marek; Dell, Holger; Lokshtanov, Daniel; Marx, Dániel; Nederlof, Jesper; Okamoto, Yoshio; Paturi, Ramamohan; Saurabh, Saket; Wahlström, Magnus
34
2016
Finding small separators in linear time via treewidth reduction. Zbl 1301.05337
Marx, Dániel; O’Sullivan, Barry; Razgon, Igor
31
2013
Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams. Zbl 1422.68253
Marx, Dániel; Pilipczuk, Michał
30
2015
On tree width, bramble size, and expansion. Zbl 1205.05049
Grohe, Martin; Marx, Dániel
30
2009
Efficient approximation schemes for geometric problems? Zbl 1162.68822
Marx, Dániel
30
2005
Bin packing with fixed number of bins revisited. Zbl 1261.68065
Jansen, Klaus; Kratsch, Stefan; Marx, Dániel; Schlotter, Ildikó
30
2013
Slightly superexponential parameterized problems. Zbl 1373.68273
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
29
2011
A parameterized view on matroid optimization problems. Zbl 1180.90275
Marx, Dániel
27
2009
Homomorphisms are a good basis for counting small subgraphs. Zbl 1369.05191
Curticapean, Radu; Dell, Holger; Marx, Dániel
25
2017
Packing cycles through prescribed vertices. Zbl 1223.05231
Kakimura, Naonori; Kawarabayashi, Ken-Ichi; Marx, Dániel
25
2011
Fixed-parameter tractability of multicut parameterized by the size of the cutset. Zbl 1288.05283
Marx, Dániel; Razgon, Igor
24
2011
Fixed-parameter tractability of Multicut parameterized by the size of the cutset. Zbl 1304.68078
Marx, Dániel; Razgon, Igor
24
2014
Parameterized complexity of independence and domination on geometric graphs. Zbl 1154.68431
Marx, Dániel
24
2006
Complexity of clique coloring and related problems. Zbl 1222.05070
Marx, Dániel
23
2011
Chordal editing is fixed-parameter tractable. Zbl 1344.68095
Cao, Yixin; Marx, Dániel
21
2016
Constraint solving via fractional edge covers. Zbl 1192.68642
Grohe, Martin; Marx, Dániel
21
2006
Closest substring problems with small distances. Zbl 1178.68695
Marx, Dániel
21
2008
Obtaining a planar graph by vertex deletion. Zbl 1239.05044
Marx, Dániel; Schlotter, Ildikó
20
2012
Known algorithms on graphs of bounded treewidth are probably optimal. Zbl 1454.68110
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
19
2018
Tractable hypergraph properties for constraint satisfaction and conjunctive queries. Zbl 1281.68135
Marx, Dániel
19
2013
Parameterized coloring problems on chordal graphs. Zbl 1087.68072
Marx, Dániel
19
2006
Everything you always wanted to know about the parameterized complexity of subgraph isomorphism (but were afraid to ask). Zbl 1359.68139
Marx, Dániel; Pilipczuk, Michał
18
2014
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset. Zbl 1312.68097
Chitnis, Rajesh; Hajiaghayi, MohammadTaghi; Marx, Dániel
18
2013
Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth. Zbl 1281.68233
Bateni, MohammadHossein; Hajiaghayi, MohammadTaghi; Marx, Dániel
17
2011
Stable assignment with couples: parameterized complexity and local search. Zbl 1248.90058
Marx, Dániel; Schlotter, Ildikó
17
2011
A tight lower bound for planar multiway cut with fixed number of terminals. Zbl 1272.68147
Marx, Dániel
15
2012
Structure theorem and isomorphism test for graphs with excluded topological subgraphs. Zbl 1314.05134
Grohe, Martin; Marx, Dániel
15
2015
Parameterized complexity and local search approaches for the stable marriage problem with ties. Zbl 1204.68148
Marx, Dániel; Schlotter, Ildikó
15
2010
Solving planar \(k\)-terminal cut in \(O(n^{c \sqrt{k}})\) time. Zbl 1272.68157
Klein, Philip N.; Marx, Dániel
14
2012
Tractable hypergraph properties for constraint satisfaction and conjunctive queries. Zbl 1293.68171
Marx, Dániel
14
2010
Searching the \(k\)-change neighborhood for TSP is W[1]-hard. Zbl 1166.90364
Marx, Dániel
14
2008
Directed Subset Feedback Vertex Set is fixed-parameter tractable. Zbl 1272.68149
Chitnis, Rajesh; Cygan, Marek; Hajiaghayi, MohammadTaghi; Marx, Dániel
13
2012
Parameterized complexity of Eulerian deletion problems. Zbl 1284.05157
Cygan, Marek; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Schlotter, Ildikó
13
2014
Approximating fractional hypertree width. Zbl 1300.05201
Marx, Dániel
13
2010
Immersions in highly edge connected graphs. Zbl 1292.05158
Marx, Dániel; Wollan, Paul
12
2014
Constraint solving via fractional edge covers. Zbl 1398.68240
Grohe, Martin; Marx, Dániel
12
2014
Kernelization of packing problems. Zbl 1421.68072
Dell, Holger; Marx, Dániel
12
2012
Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels. Zbl 1371.68212
Jansen, Bart M. P.; Marx, Dániel
11
2015
Precoloring extension on unit interval graphs. Zbl 1090.05028
Marx, Dániel
11
2006
Exponential time complexity of the permanent and the Tutte polynomial. Zbl 1398.68191
Dell, Holger; Husfeldt, Thore; Marx, Dániel; Taslaman, Nina; Wahlén, Martin
11
2014
Interval deletion is fixed-parameter tractable. Zbl 1398.68220
Cao, Yixin; Marx, Dániel
11
2015
What’s next? Future directions in parameterized complexity. Zbl 1358.68143
Marx, Dániel
11
2012
Chordal deletion is fixed-parameter tractable. Zbl 1167.68412
Marx, Dániel
11
2006
The tractability of CSP classes defined by forbidden patterns. Zbl 1253.68296
Cohen, David A.; Cooper, Martin C.; Creed, Páidí; Marx, Dániel; Salamon, András Z.
11
2012
Structure theorem and isomorphism test for graphs with excluded topological subgraphs. Zbl 1286.05106
Grohe, Martin; Marx, Dániel
10
2012
Prize-collecting Steiner problems on planar graphs. Zbl 1376.68059
Bateni, M.; Chekuri, C.; Ene, A.; Hajiaghayi, M. T.; Korula, N.; Marx, D.
10
2011
Parameterized complexity of constraint satisfaction problems. Zbl 1085.68068
Marx, Dániel
10
2005
Enumerating homomorphisms. Zbl 1253.68165
Bulatov, Andrei A.; Dalmau, Víctor; Grohe, Martin; Marx, Dániel
10
2012
Slightly superexponential parameterized problems. Zbl 1393.68077
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
10
2018
Minimizing movement: fixed-parameter tractability. Zbl 1256.68082
Demaine, Erik D.; Hajiaghayi, MohammadTaghi; Marx, Dániel
10
2009
Obtaining a planar graph by vertex deletion. Zbl 1141.68542
Marx, Dániel; Schlotter, Ildikó
10
2007
Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs. Zbl 1428.05291
Bacsó, Gábor; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Tuza, Zsolt; van Leeuwen, Erik Jan
10
2019
A faster FPT algorithm for bipartite contraction. Zbl 1284.68648
Guillemot, Sylvain; Marx, Dániel
9
2013
Eulerian disjoint paths problem in grid graphs is NP-complete. Zbl 1053.05078
Marx, Dániel
9
2004
Chordal editing is fixed-parameter tractable. Zbl 1359.05119
Cao, Yixin; Marx, Dániel
9
2014
The complexity of tree multicolorings. Zbl 1014.68117
Marx, Dániel
8
2002
Finding small patterns in permutations in linear time. Zbl 1421.68083
Guillemot, Sylvain; Marx, Daniel
8
2014
Size bounds and query plans for relational joins. Zbl 1276.68066
Atserias, Albert; Grohe, Martin; Marx, Dániel
8
2013
NP-completeness of list coloring and precoloring extension on the edges of planar graphs. Zbl 1068.05024
Marx, Dániel
7
2005
Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth. Zbl 1293.68308
Bateni, MohammadHossein; Hajiaghayi, MohammadTaghi; Marx, Dániel
7
2010
Parameterized complexity and kernelizability of Max Ones and Exact Ones problems. Zbl 1287.68077
Kratsch, Stefan; Marx, Dániel; Wahlström, Magnus
7
2010
On the hardness of losing weight. Zbl 1153.68382
Krokhin, Andrei; Marx, Dániel
7
2008
Completely inapproximable monotone and antimonotone parameterized problems. Zbl 1261.68066
Marx, Dániel
7
2013
Cleaning interval graphs. Zbl 1259.68082
Marx, Dániel; Schlotter, Ildikó
7
2013
Clustering with local restrictions. Zbl 1266.05122
Lokshtanov, Daniel; Marx, Dániel
7
2013
The limited blessing of low dimensionality: when \(1-1/d\) is the best possible exponent for \(d\)-dimensional geometric problems (extended abstract). Zbl 1395.68309
Marx, Dániel; Sidiropoulos, Anastasios
7
2014
Parameterized and approximation results for scheduling with a low rank processing time matrix. Zbl 1402.68085
Chen, Lin; Marx, Dániel; Ye, Deshi; Zhang, Guochuan
7
2017
A subexponential parameterized algorithm for subset TSP on planar graphs. Zbl 1423.68214
Klein, Philip N.; Marx, Daniel
7
2014
The complexity landscape of fixed-parameter directed Steiner network problems. Zbl 1388.68228
Feldmann, Andreas Emil; Marx, Dániel
7
2016
Coloring graphs with constraints on connectivity. Zbl 1368.05040
Aboulker, Pierre; Brettell, Nick; Havet, Frédéric; Marx, Dániel; Trotignon, Nicolas
6
2017
Fixed-parameter algorithms for minimum-cost edge-connectivity augmentation. Zbl 1398.68255
Marx, Dániel; Végh, László A.
6
2015
The complexity of chromatic strength and chromatic edge strength. Zbl 1103.05032
Marx, Dániel
6
2005
Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions). Zbl 1421.68112
Chitnis, Rajesh; Hajiaghayi, Mohammadtaghi; Marx, Daniel
6
2014
Covering a tree with rooted subtrees – parameterized and approximation algorithms. Zbl 1403.68343
Chen, Lin; Marx, Daniel
6
2018
Complexity results for minimum sum edge coloring. Zbl 1169.05382
Marx, Dániel
6
2009
A short proof of the NP-completeness of minimum sum interval coloring. Zbl 1067.05027
Marx, Dániel
5
2005
Parameterized vertex deletion problems for hereditary graph classes with a block property. Zbl 1417.68062
Bonnet, Édouard; Brettell, Nick; Kwon, O-joung; Marx, Dániel
5
2016
Hitting forbidden subgraphs in graphs of bounded treewidth. Zbl 1376.68062
Cygan, Marek; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał
5
2017
List H-coloring a graph by removing few vertices. Zbl 1361.05085
Chitnis, Rajesh; Egri, László; Marx, Dániel
5
2017
Geometric clustering, fixed-parameter tractability and lower bounds with respect to the dimension. Zbl 1295.68129
Cabello, Sergio; Giannopoulos, Panos; Knauer, Christian; Marx, Dániel; Rote, Günter
5
2011
On the hardness of losing weight. Zbl 1295.68123
Krokhin, Andrei; Marx, Dániel
5
2012
The complexity of global cardinality constraints. Zbl 1202.68208
Bulatov, Andrei A.; Marx, Daniel
5
2010
Constant ratio fixed-parameter approximation of the edge multicut problem. Zbl 1197.05149
Marx, Dániel; Razgon, Igor
5
2009
Directed subset feedback vertex set is fixed-parameter tractable. Zbl 1398.68222
Chitnis, Rajesh; Cygan, Marek; Hajiaghayi, Mohammataghi; Marx, Dániel
5
2015
Treewidth reduction for constrained separation and bipartization problems. Zbl 1230.68113
Marx, Dániel; O’Sullivan, Barry; Razgon, Igor
5
2010
Parameterized complexity of Eulerian deletion problems. Zbl 1341.05141
Cygan, Marek; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Schlotter, Ildikó
5
2011
Precoloring extension on chordal graphs. Zbl 1123.05041
Marx, Dániel
5
2007
Peeling and nibbling the cactus: subexponential-time algorithms for counting triangulations and related problems. Zbl 1387.68269
Marx, Dániel; Miltzow, Tillmann
5
2016
H-free graphs, independent sets, and subexponential-time algorithms. Zbl 1398.05191
Bacsó, Gábor; Marx, Dániel; Tuza, Zsolt
5
2017
Fixed-parameter algorithms for minimum cost edge-connectivity augmentation. Zbl 1336.68141
Marx, Dániel; Végh, László A.
4
2013
The complexity of nonrepetitive coloring. Zbl 1188.05066
Marx, Dániel; Schaefer, Marcus
4
2009
The multivariate algorithmic revolution and beyond. Essays dedicated to Michael R. Fellows on the occasion of his 60th birthday. Zbl 1245.68001
4
2012
Tractable structures for constraint satisfaction with truth tables. Zbl 1253.68180
Marx, Dániel
4
2011
Incompressibility of \(H\)-free edge modification problems: towards a dichotomy. Zbl 07466698
Marx, Dániel; Sandeep, R. B.
2
2022
A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs. Zbl 07294223
de Berg, Mark; Bodlaender, Hans L.; Kisfaludi-Bak, Sándor; Marx, Dániel; van der Zanden, Tom C.
1
2020
Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs. Zbl 1428.05291
Bacsó, Gábor; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Tuza, Zsolt; van Leeuwen, Erik Jan
10
2019
Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms. Zbl 1430.68179
Bonnet, Édouard; Brettell, Nick; Kwon, O-joung; Marx, Dániel
4
2019
Parameterized algorithms for generalizations of directed feedback vertex set. Zbl 07163791
Göke, Alexander; Marx, Dániel; Mnich, Matthias
2
2019
Routing with congestion in acyclic digraphs. Zbl 1461.05098
Akhoondian Amiri, Saeed; Kreutzer, Stephan; Marx, Dániel; Rabinovich, Roman
2
2019
Known algorithms on graphs of bounded treewidth are probably optimal. Zbl 1454.68110
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
19
2018
Slightly superexponential parameterized problems. Zbl 1393.68077
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
10
2018
Covering a tree with rooted subtrees – parameterized and approximation algorithms. Zbl 1403.68343
Chen, Lin; Marx, Daniel
6
2018
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. Zbl 1427.68353
de Berg, Mark; Bodlaender, Hans L.; Kisfaludi-Bak, Sándor; Marx, Dániel; Zanden, Tom C. van der
4
2018
The parameterized hardness of the \(k\)-center problem in transportation networks. Zbl 1477.68223
Feldmann, Andreas Emil; Marx, Dániel
3
2018
Fine-grained complexity of coloring unit disks and balls. Zbl 1417.68227
Biró, Csaba; Bonnet, Édouard; Marx, Dániel; Miltzow, Tillmann; Rzążewski, Paweł
2
2018
45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Zbl 1392.68012
1
2018
Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms. Zbl 1443.68121
Bonnet, Édouard; Brettell, Nick; Kwon, O-joung; Marx, Dániel
1
2018
Finding list homomorphisms from bounded-treewidth graphs to reflexive graphs: a complete complexity characterization. Zbl 1487.68125
Egri, László; Marx, Dániel; Rzążewski, Paweł
1
2018
Homomorphisms are a good basis for counting small subgraphs. Zbl 1369.05191
Curticapean, Radu; Dell, Holger; Marx, Dániel
25
2017
Parameterized and approximation results for scheduling with a low rank processing time matrix. Zbl 1402.68085
Chen, Lin; Marx, Dániel; Ye, Deshi; Zhang, Guochuan
7
2017
Coloring graphs with constraints on connectivity. Zbl 1368.05040
Aboulker, Pierre; Brettell, Nick; Havet, Frédéric; Marx, Dániel; Trotignon, Nicolas
6
2017
Hitting forbidden subgraphs in graphs of bounded treewidth. Zbl 1376.68062
Cygan, Marek; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał
5
2017
List H-coloring a graph by removing few vertices. Zbl 1361.05085
Chitnis, Rajesh; Egri, László; Marx, Dániel
5
2017
H-free graphs, independent sets, and subexponential-time algorithms. Zbl 1398.05191
Bacsó, Gábor; Marx, Dániel; Tuza, Zsolt
5
2017
Rooted grid minors. Zbl 1350.05158
Marx, Daniel; Seymour, Paul; Wollan, Paul
2
2017
Fine-grained complexity of coloring unit disks and balls. Zbl 1417.68226
Biró, Csaba; Bonnet, Édouard; Marx, Dániel; Miltzow, Tillmann; Rzążewski, Paweł
2
2017
Subexponential parameterized algorithms for graphs of polynomial growth. Zbl 1442.68178
Marx, Dániel; Pilipczuk, Marcin
1
2017
On problems as hard as CNF-SAT. Zbl 1442.68064
Cygan, Marek; Dell, Holger; Lokshtanov, Daniel; Marx, Dániel; Nederlof, Jesper; Okamoto, Yoshio; Paturi, Ramamohan; Saurabh, Saket; Wahlström, Magnus
34
2016
Chordal editing is fixed-parameter tractable. Zbl 1344.68095
Cao, Yixin; Marx, Dániel
21
2016
The complexity landscape of fixed-parameter directed Steiner network problems. Zbl 1388.68228
Feldmann, Andreas Emil; Marx, Dániel
7
2016
Parameterized vertex deletion problems for hereditary graph classes with a block property. Zbl 1417.68062
Bonnet, Édouard; Brettell, Nick; Kwon, O-joung; Marx, Dániel
5
2016
Peeling and nibbling the cactus: subexponential-time algorithms for counting triangulations and related problems. Zbl 1387.68269
Marx, Dániel; Miltzow, Tillmann
5
2016
Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus. Zbl 1409.68126
Curticapean, Radu; Marx, Dániel
4
2016
Double-exponential and triple-exponential bounds for choosability problems parameterized by treewidth. Zbl 1388.68128
Marx, Dániel; Mitsou, Valia
4
2016
Fixed-parameter approximability of Boolean MinCSPs. Zbl 1397.68090
Bonnet, Édouard; Egri, László; Marx, Dániel
4
2016
A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting. Zbl 1376.68168
Bateni, MohammadHossein; Demaine, Erik D.; Hajiaghayi, MohammadTaghi; Marx, Dániel
2
2016
Constant-factor approximations for asymmetric TSP on nearly-embeddable graphs. Zbl 1398.68681
Marx, Dániel; Salmasi, Ario; Sidiropoulos, Anastasios
2
2016
Routing with congestion in acyclic digraphs. Zbl 1398.68208
Amiri, Saeed Akhoondian; Kreutzer, Stephan; Marx, Dániel; Rabinovich, Roman
2
2016
Parameterized complexity and kernelizability of max ones and exact ones problems. Zbl 1347.68183
Kratsch, Stefan; Marx, Dániel; Wahlström, Magnus
1
2016
Parameterized algorithms. Zbl 1334.90001
Cygan, Marek; Fomin, Fedor V.; Kowalik, Łukasz; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
526
2015
Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams. Zbl 1422.68253
Marx, Dániel; Pilipczuk, Michał
30
2015
Structure theorem and isomorphism test for graphs with excluded topological subgraphs. Zbl 1314.05134
Grohe, Martin; Marx, Dániel
15
2015
Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels. Zbl 1371.68212
Jansen, Bart M. P.; Marx, Dániel
11
2015
Interval deletion is fixed-parameter tractable. Zbl 1398.68220
Cao, Yixin; Marx, Dániel
11
2015
Fixed-parameter algorithms for minimum-cost edge-connectivity augmentation. Zbl 1398.68255
Marx, Dániel; Végh, László A.
6
2015
Directed subset feedback vertex set is fixed-parameter tractable. Zbl 1398.68222
Chitnis, Rajesh; Cygan, Marek; Hajiaghayi, Mohammataghi; Marx, Dániel
5
2015
An exact characterization of tractable demand patterns for maximum disjoint path problems. Zbl 1372.68139
Marx, Dániel; Wollan, Paul
2
2015
On the parameterized complexity of finding separators with non-hereditary properties. Zbl 1328.68094
Heggernes, Pinar; van ’t Hof, Pim; Marx, Dániel; Misra, Neeldhara; Villanger, Yngve
1
2015
Fixed-parameter tractability of Multicut parameterized by the size of the cutset. Zbl 1304.68078
Marx, Dániel; Razgon, Igor
24
2014
Everything you always wanted to know about the parameterized complexity of subgraph isomorphism (but were afraid to ask). Zbl 1359.68139
Marx, Dániel; Pilipczuk, Michał
18
2014
Parameterized complexity of Eulerian deletion problems. Zbl 1284.05157
Cygan, Marek; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Schlotter, Ildikó
13
2014
Immersions in highly edge connected graphs. Zbl 1292.05158
Marx, Dániel; Wollan, Paul
12
2014
Constraint solving via fractional edge covers. Zbl 1398.68240
Grohe, Martin; Marx, Dániel
12
2014
Exponential time complexity of the permanent and the Tutte polynomial. Zbl 1398.68191
Dell, Holger; Husfeldt, Thore; Marx, Dániel; Taslaman, Nina; Wahlén, Martin
11
2014
Chordal editing is fixed-parameter tractable. Zbl 1359.05119
Cao, Yixin; Marx, Dániel
9
2014
Finding small patterns in permutations in linear time. Zbl 1421.68083
Guillemot, Sylvain; Marx, Daniel
8
2014
The limited blessing of low dimensionality: when \(1-1/d\) is the best possible exponent for \(d\)-dimensional geometric problems (extended abstract). Zbl 1395.68309
Marx, Dániel; Sidiropoulos, Anastasios
7
2014
A subexponential parameterized algorithm for subset TSP on planar graphs. Zbl 1423.68214
Klein, Philip N.; Marx, Daniel
7
2014
Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions). Zbl 1421.68112
Chitnis, Rajesh; Hajiaghayi, Mohammadtaghi; Marx, Daniel
6
2014
Minimizing movement: fixed-parameter tractability. Zbl 1398.68225
Demaine, Erik D.; Hajiaghayi, Mohammadtaghi; Marx, Dániel
4
2014
Constraint satisfaction parameterized by solution size. Zbl 1360.68499
Bulatov, Andrei A.; Marx, Dániel
3
2014
Interval deletion is fixed-parameter tractable. Zbl 1421.68066
Cao, Yixin; Marx, Dániel
1
2014
Finding small separators in linear time via treewidth reduction. Zbl 1301.05337
Marx, Dániel; O’Sullivan, Barry; Razgon, Igor
31
2013
Bin packing with fixed number of bins revisited. Zbl 1261.68065
Jansen, Klaus; Kratsch, Stefan; Marx, Dániel; Schlotter, Ildikó
30
2013
Tractable hypergraph properties for constraint satisfaction and conjunctive queries. Zbl 1281.68135
Marx, Dániel
19
2013
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset. Zbl 1312.68097
Chitnis, Rajesh; Hajiaghayi, MohammadTaghi; Marx, Dániel
18
2013
A faster FPT algorithm for bipartite contraction. Zbl 1284.68648
Guillemot, Sylvain; Marx, Dániel
9
2013
Size bounds and query plans for relational joins. Zbl 1276.68066
Atserias, Albert; Grohe, Martin; Marx, Dániel
8
2013
Completely inapproximable monotone and antimonotone parameterized problems. Zbl 1261.68066
Marx, Dániel
7
2013
Cleaning interval graphs. Zbl 1259.68082
Marx, Dániel; Schlotter, Ildikó
7
2013
Clustering with local restrictions. Zbl 1266.05122
Lokshtanov, Daniel; Marx, Dániel
7
2013
Fixed-parameter algorithms for minimum cost edge-connectivity augmentation. Zbl 1336.68141
Marx, Dániel; Végh, László A.
4
2013
Block-sorted quantified conjunctive queries. Zbl 1334.68129
Chen, Hubie; Marx, Dániel
3
2013
List H-coloring a graph by removing few vertices. Zbl 1395.68145
Chitnis, Rajesh; Egri, László; Marx, Dániel
2
2013
A faster FPT algorithm for bipartite contraction. Zbl 1407.68536
Guillemot, Sylvain; Marx, Dániel
2
2013
Obtaining a planar graph by vertex deletion. Zbl 1239.05044
Marx, Dániel; Schlotter, Ildikó
20
2012
A tight lower bound for planar multiway cut with fixed number of terminals. Zbl 1272.68147
Marx, Dániel
15
2012
Solving planar \(k\)-terminal cut in \(O(n^{c \sqrt{k}})\) time. Zbl 1272.68157
Klein, Philip N.; Marx, Dániel
14
2012
Directed Subset Feedback Vertex Set is fixed-parameter tractable. Zbl 1272.68149
Chitnis, Rajesh; Cygan, Marek; Hajiaghayi, MohammadTaghi; Marx, Dániel
13
2012
Kernelization of packing problems. Zbl 1421.68072
Dell, Holger; Marx, Dániel
12
2012
What’s next? Future directions in parameterized complexity. Zbl 1358.68143
Marx, Dániel
11
2012
The tractability of CSP classes defined by forbidden patterns. Zbl 1253.68296
Cohen, David A.; Cooper, Martin C.; Creed, Páidí; Marx, Dániel; Salamon, András Z.
11
2012
Structure theorem and isomorphism test for graphs with excluded topological subgraphs. Zbl 1286.05106
Grohe, Martin; Marx, Dániel
10
2012
Enumerating homomorphisms. Zbl 1253.68165
Bulatov, Andrei A.; Dalmau, Víctor; Grohe, Martin; Marx, Dániel
10
2012
On the hardness of losing weight. Zbl 1295.68123
Krokhin, Andrei; Marx, Dániel
5
2012
The multivariate algorithmic revolution and beyond. Essays dedicated to Michael R. Fellows on the occasion of his 60th birthday. Zbl 1245.68001
4
2012
FPT suspects and tough customers: open problems of Downey and Fellows. Zbl 1358.68132
Fomin, Fedor V.; Marx, Dániel
2
2012
On the parameterized complexity of finding separators with non-hereditary properties. Zbl 1341.68060
Heggernes, Pinar; van’t Hof, Pim; Marx, Dániel; Misra, Neeldhara; Villanger, Yngve
1
2012
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset. Zbl 1421.68067
Chitnis, Rajesh; Hajiaghayi, Mohammad Taghi; Marx, Dániel
1
2012
Lower bounds based on the exponential time hypothesis. Zbl 1258.68068
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
100
2011
Known algorithms on graphs of bounded treewidth are probably optimal. Zbl 1373.68242
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
47
2011
Finding topological subgraphs is fixed-parameter tractable. Zbl 1288.05058
Grohe, Martin; Kawarabayashi, Ken-ichi; Marx, Dániel; Wollan, Paul
38
2011
Slightly superexponential parameterized problems. Zbl 1373.68273
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
29
2011
Packing cycles through prescribed vertices. Zbl 1223.05231
Kakimura, Naonori; Kawarabayashi, Ken-Ichi; Marx, Dániel
25
2011
Fixed-parameter tractability of multicut parameterized by the size of the cutset. Zbl 1288.05283
Marx, Dániel; Razgon, Igor
24
2011
Complexity of clique coloring and related problems. Zbl 1222.05070
Marx, Dániel
23
2011
Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth. Zbl 1281.68233
Bateni, MohammadHossein; Hajiaghayi, MohammadTaghi; Marx, Dániel
17
2011
Stable assignment with couples: parameterized complexity and local search. Zbl 1248.90058
Marx, Dániel; Schlotter, Ildikó
17
2011
Prize-collecting Steiner problems on planar graphs. Zbl 1376.68059
Bateni, M.; Chekuri, C.; Ene, A.; Hajiaghayi, M. T.; Korula, N.; Marx, D.
10
2011
Geometric clustering, fixed-parameter tractability and lower bounds with respect to the dimension. Zbl 1295.68129
Cabello, Sergio; Giannopoulos, Panos; Knauer, Christian; Marx, Dániel; Rote, Günter
5
2011
Parameterized complexity of Eulerian deletion problems. Zbl 1341.05141
Cygan, Marek; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Schlotter, Ildikó
5
2011
Tractable structures for constraint satisfaction with truth tables. Zbl 1253.68180
Marx, Dániel
4
2011
Soft constraints of difference and equality. Zbl 1218.90173
Hebrard, E.; Marx, D.; O’Sullivan, B.; Razgon, I.
3
2011
...and 49 more Documents
all top 5

Cited by 1,570 Authors

88 Saurabh, Saket
52 Marx, Dániel
47 Golovach, Petr A.
45 Fomin, Fedor V.
42 Pilipczuk, Marcin L.
42 Sau, Ignasi
40 Lokshtanov, Daniel
39 Pilipczuk, Michał
39 Thilikos, Dimitrios M.
34 Zehavi, Meirav
32 Niedermeier, Rolf
31 Kratsch, Stefan
29 Panolan, Fahad
27 Jansen, Bart M. P.
27 Komusiewicz, Christian
25 Paulusma, Daniël
24 Ramanujan, M. S.
23 Otachi, Yota
23 Raman, Venkatesh
21 Agrawal, Akanksha
21 van Bevern, René
20 Cygan, Marek
20 Hermelin, Danny
20 Van Leeuwen, Erik Jan
19 Bodlaender, Hans L.
19 Knop, Dušan
19 Sorge, Manuel
17 Ganian, Robert
17 Gutin, Gregory Z.
17 Mnich, Matthias
16 Eiben, Eduard
16 Lampis, Michael
16 Wahlström, Magnus
15 Bonnet, Edouard
15 Heggernes, Pinar
15 Kwon, Ojoung
15 Ordyniak, Sebastian
15 Rzążewski, Paweł
15 Suchý, Ondřej
15 Tale, Prafullkumar
15 Wang, Jianxin
14 Fernau, Henning
14 Kolay, Sudeshna
14 Misra, Neeldhara
14 Paul, Christophe
14 Szeider, Stefan
14 van ’t Hof, Pim
14 Živný, Stanislav
13 Baste, Julien
13 Feng, Qilong
13 Hanaka, Tesshu
12 Belmonte, Rémy
12 Chen, Jian-er
12 Fellows, Michael Ralph
12 Molter, Hendrik
12 Roth, Marc
12 Villanger, Yngve
11 Kamiński, Marcin Marek
11 Kanj, Iyad A.
11 Krithika, R.
11 Misra, Pranabendu
11 Weller, Mathias
10 Feldmann, Andreas Emil
10 Gupta, Sushmita
10 Koutecký, Martin
10 Lima, Paloma T.
10 Majumdar, Diptapriyo
10 Philip, Geevarghese
10 Rosamond, Frances A.
10 Schlotter, Ildikó
10 Wood, David Ronald
9 Bredereck, Robert
9 Cao, Yixin
9 Chitnis, Rajesh Hemant
9 Dell, Holger
9 Greco, Gianluigi
9 Jaffke, Lars
9 Kawarabayashi, Ken-ichi
9 Kobayashi, Yasuaki
9 Meeks, Kitty
9 Scarcello, Francesco
9 Sikora, Florian
8 Araújo, Júlio César Silva
8 Cooper, Martin C.
8 Fluschnik, Till
8 Giroudeau, Rodolphe
8 Guo, Jiong
8 Jansen, Klaus
8 Kakimura, Naonori
8 Kanesh, Lawqueen
8 Kobayashi, Yusuke
8 Liang, Zuosong
8 Maity, Soumen
8 Masařík, Tomáš
8 Mertzios, George B.
8 Nederlof, Jesper
8 Nichterlein, André
8 Ono, Hirotaka
8 Reidl, Felix
8 Telle, Jan Arne
...and 1,470 more Authors
all top 5

Cited in 97 Serials

180 Algorithmica
168 Theoretical Computer Science
84 Journal of Computer and System Sciences
77 Discrete Applied Mathematics
60 SIAM Journal on Discrete Mathematics
50 Theory of Computing Systems
39 Information Processing Letters
38 SIAM Journal on Computing
31 Journal of Combinatorial Optimization
21 Information and Computation
19 Journal of Combinatorial Theory. Series B
16 Artificial Intelligence
16 Discrete Mathematics
11 Discrete Optimization
10 European Journal of Combinatorics
10 Journal of Graph Algorithms and Applications
9 Journal of Graph Theory
9 Journal of Discrete Algorithms
8 Annals of Operations Research
8 European Journal of Operational Research
8 The Electronic Journal of Combinatorics
7 Discrete & Computational Geometry
7 Journal of Scheduling
6 Computational Geometry
6 Constraints
6 Computer Science Review
5 Acta Informatica
5 Graphs and Combinatorics
5 Mathematical Programming. Series A. Series B
4 Operations Research Letters
4 Annals of Mathematics and Artificial Intelligence
4 ACM Transactions on Computation Theory
3 Operations Research
3 Computers & Operations Research
3 International Journal of Computational Geometry & Applications
3 International Journal of Foundations of Computer Science
3 INFORMS Journal on Computing
3 Algorithms
2 Applied Mathematics and Computation
2 Mathematical Social Sciences
2 Combinatorica
2 Journal of Automated Reasoning
2 SIAM Journal on Optimization
2 The Journal of Artificial Intelligence Research (JAIR)
2 International Transactions in Operational Research
2 RAIRO. Operations Research
2 ACM Journal of Experimental Algorithmics
2 Proceedings of the Steklov Institute of Mathematics
2 Logical Methods in Computer Science
2 Discrete Mathematics, Algorithms and Applications
1 International Journal of Theoretical Physics
1 Physica A
1 Problems of Information Transmission
1 Mathematics of Computation
1 Bulletin of Mathematical Biology
1 Mathematics of Operations Research
1 Transactions of the American Mathematical Society
1 Moscow University Computational Mathematics and Cybernetics
1 Advances in Applied Mathematics
1 Social Choice and Welfare
1 Order
1 Journal of Complexity
1 Machine Learning
1 MSCS. Mathematical Structures in Computer Science
1 Journal of Global Optimization
1 Historia Mathematica
1 Linear Algebra and its Applications
1 Cybernetics and Systems Analysis
1 Computational Complexity
1 Journal of Computer and Systems Sciences International
1 Combinatorics, Probability and Computing
1 Discussiones Mathematicae. Graph Theory
1 The Journal of Fourier Analysis and Applications
1 Vietnam Journal of Mathematics
1 Soft Computing
1 Chicago Journal of Theoretical Computer Science
1 Annals of Combinatorics
1 Discrete Mathematics and Theoretical Computer Science. DMTCS
1 Data Mining and Knowledge Discovery
1 New Journal of Physics
1 International Journal of Applied Mathematics and Computer Science
1 Fundamenta Informaticae
1 International Game Theory Review
1 JMMA. Journal of Mathematical Modelling and Algorithms
1 Quantum Information Processing
1 ACM Transactions on Computational Logic
1 4OR
1 Internet Mathematics
1 Sibirskie Èlektronnye Matematicheskie Izvestiya
1 Optimization Letters
1 Mathematical Programming Computation
1 RAIRO. Theoretical Informatics and Applications
1 Symmetry
1 ACM Transactions on Algorithms
1 Bulletin of the Hellenic Mathematical Society
1 Advances in Combinatorics
1 Journal of Algebraic Systems

Citations by Year