Prabhakar Ragde

	2008
50		Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides: Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. Algorithmica 52(2): 167-176 (2008)
49		Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood: On the Parameterized Complexity of Layered Graph Drawing. Algorithmica 52(2): 267-292 (2008)
	2007
48		Naomi Nishimura, Prabhakar Ragde, Stefan Szeider: Solving #SAT using vertex covers. Acta Inf. 44(7-8): 509-523 (2007)
	2006
47		Naomi Nishimura, Prabhakar Ragde, Stefan Szeider: Solving #SAT Using Vertex Covers. SAT 2006: 396-409
46		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: A Fixed-Parameter Approach to 2-Layer Planarization. Algorithmica 45(2): 159-182 (2006)
	2005
45		Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Parameterized Counting Algorithms for General Graph Covering Problems. WADS 2005: 99-109
44		Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde: Embeddings of k-connected graphs of pathwidth k. Discrete Applied Mathematics 145(2): 242-265 (2005)
43		Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. Discrete Applied Mathematics 152(1-3): 229-245 (2005)
	2004
42		Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides: Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. ESA 2004: 311-322
41		Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Smaller Kernels for Hitting Set Problems of Constant Arity. IWPEC 2004: 121-126
40		Naomi Nishimura, Prabhakar Ragde, Stefan Szeider: Detecting Backdoor Sets with Respect to Horn and Binary Clauses. SAT 2004
39		Erik D. Demaine, Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. J. Comput. Syst. Sci. 69(2): 166-195 (2004)
	2003
38		Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt: On the parameterized complexity of the generalized rush hour puzzle. CCCG 2003: 6-9
	2002
37		Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: On Graph Powers for Leaf-Labeled Trees. J. Algorithms 42(1): 69-108 (2002)
	2001
36		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: On the Parameterized Complexity of Layered Graph Drawing. ESA 2001: 488-499
35		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: A Fixed-Parameter Approach to Two-Layer Planarization. Graph Drawing 2001: 1-15
34		Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover. WADS 2001: 75-86
33		Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs. Electronic Notes in Discrete Mathematics 10: 137-142 (2001)
	2000
32		Friedhelm Meyer auf der Heide, Miroslaw Kutylowski, Prabhakar Ragde: Complexity Theory and Algorithms. Euro-Par 2000: 455
31		Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde: Embeddings of k-Connected Graphs of Pathwidth k. SWAT 2000: 111-124
30		Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: On Graph Powers for Leaf-Labeled Trees. SWAT 2000: 125-138
29		Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Finding Smallest Supertrees Under Minor Containment. Int. J. Found. Comput. Sci. 11(3): 445-465 (2000)
	1999
28		Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Finding Smallest Supertrees Under Minor Containment. WG 1999: 303-312
	1998
27		Omer Berkman, Yossi Matias, Prabhakar Ragde: Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains. J. Algorithms 28(2): 197-215 (1998)
26		Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde: Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth. J. Comput. Syst. Sci. 57(3): 366-375 (1998)
	1996
25		Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde: Parallel Pointer-Based Join Algorithms in Memory-mapped Environments. ICDE 1996: 266-275
24		Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde: µDatabase: Parallelism in a Memory-Mapped Environment. SPAA 1996: 196-199
23		Jonathan F. Buss, Paris C. Kanellakis, Prabhakar Ragde, Alexander A. Shvartsman: Parallel Algorithms with Processor Failures and Delays. J. Algorithms 20(1): 45-86 (1996)
22		Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo: Pointers versus Arithmetic in PRAMs. J. Comput. Syst. Sci. 53(2): 218-232 (1996)
	1995
21		Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde: Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees. SODA 1995: 641-649
20		Faith E. Fich, Miroslaw Kowaluk, Miroslaw Kutylowski, Krzysztof Lorys, Prabhakar Ragde: Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs. Computational Complexity 5(2): 113-131 (1995)
	1993
19		Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo: Pointers versus Arithmetic in PRAMs. Structure in Complexity Theory Conference 1993: 239-252
18		Omer Berkman, Yossi Matias, Prabhakar Ragde: Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs. WADS 1993: 175-187
17		Prabhakar Ragde: The Parallel Simplicity of Compaction and Chaining. J. Algorithms 14(3): 371-380 (1993)
	1992
16		Faith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, Miroslaw Kutylowski, Prabhakar Ragde: Retrieval of scattered information by EREW, CREW and CRCW PRAMs. SWAT 1992: 30-41
15		Prabhakar Ragde: Processor-Time Tradeoffs in PRAM Simulations. J. Comput. Syst. Sci. 44(1): 103-113 (1992)
	1991
14		Prabhakar Ragde, Avi Wigderson: Linear-Size Constant-Depth Polylog-Treshold Circuits. Inf. Process. Lett. 39(3): 143-146 (1991)
13		Prabhakar Ragde: Analysis of an Asynchronous PRAM Algorithm. Inf. Process. Lett. 39(5): 253-256 (1991)
	1990
