Frances A. Rosamond - Citegraph

Author Info

Name	Affiliation	Papers
FRANCES A. ROSAMOND	University of Newcastle, Callaghan, NSW, Australia	17
Collaborators	Citations	PageRank
42	304	15.94
Referers	Referees	References
411	370	264

Search Limit

100411

Publications (17 rows)

Collaborators (42 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Haplotype Inference Constrained by Plausible Haplotype Data	2	0.38	2011
Determining the Winner of a Dodgson Election is Hard	2	0.64	2010
Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs	6	0.47	2009
Clique-Width is NP-Complete	55	1.43	2009
Abstract Milling with Turn Costs	0	0.34	2009
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane	9	0.82	2009
How similarity helps to efficiently compute Kemeny rankings	8	0.57	2009
Fixed-Parameter Algorithms for Kemeny Scores	23	1.19	2008
A purely democratic characterization of W[1]	0	0.34	2008
Efficient parameterized preprocessing for cluster editing	27	1.08	2007
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number	6	0.51	2007
A Fixed-Parameter Approach to 2-Layer Planarization	7	0.54	2006
Clique-width minimization is NP-hard	32	1.20	2006
Nonblocker: parameterized algorithmics for minimum dominating set	19	1.11	2006
Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover	28	1.55	2004
Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems.	55	2.27	2003
A Fixed-Parameter Approach to Two-Layer Planarization	25	1.52	2001

1