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
Number of items: 5.

Conference or Workshop Item (A Paper)

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
(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 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

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 Mon Dec 6 21:49:31 2021 CET.