Proust: A Nano Proof Assistant von Ragde, Prabhakar

Volltext

Simple Balanced Binary Search Trees von Ragde, Prabhakar

Volltext

Mathematics Is Imprecise von Ragde, Prabhakar

Volltext

On the Parameterized Complexity of Layered Graph Drawing von Dujmović, Vida, Fellows, Michael R., Kitching, Matthew, Liotta, Giuseppe, McCartin, Catherine, Nishimura, Naomi, Ragde, Prabhakar, Rosamond, Frances, Whitesides, Sue, Wood, David R.

Volltext

Solving #SAT using vertex covers von NISHIMURA, Naomi, RAGDE, Prabhakar, SZEIDER, Stefan

Volltext

A fixed-parameter approach to 2-layer planarization von DUJMOVIC, Vida, FELLOWS, Michael, WHITESIDES, Sue, WOOD, David R, HALLETT, Michael, KITCHING, Matthew, LIOTTA, Giuseppe, MCCARTIN, Catherine, NISHIMURA, Naomi, RAGDE, Prabhakar, ROSAMOND, Fran, SUDERMAN, Matthew

Volltext

Solving #SAT Using Vertex Covers von Nishimura, Naomi, Ragde, Prabhakar, Szeider, Stefan

Volltext

Proust: A Nano Proof Assistant von Ragde, Prabhakar

Volltext

Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover von Nishimura, Naomi, Ragde, Prabhakar, Thilikos, Dimitrios M.

Volltext

The Parallel Simplicity of Compaction and Chaining von Ragde, P.

Volltext

Linear-size constant-depth polylog-threshold circuits von Ragde, Prabhakar, Wigderson, Avi

Volltext

Simple Balanced Binary Search Trees von Ragde, Prabhakar

Volltext

Analysis of an asynchronous PRAM algorithm von Ragde, Prabhakar

Volltext

Relations between concurrent-write models of parallel computation von FICH, F. E, PRABHAKAR RAGDE, AVI WIGDERSON

Volltext

Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth von Hagerup, Torben, Katajainen, Jyrki, Nishimura, Naomi, Ragde, Prabhakar

Volltext

Approximation algorithms for classes of graphs excluding single-crossing graphs as minors von Demaine, Erik D, Hajiaghayi, MohammadTaghi, Nishimura, Naomi, Ragde, Prabhakar, Thilikos, Dimitrios M

Volltext

Mathematics Is Imprecise von Ragde, Prabhakar

Volltext

Embeddings of k -connected graphs of pathwidth k von Gupta, Arvind, Nishimura, Naomi, Proskurowski, Andrzej, Ragde, Prabhakar

Volltext

Parameterized Counting Algorithms for General Graph Covering Problems von Nishimura, Naomi, Ragde, Prabhakar, Thilikos, Dimitrios M.

Volltext

Incomparability in parallel computation von Grolmusz, Vince, Ragde, Prabhakar

Volltext