Items where Author is "Neuen, Daniel"

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

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)

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

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)

Neuen, Daniel
(2022) Isomorphism Testing for Graphs Excluding Small Topological Subgraphs.
In: UNSPECIFIED.
Conference: SODA ACM/SIAM Symposium on Discrete Algorithms
(Submitted)

Neuen, Daniel
(2021) Isomorphism Testing Parameterized by Genus and Beyond.
In: European Symposium on Algorithms.
Conference: ESA European Symposium on Algorithms

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

This list was generated on Mon Apr 22 11:42:36 2024 CEST.