Charles Darwin University

CDU eSpace
Institutional Repository

 
CDU Staff and Student only
 

Publications by Rosamond, Frances A.

Browse Results (43 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
Book Chapters (7)
Rosamond, Frances A. (2012). Passion Plays: Melodramas about Mathematics. In Bodlaender, H. L., Downey, R., Fomin, F. V. and Marx, D.(Ed.), The Multivariate Algorithmic Revolution and Beyond. : Springer. (pp. 80-87). 28  
Bell, Tim, Rosamond, Frances A. and Casey, Nancy (2012). Computer Science Unplugged and Related Projects in Math and Computer Science Popularization. In Bodlaender, H. L., Downey, R., Fomin, F. V. and Marx, D.(Ed.), The Multivariate Algorithmic Revolution and Beyond. Germany: Springer-Verlag. (pp. 398-456). 38  
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). 42 7
Rosamond, Frances A. (2011). Statistics of the Field. In Computer Science: The Harware, Software and Heart of It. United States: . (pp. 421-466). 34 10
Rosamond, Frances (2010). Statistics of the field. In Blum Ed(Ed.), Theoretical computer science. Amsterdam Holland: North-Holland. 13  
Rosamond, Frances A. (2008). Max Leaf Spanning Tree. In Encyclopedia of Algorithms. New York, United States: . (pp. 297-305). 8  
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). 6  
Journal Articles (19)
Rosamond, Frances (2015). Editing to Cliques: A Survey of FPT Results and Recent Applications in Analyzing Large Datasets. Matematica Contemporanea,44:1-12. 20  
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. 30   0
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. 17   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. 23   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. 21   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. 34   Cited 0 times in Scopus0 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. 23  
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. 17   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. 28   Cited 1 times in Scopus1 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. 25   Cited 0 times in Scopus0 0
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. 42 7 Cited 7 times in Scopus7 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. 22   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. 46 5 47
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. 25   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. 38 9
Rosamond, Frances A., Bardohl, Roswitha, Diehl, Stephan, Geisler, Uwe, Bolduan, Gordon, Lessmollmann, Annette, Schwill, Andreas and Stege, Ulrike (2011). Reaching out to the edia: become a computer science ambassador. Communications of the ACM,54(3):113-116. 38 7
Rosamond, Frances (2011). Virtual extension reaching out to the media:Become a computer science ambassador. Communications of the ACM,54(3):113-116. 18   Cited 0 times in Scopus0 0
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. 26   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. 28   0
Conference Papers (17)
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. 23  
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. 27  
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. 43 9
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. 35 6
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. 61  
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. 29  
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. 36 7
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. 40 3
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. 36 8
Rosamond, Frances (2011). A three-hour tour of some modern mathematics. In: Clark, Julie, Kissane, Barry, Mousley, Judity, Spencer, Toby and Thornton, Steve First Joint Australian Association of Mathematics Teachers Inc and Mathematics Education Research Group of Australasia, Alice Springs, 3-7 Suly 2011. 27  
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. 25  
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. 42 13
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. 62 17
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. 34 5
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. 16 6
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. 18 7
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. 19 7