• E-mailFrances.Rosamond@uib.no
  • Visitor Address
    Thormøhlens Gate 55
    5008 Bergen
  • Postal Address
    Postboks 7803
    5020 Bergen

Frances Rosamond is a professor of computer science at the University of Bergen, Norway. Rosamond’s research area is in theoretical computer science and parameterized complexity, and she is heavily involved in bridging parameterized algorithmics and practice. Rosamond’s research also extends to education, where it involves designing a methodology of systematically generating game puzzles by applying NP-complete problems.

As professor Rosamond is particularly interested in computer science education, this is reflected on her research. Here are some selected highlights of her current outreach and research projects:

Parameterized Complexity Wiki and Newsletter

She is actively contributing to the theoretical computers science community. Rosamond has moderated the Parameterized Complexity wiki since she created it in 2005. In addition, she edits the FPT News: The Parameterized Complexity Newsletter.

Creative Mathematical Science Communication 

The research question asks how the foundational ideas and open problems in the mathematical sciences can be communicated to the general public in meaningful ways, especially through active and kinesthetic activities such as those in Computer Science Unplugged. We believe that science communication is a two-way street. We are interested in the  technical and scientific research benefits to the computer scientist or mathematician who engages in outreach. To help understand these issues, Dr. Rosamond initiated the Creative Mathematical Sciences Communication (CMSC) conference series. The 4th CMSC will be held July 20-23 in Wellington, New Zealand.


Rosamond was involved in starting the PACE programming challenge (Parameterized Algorithms and Computational Experiments), and was the Steering Committee Chair of PACE in 2016 and 2017. The competition is annual, and aims to increase awareness of the relevance of algorithm engineering, in addition to help deepen the relationship between parameterized algorithmics and practice.


Rosamond has created a consortium to bring the Bebras challenge to Norway (Norwegian website, English website). Bebras is an international initiative aiming to promote Informatics (Computer Science, or Computing) and computational thinking among school students at all ages. The first official competition in Norway will be in available between 6th and 17th of November.

Professor Frances Rosamond has actively shared her research on the mathematical foundations of computer science to children and adults through workshops, lectures and other outreach activities throughout the world. Rosamond started to work as a professor and researcher at University of Bergen in 2016, and she has already actively contributed to outreach activities at UiB. Her contributions include organize activities from the Computer Science Unplugged! project at the Research Days (Forskningsdagene) and Research Night at The Natural History Museum, and has given a workshop at Bergen High School.

Another important aspect of her outreach activities is to promote opportunities for women in mathematics and informatics. An example of her efforts is from when she worked a professor of mathematics at the National University in San Diego (1986 – 2000), where she organized the Sonia Kovalevsky Mathematics Days for girls and their teachers.

Frances Rosamond is developing activities and initiatives to renew education and dissemination in informatics, especially targeting Norwegian primary and lower and upper secondary education, which she sees very desirable. To do this, she is primarily using materials from the Computer Science Unplugged! program.

Academic article
  • Show author(s) (2022). Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. Artificial Intelligence.
  • Show author(s) (2021). Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday. Springer Series in Computer Science.
  • Show author(s) (2020). Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory. IJCAI International Joint Conference on Artificial Intelligence. 1119-1125.
  • Show author(s) (2018). What Is Known About Vertex Cover Kernelization? Lecture Notes in Computer Science (LNCS). 330-356.
  • Show author(s) (2018). Parameterized approximation via fidelity preserving transformations. Journal of computer and system sciences. 30-40.
  • Show author(s) (2018). Computational thinking enrichment: Public-key cryptography. Informatics in Education. An International Journal. 93-103.
  • Show author(s) (2018). A brief history of Edward K. Blum and the Journal of Computer and System Sciences. Journal of computer and system sciences. 2-10.
  • Show author(s) (2017). The first Parameterized Algorithms and Computational Experiments challenge. Leibniz International Proceedings in Informatics. 1-9.
  • Show author(s) (2016). Tractable parameterizations for the MINIMUM LINEAR ARRANGEMENT problem. ACM Transactions on Computation Theory.
Academic lecture
  • Show author(s) (2021). Parameterized String Equations abs/2104.14171.
  • Show author(s) (2021). Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory.
  • Show author(s) (2020). Editorial Special Issue “New Frontiers in Parameterized Complexity and Algorithms”: Foreward by the Guest Editors. Algorithms. 4 pages.
  • Show author(s) (2019). Frontiers in Algorithmics. Theoretical Computer Science. 1.
  • Show author(s) (2017). Preface. Lecture Notes in Computer Science (LNCS). VI-VI.
Academic monograph
  • Show author(s) (2018). Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday.
Popular scientific article
  • Show author(s) (2020). The International Conference on Creative Mathematical Sciences Communication: Online Event (CMSC'20) and CMSC'21. Journal of Humanistic Mathematics.
Website (informational material)
  • Show author(s) (2020). Parameterized Complexity Community Wiki www.fpt.wikidot.com Started 2005, continues to inform and serve the community.

More information in national current research information system (CRIStin)

Frances Rosamond is also the President and CEO of Rosamond Computer Science Research and Education Company.

Professor Rosamond has done a lot of good and important work in her field, and this is evident from the following selected honours and rewards:

- 2013: Australian Council of Deans of ICT (ACDICT), 2013 ACDICT Learning and Teaching Academy (ALTA) Engagement Award to communicate foundations and frontiers of ICT to Indigenous children.

- 2013: First International Conference on Creative Mathematical Sciences Communication. She started the conference series with sponsors such as Google, the Australian Mathematical Sciences Institute (AMSI), Kikdigital Media, and other local sponsors.

- 2003-2004: University of Newcastle Higher Education Equity Programme Award: An Investigation into Increasing the Number of Women in Computer Science.

- 2012: University of Newcastle New Staff Grant: Computer Games: Learning and Edutainment, Applications in Computer Science.