The University of Newcastle, Researcher report.

Researcher: Dr Frances Rosamond
School: Office of Deputy Vice-Chancellor (Research)
Commenced with Institution: 23-MAY-2001
Personal URL:

Funded Projects

Please note, only grants administered through the University of Newcastle Research Office are recorded here. For a more complete picture of the researcher's grant history a Personal URL may be supplied, above.

Research Team Initial Year Duration (Years) Funding Body/Client Award Type Title of Project Collaborating Partners Total Cash $ Total Inkind $
Dr Frances Rosamond 2003 1 University of Newcastle Travel - Travel Grant Dagstuhl Seminar 03311: Fixed parameter Algorithms, Germany 27 July - 1 August, 2003   2170  
Dr Frances Rosamond 2002 1 University of Newcastle Project - New Staff Grant Computer Games for Learning: with a special focus on Mathematics Learning, especially the Mathematics that is foundational to the Computing Sciences   13000  
Dr Frances Rosamond 2002 1 University of Newcastle Travel - Travel Grant Dagstuhl Seminar 02371 Experimental Algorithmics, Germany 8-13 September 2002   2400  

Research Publications

Please note, the publications listed here:
(1) relate to the researcher's position at the University of Newcastle only
(2) are for selected categories of publications, and
(3) relate to publication year 1998, onwards.
For a more complete picture of the researcher's publication history a Personal URL may be supplied at the top of this page.

Journal Article

Fellows Michael Ralph, Knauer C, Nishimura N, Ragde P, Rosamond Frances Ann, Stege U, Thilikos D M, Whitesides S, ’Faster fixed-parameter tractable algorithms for matching and packing problems’, Algorithmica, 52 167-176 (2008) [C1]

Dujmovic V, Fellows Michael Ralph, Kitching M, Liotta G, McCartin C, Nishimura N, Ragde P, Rosamond Frances Ann, Whitesides S, Wood D R, ’On the parameterized complexity of layered graph drawing’, Algorithmica, 52 267-292 (2008) [C1]

Cai L, Huang X, Liu C, Rosamond Frances Ann, Song Y, ’Parameterized complexity and biopolymer sequence comparison’, Computer Journal, 51 270-291 (2008) [C1]

Dehne F, Fellows Michael Ralph, Langston M, Rosamond Frances Ann, Stevens K, ’An O(2(O(k))n(3)) FPT algorithm for the undirected feedback vertex set problem’, Theory of Computing Systems, 41 479-492 (2007) [C1]

Christian R, Fellows Michael Ralph, Rosamond Frances Ann, Slinko A, ’On complexity of lobbying in multiple referenda’, Review of Economic Design, 11 217-224 (2007) [C1]

Cai L, Fellows Michael Ralph, Juedes D, Rosamond Frances Ann, ’The complexity of polynomial-time approximation’, Theory of Computing Systems, 41 459-477 (2007) [C1]

Dujmovic V, Fellows Michael Ralph, Hallett M, Kitching M, Liotta G, McCartin C, Nishimura N, Ragde P, Rosamond Frances Ann, Suderman M, Whitesides S, Wood D R, ’A fixed-parameter approach to 2-layer planarization’, Algorithmica, 45 159-182 (2006) [C1]

Alber Jochen, Fan Hongbing, Fellows Michael Ralph, Fernau Henning, Niedermeier Rolf, Rosamond Frances Ann, Stege Ulrike, ’A refined search tree technique for Dominating Set on planar graphs’, Journal of Computer and System Sciences, 71 385-405 (2005) [C1]

Chalup Stephan, Mellor Drew, Rosamond Frances Ann, ’The Machine Intelligence Hex Project’, Computer Science Education, 15 245-273 (2005) [C1]

Downey R, Estivill-Castro Vladimir, Fellows Michael Ralph, Prieto-Rodriguez Elena, Rosamond Frances Ann, ’Cutting up is hard to do: the parameterized Complexity of k-Cut and Related Probelms’, Electronic Notes in Theoretical Computer Science, 78 205-218 (2003) [C1]

Book

Rosamond Frances Ann, Copes Larry, Educational Transformations: The Influences of Stephen I. Brown, AuthorHouse, Bloomington, IN, 576 (2006) [A3]

Chapter in Book

Rosamond Frances Ann, ’Off-Line and On-Line Computer Games and Mathematical Sciences Popularization’, Educational Transformations: The Influences of Stephen I. Brown, AuthorHouse, Bloomington, IL, 407-426 (2006) [B1]

Review

Estivill-Castro V, Fellows Michael Ralph, Langston M A, Rosamond Frances Ann, ’Max Leaf Spanning Tree’, Encyclopedia of Algorithms (2008) [D2]

Conference Publication

Fellows Michael Ralph, Hermelin D, Muller M, Rosamond Frances Ann, ’A purely democratic characterization of W[1]’, Parameterized and Exact Computation, Victoria, BC (2008) [E1]

Bodlaender H L, Fellows Michael Ralph, Heggernes P, Mancini Federico, Papadopoulos C, Rosamond Frances Ann, ’Clustering with Partial Information’, Mathematical Foundations of Computer Science 2008, Torun, Poland (2008) [E1]

Betzler Nadja, Fellows Michael Ralph, Guo Jiong, Niedermeier Rolf, Rosamond Frances Ann, ’Fixed-parameter algorithms for Kemeny Scores’, Algorithmic Aspects in Information and Management. 4th International Conference, AAIM 2008, Shanghai, China (2008) [E1]

