Hjem
Parameterized Complexity for Practical Computing

Varselmelding

There has not been added a translated version of this content. You can either try searching or go to the "area" home page to see if you can find the information there

Publications

Selected publications

Hovedinnhold

2018

Mateus de Oliveira Oliveira: Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness Function. Theory of Computing Systems. 62(1): 136-161 (2018)

Michael R. Fellows, Fábio Protti, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza: Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number. Discrete Applied Mathematics 245: 94-100 (2018)

Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai: Parameterized approximation via fidelity preserving transformations. Journal of Computer and System Sciences 93: 30-40 (2018)

Michael R. Fellows, Frances A. Rosamond: A brief history of Edward K. Blum and the Journal of Computer and System Sciences. Journal of Computer and System Sciences 94: 2-10 (2018)

Michael R. Fellows, Lars Jaffke, Aliz Izabella Király, Frances A. Rosamond, Mathias Weller: What Is Known About Vertex Cover Kernelization? Adventures Between Lower Bounds and Higher Altitudes 2018: 330-356

Michael R. Fellows, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza: A Survey on the Complexity of Flood-Filling Games. Adventures Between Lower Bounds and Higher Altitudes 2018: 357-376

Mateus de Oliveira Oliveira, Michael Wehar: Intersection Non-emptiness and Hardness Within Polynomial Time. 22nd DLT 2018: 282-290

Mateus de Oliveira Oliveira: A Near-Quadratic Lower Bound for the Size of Quantum Circuits of Constant Treewidth. 29. SODA 2018: New Orleans, LA, USA: 136-145

Mateus de Oliveira Oliveira: Graph Amalgamation Under Logical Constraints. 44th WG 2018: Cottbus, Germany: 152-163

Lars Jaffke, Mateus de Oliveira Oliveira: On Weak Isomorphism of Rooted Vertex-Colored Graphs. 44th WG 2018: Cottbus, Germany: 266-278