Prabhakar Ragde
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
19
Venues
14
Active years
1984–2008
Best venue rank
A*
Where they publish
Papers
19 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2008 | ICFP | The chilling descent: making the transition to a conventional curriculum. | Prabhakar Ragde |
| 2006 | SAT | Solving #SAT Using Vertex Covers. | Naomi Nishimura, Prabhakar Ragde, Stefan Szeider |
| 2005 | WADS | Parameterized Counting Algorithms for General Graph Covering Problems. | Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos |
| 2004 | ESA | Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. | Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides |
| 2004 | SAT | Detecting Backdoor Sets with Respect to Horn and Binary Clauses. | Naomi Nishimura, Prabhakar Ragde, Stefan Szeider |
| 2001 | ESA | On the Parameterized Complexity of Layered Graph Drawing. | 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 |
| 2001 | GD | A Fixed-Parameter Approach to Two-Layer Planarization. | 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 |
| 2001 | WADS | Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover. | Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos |
| 2000 | EuroPar | Complexity Theory and Algorithms. | Friedhelm Meyer auf der Heide, Miroslaw Kutylowski, Prabhakar Ragde |
| 1999 | WG | Finding Smallest Supertrees Under Minor Containment. | Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos |
| 1996 | ICDE | Parallel Pointer-Based Join Algorithms in Memory-mapped Environments. | Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde |
| 1996 | SPAA | Database: Parallelism in a Memory-Mapped Environment. | Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde |
| 1995 | SODA | Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees. | Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde |
| 1993 | WADS | Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs. | Omer Berkman, Yossi Matias, Prabhakar Ragde |
| 1990 | ICALP | The Parallel Simplicity of Compaction and Chaining. | Prabhakar Ragde |
| 1987 | FOCS | Incomparability in Parallel Computation | Vince Grolmusz, Prabhakar Ragde |
| 1985 | ICALP | A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior (Preliminary Version). | Michael Luby, Prabhakar Ragde |
| 1985 | STOC | One, Two, Three \dots Infinity: Lower Bounds for Parallel Computation | Faith E. Fich, Friedhelm Meyer auf der Heide, Prabhakar Ragde, Avi Wigderson |
| 1984 | PODC | Relations Between Concurrent-Write Models of Parallel Computation. | Faith E. Fich, Prabhakar Ragde, Avi Wigderson |