Chor B, Fellows Michael Ralph, Ragan M A, Razgon I, Rosamond Frances Ann, Snir S, ’Connected coloring completion for general graphs: Algorithms and complexity’, Computing and Combinatorics. 13th Annual International Conference, COCOON 2007. Proceedings, Banff, Canada (2007) [E1]

Fellows Michael Ralph, Langston M, Rosamond Frances Ann, Shaw Peter Edward, ’Efficient parameterized preprocessing for cluster editing’, Fundamentals of Computation Theory. 16th International Symposium, FCT 2007 Budapest, Hungary, August 27-30, 2007 Proceedings, Budapest, Hungary (2007) [E1]

Fellows Michael Ralph, Fornin F V, Lokshtanov D, Rosamond Frances Ann, Saurabh S, Szeider S, Thomassen C, ’On the complexity of some colorful problems parameterized by treewidth’, Combinatorial Optimization and Applications. First International Conference Proceedings, Xi'an, China (2007) [E1]

Fellows Michael Ralph, Flum J, Hermelin D, Muller M, Rosamond Frances Ann, ’Parameterized complexity via combinatorial circuits’, Algorithms and Complexity: Proceedings of the Third ACiD Workshop, Durham, UK (2007) [E1]

Bodlaender H, Fellows Michael Ralph, Langston M, Ragan M A, Rosamond Frances Ann, Weyer M, ’Quadratic kernelization for convex recoloring of trees’, Computing and Combinatorics. 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007. Proceedings, Banff, Canada (2007) [E1]

Fellows Michael Ralph, Rosamond Frances Ann, ’The complexity ecology of parameters: An illustration using bounded max leaf number’, Computation and Logic in the RealWorld. Third Conference on Computability in Europe, CiE 2007, Siena, Italy (2007) [E1]

Fellows Michael Ralph, Rosamond Frances Ann, ’Why is P not equal to NP?’, Computation and Logic in the Real World: Third Conference on Computability in Europe, CiE 2007: Local Proceedings, Siena, Italy (2007) [E1]

Fellows Michael Ralph, Rosamond Frances Ann, Rotics U, Szeider S, ’Clique width Minimization is NP-hard’, STOC '06 Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA (2006) [E1]

Bodlaender Hans L, Fellows Michael Ralph, Langston Michael A, Ragan Mark A, Rosamond Frances Ann, Weyer Mark, ’Kernelization for Convex Recoloring of Trees’, Algorithms and Complexity in Durham 2006, Proceedings of the Second ACiD Workshop (Texts in Algorithmics 7), London (2006) [E1]

Dehne F, Fellows Michael Ralph, Fernau Henning, Prieto-Rodriguez Elena, Rosamond Frances Ann, ’NONBLOCKER: Parameterized algorithmics for MINIMUM DOMINATING SET’, Lecture Notes in Computer Science (SOFSEM 2006: 32nd Conference on Current Trends in Theory and Practice of Computer Science), Merin, Czech Republic (2006) [E1]

Christian Robin, Fellows Michael Ralph, Rosamond Frances Ann, Slinko Arkadii, ’On Complexity of Lobbying in Multiple Referenda’, 1st International Workshop on Computational Social Choice, Amsterdam (2006) [E1]

Burrage K, Estivill-Castro V, Fellows Michael Ralph, Langston M, Mac S, Rosamond Frances Ann, ’The undirected feedback vertex set problem has a poly(k) kernel’, Lecture Notes in Computer Science (Parameterized and Exact Computation. Second International Workshop, IWPEC 2006 Proceedings), Z?rich, Switzerland (2006) [E1]

Dehne F, Fellows Michael Ralph, Rosamond Frances Ann, Langston M A, Stevens K, ’An O(2O(k)n3) FPT algorithm for the undirected feedback vertex set problem’, Proceedings of Computing and Combinatorics: 11th Annual International Conference, COCOON 2005, Kunming, China (2005) [E1]

Fellows Michael Ralph, Estivill-Castro Vladimir, Langston M, Rosamond Frances Ann, ’Fixed-Parameter Tractability is Polynomial-Time Extremal Structure Theory I: The Case of Max Leaf’, Algorithms and complexity in Durham 2005 : proceedings of the first ACiD workshop, University of Durham (2005) [E1]

Fellows Michael Ralph, Knauer N, Nishimura N, Radge P, Rosamond Frances Ann, Stege U, Thilikos Dm, Whitesides S, ’Faster fixed-parameter tractable algorithms for matching and packing problems’, Algorithms - ESA 2004 : 12th annual European symposium, proceedings : Lecture Notes in computer Science, Bergen, Norway (2004) [E1]

Fellows Michael Ralph, Heggernes P, Rosamond Frances Ann, Sloper C, Arne Telle J, ’Finding k disjoint triangles in an arbitrary graph’, Graph-Theoretic Concepts in Computer Science: 30th International Workshop, WG 2004 : Lecture Notes in Computer Science, Bad Honnef, Germany (2004) [E1]

Dehne F, Fellows Michael Ralph, Rosamond Frances Ann, Shaw Peter Edward, ’Greedy localisation, iterative compression, and modeled crown reductions: New FPT techniques, an improved algorithm for set splitting, and a novel 2k kernelization for vertex cover’, Conference Paper, Bergen, Norway (2004) [E1]

Dehne F, Fellows Michael Ralph, Rosamond Frances Ann, ’An FPT Algorithm for set splitting’, Lecture Notes in Computer Science, Elspeet, The Netherlands (2003) [E1]

Return to Search page