Items where Author is "Marx, Dániel"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Jump to: Conference or Workshop Item (A Paper) | Article
Number of items: 19.

Conference or Workshop Item (A Paper)

Agrawal, Akanksha and Marx, Dániel and Neuen, Daniel and Slusallek, Jasper
(2023) Computing Square Colorings on Bounded-Treewidth and Planar Graphs.
In: ACM-SIAM Symposium on Discrete Algorithms (SODA 2023).
Conference: SODA ACM/SIAM Symposium on Discrete Algorithms
(In Press)

Focke, Jacob and Marx, Dániel and Mc Inerney, Fionn and Neuen, Daniel and Sankar, Govind and Schepper, Philipp and Wellnitz, Philip
(2023) Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs.
In: ACM-SIAM Symposium on Discrete Algorithms (SODA 2023).
Conference: SODA ACM/SIAM Symposium on Discrete Algorithms
(In Press)

Marx, Dániel and Sankar, Govind and Schepper, Philipp
(2022) Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard).
In: 17th International Symposium on Parameterized and Exact Computation (IPEC 2022).
Conference: IPEC International Symposium on Parameterized and Exact Computation (was IWPEC pre 2004)
(In Press)

Esmer, Baris Can and Kulik, Ariel and Marx, Dániel and Schepper, Philipp and Węgrzycki, Karol
(2022) Computing Generalized Convolutions Faster Than Brute Force.
In: 17th International Symposium on Parameterized and Exact Computation (IPEC 2022).
Conference: IPEC International Symposium on Parameterized and Exact Computation (was IWPEC pre 2004)
(In Press)

Galby, Esther and Marx, Dániel and Schepper, Philipp and Sharma, Roohani and Tale, Prafullkumar
(2022) Domination and Cut Problems on Chordal Graphs with Bounded Leafage.
In: 17th International Symposium on Parameterized and Exact Computation (IPEC 2022).
Conference: IPEC International Symposium on Parameterized and Exact Computation (was IWPEC pre 2004)
(In Press)

Galby, Esther and Marx, Dániel and Schepper, Philipp and Sharma, Roohani and Tale, Prafullkumar
(2022) Parameterized Complexity of Weighted Multicut in Trees.
In: 48th International Workshop on Graph-Theoretic Concepts in Computer Science (WG2022).
Conference: WG International Workshop on Graph-Theoretic Concepts in Computer Science

Can Esmer, Baris and Kulik, Ariel and Marx, Dániel and Neuen, Daniel and Sharma, Roohani
(2022) Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search.
In: 30th Annual European Symposium on Algorithms (ESA 2022).
Conference: ESA European Symposium on Algorithms

Bringmann, Karl and Kisfaludi-Bak, Sándor and Künnemann, Marvin and Marx, Dániel and Nusser, André
(2022) Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves.
In: 38th International Symposium on Computational Geometry (SoCG 2022).
Conference: SoCG International Symposium on Computational Geometry

Focke, Jacob and Marx, Dániel and Rzążewski, Paweł
(2022) Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds.
In: SODA 2022 - ACM/SIAM Symposium on Discrete Algorithms.
Conference: SODA ACM/SIAM Symposium on Discrete Algorithms

Marx, Dániel and Misra, Pranabendu and Neuen, Daniel and Tale, Prafullkumar
(2022) A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs.
In: UNSPECIFIED.
Conference: SODA ACM/SIAM Symposium on Discrete Algorithms
(Submitted)

Marx, Dániel and Sankar, Govind S. and Schepper, Philipp
(2021) Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth.
In: ICALP 2021.
Conference: ICALP International Colloquium on Automata Languages and Programming

Marx, Dániel
(2021) Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction.
In: 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database System.
Conference: PODS ACM SIGMOD-SIGACT-SIGART Conference on Principles of Database Systems

Cohen-Addad, Vincent and Klein, Philip N. and Marx, Dániel and Wheeler, Archer and Wolfram, Christopher
(2021) On the Computational Tractability of a Geographic Clustering Problem Arising in Redistricting.
In: 2nd Symposium on Foundations of Responsible Computing, FORC 2021, June 9-11, 2021, Virtual Conference.
Conference: UNSPECIFIED

Marx, Dániel and Sandeep, R.B.
(2020) Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy.
In: ESA 2020.
Conference: ESA European Symposium on Algorithms

Marx, Dániel
(2020) Chordless Cycle Packing Is Fixed-Parameter Tractable.
In: ESA 2020.
Conference: ESA European Symposium on Algorithms

Article

Marx, Dániel and Sandeep, R.B.
(2022) Incompressibility of H-free edge modification problems: Towards a dichotomy.
Journal of Computer and System Sciences, 125. pp. 25-58. ISSN 00220000

Cohen-Addad, Vincent and De Verdière, Éric Colin and Marx, Dániel and De Mesmay, Arnaud
(2021) Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs.
Journal of the ACM, 68 (4). pp. 1-26. ISSN 0004-5411

Bhattacharyya, Arnab and Bonnet, Édouard and Egri, László and Ghoshal, Suprovat and C. S., Karthik and Lin, Bingkai and Manurangsi, Pasin and Marx, Dániel
(2021) Parameterized Intractability of Even Set and Shortest Vector Problem.
Journal of the ACM, 68 (3). pp. 1-40. ISSN 0004-5411

de Berg, Mark and Bodlaender, Hans L. and Kisfaludi-Bak, Sándor and Marx, Dániel and van der Zanden, Tom C.
(2020) A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs.
SIAM Journal on Computing, 49 (6). pp. 1291-1331. ISSN 0097-5397

This list was generated on Sun Dec 22 02:44:07 2024 CET.
CISPA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.