×
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

41 single-authored
13 Schlotter, Ildikó
12 Pilipczuk, Marcin L.
11 Hajiaghayi, Mohammad Taghi
11 Lokshtanov, Daniel
11 Pilipczuk, Michał
9 Cygan, Marek
9 Grohe, Martin
9 Saurabh, Saket
8 Bonnet, Edouard
8 Chitnis, Rajesh Hemant
7 Razgon, Igor
6 Kratsch, Stefan
5 Brettell, Nick
5 Bulatov, Andrei A.
5 Egri, László
5 Wahlström, Magnus
4 Bateni, MohammadHossein
4 Cao, Yixin
4 Dell, Holger
4 Feldmann, Andreas Emil
4 Fomin, Fedor V.
4 Kisfaludi-Bak, Sándor
4 Kwon, O. joung
4 Miltzow, Tillmann
4 Wollan, Paul
3 Bodlaender, Hans L.
3 Curticapean, Radu
3 Demaine, Erik D.
3 Guillemot, Sylvain
3 O’Sullivan, Barry
3 Rzążewski, Paweł
3 Schepper, Philipp
3 van der Zanden, Tom C.
2 Akhoondian Amiri, Saeed
2 Bacsó, Gábor
2 Berendsohn, Benjamin Aram
2 Bíró, Csaba
2 Chen, Lin
2 Cohen-Addad, Vincent
2 Dalmau, Víctor
2 de Berg, Mark Theodoor
2 De Mesmay, Arnaud
2 Galby, Esther
2 Giannopoulos, Panos
2 Göke, Alexander
2 Heggernes, Pinar
2 Jansen, Klaus
2 Kawarabayashi, Ken-ichi
2 Klein, Philip N.
2 Knauer, Christian
2 Kozma, Laszlo
2 Kreutzer, Stephan
2 Krokhin, Andrei A.
2 Künnemann, Marvin
2 Li, Shaohua
2 Misra, Neeldhara
2 Mnich, Matthias
2 Rabinovich, Roman
2 Sandeep, R. B.
2 Sharma, Roohani
2 Sidiropoulos, Anastasios
2 Tale, Prafullkumar
2 Tuza, Zsolt
2 van ’t Hof, Pim
2 Végh, László A.
2 Villanger, Yngve
1 Aboulker, Pierre
1 Agrawal, Akanksha
1 Alon, Noga
1 Atserias, Albert
1 Bhattacharyya, Arnab
1 Biswas, Arindam
1 Bringmann, Karl
1 Cabello, Sergio
1 Chatzigiannakis, Ioannis
1 Chekuri, Chandra S.
1 Chen, Hubie
1 Cohen, David A.
1 Colin de Verdière, Éric
1 Colin, De Verdière Éric
1 Cooper, Martin C.
1 Creed, Páidí
1 Downey, Rodney Graham
1 Ene, Alina
1 Esmer, Barış Can
1 Ghoshal, Suprovat
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 Kuetz, Martin
1 Kulik, Ariel
1 Lin, Bingkai
1 Manurangsi, Pasin
...and 23 more Co-Authors

Publications by Year

Citations contained in zbMATH Open

