Frances A. Rosamond informaticienne américaine
Rosamond, Frances Ann Novak, 1943-
VIAF ID: 48943244 (Personal)
Permalink: http://viaf.org/viaf/48943244
Preferred Forms
4xx's: Alternate Name Forms (7)
Works
| Title | Sources |
|---|---|
| Clique-Width is NP-Complete |
|
| Clustering with Partial Information |
|
| The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number |
|
| The Complexity of Polynomial-Time Approximation |
|
| Computer Science Unplugged and Related Projects in Math and Computer Science Popularization |
|
| Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable |
|
| Dynamic dominating set and turbo-charging greedy heuristics |
|
| Fixed-parameter algorithms for Kemeny rankings |
|
| A Fixed-Parameter Approach to 2-Layer Planarization |
|
| Graph Layout Problems Parameterized by Vertex Cover |
|
| Guest editorial: Special issue on parameterized complexity |
|
| Haplotype inference constrained by plausible haplotype data |
|
| Leaf Powers and Their Properties: Using the Trees |
|
| Listening to students in the Cornell Mathematics Support Center, 1981: |
|
| Local search: Is brute-force avoidable? |
|
| Myhill-Nerode Methods for Hypergraphs |
|
| nonblocker: Parameterized Algorithmics for minimum dominating set |
|
| An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem |
|
| On complexity of lobbying in multiple referenda |
|
| Parameterized Approximation via Fidelity Preserving Transformations |
|
| The Parameterized Complexity of Stabbing Rectangles |
|
| Passion Plays: Melodramas about Mathematics |
|
| A Purely Democratic Characterization of W[1] |
|
| Quadratic Kernelization for Convex Recoloring of Trees |
|
| Reaching out to the media |
|
| A refined search tree technique for Dominating Set on planar graphs |
|
| Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity |
|
| Tractable Parameterizations for the Minimum Linear Arrangement Problem |
|
| Train Marshalling Is Fixed Parameter Tractable |
|
| W-Hierarchies Defined by Symmetric Gates |
|
| Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs |
|
| What Makes Equitable Connected Partition Easy |
|
