World's Best Scientists 2026 revealed!
Frances A. Rosamond

Frances A. Rosamond

D-Index & Metrics

Computer Science

D-Index
34
Citations
4269
World Ranking
12260
National Ranking
41

Frances A. Rosamond publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Frances A. Rosamond sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 125 publications — 17th percentile

17% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Frances A. Rosamond D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Frances A. Rosamond sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 34 D-Index — 16th percentile

16% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

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

  • Computer science unplugged and related projects in math and computer science popularization

    Tim Bell;Frances Rosamond;Nancy Casey

  • On the complexity of some colorful problems parameterized by treewidth

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

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

    Frank Dehne;Michael Fellows;Michael Langston;Frances Rosamond

  • Graph Layout Problems Parameterized by Vertex Cover

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

  • Clique-Width is NP-Complete

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

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

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

  • A refined search tree technique for Dominating Set on planar graphs

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

  • FPT is P-Time Extremal Structure I

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

  • Fixed-parameter algorithms for Kemeny rankings

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

  • Finding k disjoint triangles in an arbitrary graph

    Mike Fellows;Pinar Heggernes;Frances Rosamond;Christian Sloper

  • Clique-width minimization is NP-hard

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

  • On the Parameterized Complexity of Layered Graph Drawing

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

  • On the Parameterized Complexity of Layered Graph Drawing

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

  • 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

  • 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

  • Finding k disjoint triangles in an arbitrary graph

    Mike Fellows;Pinar Heggernes;Frances Rosamond;Christian Sloper

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

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

  • Efficient parameterized preprocessing for cluster editing

    Michael Fellows;Michael Langston;Frances Rosamond;Peter Shaw

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

    Michael Fellows;Daniel Lokshtanov;Neeldhara Misra;Matthias Mnich

  • Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems

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

  • 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

Frequent Co-Authors

Michael R. Fellows
Michael R. Fellows Lebanese American University
Michael A. Langston
Michael A. Langston University of Tennessee at Knoxville
Daniel Lokshtanov
Daniel Lokshtanov University of California, Santa Barbara
Saket Saurabh
Saket Saurabh Institute of Mathematical Sciences
Sue Whitesides
Sue Whitesides University of Victoria
Frank Dehne
Frank Dehne Carleton University
Fedor V. Fomin
Fedor V. Fomin University of Bergen
Jiong Guo
Jiong Guo Shandong University
Rolf Niedermeier
Rolf Niedermeier Technical University of Berlin

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

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

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.

Best Scientists Citing Frances A. Rosamond

Trending Scientists

Recently Published Articles