163 Publications have been cited 3,106 times in 1,932 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
915
2015
Lower bounds based on the exponential time hypothesis. Zbl 1258.68068
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
120
2011
Parameterized graph separation problems. Zbl 1086.68104
Marx, Dániel
103
2006
Can you beat treewidth? Zbl 1213.68316
Marx, Dániel
69
2010
Known algorithms on graphs of bounded treewidth are probably optimal. Zbl 1373.68242
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
53
2011
Chordal deletion is fixed-parameter tractable. Zbl 1220.05066
Marx, Dániel
51
2010
Finding topological subgraphs is fixed-parameter tractable. Zbl 1288.05058
Grohe, Martin; Kawarabayashi, Ken-ichi; Marx, Dániel; Wollan, Paul
51
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
50
2016
Bin packing with fixed number of bins revisited. Zbl 1261.68065
Jansen, Klaus; Kratsch, Stefan; Marx, Dániel; Schlotter, Ildikó
43
2013
Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams. Zbl 1422.68253
Marx, Dániel; Pilipczuk, Michał
41
2015
Kernelization of packing problems. Zbl 1421.68072
Dell, Holger; Marx, Dániel
41
2012
Efficient approximation schemes for geometric problems? Zbl 1162.68822
Marx, Dániel
38
2005
Finding small separators in linear time via treewidth reduction. Zbl 1301.05337
Marx, Dániel; O’Sullivan, Barry; Razgon, Igor
38
2013
Slightly superexponential parameterized problems. Zbl 1373.68273
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
35
2011
A parameterized view on matroid optimization problems. Zbl 1180.90275
Marx, Dániel
34
2009
On tree width, bramble size, and expansion. Zbl 1205.05049
Grohe, Martin; Marx, Dániel
34
2009
Chordal editing is fixed-parameter tractable. Zbl 1344.68095
Cao, Yixin; Marx, Dániel
33
2016
Fixed-parameter tractability of Multicut parameterized by the size of the cutset. Zbl 1304.68078
Marx, Dániel; Razgon, Igor
32
2014
Homomorphisms are a good basis for counting small subgraphs. Zbl 1369.05191
Curticapean, Radu; Dell, Holger; Marx, Dániel
32
2017
Parameterized complexity of independence and domination on geometric graphs. Zbl 1154.68431
Marx, Dániel
31
2006
Packing cycles through prescribed vertices. Zbl 1223.05231
Kakimura, Naonori; Kawarabayashi, Ken-Ichi; Marx, Dániel
30
2011
Fixed-parameter tractability of multicut parameterized by the size of the cutset. Zbl 1288.05283
Marx, Dániel; Razgon, Igor
28
2011
Obtaining a planar graph by vertex deletion. Zbl 1239.05044
Marx, Dániel; Schlotter, Ildikó
26
2012
Structure theorem and isomorphism test for graphs with excluded topological subgraphs. Zbl 1314.05134
Grohe, Martin; Marx, Dániel
26
2015
Complexity of clique coloring and related problems. Zbl 1222.05070
Marx, Dániel
25
2011
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset. Zbl 1312.68097
Chitnis, Rajesh; Hajiaghayi, MohammadTaghi; Marx, Dániel
25
2013
Constraint solving via fractional edge covers. Zbl 1192.68642
Grohe, Martin; Marx, Dániel
25
2006
Interval deletion is fixed-parameter tractable. Zbl 1398.68220
Cao, Yixin; Marx, Dániel
25
2015
Closest substring problems with small distances. Zbl 1178.68695
Marx, Dániel
24
2008
Known algorithms on graphs of bounded treewidth are probably optimal. Zbl 1454.68110
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
24
2018
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ł
23
2014
Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth. Zbl 1281.68233
Bateni, MohammadHossein; Hajiaghayi, MohammadTaghi; Marx, Dániel
23
2011
Stable assignment with couples: parameterized complexity and local search. Zbl 1248.90058
Marx, Dániel; Schlotter, Ildikó
22
2011
Tractable hypergraph properties for constraint satisfaction and conjunctive queries. Zbl 1281.68135
Marx, Dániel
22
2013
Constraint solving via fractional edge covers. Zbl 1398.68240
Grohe, Martin; Marx, Dániel
22
2014
Slightly superexponential parameterized problems. Zbl 1393.68077
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
21
2018
Parameterized coloring problems on chordal graphs. Zbl 1087.68072
Marx, Dániel
21
2006
Parameterized complexity of Eulerian deletion problems. Zbl 1284.05157
Cygan, Marek; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Schlotter, Ildikó
20
2014
Parameterized complexity and local search approaches for the stable marriage problem with ties. Zbl 1204.68148
Marx, Dániel; Schlotter, Ildikó
19
2010
Immersions in highly edge connected graphs. Zbl 1292.05158
Marx, Dániel; Wollan, Paul
18
2014
A tight lower bound for planar multiway cut with fixed number of terminals. Zbl 1272.68147
Marx, Dániel
18
2012
Solving planar \(k\)-terminal cut in \(O(n^{c \sqrt{k}})\) time. Zbl 1272.68157
Klein, Philip N.; Marx, Dániel
17
2012
Approximating fractional hypertree width. Zbl 1300.05201
Marx, Dániel
16
2010
Directed subset feedback vertex set is fixed-parameter tractable. Zbl 1398.68222
Chitnis, Rajesh; Cygan, Marek; Hajiaghayi, Mohammataghi; Marx, Dániel
16
2015
Searching the \(k\)-change neighborhood for TSP is W[1]-hard. Zbl 1166.90364
Marx, Dániel
15
2008
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
15
2015
A faster FPT algorithm for bipartite contraction. Zbl 1284.68648
Guillemot, Sylvain; Marx, Dániel
15
2013
Finding small patterns in permutations in linear time. Zbl 1421.68083
Guillemot, Sylvain; Marx, Daniel
15
2014
What’s next? Future directions in parameterized complexity. Zbl 1358.68143
Marx, Dániel
14
2012
Precoloring extension on unit interval graphs. Zbl 1090.05028
Marx, Dániel
14
2006
Tractable hypergraph properties for constraint satisfaction and conjunctive queries. Zbl 1293.68171
Marx, Dániel
14
2010
Chordal deletion is fixed-parameter tractable. Zbl 1167.68412
Marx, Dániel
14
2006
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
14
2019
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
14
2014
A subexponential parameterized algorithm for subset TSP on planar graphs. Zbl 1423.68214
Klein, Philip N.; Marx, Daniel
14
2014
Directed Subset Feedback Vertex Set is fixed-parameter tractable. Zbl 1272.68149
Chitnis, Rajesh; Cygan, Marek; Hajiaghayi, MohammadTaghi; Marx, Dániel
13
2012
Size bounds and query plans for relational joins. Zbl 1276.68066
Atserias, Albert; Grohe, Martin; Marx, Dániel
13
2013
Covering a tree with rooted subtrees – parameterized and approximation algorithms. Zbl 1403.68343
Chen, Lin; Marx, Daniel
12
2018
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
12
2014
Parameterized complexity of constraint satisfaction problems. Zbl 1085.68068
Marx, Dániel
12
2005
Prize-collecting Steiner problems on planar graphs. Zbl 1376.68059
Bateni, M.; Chekuri, C.; Ene, A.; Hajiaghayi, M. T.; Korula, N.; Marx, D.
12
2011
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.
12
2012
Obtaining a planar graph by vertex deletion. Zbl 1141.68542
Marx, Dániel; Schlotter, Ildikó
11
2007
NP-completeness of list coloring and precoloring extension on the edges of planar graphs. Zbl 1068.05024
Marx, Dániel
11
2005
Minimizing movement: fixed-parameter tractability. Zbl 1256.68082
Demaine, Erik D.; Hajiaghayi, MohammadTaghi; Marx, Dániel
11
2009
List H-coloring a graph by removing few vertices. Zbl 1361.05085
Chitnis, Rajesh; Egri, László; Marx, Dániel
11
2017
Fixed-parameter algorithms for minimum-cost edge-connectivity augmentation. Zbl 1398.68255
Marx, Dániel; Végh, László A.
11
2015
Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions). Zbl 1421.68112
Chitnis, Rajesh; Hajiaghayi, Mohammadtaghi; Marx, Daniel
11
2014
Enumerating homomorphisms. Zbl 1253.68165
Bulatov, Andrei A.; Dalmau, Víctor; Grohe, Martin; Marx, Dániel
10
2012
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
10
2017
Eulerian disjoint paths problem in grid graphs is NP-complete. Zbl 1053.05078
Marx, Dániel
10
2004
Clustering with local restrictions. Zbl 1266.05122
Lokshtanov, Daniel; Marx, Dániel
10
2013
Chordal editing is fixed-parameter tractable. Zbl 1359.05119
Cao, Yixin; Marx, Dániel
10
2014
Structure theorem and isomorphism test for graphs with excluded topological subgraphs. Zbl 1286.05106
Grohe, Martin; Marx, Dániel
10
2012
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
10
2018
The complexity landscape of fixed-parameter directed Steiner network problems. Zbl 1388.68228
Feldmann, Andreas Emil; Marx, Dániel
9
2016
Coloring graphs with constraints on connectivity. Zbl 1368.05040
Aboulker, Pierre; Brettell, Nick; Havet, Frédéric; Marx, Dániel; Trotignon, Nicolas
9
2017
Complexity results for minimum sum edge coloring. Zbl 1169.05382
Marx, Dániel
8
2009
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
8
2016
Peeling and nibbling the cactus: subexponential-time algorithms for counting triangulations and related problems. Zbl 1387.68269
Marx, Dániel; Miltzow, Tillmann
8
2016
The complexity of tree multicolorings. Zbl 1014.68117
Marx, Dániel
8
2002
The parameterized hardness of the \(k\)-center problem in transportation networks. Zbl 1477.68223
Feldmann, Andreas Emil; Marx, Dániel
8
2018
Completely inapproximable monotone and antimonotone parameterized problems. Zbl 1261.68066
Marx, Dániel
8
2013
Cleaning interval graphs. Zbl 1259.68082
Marx, Dániel; Schlotter, Ildikó
8
2013
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
On the hardness of losing weight. Zbl 1153.68382
Krokhin, Andrei; Marx, Dániel
7
2008
A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs. Zbl 1497.68375
de Berg, Mark; Bodlaender, Hans L.; Kisfaludi-Bak, Sándor; Marx, Dániel; van der Zanden, Tom C.
7
2020
Parameterized complexity and kernelizability of Max Ones and Exact Ones problems. Zbl 1287.68077
Kratsch, Stefan; Marx, Dániel; Wahlström, Magnus
7
2010
Precoloring extension on chordal graphs. Zbl 1123.05041
Marx, Dániel
6
2007
Parameterized complexity of Eulerian deletion problems. Zbl 1341.05141
Cygan, Marek; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Schlotter, Ildikó
6
2011
H-free graphs, independent sets, and subexponential-time algorithms. Zbl 1398.05191
Bacsó, Gábor; Marx, Dániel; Tuza, Zsolt
6
2017
The complexity of chromatic strength and chromatic edge strength. Zbl 1103.05032
Marx, Dániel
6
2005
A short proof of the NP-completeness of minimum sum interval coloring. Zbl 1067.05027
Marx, Dániel
6
2005
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
6
2011
Hitting forbidden subgraphs in graphs of bounded treewidth. Zbl 1376.68062
Cygan, Marek; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał
6
2017
Constant ratio fixed-parameter approximation of the edge multicut problem. Zbl 1197.05149
Marx, Dániel; Razgon, Igor
6
2009
The complexity of global cardinality constraints. Zbl 1202.68208
Bulatov, Andrei A.; Marx, Daniel
6
2010
Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering. Zbl 1511.05222
Fomin, Fedor V.; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
6
2022
Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus. Zbl 1409.68126
Curticapean, Radu; Marx, Dániel
6
2016
Treewidth reduction for constrained separation and bipartization problems. Zbl 1230.68113
Marx, Dániel; O’Sullivan, Barry; Razgon, Igor
5
2010
Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering. Zbl 1511.05222
Fomin, Fedor V.; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
6
2022
Incompressibility of \(H\)-free edge modification problems: towards a dichotomy. Zbl 07466698
Marx, Dániel; Sandeep, R. B.
5
2022
Parameterized complexity of weighted multicut in trees. Zbl 07682415
Galby, Esther; Marx, Dániel; Schepper, Philipp; Sharma, Roohani; Tale, Prafullkumar
2
2022
Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams. Zbl 07758407
Marx, Dániel; Pilipczuk, Michał
2
2022
A subexponential parameterized algorithm for directed subset traveling salesman problem on planar graphs. Zbl 1486.05294
Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michal
1
2022
Finding and counting permutations via CSPs. Zbl 1515.68216
Berendsohn, Benjamin Aram; Kozma, László; Marx, Dániel
2
2021
Parameterized intractability of even set and shortest vector problem. Zbl 1499.68149
Bhattacharyya, Arnab; Bonnet, Édouard; Egri, László; Ghoshal, Suprovat; S., Karthik C.; Lin, Bingkai; Manurangsi, Pasin; Marx, Dániel
1
2021
A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs. Zbl 1497.68375
de Berg, Mark; Bodlaender, Hans L.; Kisfaludi-Bak, Sándor; Marx, Dániel; van der Zanden, Tom C.
7
2020
The parameterized hardness of the \(k\)-center problem in transportation networks. Zbl 1439.90059
Feldmann, Andreas Emil; Marx, Dániel
3
2020
Finding small satisfying assignments faster than brute force: a fine-grained perspective into Boolean constraint satisfaction. Zbl 07561755
Künnemann, Marvin; Marx, Dániel
2
2020
Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions). Zbl 1437.05220
Chitnis, Rajesh H.; Feldmann, Andreas E.; HajiAghayi, MohammadTaghi; Marx, Daniel
2
2020
Multi-budgeted directed cuts. Zbl 1477.68236
Kratsch, Stefan; Li, Shaohua; Marx, Dániel; Pilipczuk, Marcin; Wahlström, Magnus
1
2020
Incompressibility of \(H\)-free edge modification problems: towards a dichotomy. Zbl 07651211
Marx, Dániel; Sandeep, R. B.
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
14
2019
Parameterized algorithms for generalizations of directed feedback vertex set. Zbl 1525.68066
Göke, Alexander; Marx, Dániel; Mnich, Matthias
5
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
5
2019
Routing with congestion in acyclic digraphs. Zbl 1461.05098
Akhoondian Amiri, Saeed; Kreutzer, Stephan; Marx, Dániel; Rabinovich, Roman
4
2019
Parameterized streaming algorithms for Min-Ones \(d\)-SAT. Zbl 07650305
Agrawal, Akanksha; Biswas, Arindam; Bonnet, Édouard; Brettell, Nick; Curticapean, Radu; Marx, Dániel; Miltzow, Tillmann; Raman, Venkatesh; Saurabh, Saket
4
2019
How does object fatness impact the complexity of packing in \(d\) dimensions? Zbl 07650269
Kisfaludi-Bak, Sándor; Marx, Dániel; van der Zanden, Tom C.
2
2019
Finding and counting permutations via CSPs. Zbl 1515.68217
Berendsohn, Benjamin Aram; Kozma, László; Marx, Dániel
1
2019
Known algorithms on graphs of bounded treewidth are probably optimal. Zbl 1454.68110
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
24
2018
Slightly superexponential parameterized problems. Zbl 1393.68077
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
21
2018
Covering a tree with rooted subtrees – parameterized and approximation algorithms. Zbl 1403.68343
Chen, Lin; Marx, Daniel
12
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
10
2018
The parameterized hardness of the \(k\)-center problem in transportation networks. Zbl 1477.68223
Feldmann, Andreas Emil; Marx, Dániel
8
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
5
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ł
4
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ł
3
2018
45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Zbl 1392.68012
2
2018
Homomorphisms are a good basis for counting small subgraphs. Zbl 1369.05191
Curticapean, Radu; Dell, Holger; Marx, Dániel
32
2017
List H-coloring a graph by removing few vertices. Zbl 1361.05085
Chitnis, Rajesh; Egri, László; Marx, Dániel
11
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
10
2017
Coloring graphs with constraints on connectivity. Zbl 1368.05040
Aboulker, Pierre; Brettell, Nick; Havet, Frédéric; Marx, Dániel; Trotignon, Nicolas
9
2017
H-free graphs, independent sets, and subexponential-time algorithms. Zbl 1398.05191
Bacsó, Gábor; Marx, Dániel; Tuza, Zsolt
6
2017
Hitting forbidden subgraphs in graphs of bounded treewidth. Zbl 1376.68062
Cygan, Marek; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał
6
2017
Rooted grid minors. Zbl 1350.05158
Marx, Daniel; Seymour, Paul; Wollan, Paul
3
2017
Subexponential parameterized algorithms for graphs of polynomial growth. Zbl 1442.68178
Marx, Dániel; Pilipczuk, Marcin
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
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
50
2016
Chordal editing is fixed-parameter tractable. Zbl 1344.68095
Cao, Yixin; Marx, Dániel
33
2016
The complexity landscape of fixed-parameter directed Steiner network problems. Zbl 1388.68228
Feldmann, Andreas Emil; Marx, Dániel
9
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
8
2016
Peeling and nibbling the cactus: subexponential-time algorithms for counting triangulations and related problems. Zbl 1387.68269
Marx, Dániel; Miltzow, Tillmann
8
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
6
2016
Double-exponential and triple-exponential bounds for choosability problems parameterized by treewidth. Zbl 1388.68128
Marx, Dániel; Mitsou, Valia
5
2016
Fixed-parameter approximability of Boolean MinCSPs. Zbl 1397.68090
Bonnet, Édouard; Egri, László; Marx, Dániel
4
2016
Routing with congestion in acyclic digraphs. Zbl 1398.68208
Amiri, Saeed Akhoondian; Kreutzer, Stephan; Marx, Dániel; Rabinovich, Roman
3
2016
Constant-factor approximations for asymmetric TSP on nearly-embeddable graphs. Zbl 1398.68681
Marx, Dániel; Salmasi, Ario; Sidiropoulos, Anastasios
3
2016
Parameterized complexity and kernelizability of max ones and exact ones problems. Zbl 1347.68183
Kratsch, Stefan; Marx, Dániel; Wahlström, Magnus
3
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
Parameterized algorithms. Zbl 1334.90001
Cygan, Marek; Fomin, Fedor V.; Kowalik, Łukasz; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
915
2015
Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams. Zbl 1422.68253
Marx, Dániel; Pilipczuk, Michał
41
2015
Structure theorem and isomorphism test for graphs with excluded topological subgraphs. Zbl 1314.05134
Grohe, Martin; Marx, Dániel
26
2015
Interval deletion is fixed-parameter tractable. Zbl 1398.68220
Cao, Yixin; Marx, Dániel
25
2015
Directed subset feedback vertex set is fixed-parameter tractable. Zbl 1398.68222
Chitnis, Rajesh; Cygan, Marek; Hajiaghayi, Mohammataghi; Marx, Dániel
16
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
15
2015
Fixed-parameter algorithms for minimum-cost edge-connectivity augmentation. Zbl 1398.68255
Marx, Dániel; Végh, László A.
11
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
32
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ł
23
2014
Constraint solving via fractional edge covers. Zbl 1398.68240
Grohe, Martin; Marx, Dániel
22
2014
Parameterized complexity of Eulerian deletion problems. Zbl 1284.05157
Cygan, Marek; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Schlotter, Ildikó
20
2014
Immersions in highly edge connected graphs. Zbl 1292.05158
Marx, Dániel; Wollan, Paul
18
2014
Finding small patterns in permutations in linear time. Zbl 1421.68083
Guillemot, Sylvain; Marx, Daniel
15
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
14
2014
A subexponential parameterized algorithm for subset TSP on planar graphs. Zbl 1423.68214
Klein, Philip N.; Marx, Daniel
14
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
12
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
11
2014
Chordal editing is fixed-parameter tractable. Zbl 1359.05119
Cao, Yixin; Marx, Dániel
10
2014
Constraint satisfaction parameterized by solution size. Zbl 1360.68499
Bulatov, Andrei A.; Marx, Dániel
4
2014
Minimizing movement: fixed-parameter tractability. Zbl 1398.68225
Demaine, Erik D.; Hajiaghayi, Mohammadtaghi; Marx, Dániel
4
2014
Interval deletion is fixed-parameter tractable. Zbl 1421.68066
Cao, Yixin; Marx, Dániel
4
2014
Bin packing with fixed number of bins revisited. Zbl 1261.68065
Jansen, Klaus; Kratsch, Stefan; Marx, Dániel; Schlotter, Ildikó
43
2013
Finding small separators in linear time via treewidth reduction. Zbl 1301.05337
Marx, Dániel; O’Sullivan, Barry; Razgon, Igor
38
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
25
2013
Tractable hypergraph properties for constraint satisfaction and conjunctive queries. Zbl 1281.68135
Marx, Dániel
22
2013
A faster FPT algorithm for bipartite contraction. Zbl 1284.68648
Guillemot, Sylvain; Marx, Dániel
15
2013
Size bounds and query plans for relational joins. Zbl 1276.68066
Atserias, Albert; Grohe, Martin; Marx, Dániel
13
2013
Clustering with local restrictions. Zbl 1266.05122
Lokshtanov, Daniel; Marx, Dániel
10
2013
Completely inapproximable monotone and antimonotone parameterized problems. Zbl 1261.68066
Marx, Dániel
8
2013
Cleaning interval graphs. Zbl 1259.68082
Marx, Dániel; Schlotter, Ildikó
8
2013
Fixed-parameter algorithms for minimum cost edge-connectivity augmentation. Zbl 1336.68141
Marx, Dániel; Végh, László A.
5
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
Kernelization of packing problems. Zbl 1421.68072
Dell, Holger; Marx, Dániel
41
2012
Obtaining a planar graph by vertex deletion. Zbl 1239.05044
Marx, Dániel; Schlotter, Ildikó
26
2012
A tight lower bound for planar multiway cut with fixed number of terminals. Zbl 1272.68147
Marx, Dániel
18
2012
Solving planar \(k\)-terminal cut in \(O(n^{c \sqrt{k}})\) time. Zbl 1272.68157
Klein, Philip N.; Marx, Dániel
17
2012
What’s next? Future directions in parameterized complexity. Zbl 1358.68143
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
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.
12
2012
Enumerating homomorphisms. Zbl 1253.68165
Bulatov, Andrei A.; Dalmau, Víctor; Grohe, Martin; Marx, Dániel
10
2012
Structure theorem and isomorphism test for graphs with excluded topological subgraphs. Zbl 1286.05106
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
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
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
...and 63 more Documents
all top 5

