Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Frances A. Rosamond

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Neeldhara Misra

> Home > Persons > Frances A. Rosamond

Publications

2020
[j37]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/algorithms/MisraRZ20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithms/MisraRZ20
Neeldhara Misra, Frances A. Rosamond, Meirav Zehavi:
Special Issue "New Frontiers in Parameterized Complexity and Algorithms": Foreward by the Guest Editors. Algorithms 13(9): 236 (2020)
2009
[j13]
- view
  authority control:
- export record
  dblp key:
  - journals/mst/FellowsLMMRS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/FellowsLMMRS09
Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, Saket Saurabh:
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. Theory Comput. Syst. 45(4): 822-848 (2009)
2008
[c24]
- view
  authority control:
- export record
  dblp key:
  - conf/isaac/FellowsLMRS08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/FellowsLMRS08
Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh:
Graph Layout Problems Parameterized by Vertex Cover. ISAAC 2008: 294-305

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.