E-LIB Suche - Ergebnisse für: Fellows, Michael R.

1

Diversity of solutions: An exploration through the lens of ..:

Baste, Julien ; Fellows, Michael R. ; Jaffke, Lars...
Artificial Intelligence. 303 (2022) - p. 103644 , 2022

Link: https://doi.org/10.1016/..

2

Collaborating with Hans: Some Remaining Wonderments:

, In: Treewidth, Kernels, and Algorithms; Lecture Notes in Computer Science,

Fellows, Michael R. ; Rosamond, Frances A. - p. 7-17 , 2020

Link: https://doi.org/10.1007/..

3

Parameterized approximation via fidelity preserving transfo..:

Fellows, Michael R. ; Kulik, Ariel ; Rosamond, Frances.
Journal of Computer and System Sciences. 93 (2018) - p. 30-40 , 2018

Link: https://doi.org/10.1016/..

4

A Survey on the Complexity of Flood-Filling Games:

, In: Adventures Between Lower Bounds and Higher Altitudes; Lecture Notes in Computer Science,

Fellows, Michael R. ; Rosamond, Frances A. ; Dantas da Silva, Maise. - p. 357-376 , 2018

Link: https://doi.org/10.1007/..

5

What Is Known About Vertex Cover Kernelization?:

, In: Adventures Between Lower Bounds and Higher Altitudes; Lecture Notes in Computer Science,

Fellows, Michael R. ; Jaffke, Lars ; Király, Aliz Izabella.. - p. 330-356 , 2018

Link: https://doi.org/10.1007/..

6

Tractable Parameterizations for the Minimum Linear Arrangem..:

Fellows, Michael R. ; Hermelin, Danny ; Rosamond, Frances.
ACM Transactions on Computation Theory. 8 (2016) 2 - p. 1-12 , 2016

Link: https://doi.org/10.1145/..

7

Tractable Parameterizations for the Minimum Linear Arrangem..:

Fellows, Michael R. ; Hermelin, Danny ; Rosamond, Frances.
ACM Transactions on Computation Theory (TOCT). 8 (2016) 2 - p. 1-12 , 2016

Link: https://dl.acm.org/doi/1..

8

Control complexity in Bucklin and fallback voting: A theore..:

Erdélyi, Gábor ; Fellows, Michael R. ; Rothe, Jörg.
Journal of Computer and System Sciences. 81 (2015) 4 - p. 632-660 , 2015

Link: https://doi.org/10.1016/..

9

Tractability and hardness of flood-filling games on trees:

Fellows, Michael R. ; Souza, Uéverton dos Santos ; Protti, Fábio.
Theoretical Computer Science. 576 (2015) - p. 102-116 , 2015

Link: https://doi.org/10.1016/..

10

Myhill–Nerode Methods for Hypergraphs:

van Bevern, René ; Downey, Rodney G. ; Fellows, Michael R...
Algorithmica. 73 (2015) 4 - p. 696-729 , 2015

Link: https://doi.org/10.1007/..

11

The Flood-It game parameterized by the vertex cover number:

Souza, Uéverton dos Santos ; Rosamond, Frances ; Fellows, Michael R...
Electronic Notes in Discrete Mathematics. 50 (2015) - p. 35-40 , 2015

Link: https://doi.org/10.1016/..

12

On the parameterized complexity of dynamic problems:

Abu-Khzam, Faisal N. ; Egan, Judith ; Fellows, Michael R...
Theoretical Computer Science. 607 (2015) - p. 426-434 , 2015

Link: https://doi.org/10.1016/..

13

Control complexity in Bucklin and fallback voting: An exper..:

Erdélyi, Gábor ; Fellows, Michael R. ; Rothe, Jörg.
Journal of Computer and System Sciences. 81 (2015) 4 - p. 661-670 , 2015

Link: https://doi.org/10.1016/..

14

FPT is characterized by useful obstruction sets: Connecting..:

Fellows, Michael R. ; Jansen, Bart M. P.
ACM Transactions on Computation Theory. 6 (2014) 4 - p. 1-26 , 2014

Link: https://doi.org/10.1145/..

15

Parameterized complexity of firefighting:

Bazgan, Cristina ; Chopin, Morgan ; Cygan, Marek...
Journal of Computer and System Sciences. 80 (2014) 7 - p. 1285-1297 , 2014

Link: https://doi.org/10.1016/..