Cited by 2,011 Authors

139 Saurabh, Saket
73 Golovach, Petr A.
71 Fomin, Fedor V.
59 Lokshtanov, Daniel
59 Marx, Dániel
55 Zehavi, Meirav
52 Sau, Ignasi
52 Thilikos, Dimitrios M.
50 Pilipczuk, Marcin L.
46 Panolan, Fahad
44 Pilipczuk, Michał
43 Niedermeier, Rolf
40 Jansen, Bart M. P.
38 Komusiewicz, Christian
36 Kratsch, Stefan
32 Agrawal, Akanksha
32 Raman, Venkatesh
31 Otachi, Yota
29 Ganian, Robert
29 Paulusma, Daniël
29 Ramanujan, M. S.
27 Lampis, Michael
26 Gutin, Gregory Z.
26 Knop, Dušan
26 Sorge, Manuel
25 Eiben, Eduard
24 van Bevern, René
24 Wahlström, Magnus
23 Bodlaender, Hans L.
23 Hermelin, Danny
23 Tale, Prafullkumar
23 Van Leeuwen, Erik Jan
22 Bonnet, Edouard
22 Szeider, Stefan
21 Ordyniak, Sebastian
21 Rzążewski, Paweł
20 Cygan, Marek
20 Hanaka, Tesshu
20 Misra, Pranabendu
20 Suchý, Ondřej
19 Kolay, Sudeshna
19 Misra, Neeldhara
18 Fernau, Henning
18 Molter, Hendrik
17 Baste, Julien
17 Belmonte, Rémy
17 Fellows, Michael Ralph
17 Majumdar, Diptapriyo
17 Mnich, Matthias
16 Heggernes, Pinar
16 Kanesh, Lawqueen
16 Paul, Christophe
16 Rosamond, Frances A.
16 Sharma, Roohani
15 Koutecký, Martin
15 Sommer, Frank
15 van ’t Hof, Pim
15 Wang, Jianxin
14 Fluschnik, Till
14 Jaffke, Lars
14 Jain, Pallavi
14 Kanj, Iyad A.
14 Philip, Geevarghese
14 Sikora, Florian
14 Živný, Stanislav
13 Chen, Jian-er
13 Feng, Qilong
13 Gupta, Sushmita
13 Kamiński, Marcin Marek
13 Krithika, R.
13 Lima, Paloma T.
13 Roth, Marc
13 Sahu, Abhishek
13 Weller, Mathias
12 Chitnis, Rajesh Hemant
12 Chudnovsky, Maria
12 Feldmann, Andreas Emil
12 Kim, Eun Jung
12 Kobayashi, Yasuaki
12 Masařík, Tomáš
12 Mouawad, Amer E.
12 Nederlof, Jesper
12 Nichterlein, André
12 Sagunov, Danil
12 Villanger, Yngve
11 Bredereck, Robert
11 Cao, Yixin
11 Dell, Holger
11 Jansen, Klaus
11 Kisfaludi-Bak, Sándor
11 Maity, Soumen
11 Meeks, Kitty
11 Okrasa, Karolina
11 Ono, Hirotaka
11 Schlotter, Ildikó
11 Souza, Uéverton S.
11 Subramani, Krishnan
11 Wood, David Ronald
11 Zschoche, Philipp
10 Araújo, Júlio César Silva
...and 1,911 more Authors
all top 5

