Tight lower bounds for certain parameterized NP-hard problems
Chen, Jianer, Chor, Benny, Fellows, Mike, Huang, Xiuzhen, Juedes, David, Kanj, Iyad A., Xia, Ge
Published in Information and computation (15.09.2005)
Published in Information and computation (15.09.2005)
Get full text
Journal Article
On the parameterized complexity of multiple-interval graph problems
Fellows, Michael R., Hermelin, Danny, Rosamond, Frances, Vialette, Stéphane
Published in Theoretical computer science (01.01.2009)
Published in Theoretical computer science (01.01.2009)
Get full text
Journal Article
Corrigendum to “Advice classes of parameterized tractability” [Ann. Pure Appl. Logic 84 (1) (1997) 119–138]
Cai, Liming, Chen, Jainer, Downey, Rod, Fellows, Mike
Published in Annals of pure and applied logic (01.05.2018)
Published in Annals of pure and applied logic (01.05.2018)
Get full text
Journal Article
Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps
Chor, Benny, Fellows, Mike, Juedes, David
Published in Graph-Theoretic Concepts in Computer Science (2004)
Published in Graph-Theoretic Concepts in Computer Science (2004)
Get full text
Book Chapter
Conference Proceeding
On complexity of lobbying in multiple referenda
Christian, Robin, Fellows, Mike, Rosamond, Frances, Slinko, Arkadii
Published in Review of economic design (01.11.2007)
Published in Review of economic design (01.11.2007)
Get full text
Journal Article
Finding k Disjoint Triangles in an Arbitrary Graph
Fellows, Mike, Heggernes, Pinar, Rosamond, Frances, Sloper, Christian, Telle, Jan Arne
Published in Graph-Theoretic Concepts in Computer Science (2004)
Published in Graph-Theoretic Concepts in Computer Science (2004)
Get full text
Book Chapter
Conference Proceeding
Explaining cryptographic systems
Bell, Tim, Thimbleby, Harold, Fellows, Mike, Witten, Ian, Koblitz, Neil, Powell, Matthew
Published in Computers and education (01.04.2003)
Published in Computers and education (01.04.2003)
Get full text
Journal Article
Tight lower bounds for certain parameterized NP-hard problems
Chen, J., Chor, B., Fellows, M., Xiuzhen Huang, Juedes, D., Kanj, I., Ge Xia
Published in Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004 (2004)
Published in Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004 (2004)
Get full text
Conference Proceeding
On complexity of lobbying in multiple referenda
Rosamond, Frances, Fellows, Mike, Slinko, Arkadii, Christian, Robin
Published in Review of Economic Design (2007)
Get more information
Published in Review of Economic Design (2007)
Journal Article
On Complexity of Lobbying in Multiple Referenda
CHRISTIAN, Robin, FELLOWS, Mike, ROSAMOND, Frances
Published in IDEAS Working Paper Series from RePEc (01.01.2006)
Get full text
Published in IDEAS Working Paper Series from RePEc (01.01.2006)
Paper