Charles Darwin University

CDU eSpace
Institutional Repository

 
CDU Staff and Student only
 

Publications by Fellows, Michael R.

Browse Results (57 results found)

Subscribe to the RSS feed for this result setSubscribe to the RSS feed for this result set

Refine

  Abstract Views File Downloads Thomson Reuters Web of Science Citation Count Scopus Citation Count Altmetric Score
Books (1)
Downey, Rod and Fellows, Michael R.Gries, David and Schneider, Fred B. Ed. (2013). Fundamentals of parameterized complexity. United Kingdom: Springer. 116 15
Book Chapters (2)
Fellows, Michael R., Gaspers, Serge and Rosamond, Frances A. (2011). Multivariate complexity theory. In Blum, Edward K. and Aho, Alfred V.(Ed.), Computer science: the harware software and heart of it. United States: Springer. (pp. 269-294). 92 7
Estivill-Castro, V., Fellows, Michael R., Langston, M. and Rosamond, Frances A. (2005). FPT is P-Time Extremal Structure I (Fixed-parameter tractability is polynomial-time extremal structure theory). In Broersma, H., Johnson, M. and Szeider, S.(Ed.), Algorithms and Complexity (Texts in Algorithmics 4). London: King's College Publications. (pp. 1-41). 9  
Journal Articles (27)
Souza, Uéverton dos Santos, Rosamond, Frances, Fellows, Michael R., Protti, Fabio and da Silva, Maise Dantas (2015). The Flood-It game parameterized by the vertex cover number. Electronic Notes in Discrete Mathematics,50(December 2015):35-40. 77   0
Erdelyi, Gabor, Fellows, Michael R., Rothe, Jorg and Schend, Lena (2015). Control complexity in Bucklin and fallback voting: A theoretical analysis. Journal of Computer and System Sciences,81(4):632-660. 72   0
van Bevern, René, Downey, Rodney G., Fellows, Michael R., Gaspers, Serge and Rosamond, Frances A. (2015). Myhill-Nerode Methods for Hypergraphs. Algorithmica: an international journal in computer science,73:696-729. 110   0
Erdelyi, Gabor, Fellows, Michael R., Rothe, Jorg and Schend, Lena (2015). Control complexity in Bucklin and fallback voting: An experimental analysis. Journal of Computer and System Sciences,81(4):661-670. 99   0
Fellows, Michael R., Souza, Uéverton dos Santos, Protti, Fabio and da Silva, Maise Dantas (2015). Tractability and hardness of flood-filling games on trees. Theoretical Computer Science,576(April):102-116. 74   0
Abu-Khzam, Faisal N., Egan, Judith, Fellows, Michael R., Rosamond, Frances A. and Shaw, Peter (2015). On the parameterized complexity of dynamic problems<br />. Theoretical Computer Science,607(3):426-434. 107   0
Fellows, Michael R. (2014). Some open problems in parameterized complexity related to the work of Jianer Chen. Tsinghua Science & Technology,19(4 Art No 6867514):325-328. 49   Cited 0 times in Scopus0 0
Fellows, Michael and Jansen, Bart M. P. (2014). FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders. ACM Transactions on Computation Theory,6(4 - Article No. 16):1-26. 16   0
Downey, Rod, Egan, Judith, Fellows, Michael, Rosamond, Frances and Shaw, Peter (2014). Dynamic dominating set and turbo-charging greedy heuristics. Tsinghua Science & Technology,19(4):329-337. 83   Cited 0 times in Scopus0 0
Crowston, Robert, Fellows, Michael, Gutin, Gregory, Jones, Mark, Kim, E. J., Rosamond, Frances, Ruzsa, I. Z., Thomsse, S. and Yeo, A. (2014). Satisfying more than half of a system of linear equations over GF(2): A multivariate approach. Journal of Computer and System Sciences,80(4):687-696. 86   0
Bazgan, Cristina, Chopin, Morgan, Cygan, Marek, Fellows, Michael R., Fomin, Fedor V. and van Leeuwen, Erik Jan (2014). Parameterized complexity of firefighting. Journal of Computer and System Sciences,80(7):1285-1297. 80   Cited 0 times in Scopus0 0
Fellows, Michael, Friedrich, Tobias, Hermelin, Danny, Narodytska, Nina and Rosamond, Frances (2013). Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable. Theoretical Computer Science,472:81-89. 86   Cited 1 times in Scopus1 0
Fellows, Michael, Jansen, Bart and Rosamond, Frances (2013). Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity. European Journal of Combinatorics,34(3):541-566. 86  
Fellows, Michael, Fomin, Fedor, Lokshtanov, Daniel, Losievskaja, Elena, Rosamond, Frances and Saurabh, Saket (2013). Distortion is Fixed Parameter Tractable. ACM Transactions on Computation Theory,5(4):16:1-16:20. 120   Cited 0 times in Scopus0 0
Fellows, Michael, Hermelin, Danny and Rosamond, Frances (2012). Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications. Algorithmica: an international journal in computer science,64(1):3-18. 104   Cited 2 times in Scopus2 0
Fellows, Michael R., Gaspers, Serge and Rosamond, Frances A. (2012). Parameterizing by the number of numbers. Theory of Computing Systems,50(4):675-693. 122 5 47
Fellows, Michael R., Fomin, Fedor V., Lokshtanov, Daniel, Rosamond, Frances A., Saurabh, Saket and Villanger, Yngve (2012). Local search: Is brute-force avoidable?. Journal of Computer and System Sciences,78(3):707-719. 117 7 Cited 7 times in Scopus7 0
Dom, M, Fellows, Michael, Rosamond, Frances and Sikdar, Somnath (2012). The Parameterized Complexity of Stabbing Rectangles. Algorithmica: an international journal in computer science,62(1-2):564-594. 86   Cited 0 times in Scopus0 0
Fellows, Michael R., Fomin, Fedor, Lokshtanov, Daniel, Rosamond, Frances A., Saurabh, Saket, Szeider, Stefan and Thomassen, Carsten (2011). On the complexity of some colourful problems parameterized by treewidth. Information and Computation,209(2):143-153. 64 9
Fellows, Michael, Hartman, Tzvika, Hermelin, Danny, Landau, Gad, Rosamond, Frances and Rozenberg, Liat (2011). Haplotype inference constrained by plausible haplotype data. IEEE - ACM Transactions on Computational Biology and Bioinformatics,8(6):1692-1699. 98   0
Fellows, Michael, Guo, Jiong, Moser, Hannes and Niedermeier, Rolf (2011). A generalization of Nemhauser and Trotter's local optimization theorem. Journal of Computer and System Sciences,77(6):1141-1158. 128   4 Cited 5 times in Scopus5 0
Betzler, Nadja, Van Bevern, Rene, Fellows, Michael, Komusiewicz, Christian and Niedermeier, Rolf (2011). Parameterized Algorithmics for Finding Connected Motifs in Biological Networks. IEEE - ACM Transactions on Computational Biology and Bioinformatics,8(5):1296-1308. 94   4
Fellows, Michael R., Guo, Jiong, Moser, Hannes and Niedermeier, Rolf (2011). A complexity dichotomy for finding disjoint solutions of vertex deletion problems. ACM Transactions on Computation Theory,2(5):5-25. 146   0
Fellows, Michael R. and Fernau, Henning (2011). Facility location problems: a parameterized view. Discrete Applied Mathematics,159(11):1118-1130. 136 8
Fellows, Michael R., Guo, Jiong, Komusiewicz, Christian, Niedermeier, Rolf and Uhlmann, Johannes (2011). Graph-based data clustering with overlaps. Discrete Optimization,8(1):2-17. 132 2
Bodlaender, H, Fellows, Michael, Heggernes, P, Mancini, F, Papadopoulos, C and Rosamond, Frances (2010). Clustering with partial information. Theoretical Computer Science,411(7-Sep):1202-1211. 88   0
Fellows, Michael, Lokshtanov, D, Misra, N, Mnich, M, Rosamond, Frances and Saurabh, S (2009). The complexity ecology of parameters: An illustration using bounded max leaf number. Theory of Computing Systems,45(4):822-848. 101   0
Conference Papers (27)
Abu-Khzam, Faisal N., Egan, Judith, Fellows, Michael, Rosamond, Frances and Shaw, Peter (2014). On the parameterized complexity of dynamic problems with connectivity constraints. In: 8th International Confrence, COCOA 2014, Maui, Hawaii, USA, 19-21 December 2014. 105  
Fellows, Michael, Tan, Xuehou and Zhu, Binhai (2013). Preface. In: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management Third Joint International Conference FAW-AAIM 2013, Dalian, China, 26-28 June 2013. 23  
Van, Bevern, Fellows, Michael R., Gaspers, Serge and Rosamond, Frances A. (2013). Myhill-Nerode methods for hypergraphs. In: 24th International Symposium on Algorithms and Computation (ISAAC 2013), University of Hong Kong, Hong Kong, China, 16-18 December 2013. 120 9
Fellows, Michael R., Hermelin, Danny, Rosamond, Frances A. and Shachnai, Hadas (2013). Tractable Parameterizations for the Minimum Linear Arrangement Problem. In: 21st Annual European Symposium ESA 2013, Sophia Antipolis, France, 2-4 September 2013. 128  
Fellows, Michael R. and Jansen, Bart (2013). FPT is characterized by useful obstruction sets. In: Graph-Theoretic Concepts in Computer Science 39th International Workshop WG 2013, Lübeck, Germany, 19-21 June 2013. 139 7
Bell, Tim, Fellows, Michael R., Rosamond, Frances a., Bell, Judith and Marghitu, Daniela (2012). Unplugging Education: Removing barriers to engaging with new disciplines. In: SDPS 2012 - Society for Design and Process Science Transformative Research and Education through Transdisciplinary Means, Berlin, Germany, 10-14 June 2012. 83  
Fellows, Michael, Pfandler, Andreas, Rosamond, Frances and Rummele, Stefan (2012). The Parameterized Complexity of Abduction. In: AAAI-12 Conference on Artificial Intelligence 2012, Toronto, Ontario Canada, 22-26 July 2012. 36  
Brueggeman, Leo, Fellows, Michael R., Fleischer, Rudolf, Lackner, Martin, Komusiewicz, Christian, Koutis, Yiannis, Pfandler, Andreas and Rosamond, Frances A. (2012). Train Marshalling Is Fixed Parameter Tractable. In: Sixth International Conference on FUN WITH ALGORITHMS, Venice Italy, 4-6 June 2012. 93 7
Fellows, Michael R., Kulik, Ariel, Rosamond, Frances A. and Shachnai, Hadas (2012). Parameterized Approximation via Fidelity Preserving Transformations. In: 39th International Colloquium Automata Languages and Programming ICALP 2012, University of Warwick United Kingdown, 9-13th July 2012. 142 6
Crowston, Robert, Fellows, Michael R., Gutin, Gregory, Jones, Mark, Rosamond, Frances A., Thomasse, Stephan and Yeo, Anders (2011). Simultaneously satisfying linear equations over F2: MaxLin2 and Max-r-Lin2 Parameterized above average. In: 31st International Conference on Foundations of Software Technology and Theoretical Computer Science, India, 12-14 December 2011. 58 8
Fellows, Michael R., Friedrich, Tobias, Hermelin, Danny, Narodytska, Nina and Rosamond, Frances A. (2011). Constraint Satisfaction Problems: Convexity makes all differenct constraints tractable. In: 22nd International Joint conference on Artificial Intelligence, Barcelona Spain, 19-22 July 2011. 44 3
Bazgan, Cristina, Chopin, Morgan and Fellows, Michael R. (2011). Parameterized complexity of the firefighter problem. In: 22nd International Symposium on Algorithms and Computation, Japan, 5-8 December 2011. 131 8
Fellows, Michael (2011). Recent Developments in the Theory of Pre-Processing. In: Joint Conference of FAW2011 and AAIM, Jinhua, China, 28-31 May 2011. 81  
Erdelyi, Gabor and Fellows, Michael R. (2010). Parameterized control complexity in bucklin voting and in fallback voting. In: COMSOC 2010. International Workshop on Computational Social Choice, Dusseldorf, 1-Sep-2010. 57  
Fellows, Michael R., Jansen, Bart, Lokshtanov, Daniel, Rosamond, Frances A. and Saurabh, Saket (2010). Determining the winner of a Dodgson election is hard. In: Lodaya, Kamal and Mahajan, Meena IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), Chennai, India, 15-18 December 2010. 68 17
Fellows, Michael, Giannopoulos, Panos, Knauer, Christian, Paul, Christophe, Rosamond, Frances, Whitesides, Sue and Yu, Nathan (2010). Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. In: Thilikos, Dimitrios M. WG 2010. 36th International Workshop on Graph-Theoretic Concepts in Computer Science, Zaros, Crete, Greece, 28-30 June 2010. 87  
Fellows, Michael R., Gaspers, Serge and Rosamond, Frances A. (2010). Parameterizing by the number of numbers. In: Raman, Venkatesh and Saurabh, Saket IPEC. Parameterized and Exact 2010, Chennai, India, 13-15 December 2010. 123 13
Chen, Zhi-Zhong, Fellows, Michael R., Fu, Bin, Jiang, Haitao, Liu, Yang, Wang, Lusheng and Zhu, Binhai (2010). A Linear Kernel for Co-Path Cycle Packing. In: AAIM 2010. 6th International Conference on Algorithmic Aspects in Information and Management, Weihai, 19-21 Jul 2010. 128 4
Betzler, Nadja, Fellows, Michael R., Guo, Jiong, Niedermeier, Rolf and Rosamond, Frances A. (2009). How Similarity Helps to Efficiently Compute Kemeny Rankings. In: AAMAS 2009. 8th International Joint Conference on Autonomous Agents and Multiagent Systems, Budapest, Hungary, 2009. 21 6
Fellows, Michael, Hartman, Tzvika, Hermelin, Danny, Landau, Gad, Leventhal, L and Rosamond, Frances (2009). Haplotype inference constrained by plausible haplotype data. In: CPM 2009. Combinatorial Pattern Matching, 20th Annual Symposium, Lille, France, . 80  
Fellows, Michael R., Hermelin, Danny and Rosamond, Frances A. (2009). Well-quasi-orders in subclasses of bounded treewidth graphs and their algorithmic applications. In: IWPEC 2009. International Workshop on Exact and Parameterized Computation, Copenhagen, Denmark, 2009. 107 5
Fellows, Michael R., Guo, Jiong, Moser, Hannes and Niedermeier, Rolf (2009). A complexity dichotomy for finding disjoint solutions of vertex deletion problems. In: International Symposium, Mathematical Foundations of Computer Science. MFCS 2009., Novy Smokovev, High Tatras, . 136   0
Fellows, Michael, Guo, Jiong, Komusiewicz, Christian, Niedermeier, Rolf and Uhlmann, Johannes (2009). Graph-based data clustering with overlaps. In: COCOON 2009, Niagara Falls, NY, . 107  
Betzler, Nadja, Fellows, Michael R., Guo, Jiong, Niedermeier, Rolf and Rosamond, Frances A. (2008). Fixed-Parameter Algo Algorithms for Kemeny Scores. In: AAIM 2008. 4th International Conference on Algorithmic Aspects in Information and Management, Shanghai, 2008. 22 7
Fellows, Michael R., Lokshtanov, Daniel, Misra, Neeldhara, Rosamond, Frances A. and Saurabh, Saket (2008). Graph Layout problems Parameterized by Vertex Cover. In: ISAAC 2008. International Symposium on Automata, Algorithms and Computation, Gold Coast, 2008. 58 47
Betzler, Nadja, Fellows, Michael R., Komusiewicz, Christian and Niedermeier, Rolf (2008). Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. In: CPM 2008. 19th Annual Symposium on Combinatorial Pattern Matching, Pisa, 2008. 82 63
Fellows, Michael and Fernau, Henning (2008). Facility location problems: a parameterized view. In: AAIM 2008. 4th International Conference on Algorithmic Aspects in Information and Management, Shanghai, . 117