Cited in 112 Serials

231 Algorithmica
213 Theoretical Computer Science
106 Journal of Computer and System Sciences
95 Discrete Applied Mathematics
91 SIAM Journal on Discrete Mathematics
61 Theory of Computing Systems
48 SIAM Journal on Computing
47 Information Processing Letters
35 Journal of Combinatorial Optimization
25 Information and Computation
24 Artificial Intelligence
24 Journal of Combinatorial Theory. Series B
20 Discrete Mathematics
16 Journal of Graph Algorithms and Applications
15 Journal of Graph Theory
15 Discrete Optimization
14 European Journal of Combinatorics
13 The Electronic Journal of Combinatorics
12 Mathematical Programming. Series A. Series B
9 Discrete & Computational Geometry
9 Annals of Operations Research
9 Journal of Scheduling
9 Journal of Discrete Algorithms
8 European Journal of Operational Research
8 Constraints
8 Computer Science Review
7 Networks
7 Computational Geometry
6 Acta Informatica
6 Graphs and Combinatorics
5 ACM Journal of Experimental Algorithmics
5 Logical Methods in Computer Science
4 Operations Research Letters
4 Annals of Mathematics and Artificial Intelligence
4 International Transactions in Operational Research
4 Discrete Mathematics and Theoretical Computer Science. DMTCS
4 ACM Transactions on Algorithms
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 The Journal of Artificial Intelligence Research (JAIR)
3 INFORMS Journal on Computing
3 Fundamenta Informaticae
3 RAIRO. Operations Research
3 ACM Transactions on Computational Logic
3 Optimization Letters
3 Discrete Mathematics, Algorithms and Applications
3 Algorithms
2 Applied Mathematics and Computation
2 Mathematics of Operations Research
2 Mathematical Social Sciences
2 Combinatorica
2 Journal of Automated Reasoning
2 SIAM Journal on Optimization
2 The Journal of Analysis
2 4OR
2 Proceedings of the Steklov Institute of Mathematics
2 Mathematical Programming Computation
2 CGT. Computing in Geometry and Topology
1 International Journal of Theoretical Physics
1 Physica A
1 Problems of Information Transmission
1 Mathematics of Computation
1 Bulletin of Mathematical Biology
1 Journal of the London Mathematical Society. Second Series
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 Random Structures & Algorithms
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 Computational and Applied Mathematics
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 Journal of the ACM
1 Annals of Combinatorics
1 Data Mining and Knowledge Discovery
1 New Journal of Physics
1 International Journal of Applied Mathematics and Computer Science
1 CEJOR. Central European Journal of Operations Research
1 International Game Theory Review
1 Algebraic & Geometric Topology
1 Theory and Practice of Logic Programming
1 JMMA. Journal of Mathematical Modelling and Algorithms
1 Quantum Information Processing
...and 12 more Serials

Citations by Year