Items where Division is "Dániel Marx (DM)" and Year is 2020

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Author(s)/Creator(s) | Item Type | No Grouping
Number of items: 7.

Grohe, Martin and Neuen, Daniel and Wiebking, Daniel
(2020) Isomorphism Testing for Graphs Excluding Small Minors.
In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science.
Conference: FOCS IEEE Symposium on Foundations of Computer Science

Gunda, Spoorthy and Jain, Pallavi and Lokshtanov, Daniel and Saurabh, Saket and Tale, Prafullkumar
(2020) On the Parameterized Approximability of Contraction to Classes of Chordal Graphs.
In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference.
Conference: APPROX International Workshop on Approximation Algorithms for Combinatorial Optimization Problems

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

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

Saurabh, Saket and Tale, Prafullkumar
(2020) On the Parameterized Complexity of Maximum Degree Contraction Problem.
In: 15th International Symposium on Parameterized and Exact Computation (IPEC 2020).
Conference: IPEC International Symposium on Parameterized and Exact Computation (was IWPEC pre 2004)

Schepper, Philipp
(2020) Fine-Grained Complexity of Regular Expression Pattern Matching and Membership.
In: European Symposium on Algorithms.
Conference: ESA European Symposium on Algorithms

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 Jun 24 04:58:34 2024 CEST.