2026 Frances A. Rosamond: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	34	12262	11905	41	41	125	4269

Overview

Frances A. Rosamond is affiliated with the University of Bergen in Norway. Their research is concentrated within the field of Computer Science, with a particular focus on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Computer Vision and Pattern Recognition, and Signal Processing.

Among the subfields of study, the scientist has worked extensively in:

Computational Theory and Mathematics
Artificial Intelligence
Computer Networks and Communications
Computer Vision and Pattern Recognition
Signal Processing

The main topics of research include Constraint Satisfaction and Optimization, Advanced Graph Theory Research, Graph Labeling and Dimension Problems, Logic, Reasoning, and Knowledge, Data Management and Algorithms, Advanced Algebra and Logic, and Limits and Structures in Graph Theory.

Constraint Satisfaction and Optimization
Advanced Graph Theory Research
Graph Labeling and Dimension Problems
Logic, Reasoning, and Knowledge
Data Management and Algorithms
Advanced Algebra and Logic
Limits and Structures in Graph Theory

The scientist has published in several venues, including:

arXiv (Cornell University)
Artificial Intelligence
Proceedings of the AAAI Conference on Artificial Intelligence
Journal of Humanistic Mathematics
Algorithms

Some of the recent papers authored or co-authored by Frances A. Rosamond are:

Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory (2021), Artificial Intelligence
The Parameterized Complexity of Abduction (2021), Proceedings of the AAAI Conference on Artificial Intelligence
Parameterized String Equations (2021), arXiv (Cornell University)
On Solution Discovery via Reconfiguration (2023), arXiv (Cornell University)
The International Conference on Creative Mathematical Sciences Communication: Online Event (CMSC'20) and CMSC'21 (2020), Journal of Humanistic Mathematics

Frequent collaborators include Michael R. Fellows, Emmanuel Sam, Petr A. Golovach, Mario Grobler, and Nicole Megow.

Best Publications

On the parameterized complexity of multiple-interval graph problems

Michael R. Fellows;Danny Hermelin;Frances Rosamond;Stéphane Vialette

390
Citations
Computer science unplugged and related projects in math and computer science popularization

Tim Bell;Frances Rosamond;Nancy Casey

246
Citations
On the complexity of some colorful problems parameterized by treewidth

Michael R. Fellows;Fedor V. Fomin;Daniel Lokshtanov;Frances Rosamond

168
Citations
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem

Frank Dehne;Michael Fellows;Michael Langston;Frances Rosamond

168
Citations
Graph Layout Problems Parameterized by Vertex Cover

Michael R. Fellows;Daniel Lokshtanov;Neeldhara Misra;Frances A. Rosamond

162
Citations
Clique-Width is NP-Complete

Michael R. Fellows;Frances A. Rosamond;Udi Rotics;Stefan Szeider

142
Citations
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity

Michael R. Fellows;Bart M. P. Jansen;Frances Rosamond

114
Citations
A refined search tree technique for Dominating Set on planar graphs

Jochen Alber;Hongbing Fan;Michael R. Fellows;Henning Fernau

106
Citations
FPT is P-Time Extremal Structure I

Vladimir Estivill-Castro;Michael R. Fellows;Michael A. Langston;Frances A. Rosamond

99
Citations
Fixed-parameter algorithms for Kemeny rankings

Nadja Betzler;Michael R. Fellows;Jiong Guo;Rolf Niedermeier

98
Citations
Finding k disjoint triangles in an arbitrary graph

Mike Fellows;Pinar Heggernes;Frances Rosamond;Christian Sloper

97
Citations
Clique-width minimization is NP-hard

Michael R. Fellows;Frances A. Rosamond;Udi Rotics;Stefan Szeider

94
Citations
On the Parameterized Complexity of Layered Graph Drawing

Vida Dujmović;Michael R. Fellows;Matthew Kitching;Giuseppe Liotta

92
Citations
On the Parameterized Complexity of Layered Graph Drawing

Vida Dujmovic;Michael R. Fellows;Michael T. Hallett;M. Kitching

88
Citations
Greedy Localization, Iterative Compression, and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover

Frank K. H. A. Dehne;Michael R. Fellows;Frances A. Rosamond;Peter Shaw

87
Citations
An O (2 O(k) n 3 ) FPT algorithm for the undirected feedback vertex set problem

Frank Dehne;Michael Fellows;Michael A. Langston;Frances Rosamond

87
Citations
Finding k disjoint triangles in an arbitrary graph

Mike Fellows;Pinar Heggernes;Frances Rosamond;Christian Sloper

86
Citations
The undirected feedback vertex set problem has a poly( k ) kernel

Kevin Burrage;Vladimir Estivill-Castro;Michael Fellows;Michael Langston

85
Citations
Efficient parameterized preprocessing for cluster editing

Michael Fellows;Michael Langston;Frances Rosamond;Peter Shaw

84
Citations
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number

Michael Fellows;Daniel Lokshtanov;Neeldhara Misra;Matthias Mnich

77
Citations
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems

M. R. Fellows;C. Knauer;N. Nishimura;P. Ragde

66
Citations
Cutting Up is Hard to Do: the Parameterized Complexity of k-cut and Related Problems.

Rodney G. Downey;Vladimir Estivill-Castro;Michael R. Fellows;Elena Prieto

1
Citations

Frequent Co-Authors

Michael R. Fellows Lebanese American University

Michael A. Langston University of Tennessee at Knoxville

Daniel Lokshtanov University of California, Santa Barbara

Saket Saurabh Institute of Mathematical Sciences

Sue Whitesides University of Victoria

Frank Dehne Carleton University

Fedor V. Fomin University of Bergen

Jiong Guo Shandong University

Stefan Szeider TU Wien

Rolf Niedermeier Technical University of Berlin

External Links

Personal website of Frances A. Rosamond

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens doors to a variety of related fields you can pursue online. For those interested in building on technical skills, consider programs like an online mechanical engineering degree. These programs are designed for flexibility and are ideal for students balancing studies with work or other commitments.

If you are passionate about the foundations of computation and the universe, a best online physics degree can provide a robust background for advanced tech careers. Similarly, the growing field of artificial intelligence and analytics makes data science degrees more relevant than ever, offering strong job prospects in various industries.

For those interested in circuitry, systems, and innovation, choosing from the top online electrical engineering schools can help advance your expertise. With more accredited options available online, it’s easier than ever to align your education with your career goals across STEM fields.