Sam, Emmanuel; Fellows, Michael; Rosamond, Frances; Golovach, Petr A. On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves. (English) Zbl 07745718 Mavronicolas, Marios (ed.), Algorithms and complexity. 13th international conference, CIAC 2023, Larnaca, Cyprus, June 13–16, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13898, 353-367 (2023). MSC: 68Wxx PDFBibTeX XMLCite \textit{E. Sam} et al., Lect. Notes Comput. Sci. 13898, 353--367 (2023; Zbl 07745718) Full Text: DOI
Baste, Julien; Fellows, Michael R.; Jaffke, Lars; Masařík, Tomáš; de Oliveira Oliveira, Mateus; Philip, Geevarghese; Rosamond, Frances A. Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory. (English) Zbl 07482897 Artif. Intell. 303, Article ID 103644, 15 p. (2022). MSC: 68Txx PDFBibTeX XMLCite \textit{J. Baste} et al., Artif. Intell. 303, Article ID 103644, 15 p. (2022; Zbl 07482897) Full Text: DOI arXiv
Fellows, Michael R.; Rosamond, Frances A. Collaborating with Hans: some remaining wonderments. (English) Zbl 07604201 Fomin, Fedor V. (ed.) et al., Treewidth, kernels, and algorithms. Essays dedicated to Hans L. Bodlaender on the occasion of his 60th birthday. Cham: Springer. Lect. Notes Comput. Sci. 12160, 7-17 (2020). MSC: 68-XX PDFBibTeX XMLCite \textit{M. R. Fellows} and \textit{F. A. Rosamond}, Lect. Notes Comput. Sci. 12160, 7--17 (2020; Zbl 07604201) Full Text: DOI
Fellows, Michael R.; Rosamond, Frances A.; da Silva, Maise Dantas; Souza, Uéverton S. A survey on the complexity of flood-filling games. (English) Zbl 1514.68214 Böckenhauer, Hans-Joachim (ed.) et al., Adventures between lower bounds and higher altitudes. Essays dedicated to Juraj Hromkovič on the occasion of his 60th birthday. Cham: Springer. Lect. Notes Comput. Sci. 11011, 357-376 (2018). MSC: 68R10 05C57 05C85 68Q27 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Lect. Notes Comput. Sci. 11011, 357--376 (2018; Zbl 1514.68214) Full Text: DOI
Fellows, Michael R.; Jaffke, Lars; Király, Aliz Izabella; Rosamond, Frances A.; Weller, Mathias What is known about vertex cover kernelization? (English) Zbl 1514.68213 Böckenhauer, Hans-Joachim (ed.) et al., Adventures between lower bounds and higher altitudes. Essays dedicated to Juraj Hromkovič on the occasion of his 60th birthday. Cham: Springer. Lect. Notes Comput. Sci. 11011, 330-356 (2018). MSC: 68R10 05C70 68Q27 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Lect. Notes Comput. Sci. 11011, 330--356 (2018; Zbl 1514.68213) Full Text: DOI arXiv
Fellows, Michael; Protti, Fábio; Rosamond, Frances; da Silva, Maise Dantas; Souza, Uéverton S. Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number. (English) Zbl 1387.05197 Discrete Appl. Math. 245, 94-100 (2018). MSC: 05C70 05C15 68Q17 05C57 PDFBibTeX XMLCite \textit{M. Fellows} et al., Discrete Appl. Math. 245, 94--100 (2018; Zbl 1387.05197) Full Text: DOI
Fellows, Michael; Rosamond, Frances A brief history of Edward K. Blum and the Journal of Computer and System Sciences. (English) Zbl 1390.01075 J. Comput. Syst. Sci. 94, 2-10 (2018). MSC: 01A70 68-03 PDFBibTeX XMLCite \textit{M. Fellows} and \textit{F. Rosamond}, J. Comput. Syst. Sci. 94, 2--10 (2018; Zbl 1390.01075) Full Text: DOI
Cai, Liming; Chen, Jainer; Downey, Rod; Fellows, Mike Corrigendum to: “Advice classes of parameterized tractability”. (English) Zbl 1382.68083 Ann. Pure Appl. Logic 169, No. 5, 463-465 (2018). MSC: 68Q15 03D15 68Q25 PDFBibTeX XMLCite \textit{L. Cai} et al., Ann. Pure Appl. Logic 169, No. 5, 463--465 (2018; Zbl 1382.68083) Full Text: DOI
Fellows, Michael R.; Kulik, Ariel; Rosamond, Frances; Shachnai, Hadas Parameterized approximation via fidelity preserving transformations. (English) Zbl 1382.68105 J. Comput. Syst. Sci. 93, 30-40 (2018). MSC: 68Q25 68W25 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., J. Comput. Syst. Sci. 93, 30--40 (2018; Zbl 1382.68105) Full Text: DOI
Fellows, Michael R. Surfing with Rod. (English) Zbl 1359.01039 Day, Adam (ed.) et al., Computability and complexity. Essays dedicated to Rodney G. Downey on the occasion of his 60th birthday. Cham: Springer (ISBN 978-3-319-50061-4/pbk; 978-3-319-50062-1/ebook). Lecture Notes in Computer Science 10010, 9-18 (2017). MSC: 01A70 68-03 PDFBibTeX XMLCite \textit{M. R. Fellows}, Lect. Notes Comput. Sci. 10010, 9--18 (2017; Zbl 1359.01039) Full Text: DOI
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances; Shachnai, Hadas Tractable parameterizations for the minimum linear arrangement problem. (English) Zbl 1427.68118 ACM Trans. Comput. Theory 8, No. 2, Article No. 6, 12 p. (2016). MSC: 68Q25 05C85 68R10 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., ACM Trans. Comput. Theory 8, No. 2, Article No. 6, 12 p. (2016; Zbl 1427.68118) Full Text: DOI
dos Santos Souza, Uéverton; Rosamond, Frances; Fellows, Michael R.; Protti, Fábio; Dantas da Silva, Maise The Flood-It game parameterized by the vertex cover number. (English) Zbl 1347.05122 Campêlo, Manoel (ed.) et al., LAGOS ’15. Selected papers of the 8th Latin-American algorithms, graphs, and optimization symposium, Praia das Fontes, Beberibe, Brazil, May 11–15, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 50, 35-40, electronic only (2015). MSC: 05C57 05C15 91A43 68Q17 91A46 PDFBibTeX XMLCite \textit{U. dos Santos Souza} et al., Electron. Notes Discrete Math. 50, 35--40 (2015; Zbl 1347.05122) Full Text: DOI
van Bevern, René; Downey, Rodney G.; Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances A. Myhill-Nerode methods for hypergraphs. (English) Zbl 1335.68098 Algorithmica 73, No. 4, 696-729 (2015). MSC: 68Q17 05C65 05C85 68Q45 PDFBibTeX XMLCite \textit{R. van Bevern} et al., Algorithmica 73, No. 4, 696--729 (2015; Zbl 1335.68098) Full Text: DOI arXiv
Abu-Khzam, Faisal N.; Egan, Judith; Fellows, Michael R.; Rosamond, Frances A.; Shaw, Peter On the parameterized complexity of dynamic problems. (English) Zbl 1333.68130 Theor. Comput. Sci. 607, Part 3, 426-434 (2015). MSC: 68Q25 05C69 68Q17 PDFBibTeX XMLCite \textit{F. N. Abu-Khzam} et al., Theor. Comput. Sci. 607, Part 3, 426--434 (2015; Zbl 1333.68130) Full Text: DOI
Fellows, Michael R.; dos Santos Souza, Uéverton; Protti, Fábio; Dantas da Silva, Maise Tractability and hardness of flood-filling games on trees. (English) Zbl 1312.68090 Theor. Comput. Sci. 576, 102-116 (2015). MSC: 68Q17 05C15 05C57 92D15 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Theor. Comput. Sci. 576, 102--116 (2015; Zbl 1312.68090) Full Text: DOI
Erdélyi, Gábor; Fellows, Michael R.; Rothe, Jörg; Schend, Lena Control complexity in Bucklin and fallback voting: an experimental analysis. (English) Zbl 1320.91056 J. Comput. Syst. Sci. 81, No. 4, 661-670 (2015). MSC: 91B14 91B12 68Q25 91A90 91B06 PDFBibTeX XMLCite \textit{G. Erdélyi} et al., J. Comput. Syst. Sci. 81, No. 4, 661--670 (2015; Zbl 1320.91056) Full Text: DOI
Erdélyi, Gábor; Fellows, Michael R.; Rothe, Jörg; Schend, Lena Control complexity in Bucklin and fallback voting: a theoretical analysis. (English) Zbl 1320.91055 J. Comput. Syst. Sci. 81, No. 4, 632-660 (2015). MSC: 91B14 91B12 68Q25 PDFBibTeX XMLCite \textit{G. Erdélyi} et al., J. Comput. Syst. Sci. 81, No. 4, 632--660 (2015; Zbl 1320.91055) Full Text: DOI
Downey, Rodney G.; Egan, Judith; Fellows, Michael R.; Rosamond, Frances A.; Shaw, Peter Dynamic dominating set and turbo-charging greedy heuristics. (English) Zbl 1485.68244 Tsinghua Sci. Technol. 19, No. 4, 329-337 (2014). MSC: 68T20 05C69 68Q27 PDFBibTeX XMLCite \textit{R. G. Downey} et al., Tsinghua Sci. Technol. 19, No. 4, 329--337 (2014; Zbl 1485.68244)
Fellows, Michael R.; Jansen, Bart M. P. FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders. (English) Zbl 1347.68167 ACM Trans. Comput. Theory 6, No. 4, Article No. 16, 26 p. (2014). MSC: 68Q17 05C85 68Q25 PDFBibTeX XMLCite \textit{M. R. Fellows} and \textit{B. M. P. Jansen}, ACM Trans. Comput. Theory 6, No. 4, Article No. 16, 26 p. (2014; Zbl 1347.68167) Full Text: DOI
Abu-Khzam, Faisal N.; Egan, Judith; Fellows, Michael R.; Rosamond, Frances A.; Shaw, Peter On the parameterized complexity of dynamic problems with connectivity constraints. (English) Zbl 1434.68204 Zhang, Zhao (ed.) et al., Combinatorial optimization and applications. 8th international conference, COCOA 2014, Wailea, Maui, HI, USA, December 19–21, 2014. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 8881, 625-636 (2014). MSC: 68Q27 05C69 68Q17 PDFBibTeX XMLCite \textit{F. N. Abu-Khzam} et al., Lect. Notes Comput. Sci. 8881, 625--636 (2014; Zbl 1434.68204) Full Text: DOI
Bazgan, Cristina; Chopin, Morgan; Cygan, Marek; Fellows, Michael R.; Fomin, Fedor V.; van Leeuwen, Erik Jan Parameterized complexity of firefighting. (English) Zbl 1411.68046 J. Comput. Syst. Sci. 80, No. 7, 1285-1297 (2014). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{C. Bazgan} et al., J. Comput. Syst. Sci. 80, No. 7, 1285--1297 (2014; Zbl 1411.68046) Full Text: DOI
Crowston, R.; Fellows, M.; Gutin, G.; Jones, M.; Kim, E. J.; Rosamond, F.; Ruzsa, I. Z.; Thomassé, S.; Yeo, A. Satisfying more than half of a system of linear equations over GF(2): a multivariate approach. (English) Zbl 1285.68053 J. Comput. Syst. Sci. 80, No. 4, 687-696 (2014). MSC: 68Q17 68Q25 15A60 05C50 68R10 PDFBibTeX XMLCite \textit{R. Crowston} et al., J. Comput. Syst. Sci. 80, No. 4, 687--696 (2014; Zbl 1285.68053) Full Text: DOI Link
Fellows, Michael; Fomin, Fedor V.; Lokshtanov, Daniel; Losievskaja, Elena; Rosamond, Frances; Saurabh, Saket Distortion is fixed parameter tractable. (English) Zbl 1322.68102 ACM Trans. Comput. Theory 5, No. 4, Article No. 16, 20 p. (2013). MSC: 68Q25 05C12 68Q17 PDFBibTeX XMLCite \textit{M. Fellows} et al., ACM Trans. Comput. Theory 5, No. 4, Article No. 16, 20 p. (2013; Zbl 1322.68102) Full Text: DOI
van Bevern, René; Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances A. Myhill-Nerode methods for hypergraphs. (English) Zbl 1329.68129 Cai, Leizhen (ed.) et al., Algorithms and computation. 24th international symposium, ISAAC 2013, Hong Kong, China, December 16–18, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-45029-7/pbk). Lecture Notes in Computer Science 8283, 372-382 (2013). MSC: 68Q17 05C65 05C85 68Q45 PDFBibTeX XMLCite \textit{R. van Bevern} et al., Lect. Notes Comput. Sci. 8283, 372--382 (2013; Zbl 1329.68129) Full Text: DOI arXiv
Fellows, Michael R.; Jansen, Bart M. P. FPT is characterized by useful obstruction sets. (English) Zbl 1417.68051 Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 39th international workshop, WG 2013, Lübeck, Germany, June 19–21, 2013. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 8165, 261-273 (2013). MSC: 68Q17 05C85 68Q25 PDFBibTeX XMLCite \textit{M. R. Fellows} and \textit{B. M. P. Jansen}, Lect. Notes Comput. Sci. 8165, 261--273 (2013; Zbl 1417.68051) Full Text: DOI arXiv
Downey, Rodney G.; Fellows, Michael R. Fundamentals of parameterized complexity. (English) Zbl 1358.68006 Texts in Computer Science. London: Springer (ISBN 978-1-4471-5558-4/hbk; 978-1-4471-5559-1/ebook). xxx, 763 p. (2013). Reviewer: Marius Zimand (Towson) MSC: 68-02 68Q15 68Q17 68Q25 68W01 PDFBibTeX XMLCite \textit{R. G. Downey} and \textit{M. R. Fellows}, Fundamentals of parameterized complexity. London: Springer (2013; Zbl 1358.68006) Full Text: DOI
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances A.; Shachnai, Hadas Tractable parameterizations for the minimum linear arrangement problem. (English) Zbl 1394.68441 Bodlaender, Hans L. (ed.) et al., Algorithms – ESA 2013. 21st annual European symposium, Sophia Antipolis, France, September 2–4, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40449-8/pbk). Lecture Notes in Computer Science 8125, 457-468 (2013). MSC: 68W25 05C62 05C85 68R10 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Lect. Notes Comput. Sci. 8125, 457--468 (2013; Zbl 1394.68441) Full Text: DOI
Fellows, Michael; Friedrich, Tobias; Hermelin, Danny; Narodytska, Nina; Rosamond, Frances Constraint satisfaction problems: convexity makes AllDifferent constraints tractable. (English) Zbl 1257.68079 Theor. Comput. Sci. 472, 81-89 (2013). MSC: 68Q25 90C27 90C25 PDFBibTeX XMLCite \textit{M. Fellows} et al., Theor. Comput. Sci. 472, 81--89 (2013; Zbl 1257.68079) Full Text: DOI
Fellows, Michael R.; Jansen, Bart M. P.; Rosamond, Frances Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity. (English) Zbl 1448.68465 Eur. J. Comb. 34, No. 3, 541-566 (2013). MSC: 68W01 05C85 68Q25 68Q27 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Eur. J. Comb. 34, No. 3, 541--566 (2013; Zbl 1448.68465) Full Text: DOI
Fellows, Michael R.; Kulik, Ariel; Rosamond, Frances; Shachnai, Hadas Parameterized approximation via fidelity preserving transformations. (English) Zbl 1272.68459 Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Warwick, UK, July 9–13, 2012. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-31593-0/pbk). Lecture Notes in Computer Science 7391, 351-362 (2012). MSC: 68W25 68Q25 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Lect. Notes Comput. Sci. 7391, 351--362 (2012; Zbl 1272.68459) Full Text: DOI
Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances A. Parameterizing by the number of numbers. (English) Zbl 1253.68173 Theory Comput. Syst. 50, No. 4, 675-693 (2012). MSC: 68Q25 68Q45 68Q17 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Theory Comput. Syst. 50, No. 4, 675--693 (2012; Zbl 1253.68173) Full Text: DOI arXiv
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances A. Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications. (English) Zbl 1264.05131 Algorithmica 64, No. 1, 3-18 (2012). Reviewer: Haiko Müller (Leeds) MSC: 05C83 06A06 68R10 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Algorithmica 64, No. 1, 3--18 (2012; Zbl 1264.05131) Full Text: DOI
Fellows, Michael R.; Fomin, Fedor V.; Lokshtanov, Daniel; Rosamond, Frances; Saurabh, Saket; Villanger, Yngve Local search: is brute-force avoidable? (English) Zbl 1244.68070 J. Comput. Syst. Sci. 78, No. 3, 707-719 (2012). MSC: 68T20 68R10 68Q25 05C85 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., J. Comput. Syst. Sci. 78, No. 3, 707--719 (2012; Zbl 1244.68070) Full Text: DOI
Dom, Michael; Fellows, Michael R.; Rosamond, Frances A.; Sikdar, Somnath The parameterized complexity of stabbing rectangles. (English) Zbl 1236.68083 Algorithmica 62, No. 1-2, 564-594 (2012). MSC: 68Q17 68U05 PDFBibTeX XMLCite \textit{M. Dom} et al., Algorithmica 62, No. 1--2, 564--594 (2012; Zbl 1236.68083) Full Text: DOI
Fellows, Michael R.; Guo, Jiong; Moser, Hannes; Niedermeier, Rolf A complexity dichotomy for finding disjoint solutions of vertex deletion problems. (English) Zbl 1322.68101 ACM Trans. Comput. Theory 2, No. 2, Article No. 5, 23 p. (2011). MSC: 68Q25 05C85 68Q17 90C35 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., ACM Trans. Comput. Theory 2, No. 2, Article No. 5, 23 p. (2011; Zbl 1322.68101) Full Text: DOI
Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances Multivariate complexity theory. (English) Zbl 1281.68123 Blum, Edward K. (ed.) et al., Computer science. The hardware, software and heart of it. Berlin: Springer (ISBN 978-1-4614-1167-3/hbk; 978-1-4614-1168-0/ebook). 269-293 (2011). MSC: 68Q17 68Q15 68W40 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., in: Computer science. The hardware, software and heart of it. Berlin: Springer. 269--293 (2011; Zbl 1281.68123) Full Text: DOI
Fellows, Michael R.; Guo, Jiong; Komusiewicz, Christian; Niedermeier, Rolf; Uhlmann, Johannes Graph-based data clustering with overlaps. (English) Zbl 1248.90070 Discrete Optim. 8, No. 1, 2-17 (2011). MSC: 90C35 90C60 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Discrete Optim. 8, No. 1, 2--17 (2011; Zbl 1248.90070) Full Text: DOI
Crowston, Robert; Fellows, Michael; Gutin, Gregory; Jones, Mark; Rosamond, Frances; Thomassé, Stéphan; Yeo, Anders Simultaneously satisfying linear equations over \(\mathbb {F}_2\): MaxLin2 and Max-\(r\)-Lin2 parameterized above average. (English) Zbl 1246.68129 Chakraborthy, Supraik (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2011), Mumbai, India, December 12–14, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-34-7). LIPIcs – Leibniz International Proceedings in Informatics 13, 229-240, electronic only (2011). MSC: 68Q25 PDFBibTeX XMLCite \textit{R. Crowston} et al., LIPIcs -- Leibniz Int. Proc. Inform. 13, 229--240 (2011; Zbl 1246.68129) Full Text: DOI
Fellows, Michael R.; Guo, Jiong; Moser, Hannes; Niedermeier, Rolf A generalization of Nemhauser and Trotter’s local optimization theorem. (English) Zbl 1235.68081 J. Comput. Syst. Sci. 77, No. 6, 1141-1158 (2011). MSC: 68Q25 68Q17 05C85 05C07 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., J. Comput. Syst. Sci. 77, No. 6, 1141--1158 (2011; Zbl 1235.68081) Full Text: DOI
Bazgan, Cristina; Chopin, Morgan; Fellows, Michael R. Parameterized complexity of the firefighter problem. (English) Zbl 1350.68128 Asano, Takao (ed.) et al., Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5–8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25590-8/pbk). Lecture Notes in Computer Science 7074, 643-652 (2011). MSC: 68Q25 05C35 68Q17 PDFBibTeX XMLCite \textit{C. Bazgan} et al., Lect. Notes Comput. Sci. 7074, 643--652 (2011; Zbl 1350.68128) Full Text: DOI
Bodlaender, Hans L.; Fellows, Michael R.; Langston, Michael A.; Ragan, Mark A.; Rosamond, Frances A.; Weyer, Mark Quadratic kernelization for convex recoloring of trees. (English) Zbl 1234.68146 Algorithmica 61, No. 2, 362-388 (2011). MSC: 68Q25 68R10 05C15 05C85 68Q17 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., Algorithmica 61, No. 2, 362--388 (2011; Zbl 1234.68146) Full Text: DOI
Fellows, Michael R.; Fernau, Henning Facility location problems: a parameterized view. (English) Zbl 1218.90100 Discrete Appl. Math. 159, No. 11, 1118-1130 (2011). MSC: 90B80 90C60 90C90 PDFBibTeX XMLCite \textit{M. R. Fellows} and \textit{H. Fernau}, Discrete Appl. Math. 159, No. 11, 1118--1130 (2011; Zbl 1218.90100) Full Text: DOI
Fellows, Michael R. Recent developments in the theory of pre-processing. (English) Zbl 1329.68138 Atallah, Mikhail (ed.) et al., Frontiers in algorithmics and algorithmic aspects in information and management. Joint international conference, FAW-AAIM 2011, Jinhua, China, May 28–31, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21203-1/pbk). Lecture Notes in Computer Science 6681, 4-5 (2011). MSC: 68Q25 68Q17 PDFBibTeX XMLCite \textit{M. R. Fellows}, Lect. Notes Comput. Sci. 6681, 4--5 (2011; Zbl 1329.68138) Full Text: DOI
Fellows, Michael R.; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane Upper and lower bounds for finding connected motifs in vertex-colored graphs. (English) Zbl 1210.68060 J. Comput. Syst. Sci. 77, No. 4, 799-811 (2011). MSC: 68Q25 05C15 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., J. Comput. Syst. Sci. 77, No. 4, 799--811 (2011; Zbl 1210.68060) Full Text: DOI
Fellows, Michael R.; Fomin, Fedor V.; Lokshtanov, Daniel; Rosamond, Frances; Saurabh, Saket; Szeider, Stefan; Thomassen, Carsten On the complexity of some colorful problems parameterized by treewidth. (English) Zbl 1223.05070 Inf. Comput. 209, No. 2, 143-153 (2011). MSC: 05C15 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Inf. Comput. 209, No. 2, 143--153 (2011; Zbl 1223.05070) Full Text: DOI Link
Fellows, Michael; Jansen, Bart M. P.; Lokshtanov, Daniel; Rosamond, Frances A.; Saurabh, Saket Determining the winner of a Dodgson election is hard. (English) Zbl 1245.68091 Lodaya, Kamal (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2010), December 15–18, 2010, Chennai, India. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-23-1). LIPIcs – Leibniz International Proceedings in Informatics 8, 459-468, electronic only (2010). MSC: 68Q17 68Q25 91B12 PDFBibTeX XMLCite \textit{M. Fellows} et al., LIPIcs -- Leibniz Int. Proc. Inform. 8, 459--468 (2010; Zbl 1245.68091) Full Text: DOI Link
Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances A. Parameterizing by the number of numbers. (English) Zbl 1309.68092 Raman, Venkatesh (ed.) et al., Parameterized and exact computation. 5th international symposium, IPEC 2010, Chennai, India, December 13–15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-17492-6/pbk). Lecture Notes in Computer Science 6478, 123-134 (2010). MSC: 68Q25 68Q17 68Q45 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Lect. Notes Comput. Sci. 6478, 123--134 (2010; Zbl 1309.68092) Full Text: DOI arXiv
Fellows, Mike; Giannopoulos, Panos; Knauer, Christian; Paul, Christophe; Rosamond, Frances; Whitesides, Sue; Yu, Nathan Milling a graph with turn costs: a parameterized complexity perspective. (English) Zbl 1309.68093 Thilikos, Dimitrios M. (ed.), Graph theoretic concepts in computer science. 36th international workshop, WG 2010, Zarós, Crete, Greece, June 28–30, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-16925-0/pbk). Lecture Notes in Computer Science 6410, 123-134 (2010). MSC: 68Q25 05C12 05C85 PDFBibTeX XMLCite \textit{M. Fellows} et al., Lect. Notes Comput. Sci. 6410, 123--134 (2010; Zbl 1309.68093) Full Text: DOI
Fellows, Michael R.; Guo, Jiong; Kanj, Iyad The parameterized complexity of some minimum label problems. (English) Zbl 1214.05150 J. Comput. Syst. Sci. 76, No. 8, 727-740 (2010). MSC: 05C78 05C35 68R10 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., J. Comput. Syst. Sci. 76, No. 8, 727--740 (2010; Zbl 1214.05150) Full Text: DOI
Chen, Zhi-Zhong; Fellows, Michael; Fu, Bin; Jiang, Haitao; Liu, Yang; Wang, Lusheng; Zhu, Binhai A linear kernel for co-path/cycle packing. (English) Zbl 1286.05131 Chen, Bo (ed.), Algorithmic aspects in information and management. 6th international conference, AAIM 2010, Weihai, China, July 19–21, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14354-0/pbk). Lecture Notes in Computer Science 6124, 90-102 (2010). MSC: 05C70 68Q17 68W25 PDFBibTeX XMLCite \textit{Z.-Z. Chen} et al., Lect. Notes Comput. Sci. 6124, 90--102 (2010; Zbl 1286.05131) Full Text: DOI
Fellows, Michael; Flum, Jörg; Hermelin, Danny; Müller, Moritz; Rosamond, Frances W-hierarchies defined by symmetric gates. (English) Zbl 1211.68217 Theory Comput. Syst. 46, No. 2, 311-339 (2010). MSC: 68Q25 68T20 68M07 PDFBibTeX XMLCite \textit{M. Fellows} et al., Theory Comput. Syst. 46, No. 2, 311--339 (2010; Zbl 1211.68217) Full Text: DOI
Bodlaender, Hans L.; Fellows, Michael R.; Heggernes, Pinar; Mancini, Federico; Papadopoulos, Charis; Rosamond, Frances Clustering with partial information. (English) Zbl 1213.05222 Theor. Comput. Sci. 411, No. 7-9, 1202-1211 (2010). MSC: 05C76 05C85 05C72 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., Theor. Comput. Sci. 411, No. 7--9, 1202--1211 (2010; Zbl 1213.05222) Full Text: DOI
Fellows, Michael R.; Guo, Jiong; Kanj, Iyad A. The parameterized complexity of some minimum label problems. (English) Zbl 1273.68166 Paul, Christophe (ed.) et al., Graph-theoretic concepts in computer science. 35th international workshop, WG 2009, Montpellier, France, June 24–26, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-11408-3/pbk). Lecture Notes in Computer Science 5911, 88-99 (2010). MSC: 68Q25 05C78 05C85 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Lect. Notes Comput. Sci. 5911, 88--99 (2010; Zbl 1273.68166) Full Text: DOI
Fellows, Michael R.; Guo, Jiong; Moser, Hannes; Niedermeier, Rolf A generalization of Nemhauser and Trotter’s local optimization theorem. (English) Zbl 1236.68086 Albers, Susanne (ed.) et al., STACS 2009. 26th international symposium on theoretical aspects of computer science, Freiburg, Germany, February 26–28, 2009. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-09-5). LIPIcs – Leibniz International Proceedings in Informatics 3, 409-420, electronic only (2009). MSC: 68Q17 05C85 05C07 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., LIPIcs -- Leibniz Int. Proc. Inform. 3, 409--420 (2009; Zbl 1236.68086) Full Text: DOI Link
Downey, Rodney G.; Fellows, Michael R.; McCartin, Catherine; Rosamond, Frances Parameterized approximation of dominating set problems. (English) Zbl 1191.68862 Inf. Process. Lett. 109, No. 1, 68-70 (2009). MSC: 68W25 PDFBibTeX XMLCite \textit{R. G. Downey} et al., Inf. Process. Lett. 109, No. 1, 68--70 (2009; Zbl 1191.68862) Full Text: DOI
Fellows, Michael R.; Rosamond, Frances A.; Rotics, Udi; Szeider, Stefan Clique-width is NP-complete. (English) Zbl 1207.68159 SIAM J. Discrete Math. 23, No. 2, 909-939 (2009). MSC: 68Q17 05C75 68Q42 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., SIAM J. Discrete Math. 23, No. 2, 909--939 (2009; Zbl 1207.68159) Full Text: DOI Link
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances A. Well-quasi-orders in subclasses of bounded treewidth graphs. (English) Zbl 1264.68120 Chen, Jianer (ed.) et al., Parameterized and exact computation. 4th international workshop, IWPEC 2009, Copenhagen, Denmark, September 10–11, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-11268-3/pbk). Lecture Notes in Computer Science 5917, 149-160 (2009). MSC: 68R10 05C85 06A99 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Lect. Notes Comput. Sci. 5917, 149--160 (2009; Zbl 1264.68120) Full Text: DOI
Enciso, Rosa; Fellows, Michael R.; Guo, Jiong; Kanj, Iyad; Rosamond, Frances; Suchý, Ondřej What makes equitable connected partition easy. (English) Zbl 1273.68164 Chen, Jianer (ed.) et al., Parameterized and exact computation. 4th international workshop, IWPEC 2009, Copenhagen, Denmark, September 10–11, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-11268-3/pbk). Lecture Notes in Computer Science 5917, 122-133 (2009). MSC: 68Q25 05C70 68Q17 PDFBibTeX XMLCite \textit{R. Enciso} et al., Lect. Notes Comput. Sci. 5917, 122--133 (2009; Zbl 1273.68164) Full Text: DOI
Fellows, Michael Towards fully multivariate algorithmics: some new results and directions in parameter ecology. (English) Zbl 1267.68302 Fiala, Jiří (ed.) et al., Combinatorial algorithms. 20th international workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28–July 2, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-10216-5/pbk). Lecture Notes in Computer Science 5874, 2-10 (2009). MSC: 68W01 05C85 68Q25 PDFBibTeX XMLCite \textit{M. Fellows}, Lect. Notes Comput. Sci. 5874, 2--10 (2009; Zbl 1267.68302) Full Text: DOI
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny On problems without polynomial kernels. (English) Zbl 1192.68288 J. Comput. Syst. Sci. 75, No. 8, 423-434 (2009). MSC: 68Q15 68Q17 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., J. Comput. Syst. Sci. 75, No. 8, 423--434 (2009; Zbl 1192.68288) Full Text: DOI
Betzler, Nadja; Fellows, Michael R.; Guo, Jiong; Niedermeier, Rolf; Rosamond, Frances A. Fixed-parameter algorithms for Kemeny rankings. (English) Zbl 1179.91062 Theor. Comput. Sci. 410, No. 45, 4554-4570 (2009). MSC: 91B12 68Q17 PDFBibTeX XMLCite \textit{N. Betzler} et al., Theor. Comput. Sci. 410, No. 45, 4554--4570 (2009; Zbl 1179.91062) Full Text: DOI
Fellows, Michael; Lokshtanov, Daniel; Misra, Neeldhara; Mnich, Matthias; Rosamond, Frances; Saurabh, Saket The complexity ecology of parameters: An illustration using bounded max leaf number. (English) Zbl 1184.05123 Theory Comput. Syst. 45, No. 4, 822-848 (2009). MSC: 05C85 68Q10 68Q25 PDFBibTeX XMLCite \textit{M. Fellows} et al., Theory Comput. Syst. 45, No. 4, 822--848 (2009; Zbl 1184.05123) Full Text: DOI
Fellows, Michael R.; Guo, Jiong; Moser, Hannes; Niedermeier, Rolf A complexity dichotomy for finding disjoint solutions of vertex deletion problems. (English) Zbl 1250.68125 Královič, Rastislav (ed.) et al., Mathematical foundations of computer science 2009. 34th international symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24–28, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03815-0/pbk). Lecture Notes in Computer Science 5734, 319-330 (2009). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Lect. Notes Comput. Sci. 5734, 319--330 (2009; Zbl 1250.68125) Full Text: DOI
Fellows, Michael R.; Guo, Jiong; Komusiewicz, Christian; Niedermeier, Rolf; Uhlmann, Johannes Graph-based data clustering with overlaps. (English) Zbl 1248.68377 Ngo, Hung Q. (ed.), Computing and combinatorics. 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13–15, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02881-6/pbk). Lecture Notes in Computer Science 5609, 516-526 (2009). MSC: 68R10 05C69 68Q25 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Lect. Notes Comput. Sci. 5609, 516--526 (2009; Zbl 1248.68377) Full Text: DOI
Fellows, Michael R.; Fomin, Fedor V.; Lokshtanov, Daniel; Losievskaja, Elena; Rosamond, Frances A.; Saurabh, Saket Distortion is fixed parameter tractable. (English) Zbl 1248.68244 Albers, Susanne (ed.) et al., Automata, languages and programming. 36th international colloquium, ICALP 2009, Rhodes, Greece, July 5–12, 2009. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-02926-4/pbk). Lecture Notes in Computer Science 5555, 463-474 (2009). MSC: 68Q25 05C12 05C85 68Q17 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Lect. Notes Comput. Sci. 5555, 463--474 (2009; Zbl 1248.68244) Full Text: DOI
Fellows, Michael R.; Hartman, Tzvika; Hermelin, Danny; Landau, Gad M.; Rosamond, Frances; Rozenberg, Liat Haplotype inference constrained by plausible haplotype data. (English) Zbl 1247.92017 Kucherov, Gregory (ed.) et al., Combinatorial pattern matching. 20th annual symposium, CPM 2009, Lille, France, June 22–24, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02440-5/pbk). Lecture Notes in Computer Science 5577, 339-352 (2009). MSC: 92D10 92C40 92D15 65Y20 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Lect. Notes Comput. Sci. 5577, 339--352 (2009; Zbl 1247.92017) Full Text: DOI
Bodlaender, Hans L.; Fellows, Michael R.; Thilikos, Dimitrios M. Derivation of algorithms for cutwidth and related graph layout parameters. (English) Zbl 1165.68523 J. Comput. Syst. Sci. 75, No. 4, 231-244 (2009). MSC: 68W05 68Q45 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., J. Comput. Syst. Sci. 75, No. 4, 231--244 (2009; Zbl 1165.68523) Full Text: DOI Link
Dom, Michael; Fellows, Michael R.; Rosamond, Frances A. Parameterized complexity of stabbing rectangles and squares in the plane. (English) Zbl 1211.68465 Das, Sandip (ed.) et al., WALCOM: Algorithms and computation. Third international workshop, WALCOM 2009, Kolkata, India, February 18–20, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00201-4/pbk). Lecture Notes in Computer Science 5431, 298-309 (2009). MSC: 68U05 68Q25 PDFBibTeX XMLCite \textit{M. Dom} et al., Lect. Notes Comput. Sci. 5431, 298--309 (2009; Zbl 1211.68465) Full Text: DOI
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances; Vialette, Stéphane On the parameterized complexity of multiple-interval graph problems. (English) Zbl 1161.68038 Theor. Comput. Sci. 410, No. 1, 53-61 (2009). MSC: 68R10 05C69 05C70 05C85 68Q17 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Theor. Comput. Sci. 410, No. 1, 53--61 (2009; Zbl 1161.68038) Full Text: DOI
Bodlaender, Hans L.; Fellows, Michael R.; Heggernes, Pinar; Mancini, Federico; Papadopoulos, Charis; Rosamond, Frances Clustering with partial information. (English) Zbl 1173.68596 Ochmański, Edward (ed.) et al., Mathematical foundations of computer science 2008. 33rd international symposium, MFCS 2008, Toruń Poland, August 25–29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85237-7/pbk). Lecture Notes in Computer Science 5162, 144-155 (2008). MSC: 68R10 05C69 05C85 68Q25 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., Lect. Notes Comput. Sci. 5162, 144--155 (2008; Zbl 1173.68596) Full Text: DOI
Fellows, Michael R.; Meister, Daniel; Rosamond, Frances A.; Sritharan, R.; Telle, Jan Arne Leaf powers and their properties: Using the trees. (English) Zbl 1183.68425 Hong, Seok-Hee (ed.) et al., Algorithms and computation. 19th international symposium, ISAAC 2008, Gold Coast, Australia, December 15–17, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-92181-3/pbk). Lecture Notes in Computer Science 5369, 402-413 (2008). MSC: 68R10 68Q45 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Lect. Notes Comput. Sci. 5369, 402--413 (2008; Zbl 1183.68425) Full Text: DOI
Fellows, Michael R.; Lokshtanov, Daniel; Misra, Neeldhara; Rosamond, Frances A.; Saurabh, Saket Graph layout problems parameterized by vertex cover. (English) Zbl 1183.68424 Hong, Seok-Hee (ed.) et al., Algorithms and computation. 19th international symposium, ISAAC 2008, Gold Coast, Australia, December 15–17, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-92181-3/pbk). Lecture Notes in Computer Science 5369, 294-305 (2008). MSC: 68R10 68Q25 90C35 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Lect. Notes Comput. Sci. 5369, 294--305 (2008; Zbl 1183.68424) Full Text: DOI Link
Dujmović, Vida; Fellows, Michael R.; Kitching, Matthew; Liotta, Giuseppe; McCartin, Catherine; Nishimura, Naomi; Ragde, Prabhakar; Rosamond, Frances; Whitesides, Sue; Wood, David R. On the parameterized complexity of layered graph drawing. (English) Zbl 1170.68028 Algorithmica 52, No. 2, 267-292 (2008). MSC: 68R10 05C62 05C85 68Q25 68U05 PDFBibTeX XMLCite \textit{V. Dujmović} et al., Algorithmica 52, No. 2, 267--292 (2008; Zbl 1170.68028) Full Text: DOI
Fellows, M. R.; Knauer, C.; Nishimura, N.; Ragde, P.; Rosamond, F.; Stege, U.; Thilikos, D. M.; Whitesides, S. Faster fixed-parameter tractable algorithms for matching and packing problems. (English) Zbl 1170.68047 Algorithmica 52, No. 2, 167-176 (2008). MSC: 68W05 05C70 05C85 68Q25 68W40 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Algorithmica 52, No. 2, 167--176 (2008; Zbl 1170.68047) Full Text: DOI
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny On problems without polynomial kernels (extended abstract). (English) Zbl 1153.68554 Aceto, Luca (ed.) et al., Automata, languages and programming. 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 7–11, 2008. Proceedings, Part I. Berlin: Springer (ISBN 978-3-540-70574-1/pbk). Lecture Notes in Computer Science 5125, 563-574 (2008). MSC: 68W05 68Q25 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., Lect. Notes Comput. Sci. 5125, 563--574 (2008; Zbl 1153.68554) Full Text: DOI
Fellows, Michael; Fernau, Henning Facility location problems: A parameterized view. (English) Zbl 1143.90354 Fleischer, Rudolf (ed.) et al., Algorithmic aspects in information and management. 4th international conference, AAIM 2008, Shanghai, China, June 23–25, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-68865-5/pbk). Lecture Notes in Computer Science 5034, 188-199 (2008). MSC: 90B80 PDFBibTeX XMLCite \textit{M. Fellows} and \textit{H. Fernau}, Lect. Notes Comput. Sci. 5034, 188--199 (2008; Zbl 1143.90354) Full Text: DOI
Betzler, Nadja; Fellows, Michael R.; Guo, Jiong; Niedermeier, Rolf; Rosamond, Frances A. Fixed-parameter algorithms for Kemeny scores. (English) Zbl 1143.91319 Fleischer, Rudolf (ed.) et al., Algorithmic aspects in information and management. 4th international conference, AAIM 2008, Shanghai, China, June 23–25, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-68865-5/pbk). Lecture Notes in Computer Science 5034, 60-71 (2008). MSC: 91B12 68W05 PDFBibTeX XMLCite \textit{N. Betzler} et al., Lect. Notes Comput. Sci. 5034, 60--71 (2008; Zbl 1143.91319) Full Text: DOI
Betzler, Nadja; Fellows, Michael R.; Komusiewicz, Christian; Niedermeier, Rolf Parameterized algorithms and hardness results for some graph motif problems. (English) Zbl 1143.68501 Ferragina, Paolo (ed.) et al., Combinatorial pattern matching. 19th annual symposium, CPM 2008, Pisa, Italy, June 18–20, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69066-5/pbk). Lecture Notes in Computer Science 5029, 31-43 (2008). MSC: 68R10 05C85 68Q17 68Q25 68W20 PDFBibTeX XMLCite \textit{N. Betzler} et al., Lect. Notes Comput. Sci. 5029, 31--43 (2008; Zbl 1143.68501) Full Text: DOI Link
Fellows, Michael; Hermelin, Danny; Müller, Moritz; Rosamond, Frances A purely democratic characterization of W[1]. (English) Zbl 1142.68359 Grohe, Martin (ed.) et al., Parameterized and exact computation. Third international workshop, IWPEC 2008, Victoria, Canada, May 14–16, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79722-7/pbk). Lecture Notes in Computer Science 5018, 103-114 (2008). MSC: 68Q15 94C10 PDFBibTeX XMLCite \textit{M. Fellows} et al., Lect. Notes Comput. Sci. 5018, 103--114 (2008; Zbl 1142.68359) Full Text: DOI
Bodlaender, Hans L.; Fellows, Michael R.; Langston, Michael A.; Ragan, Mark A.; Rosamond, Frances A.; Weyer, Mark Quadratic kernelization for convex recoloring of trees. (English) Zbl 1206.68141 Lin, Guohui (ed.), Computing and combinatorics. 13th annual international conference, COCOON 2007, Banff, Canada, July 16–19, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73544-1/pbk). Lecture Notes in Computer Science 4598, 86-96 (2007). MSC: 68Q25 05C05 92D15 05C15 05C85 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., Lect. Notes Comput. Sci. 4598, 86--96 (2007; Zbl 1206.68141) Full Text: DOI
Chor, Benny; Fellows, Michael; Ragan, Mark A.; Razgon, Igor; Rosamond, Frances; Snir, Sagi Connected coloring completion for general graphs: algorithms and complexity. (English) Zbl 1206.05040 Lin, Guohui (ed.), Computing and combinatorics. 13th annual international conference, COCOON 2007, Banff, Canada, July 16–19, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73544-1/pbk). Lecture Notes in Computer Science 4598, 75-85 (2007). MSC: 05C15 05C85 92D15 68Q25 68W40 PDFBibTeX XMLCite \textit{B. Chor} et al., Lect. Notes Comput. Sci. 4598, 75--85 (2007; Zbl 1206.05040) Full Text: DOI
Fellows, Michael; Fomin, Fedor V.; Lokshtanov, Daniel; Rosamond, Frances; Saurabh, Saket; Szeider, Stefan; Thomassen, Carsten On the complexity of some colorful problems parameterized by treewidth. (English) Zbl 1175.68292 Dress, Andreas (ed.) et al., Combinatorial optimization and applications. First international conference, COCOA 2007, Xi’an, China, August 14–16, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73555-7/pbk). Lecture Notes in Computer Science 4616, 366-377 (2007). MSC: 68R10 05C15 05C85 68Q25 PDFBibTeX XMLCite \textit{M. Fellows} et al., Lect. Notes Comput. Sci. 4616, 366--377 (2007; Zbl 1175.68292) Full Text: DOI Link
Fellows, Michael; Langston, Michael; Rosamond, Frances; Shaw, Peter Efficient parameterized preprocessing for cluster editing. (English) Zbl 1135.68511 Csuhaj-Varjú, Erzsébet (ed.) et al., Fundamentals of computation theory. 16th international symposium, FCT 2007, Budapest, Hungary, August 27–30, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74239-5/pbk). Lecture Notes in Computer Science 4639, 312-321 (2007). MSC: 68R10 PDFBibTeX XMLCite \textit{M. Fellows} et al., Lect. Notes Comput. Sci. 4639, 312--321 (2007; Zbl 1135.68511) Full Text: DOI
Cai, Liming; Fellows, Michael; Juedes, David; Rosamond, Frances The complexity of polynomial-time approximation. (English) Zbl 1202.68481 Theory Comput. Syst. 41, No. 3, 459-477 (2007). MSC: 68W25 68Q15 68Q25 PDFBibTeX XMLCite \textit{L. Cai} et al., Theory Comput. Syst. 41, No. 3, 459--477 (2007; Zbl 1202.68481) Full Text: DOI
Dehne, Frank; Fellows, Michael; Langston, Michael; Rosamond, Frances; Stevens, Kim An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem. (English) Zbl 1148.68037 Theory Comput. Syst. 41, No. 3, 479-492 (2007). MSC: 68R10 05C85 68Q25 68W05 PDFBibTeX XMLCite \textit{F. Dehne} et al., Theory Comput. Syst. 41, No. 3, 479--492 (2007; Zbl 1148.68037) Full Text: DOI
Abu-Khzam, Faisal N.; Fellows, Michael R.; Langston, Michael A.; Suters, W. Henry Crown structures for vertex cover kernelization. (English) Zbl 1148.68035 Theory Comput. Syst. 41, No. 3, 411-430 (2007). MSC: 68R10 05C70 05C85 68Q25 68W05 PDFBibTeX XMLCite \textit{F. N. Abu-Khzam} et al., Theory Comput. Syst. 41, No. 3, 411--430 (2007; Zbl 1148.68035) Full Text: DOI
Christian, Robin; Fellows, Mike; Rosamond, Frances; Slinko, Arkadii On complexity of lobbying in multiple referenda. (English) Zbl 1136.91376 Rev. Econ. Des. 11, No. 3, 217-224 (2007). MSC: 91B12 91F10 PDFBibTeX XMLCite \textit{R. Christian} et al., Rev. Econ. Des. 11, No. 3, 217--224 (2007; Zbl 1136.91376) Full Text: DOI Link
Fellows, Michael R.; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane Sharp tractability borderlines for finding connected motifs in vertex-colored graphs. (English) Zbl 1171.68497 Arge, Lars (ed.) et al., Automata, languages and programming. 34th international colloquium, ICALP 2007, Wrocław, Poland, July 9–13, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73419-2/pbk). Lecture Notes in Computer Science 4596, 340-351 (2007). MSC: 68Q25 05C15 92D20 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Lect. Notes Comput. Sci. 4596, 340--351 (2007; Zbl 1171.68497) Full Text: DOI
Fellows, Michael; Rosamond, Frances The complexity ecology of parameters: an illustration using bounded max leaf number. (English) Zbl 1151.68426 Cooper, S. Barry (ed.) et al., Computation and logic in the real world. Third conference on computability in Europe, CiE 2007, Siena, Italy, June 18–23, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73000-2/pbk). Lecture Notes in Computer Science 4497, 268-277 (2007). MSC: 68Q25 05C85 PDFBibTeX XMLCite \textit{M. Fellows} and \textit{F. Rosamond}, Lect. Notes Comput. Sci. 4497, 268--277 (2007; Zbl 1151.68426) Full Text: DOI
Fellows, Michael R.; Rosamond, Frances A.; Rotics, Udi; Szeider, Stefan Clique-width minimization is NP-hard. (English) Zbl 1301.68145 Kleinberg, Jon M. (ed.), Proceedings of the 38th annual ACM symposium on theory of computing, STOC 2006. Seattle, WA, USA, May 21–23, 2006. New York, NY: ACM Press (ISBN 1-59593-134-1). 354-362 (2006). MSC: 68Q17 05C69 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., in: Proceedings of the 38th annual ACM symposium on theory of computing, STOC 2006. Seattle, WA, USA, May 21--23, 2006. New York, NY: ACM Press. 354--362 (2006; Zbl 1301.68145) Full Text: DOI
Fellows, Michael R. The lost continent of polynomial time: Preprocessing and kernelization. (English) Zbl 1154.68560 Bodlaender, Hans L. (ed.) et al., Parameterized and exact computation. Second international workshop, IWPEC 2006, Zürich, Switzerland, September 13–15, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-39098-5/pbk). Lecture Notes in Computer Science 4169, 276-277 (2006). MSC: 68W01 68-03 68Q25 PDFBibTeX XMLCite \textit{M. R. Fellows}, Lect. Notes Comput. Sci. 4169, 276--277 (2006; Zbl 1154.68560) Full Text: DOI
Burrage, Kevin; Estivill-Castro, Vladimir; Fellows, Michael; Langston, Michael; Mac, Shev; Rosamond, Frances The undirected feedback vertex set problem has a Poly\((k)\) kernel. (English) Zbl 1154.68421 Bodlaender, Hans L. (ed.) et al., Parameterized and exact computation. Second international workshop, IWPEC 2006, Zürich, Switzerland, September 13–15, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-39098-5/pbk). Lecture Notes in Computer Science 4169, 192-202 (2006). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{K. Burrage} et al., Lect. Notes Comput. Sci. 4169, 192--202 (2006; Zbl 1154.68421) Full Text: DOI
Downey, Rodney G.; Fellows, Michael R.; McCartin, Catherine Parameterized approximation problems. (English) Zbl 1154.68572 Bodlaender, Hans L. (ed.) et al., Parameterized and exact computation. Second international workshop, IWPEC 2006, Zürich, Switzerland, September 13–15, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-39098-5/pbk). Lecture Notes in Computer Science 4169, 121-129 (2006). MSC: 68W25 68Q25 PDFBibTeX XMLCite \textit{R. G. Downey} et al., Lect. Notes Comput. Sci. 4169, 121--129 (2006; Zbl 1154.68572) Full Text: DOI
Fellows, Michael R.; Gramm, Jens; Niedermeier, Rolf On the parameterized intractability of motif search problems. (English) Zbl 1109.68049 Combinatorica 26, No. 2, 141-167 (2006). Reviewer: Reinhard Pichler (Purkersdorf) MSC: 68Q17 03D15 68Q25 92B99 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Combinatorica 26, No. 2, 141--167 (2006; Zbl 1109.68049) Full Text: DOI arXiv
Dehne, Frank; Fellows, Michael; Fernau, Henning; Prieto, Elena; Rosamond, Frances nonblocker: Parameterized algorithmics for minimum dominating set. (English) Zbl 1175.68543 Wiedermann, Jiří (ed.) et al., SOFSEM 2006: Theory and practice of computer science. 32nd conference on current trends in theory and practice of computer science, Měřín, Czech Republic, January 21–27, 2006. Proceedings. Berlin: Springer (ISBN 3-540-31198-X/pbk). Lecture Notes in Computer Science 3831, 237-245 (2006). MSC: 68W05 05C69 68W40 PDFBibTeX XMLCite \textit{F. Dehne} et al., Lect. Notes Comput. Sci. 3831, 237--245 (2006; Zbl 1175.68543) Full Text: DOI
Dujmović, Vida; Fellows, Michael; Hallett, Michael; Kitching, Matthew; Liotta, Giuseppe; McCartin, Catherine; Nishimura, Naomi; Ragde, Prabhakar; Rosamond, Fran; Suderman, Matthew; Whitesides, Sue; Wood, David R. A fixed-parameter approach to 2-layer planarization. (English) Zbl 1095.68081 Algorithmica 45, No. 2, 159-182 (2006). MSC: 68R10 05C10 05C85 68Q25 PDFBibTeX XMLCite \textit{V. Dujmović} et al., Algorithmica 45, No. 2, 159--182 (2006; Zbl 1095.68081) Full Text: DOI
Fellows, Michael R.; Szeider, Stefan; Wrightson, Graham On finding short resolution refutations and small unsatisfiable subsets. (English) Zbl 1087.03035 Theor. Comput. Sci. 351, No. 3, 351-359 (2006). MSC: 03F20 03D15 68Q15 68Q25 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Theor. Comput. Sci. 351, No. 3, 351--359 (2006; Zbl 1087.03035) Full Text: DOI
Dehne, Frank; Fellows, Michael; Langston, Michael A.; Rosamond, Frances; Stevens, Kim An \(O (2^{ O (k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem. (English) Zbl 1128.68400 Wang, Lusheng (ed.), Computing and combinatorics. 11th annual international conference, COCOON 2005, Kunming, China, August 16–29, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28061-8/pbk). Lecture Notes in Computer Science 3595, 859-869 (2005). MSC: 68R10 05C85 68Q25 PDFBibTeX XMLCite \textit{F. Dehne} et al., Lect. Notes Comput. Sci. 3595, 859--869 (2005; Zbl 1128.68400) Full Text: DOI
Alber, Jochen; Fan, Hongbing; Fellows, Michael R.; Fernau, Henning; Niedermeier, Rolf; Rosamond, Fran; Stege, Ulrike A refined search tree technique for dominating set on planar graphs. (English) Zbl 1101.68712 J. Comput. Syst. Sci. 71, No. 4, 385-405 (2005). MSC: 68R10 PDFBibTeX XMLCite \textit{J. Alber} et al., J. Comput. Syst. Sci. 71, No. 4, 385--405 (2005; Zbl 1101.68712) Full Text: DOI
Chen, Jianer; Chor, Benny; Fellows, Mike; Huang, Xiuzhen; Juedes, David; Kanj, Iyad A.; Xia, Ge Tight lower bounds for certain parameterized NP-hard problems. (English) Zbl 1161.68476 Inf. Comput. 201, No. 2, 216-231 (2005). MSC: 68Q15 PDFBibTeX XMLCite \textit{J. Chen} et al., Inf. Comput. 201, No. 2, 216--231 (2005; Zbl 1161.68476) Full Text: DOI