|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 29 occurrences of 25 keywords
|
|
|
|
|
Results
Found 66 publication records. Showing 66 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Michael R. Fellows, Danny Hermelin, Frances A. Rosamond |
Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Dom, Michael R. Fellows, Frances A. Rosamond, Somnath Sikdar |
The Parameterized Complexity of Stabbing Rectangles. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Serge Gaspers, Frances A. Rosamond |
Parameterizing by the Number of Numbers. |
Theory Comput. Syst. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Yngve Villanger |
Local search: Is brute-force avoidable? |
J. Comput. Syst. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer |
Quadratic Kernelization for Convex Recoloring of Trees. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen |
On the complexity of some colorful problems parameterized by treewidth. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Frances A. Rosamond, Roswitha Bardohl, Stephan Diehl, Uwe Geisler, Gordon Bolduan, Annette Lessmöllmann, Andreas Schwill, Ulrike Stege |
Reaching out to the media: become a computer science ambassador. |
Commun. ACM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg |
Haplotype Inference Constrained by Plausible Haplotype Data. |
IEEE/ACM Trans. Comput. Biology Bioinform. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond |
Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable. |
IJCAI |
2011 |
DBLP BibTeX RDF |
|
| 1 | Robert Crowston, Michael R. Fellows, Gregory Gutin, Mark Jones, Frances A. Rosamond, Stéphan Thomassé, Anders Yeo |
Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond |
Clustering with partial information. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Serge Gaspers, Frances A. Rosamond |
Parameterizing by the Number of Numbers |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Michael R. Fellows, Jörg Flum, Danny Hermelin, Moritz Müller, Frances A. Rosamond |
W-Hierarchies Defined by Symmetric Gates. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mike Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu |
Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Serge Gaspers, Frances A. Rosamond |
Parameterizing by the Number of Numbers. |
IPEC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh |
Determining the Winner of a Dodgson Election is Hard. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Stéphane Vialette |
On the parameterized complexity of multiple-interval graph problems. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond |
Fixed-parameter algorithms for Kemeny rankings. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu |
Abstract Milling with Turn Costs |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider |
Clique-Width is NP-Complete. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2009 |
DBLP DOI BibTeX RDF |
Max-leaf, Well-quasiordering, Bandwidth, Kernelization, Parameterized complexity |
| 1 | Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger |
Local Search: Is Brute-Force Avoidable? |
IJCAI |
2009 |
DBLP BibTeX RDF |
|
| 1 | Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh |
Distortion Is Fixed Parameter Tractable. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A. Kanj, Frances A. Rosamond, Ondrej Suchý |
What Makes Equitable Connected Partition Easy. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Danny Hermelin, Frances A. Rosamond |
Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Dom, Michael R. Fellows, Frances A. Rosamond |
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg |
Haplotype Inference Constrained by Plausible Haplotype Data. |
CPM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond |
How similarity helps to efficiently compute Kemeny rankings. |
AAMAS |
2009 |
DBLP DOI BibTeX RDF |
structural parameterization, exact algorithm, NP-hard problem, fixed-parameter tractability, rank aggregation |
| 1 | Rodney G. Downey, Michael R. Fellows, Catherine McCartin, Frances A. Rosamond |
Parameterized approximation of dominating set problems. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood |
On the Parameterized Complexity of Layered Graph Drawing. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides |
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Graph matching, Fixed parameter tractable, Parameterized complexity, Color coding, Set packing |
| 1 | Liming Cai, Xiuzhen Huang, Chunmei Liu, Frances A. Rosamond, Yinglei Song |
Parameterized Complexity and Biopolymer Sequence Comparison. |
Comput. J. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh |
Parameterized Low-distortion Embeddings - Graph metrics into lines and trees |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Frances A. Rosamond |
Max Leaf Spanning Tree. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond |
Fixed-Parameter Algorithms for Kemeny Scores. |
AAIM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond |
Clustering with Partial Information. |
MFCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Danny Hermelin, Moritz Müller, Frances A. Rosamond |
A Purely Democratic Characterization of W[1]. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Egbert Mujuni, Frances A. Rosamond |
Parameterized Complexity of the Clique Partition Problem. |
CATS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh |
Graph Layout Problems Parameterized by Vertex Cover. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle |
Leaf Powers and Their Properties: Using the Trees. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens |
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Liming Cai, Michael R. Fellows, David W. Juedes, Frances A. Rosamond |
The Complexity of Polynomial-Time Approximation. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw |
Efficient Parameterized Preprocessing for Cluster Editing. |
FCT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen |
On the Complexity of Some Colorful Problems Parameterized by Treewidth. |
COCOA |
2007 |
DBLP DOI BibTeX RDF |
Topics Parameterized Complexity, Graph Coloring, Bounded Treewidth |
| 1 | Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer |
Quadratic Kernelization for Convex Recoloring of Trees. |
COCOON |
2007 |
DBLP DOI BibTeX RDF |
Topics Algorithms, Complexity |
| 1 | Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir |
Connected Coloring Completion for General Graphs: Algorithms and Complexity. |
COCOON |
2007 |
DBLP DOI BibTeX RDF |
Topics Algorithms and Complexity, Bioinformatics |
| 1 | Michael R. Fellows, Frances A. Rosamond |
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood |
A Fixed-Parameter Approach to 2-Layer Planarization. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
Sugiyama approach, NP-complete, Graph algorithms, Graph drawing, Planarization, Fixed-parameter tractability, Crossing minimization |
| 1 | Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer |
Kernelization for Convex Recoloring. |
ACiD |
2006 |
DBLP BibTeX RDF |
|
| 1 | Kevin Burrage, Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Shev Mac, Frances A. Rosamond |
The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank K. H. A. Dehne, Michael R. Fellows, Henning Fernau, Elena Prieto, Frances A. Rosamond |
NONBLOCKER: Parameterized Algorithmics for minimum dominating set. |
SOFSEM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider |
Clique-width minimization is NP-hard. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
absolute approximation, NP-completeness, clique-width, pathwidth |
| 1 | Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider |
Proving NP-hardness for clique-width II: non-approximability of clique-width |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider |
Proving NP-hardness for clique-width I: non-approximability of sequential clique-width |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege |
A refined search tree technique for Dominating Set on planar graphs. |
J. Comput. Syst. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond |
FPT is P-Time Extremal Structure I. |
ACiD |
2005 |
DBLP BibTeX RDF |
|
| 1 | Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens |
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem. |
COCOON |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle |
Finding k Disjoint Triangles in an Arbitrary Graph. |
WG |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides |
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. |
ESA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond, Peter Shaw |
Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Rodney G. Downey, Vladimir Estivill-Castro, Michael R. Fellows, Elena Prieto, Frances A. Rosamond |
Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems. |
Electr. Notes Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond |
An FPT Algorithm for Set Splitting. |
WG |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood |
On the Parameterized Complexity of Layered Graph Drawing. |
ESA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege |
Refined Search Tree Technique for DOMINATING SET on Planar Graphs. |
MFCS |
2001 |
DBLP DOI BibTeX RDF |
planar graph, dominating set, search tree, fixed parameter algorithm |
| 1 | Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood |
A Fixed-Parameter Approach to Two-Layer Planarization. |
Graph Drawing |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Catherine McCartin, Frances A. Rosamond, Ulrike Stege |
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems. |
FSTTCS |
2000 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #66 of 66 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")