Items where Author is "Marx, Dániel"
 | Up a level |
Number of items: 85.
ISI Article
Article
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 2020 | Kratsch, S and Li, S and Marx, Dániel and Pilipczuk, Marcin and Wahlstrom, Magnus Multi-budgeted Directed Cuts | Article | |
| 2020 | Feldmann, A E and Marx, Dániel The Parameterized Hardness of the k-Center Problem in Transportation Networks |  | Article |
| 2019 | Bonnet, É and Brettell, N and Kwon, O-J and Marx, Dániel Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms | | Article |
| 2019 | Marx, Dániel and Williams, V V and Young, N E Introduction to the Special Issue on SODA 2017 | Article | |
| 2019 | Göke, A and Marx, Dániel and Mnich, M Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set | Article | |
| 2019 | Amiri, S A and Kreutzer, S and Marx, Dániel and Rabinovich, R Routing with congestion in acyclic digraphs | | Article |
| 2019 | Bacsó, Gábor and Lokshtanov, D and Marx, Dániel and Pilipczuk, M and Tuza, Zsolt Subexponential-Time Algorithms for Maximum Independent Set in Pt-Free and Broom-Free Graphs | Article | |
| 2018 | Biró, Cs and Bonnet, É and Marx, Dániel and Miltzow, T and Rzazewski, P Fine-grained complexity of coloring unit disks and balls | Article | |
| 2018 | Lokshtanov, D and Marx, Dániel and Saurabh, S Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal | Article | |
| 2018 | Lokshtanov, D and Marx, Dániel and Saurabh, S Slightly Superexponential Parameterized Problems | Article | |
| 2017 | Aboulker, P and Brettell, N and Havet, F and Marx, Dániel and Trotignon, N Coloring Graphs with Constraints on Connectivity | Article | |
| 2017 | Cygan, M and Marx, Dániel and Pilipczuk, M and Pilipczuk, M Hitting forbidden subgraphs in graphs of bounded treewidth | | Article |
| 2017 | Chitnis, R and Egri, L and Marx, Dániel List H-Coloring a Graph by Removing Few Vertices | | Article |
| 2017 | Marx, Dániel and Seymour, P and Wollan, P Rooted grid minors | | Article |
| 2016 | Cao, Yixin and Marx, Dániel Chordal Editing is Fixed-Parameter Tractable | | Article |
| 2016 | Cygan, M and Dell, H and Lokshtanov, D and Marx, Dániel and Nederlof, J On Problems as Hard as CNF-SAT | | Article |
| 2016 | Kratsch, S and Marx, Dániel and Wahlstrom, M Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems | | Article |
| 2016 | Bonnet, Édouard and Brettel, Nick and Kwon, O-joung and Marx, Dániel Parameterized vertex deletion problems for hereditary graph classes with a block property | Article | |
| 2015 | Chitnis, R and Cygan, M and Hajiaghayi, M and Marx, Dániel Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable | | Article |
| 2015 | Marx, Dániel and Végh, LA Fixed-parameter algorithms for minimum-cost edge-connectivity augmentation | | Article |
| 2015 | Cao, Y and Marx, Dániel Interval Deletion Is Fixed-Parameter Tractable | | Article |
| 2015 | Grohe, M and Marx, Dániel Structure theorem and isomorphism test for graphs with excluded topological subgraphs | | Article |
| 2014 | Marx, Dániel Chordal editing is fixed-parameter tractable | Article | |
| 2014 | Bulatov, AA and Marx, Dániel Constraint satisfaction parameterized by solution size | | Article |
| 2014 | Grohe, M and Marx, Dániel Constraint solving via fractional edge covers | | Article |
| 2014 | Marx, Dániel and Pilipczuk, Michal Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask) | Article | |
| 2014 | Dell, Holger and Husfeldt, Thore and Marx, Dániel and Taslaman, Nina and Wahlén, Martin Exponential time complexity of the permanent and the Tutte polynomial | | Article |
| 2014 | Marx, Dániel and Razgon, Igor Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset | | Article |
| 2014 | Cygan, Marek and Marx, Dániel and Pilipczuk, Marcin and Pilipczuk, Michal Hitting forbidden subgraphs in graphs of bounded treewidth | Article | |
| 2014 | Marx, Dániel and Wollan, P Immersions in highly edge connected graphs | | Article |
| 2014 | Demaine, Erik D. and Hajiaghayi, Mohammad T. and Marx, Dániel Minimizing movement: Fixed-parameter tractability | | Article |
| 2014 | Heggernes, Pinar and van 't Hof, Pim and Marx, Dániel and Misra, Neeldhara and Villanger, Yngve On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties | | Article |
| 2014 | Cygan, Marek and Marx, Dániel and Pilipczuk, Marcin and Pilipczuk, Michal and Schlotter, Ildikó Anna Parameterized complexity of Eulerian deletion problems | Article |
Book Section
Conference or Workshop Item
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 2013 | Chen, H and Marx, Dániel Block-sorted quantified conjunctive queries | Conference or Workshop Item | |
| 2013 | Guillemot, Sylvain and Marx, Dániel A Faster FPT Algorithm for Bipartite Contraction | Conference or Workshop Item | |
| 2013 | Marx, Dániel and Végh, LA Fixed-parameter algorithms for minimum cost edge-connectivity augmentation | Conference or Workshop Item | |
| 2013 | Chitnis, R and Egri, László and Marx, Dániel List H-coloring a graph by removing few vertices | Conference or Workshop Item | |
| 2013 | Cygan, M and Marx, Dániel and Pilipczuk, M and Pilipczuk, M The planar directed k -Vertex-Disjoint Paths problem is fixed-parameter tractable | | Conference or Workshop Item |
| 2013 | Marx, Dániel The square root phenomenon in planar graphs | Conference or Workshop Item | |
| 2012 | Cygan, M and Dell, H and Lokshtanov, D and Marx, Dániel and Nederlof, J and Okamoto, Y and Paturi, R and Saurabh, S and Wahlström, M On problems as hard as CNF-SAT | Conference or Workshop Item | |
| 2012 | Heggernes, P and T, Hof and Marx, Dániel and Misra, N and Villanger, Y On the parameterized complexity of finding separators with non-hereditary properties | Conference or Workshop Item | |
| 2012 | Grohe, M and Marx, Dániel Structure theorem and isomorphism test for graphs with excluded topological subgraphs | Conference or Workshop Item |
Book
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 2018 | Chatzigiannakis, I and Kaklamanis, C and Marx, Dániel and Sannella, D 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018 | Book |
