Prabhakar Ragde

Affiliations: 
University of Waterloo, Waterloo, ON, Canada 
Area:
Computer Science
Google:
"Prabhakar Ragde"
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Dujmović V, Fellows MR, Kitching M, et al. (2008) On the parameterized complexity of layered graph drawing Algorithmica (New York). 52: 267-292
Fellows MR, Knauer C, Nishimura N, et al. (2008) Faster fixed-parameter tractable algorithms for matching and packing problems Algorithmica (New York). 52: 167-176
Nishimura N, Ragde P, Szeider S. (2007) Solving #SAT using vertex covers Acta Informatica. 44: 509-523
Dujmović V, Fellows M, Hallett M, et al. (2006) A fixed-parameter approach to 2-layer planarization Algorithmica (New York). 45: 159-182
Nishimura N, Ragde P, Thilikos DM. (2005) Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover Discrete Applied Mathematics. 152: 229-245
Gupta A, Nishimura N, Proskurowski A, et al. (2005) Embeddings of k-connected graphs of pathwidth k Discrete Applied Mathematics. 145: 242-265
Nishimura N, Ragde P, Thilikos DM. (2005) Parameterized counting algorithms for general graph covering problems Lecture Notes in Computer Science. 3608: 99-109
Demaine ED, Hajiaghayi M, Nishimura N, et al. (2004) Approximation algorithms for classes of graphs excluding single-crossing graphs as minors Journal of Computer and System Sciences. 69: 166-195
Nishimura N, Ragde P, Thilikos DM. (2004) Smaller kernels for hitting set problems of constant arity Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3162: 121-126
Nishimura N, Ragde P, Thilikos DM. (2002) On Graph Powers for Leaf-Labeled Trees Journal of Algorithms. 42: 69-108
See more...