Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems von Fellows, Michael R., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F., Stege, U., Thilikos, Dimitrios M., Whitesides, S.

Volltext

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems von Fellows, M. R., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F., Stege, U., Thilikos, D. M., Whitesides, S.

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

A Fixed-Parameter Approach to Two-Layer Planarization von Dujmović, V., Fellows, M., Hallett, M., Kitching, M., Liotta, Giuseppe, McCartin, C., Nishimura, N., Ragde, P., Rosamond, F., Suderman, M., Whitesides, S., Wood, David R.

Volltext

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

Volltext

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

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

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

On Graph Powers for Leaf-Labeled Trees von Nishimura, Naomi, Ragde, Prabhakar, Thilikos, Dimitrios M.

Volltext

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems: Parameterized and Exact Algorithms von FELLOWS, M. R, KNAUER, C, NISHIMURA, N, RAGDE, P, ROSAMOND, F, STEGE, U, THILIKOS, D. M, WHITESIDES, S

Volltext

Parallel Algorithms with Processor Failures and Delays von Buss, Jonathan F., Kanellakis, Paris C., Ragde, Prabhakar L., Shvartsman, Alex Allister

Volltext

On the Parameterized Complexity of Layered Graph Drawing von Dujmović, V., Fellows, M., Hallett, M., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F., Suderman, M., Whitesides, S., Wood, D. R.

Volltext

Smaller Kernels for Hitting Set Problems of Constant Arity von Nishimura, Naomi, Ragde, Prabhakar, Thilikos, Dimitrios M.

Volltext

Embeddings of k-connected graphs of pathwidth k von GUPTA, A, NISHIMURA, N, PROSKUROWSKI, A, RAGDE, P

Volltext

On graph powers for leaf-labeled trees von NISHIMURA, N, RAGDE, P, THILIKOS, D. M

Volltext

Processor-time tradeoffs in PRAM simulation von RAGDE, P

Volltext

The parallel simplicity of compaction and chaining von Ragde, Prabhakar

Volltext

Processor-time tradeoffs in PRAM simulations von Ragde, Prabhakar

Volltext