Frances A. Rosamond | Academic Influence

Frances A. Rosamond's AcademicInfluence.com Rankings

Frances A. Rosamond

Computer Science

#3170

World Rank

#3321

Historical Rank

Data Science

#346

World Rank

#355

Historical Rank

Computational Linguistics

#3117

World Rank

#3154

Historical Rank

Machine Learning

#5633

World Rank

#5709

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Frances A. Rosamond's Degrees

Masters Computer Science University of Melbourne
PhD Computer Science Australian National University

Similar Degrees You Can Earn

Why Is Frances A. Rosamond Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Frances Ann Novak Rosamond is an Australian computer scientist whose research interests include computer education and parameterized complexity. She is the editor of the Parameterized Complexity Newsletter, moderator of the parameterized complexity wiki, and publicity chair of the International Symposium on Parameterized and Exact Computation.

(See a Problem?)

Frances A. Rosamond's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

On the parameterized complexity of multiple-interval graph problems (2009) (314)
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem (2005) (129)
On the Complexity of Some Colorful Problems Parameterized by Treewidth (2007) (128)
Graph Layout Problems Parameterized by Vertex Cover (2008) (124)
Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems (2003) (123)
Clique-Width is NP-Complete (2009) (103)
Computer Science Unplugged and Related Projects in Math and Computer Science Popularization (2012) (102)
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity (2013) (98)
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number (2007) (92)
Refined Search Tree Technique for DOMINATING SET on Planar Graphs (2001) (91)
On complexity of lobbying in multiple referenda (2006) (85)
FPT is P-Time Extremal Structure I (2005) (79)
Clique-width minimization is NP-hard (2006) (74)
On the Parameterized Complexity of Layered Graph Drawing (2001) (74)
Fixed-parameter algorithms for Kemeny rankings (2009) (72)
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems (2008) (67)
Finding k Disjoint Triangles in an Arbitrary Graph (2004) (64)
Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover (2004) (63)
The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel (2006) (63)
Local Search: Is Brute-Force Avoidable? (2009) (60)
Parameterized approximation via fidelity preserving transformations (2012) (57)
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems (2000) (53)
Parameterized approximation of dominating set problems (2008) (51)
Efficient Parameterized Preprocessing for Cluster Editing (2007) (49)
The First Parameterized Algorithms and Computational Experiments Challenge (2017) (49)
Fixed-Parameter Algorithms for Kemeny Scores (2008) (48)
Satisfying more than half of a system of linear equations over GF(2): A multivariate approach (2014) (48)
NONBLOCKER: Parameterized Algorithmics for minimum dominating set (2006) (43)
Tractable Parameterizations for the Minimum Linear Arrangement Problem (2013) (41)
A Fixed-Parameter Approach to 2-Layer Planarization (2001) (41)
Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory (2019) (32)
Parameterizing by the Number of Numbers (2010) (30)
Parameterized Complexity of the Clique Partition Problem (2008) (30)
Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average (2011) (29)
An FPT Algorithm for Set Splitting (2003) (29)
Connected Coloring Completion for General Graphs: Algorithms and Complexity (2007) (29)
Clustering with partial information (2008) (23)
What Makes Equitable Connected Partition Easy (2009) (22)
How similarity helps to efficiently compute Kemeny rankings (2009) (21)
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems (2004) (21)
Quadratic Kernelization for Convex Recoloring of Trees (2007) (21)
The Complexity of Polynomial-Time Approximation (2007) (21)
Distortion is Fixed Parameter Tractable (2009) (21)
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane (2009) (20)
Dynamic Dominating Set and Turbo-Charging Greedy Heuristics (2014) (19)
Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable (2011) (19)
What Is Known About Vertex Cover Kernelization? (2018) (19)
Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications (2012) (19)
Leaf Powers and Their Properties: Using the Trees (2008) (17)
On the parameterized complexity of dynamic problems (2015) (17)
The Parameterized Complexity of Abduction (2012) (15)
Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications (2009) (14)
Myhill–Nerode Methods for Hypergraphs (2012) (14)
Proving NP-hardness for clique-width II: non-approximability of clique-width (2005) (14)
Fixed-Parameter Algo Algorithms for Kemeny Scores (2008) (11)
Simultaneously Satisfying Linear Equations Over $\mathbb{F}_2$: MaxLin2 and Max-$r$-Lin2 Parameterized Above Average (2011) (11)
Haplotype Inference Constrained by Plausible Haplotype Data (2009) (10)
Determining the Winner of a Dodgson Election is Hard (2010) (10)
Train Marshalling Is Fixed Parameter Tractable (2012) (10)
Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday (2017) (9)
Proving NP-hardness for clique-width I: non-approximability of sequential clique-width (2005) (9)
W-Hierarchies Defined by Symmetric Gates (2010) (9)
Parameterized Low-distortion Embeddings - Graph metrics into lines and trees (2008) (9)
Parameterized Complexity and Biopolymer Sequence Comparison (2008) (8)
Multivariate Complexity Theory (2011) (8)
On the Fixed-Parameter Intractability and Tractability of Multiple-Interval Graph Problems (2007) (8)
On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints (2014) (7)
Kernelization for Convex Recoloring (2006) (7)
The Parameterized Complexity of Stabbing Rectangles (2012) (7)
Milling a Graph with Turn Costs: A Parameterized Complexity Perspective (2010) (7)
Computing Kemeny rankings, parameterized by the average K-T distance (2008) (7)
Parameterized Complexity News (2009) (6)
Statistics of the Field (2011) (6)
Fixed-Parameter Tractability is Polynomial-Time Extremal Structure Theory I: The Case of Max Leaf (2005) (5)
Distortion is Fixed Parameter Tractable (2013) (5)
Computational Thinking Enrichment: Public-Key Cryptography (2018) (5)
Diversity in Combinatorial Optimization (2019) (4)
FPT is P-Time Extremal Structure I (Fixed-parameter tractability is polynomial-time extremal structure theory) (2005) (4)
Collaborating with Hans: Some Remaining Wonderments (2020) (4)
Polynomial-time linear kernelization for cluster editing (2007) (4)
Well-Quasi-Ordering Bounded Treewidth Graphs (2009) (4)
Myhill–Nerode Methods for Hypergraphs (2013) (4)
A Purely Democratic Characterization of W[1] (2008) (3)
Sensing God's Will is Fixed Parameter Tractable (2008) (3)
Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number (2017) (3)
A brief history of Edward K. Blum and the Journal of Computer and System Sciences (2018) (3)
Reaching out to the media (2011) (3)
Max Leaf Spanning Tree (2008) (2)
On efficient polynomial-time approximation schemes for problems on planar structures (2009) (2)
The Undirected Feedback Vertex Set Problem has Polynomial Kernel Size (2006) (2)
A Survey on the Complexity of Flood-Filling Games (2018) (2)
The machine intelligence Hex project (2005) (2)
How applying Myhill-Nerode methods to hypergraphs helps mastering the Art of Trellis Decoding (2012) (1)
Parameterizing by the Number of Numbers (2011) (1)
Combinatorial Circuits and the W-hierarchy (2007) (1)
Passion Plays: Melodramas about Mathematics (2012) (1)
Why Is P Not Equal to NP (2007) (1)
Editing to Cliques: A Survey of FPT Results and Recent Applications in Analyzing Large Datasets (2015) (1)
Unplugging Education: Removing barriers to engaging with new disciplines (2012) (1)
The Flood-It game parameterized by the vertex cover number (2015) (1)
A three-hour tour of some modern mathematics (2011) (1)
The Parameterized Complexity of Stabbing Rectangles (2010) (0)
Special Issue "New Frontiers in Parameterized Complexity and Algorithms": Foreward by the Guest Editors (2020) (0)
On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves (2023) (0)
Preface (2005) (0)
On Solution Discovery via Reconfiguration (2023) (0)
Parameterized Complexity via Combinatorial Circuits ( Extended Abstract ) (0)
Improved Kernelization and Linear Time FPT for Convex Recoloring of Trees ? (0)
Patterns of Emotion Within Mathematics Problem-Solving (1987) (0)
Myhill – Nerode Methods for Hypergraphs René (2015) (0)
Abstract Milling with Turn Costs (2009) (0)
Guest Editorial: Special Issue on Parameterized Complexity (2014) (0)
Myhill-Nerode Methods for Hypergraphs and Applications (2012) (0)
Re ned Sear h Tree Te hniquefor Dominating Set on Planar Graphs ? (2007) (0)
The International Conference on Creative Mathematical Sciences Communication: Online Event (CMSC'20) and CMSC'21 (2020) (0)
Frontiers in Algorithmics (2019) (0)
Parameterized String Equations (2021) (0)
Newsletter of the Parameterized Complexity Community fpt . wikidot . com September 2009 Welcome Copenhagen IWPEC 09 (2009) (0)
Computer Maths: Curiosity, Art, Story! The First International Conference on Creative Mathematical Sciences Communication (2013) (0)
Complete Issue 14, 1996 (2016) (0)
CMSC 2018: 4th Creative Mathematical Sciences Communication Conference (2018) (0)

This paper list is powered by the following services:

Other Resources About Frances A. Rosamond

en.wikipedia.org

What Schools Are Affiliated With Frances A. Rosamond?

Frances A. Rosamond is affiliated with the following schools: