Skip to contents

Bell, Tim; Rosamond, Frances; Casey, Nancy

The Multivariate Algorithmic Revolution and Beyond: Computer Science Unplugged and Related Projects in Math and Computer Science Popularization

View online
Schließen

Access

Full access (via DOI)

Show more show less

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Springer Berlin Heidelberg, 2012

Published in: The Multivariate Algorithmic Revolution and Beyond
Sam, Emmanuel; Fellows, Michael; Rosamond, Frances; Golovach, Petr A.

Lecture Notes in Computer Science: On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves

View online
Schließen

Access

Full access (via DOI)

Show more show less

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Springer International Publishing, 2023

Published in: Lecture Notes in Computer Science
Fellows, Michael R.; Kulik, Ariel; Rosamond, Frances; Shachnai, Hadas

Parameterized approximation via fidelity preserving transformations

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Elsevier BV, 2018

Published in: Journal of Computer and System Sciences
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances; Shachnai, Hadas

Tractable Parameterizations for the Minimum Linear Arrangement Problem

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Association for Computing Machinery (ACM), 2016

Published in: ACM Transactions on Computation Theory
Fellows, Michael; Friedrich, Tobias; Hermelin, Danny; Narodytska, Nina; Rosamond, Frances

Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Elsevier BV, 2013

Published in: Theoretical Computer Science
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances A.; Shachnai, Hadas

Lecture Notes in Computer Science: Tractable Parameterizations for the Minimum Linear Arrangement Problem

View online
Schließen

Access

Full access (via DOI)

Show more show less

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Springer Berlin Heidelberg, 2013

Published in: Lecture Notes in Computer Science
Fellows, Michael R.; Jansen, Bart M.P.; Rosamond, Frances

Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Elsevier BV, 2013

Published in: European Journal of Combinatorics
Fellows, Michael R.; Kulik, Ariel; Rosamond, Frances; Shachnai, Hadas

Automata, Languages, and Programming: Parameterized Approximation via Fidelity Preserving Transformations

View online
Schließen

Access

Full access (via DOI)

Show more show less

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Springer Berlin Heidelberg, 2012

Published in: Automata, Languages, and Programming
Dom, Michael; Fellows, Michael R.; Rosamond, Frances A.; Sikdar, Somnath

The Parameterized Complexity of Stabbing Rectangles

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Springer Science and Business Media LLC, 2012

Published in: Algorithmica
Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances A.

Parameterizing by the Number of Numbers

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Springer Science and Business Media LLC, 2012

Published in: Theory of Computing Systems
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances A.

Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Springer Science and Business Media LLC, 2012

Published in: Algorithmica
Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances A.

Parameterized and Exact Computation: Parameterizing by the Number of Numbers

View online
Schließen

Access

Full access (via DOI)

Show more show less

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Springer Berlin Heidelberg, 2010

Published in: Parameterized and Exact Computation
Fellows, Michael; Flum, Jörg; Hermelin, Danny; Müller, Moritz; Rosamond, Frances

W-Hierarchies Defined by Symmetric Gates

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Springer Science and Business Media LLC, 2010

Published in: Theory of Computing Systems
Fellows, Michael R.; Rosamond, Frances A.; Rotics, Udi; Szeider, Stefan

Clique-Width is NP-Complete

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Society for Industrial & Applied Mathematics (SIAM), 2009

Published in: SIAM Journal on Discrete Mathematics
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances; Vialette, Stéphane

On the parameterized complexity of multiple-interval graph problems

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Elsevier BV, 2009

Published in: Theoretical Computer Science
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances A.

Parameterized and Exact Computation: Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs

View online
Schließen

Access

Full access (via DOI)

Show more show less

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Springer Berlin Heidelberg, 2009

Published in: Parameterized and Exact Computation
Dom, Michael; Fellows, Michael R.; Rosamond, Frances A.

WALCOM: Algorithms and Computation: Parameterized Complexity of Stabbing Rectangles and Squares in the Plane

View online
Schließen

Access

Full access (via DOI)

Show more show less

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Springer Berlin Heidelberg, 2009

Published in: WALCOM: Algorithms and Computation
Cai, Liming; Fellows, Michael; Juedes, David; Rosamond, Frances

The Complexity of Polynomial-Time Approximation

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Springer Science and Business Media LLC, 2007

Published in: Theory of Computing Systems
Dehne, Frank; Fellows, Michael; Langston, Michael; Rosamond, Frances; Stevens, Kim

An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Springer Science and Business Media LLC, 2007

Published in: Theory of Computing Systems
Christian, Robin; Fellows, Mike; Rosamond, Frances; Slinko, Arkadii

On complexity of lobbying in multiple referenda

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Springer Science and Business Media LLC, 2007

Published in: Review of Economic Design

You did not find what you were looking for?

Purchase suggestion
Are you missing something you need for your research? If you have any suggestions please share them here.

Interlibrary Loan
Please search and order your favorite title in the Interlibrary Loan Portal.

Search in field:

Recently searched for:

You did not find what you were looking for?

> Year of publication

Year of publication