Search the dblp DataBase
Venkatesh Radhakrishnan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- 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. [Citation Graph (0, 0)][DBLP]
ESA, 1994, pp:424-435 [Conf] - Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
Approximation Schemes Using L-Reductions. [Citation Graph (0, 0)][DBLP]
FSTTCS, 1994, pp:342-353 [Conf] - Venkatesh Radhakrishnan, Sven Oliver Krumke, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi
Compact Location Problems. [Citation Graph (0, 0)][DBLP]
FSTTCS, 1993, pp:238-247 [Conf] - Venkatesh Radhakrishnan, Harry B. Hunt III, Richard Edwin Stearns
Efficient Algorithms for Solving Systems of Linear Equations and Path Problems. [Citation Graph (0, 0)][DBLP]
STACS, 1992, pp:109-119 [Conf] - Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan
Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version). [Citation Graph (0, 0)][DBLP]
STOC, 1994, pp:468-477 [Conf] - Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi
Hierarchical Specified Unit Disk Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
WG, 1993, pp:21-32 [Conf] - Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns
The Complexity of Planar Counting Problems [Citation Graph (0, 0)][DBLP]
CoRR, 1998, v:0, n:, pp:- [Journal] - Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems [Citation Graph (0, 0)][DBLP]
CoRR, 1998, v:0, n:, pp:- [Journal] - 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. [Citation Graph (0, 0)][DBLP]
Inf. Comput., 2002, v:173, n:1, pp:40-63 [Journal] - 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. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1998, v:26, n:2, pp:238-274 [Journal] - Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns
The Complexity of Planar Counting Problems. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1998, v:27, n:4, pp:1142-1167 [Journal] - Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1998, v:27, n:5, pp:1237-1261 [Journal] - Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz
Compact Location Problems. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1997, v:181, n:2, pp:379-404 [Journal] - Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi
Hierarchically Specified Unit Disk Graphs. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1997, v:174, n:1-2, pp:23-65 [Journal]
Search in 0.002secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002