12		Ilan Newman, Prabhakar Ragde, Avi Wigderson: Perfect Hashing, Graph Entropy, and Circuit Complexity. Structure in Complexity Theory Conference 1990: 91-99
11		Vince Grolmusz, Prabhakar Ragde: Incomparability in parallel computation. Discrete Applied Mathematics 29(1): 63-78 (1990)
	1989
10		Michael Luby, Prabhakar Ragde: A Bidirectional Shortest-Path Algorithm with Good Average-Case Behavior. Algorithmica 4(4): 551-567 (1989)
9		Faith E. Fich, Ming Li, Prabhakar Ragde, Yaacov Yesha: On the Power of Concurrent-Write PRAMs With Read-Only Memory Inf. Comput. 83(2): 234-244 (1989)
8		Eli Gafni, Joseph Naor, Prabhakar Ragde: On Separating the Erew and Crew Pram Models. Theor. Comput. Sci. 68(3): 343-346 (1989)
	1988
7		Faith E. Fich, Prabhakar Ragde, Avi Wigderson: Simulations Among Concurrent-Write PRAMs. Algorithmica 3: 43-51 (1988)
6		Faith E. Fich, Prabhakar Ragde, Avi Wigderson: Relations Between Concurrent-Write Models of Parallel Computation. SIAM J. Comput. 17(3): 606-627 (1988)
5		Prabhakar Ragde, William L. Steiger, Endre Szemerédi, Avi Wigderson: The Parallel Complexity of Element Distinctness is Omega (sqrt(log n)). SIAM J. Discrete Math. 1(3): 399-410 (1988)
	1987
4		Vince Grolmusz, Prabhakar Ragde: Incomparability in Parallel Computation FOCS 1987: 89-98
	1985
3		Michael Luby, Prabhakar Ragde: A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior (Preliminary Version). ICALP 1985: 394-403
2		Faith E. Fich, Friedhelm Meyer auf der Heide, Prabhakar Ragde, Avi Wigderson: One, Two, Three \dots Infinity: Lower Bounds for Parallel Computation STOC 1985: 48-58
	1984
1		Faith E. Fich, Prabhakar Ragde, Avi Wigderson: Relations Between Concurrent-Write Models of Parallel Computation. PODC 1984: 179-189

Coauthor Index

1	Omer Berkman	[18] [27]
2	Peter A. Buhr	[24] [25]
3	Jonathan F. Buss	[23]
4	Erik D. Demaine	[39]
5	Vida Dujmovic	[35] [36] [46] [49]
6	Patrick W. Dymond	[19] [22]
7	Faith Ellen (Faith Ellen Fich, Faith E. Fich)	[1] [2] [6] [7] [9] [16] [19] [20] [22]
8	Michael R. Fellows (Mike Fellows)	[35] [36] [42] [46] [49] [50]
9	Henning Fernau	[38]
10	Eli Gafni	[8]
11	Anil K. Goel	[24] [25]
12	Vince Grolmusz	[4] [11]
13	Arvind Gupta	[31] [44]
14	Torben Hagerup	[21] [26] [38]
15	Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi)	[33] [39]
16	Michael T. Hallett	[35] [36] [46]
17	Friedhelm Meyer auf der Heide	[2] [32]
18	Paris C. Kanellakis	[23]
19	Jyrki Katajainen	[21] [26]
20	Matthew Kitching	[35] [36] [46] [49]
21	Christian Knauer	[42] [50]
22	Miroslaw Kowaluk	[16] [20]
23	Miroslaw Kutylowski	[16] [20] [32]
24	Ming Li	[9]
25	Giuseppe Liotta	[35] [36] [46] [49]
26	Krzysztof Lorys	[16] [20]
27	Michael Luby	[3] [10]
28	Yossi Matias	[18] [27]
29	Catherine McCartin	[35] [36] [46] [49]
30	Joseph Naor (Seffi Naor)	[8]
31	Ilan Newman	[12]
32	Naomi Nishimura	[19] [21] [22] [24] [25] [26] [28] [29] [30] [31] [33] [34] [35] [36] [37] [38] [39] [40] [41] [42] [43] [44] [45] [46] [47] [48] [49] [50]
33	Andrzej Proskurowski	[31] [44]
34	Klaus Reinhardt	[38]
35	Frances A. Rosamond	[35] [36] [42] [46] [49] [50]
36	Walter L. Ruzzo	[19] [22]
37	Alexander A. Shvartsman	[23]
38	Ulrike Stege	[42] [50]
39	William L. Steiger	[5]
40	Matthew Suderman (Matthew J. Suderman)	[35] [36] [46]
41	Stefan Szeider	[40] [47] [48]
42	Endre Szemerédi	[5]
43	Dimitrios M. Thilikos	[28] [29] [30] [33] [34] [37] [39] [41] [42] [43] [45] [50]
44	Sue Whitesides	[35] [36] [42] [46] [49] [50]
45	Avi Wigderson	[1] [2] [5] [6] [7] [12] [14]
46	David R. Wood	[35] [36] [46] [49]
47	Yaacov Yesha	[9]

Colors in the list of coauthors