DBLP: Venkatesh Radhakrishnan

	2002
j6		Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns: Parallel Approximation Schemes for a Class of Planar and Near Planar Combinatorial Optimization Problems. Inf. Comput. 173(1): 40-63 (2002)
	1998
j5		Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. J. Algorithms 26(2): 238-274 (1998)
j4		Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns: The Complexity of Planar Counting Problems. SIAM J. Comput. 27(4): 1142-1167 (1998)
j3		Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan: Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems. SIAM J. Comput. 27(5): 1237-1261 (1998)
i2		Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns: The Complexity of Planar Counting Problems. CoRR cs.CC/9809017 (1998)
i1		Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan: Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems. CoRR cs.CC/9809064 (1998)
	1997
j2		Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi: Hierarchically Specified Unit Disk Graphs. Theor. Comput. Sci. 174(1-2): 23-65 (1997)
j1		Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz: Compact Location Problems. Theor. Comput. Sci. 181(2): 379-404 (1997)
	1994
c6		Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns: A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. ESA 1994: 424-435
c5		Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns: Approximation Schemes Using L-Reductions. FSTTCS 1994: 342-353
c4		Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan: Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version). STOC 1994: 468-477
	1993
c3		Venkatesh Radhakrishnan, Sven Oliver Krumke, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi: Compact Location Problems. FSTTCS 1993: 238-247
c2		Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi: Hierarchical Specified Unit Disk Graphs (Extended Abstract). WG 1993: 21-32
	1992
c1		Venkatesh Radhakrishnan, Harry B. Hunt III, Richard Edwin Stearns: Efficient Algorithms for Solving Systems of Linear Equations and Path Problems. STACS 1992: 109-119

2002

Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns: Parallel Approximation Schemes for a Class of Planar and Near Planar Combinatorial Optimization Problems. Inf. Comput. 173(1): 40-63 (2002)

1998

Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. J. Algorithms 26(2): 238-274 (1998)

Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns: The Complexity of Planar Counting Problems. SIAM J. Comput. 27(4): 1142-1167 (1998)

Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan: Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems. SIAM J. Comput. 27(5): 1237-1261 (1998)

Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns: The Complexity of Planar Counting Problems. CoRR cs.CC/9809017 (1998)

1997

Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi: Hierarchically Specified Unit Disk Graphs. Theor. Comput. Sci. 174(1-2): 23-65 (1997)

Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz: Compact Location Problems. Theor. Comput. Sci. 181(2): 379-404 (1997)

1994

Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns: A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. ESA 1994: 424-435

Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns: Approximation Schemes Using L-Reductions. FSTTCS 1994: 342-353

Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan: Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version). STOC 1994: 468-477

1993

Venkatesh Radhakrishnan, Sven Oliver Krumke, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi: Compact Location Problems. FSTTCS 1993: 238-247

Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi: Hierarchical Specified Unit Disk Graphs (Extended Abstract). WG 1993: 21-32

1992

Venkatesh Radhakrishnan, Harry B. Hunt III, Richard Edwin Stearns: Efficient Algorithms for Solving Systems of Linear Equations and Path Problems. STACS 1992: 109-119

1	Harry B. Hunt III	[j6] [j5] [j4] [j3] [i2] [i1] [j2] [c6] [c5] [c4] [c2] [c1]
2	Sven Oliver Krumke	[j1] [c3]
3	Madhav V. Marathe	[j6] [j5] [j4] [j3] [i2] [i1] [j2] [j1] [c6] [c5] [c4] [c3] [c2]
4	Hartmut Noltemeier	[j1]
5	S. S. Ravi	[j6] [j5] [j2] [j1] [c6] [c5] [c3] [c2]
6	Daniel J. Rosenkrantz	[j6] [j5] [j1] [c6] [c5] [c3]
7	Richard Edwin Stearns	[j6] [j5] [j4] [j3] [i2] [i1] [c6] [c5] [c4] [c1]

Venkatesh Radhakrishnan

Coauthor Index