The following pages link to Frances A. Rosamond (Q247182):
Displaying 50 items.
- (Q324712) (redirect page) (← links)
- The Flood-It game parameterized by the vertex cover number (Q324714) (← links)
- Local search: is brute-force avoidable? (Q439931) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Quadratic kernelization for convex recoloring of trees (Q639283) (← links)
- Parameterizing by the number of numbers (Q692894) (← links)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- (Q958207) (redirect page) (← links)
- Faster fixed-parameter tractable algorithms for matching and packing problems (Q958209) (← links)
- On the parameterized complexity of layered graph drawing (Q958215) (← links)
- W-hierarchies defined by symmetric gates (Q970108) (← links)
- Parameterized approximation of dominating set problems (Q975529) (← links)
- On the parameterized complexity of multiple-interval graph problems (Q1001898) (← links)
- Fixed-parameter algorithms for Kemeny rankings (Q1035688) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- A brief history of Edward K. Blum and the Journal of Computer and System Sciences (Q1745715) (← links)
- Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number (Q1752485) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
- Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity (Q1933639) (← links)
- Constraint satisfaction problems: convexity makes AllDifferent constraints tractable (Q1939255) (← links)
- Clustering with partial information (Q2268879) (← links)
- The parameterized complexity of stabbing rectangles (Q2428672) (← links)
- On complexity of lobbying in multiple referenda (Q2463791) (← links)
- An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem (Q2464330) (← links)
- The complexity of polynomial-time approximation (Q2464331) (← links)
- Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory (Q2667823) (← links)
- Parameterized Approximation via Fidelity Preserving Transformations (Q2843261) (← links)
- (Q2843923) (← links)
- Tractable Parameterizations for the Minimum Linear Arrangement Problem (Q2849336) (← links)
- Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
- Passion Plays: Melodramas about Mathematics (Q2908535) (← links)
- Computer Science Unplugged and Related Projects in Math and Computer Science Popularization (Q2908546) (← links)
- Determining the winner of a Dodgson election is hard (Q2908877) (← links)
- Clique-width minimization is NP-hard (Q2931399) (← links)
- Distortion is Fixed Parameter Tractable (Q2947587) (← links)
- (Q3043700) (← links)
- Milling a Graph with Turn Costs: A Parameterized Complexity Perspective (Q3057619) (← links)
- The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel (Q3499737) (← links)
- A Purely Democratic Characterization of W[1] (Q3503582) (← links)
- Fixed-Parameter Algorithms for Kemeny Scores (Q3511416) (← links)
- Clique-Width is NP-Complete (Q3563951) (← links)
- Graph Layout Problems Parameterized by Vertex Cover (Q3596727) (← links)
- Leaf Powers and Their Properties: Using the Trees (Q3596736) (← links)
- Clustering with Partial Information (Q3599122) (← links)
- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane (Q3605506) (← links)
- Connected Coloring Completion for General Graphs: Algorithms and Complexity (Q3608833) (← links)
- Quadratic Kernelization for Convex Recoloring of Trees (Q3608834) (← links)
- On the Complexity of Some Colorful Problems Parameterized by Treewidth (Q3611990) (← links)
- Haplotype Inference Constrained by Plausible Haplotype Data (Q3637124) (← links)
- Distortion Is Fixed Parameter Tractable (Q3638056) (← links)
