Searching for authors named "Venkatesh Radhakrishnan" – sorted by Relevance.
-
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems
- MADHAV V. MARATHE y , HARRY B. HUNT III x , RICHARD E. STEARNS x , AND VENKATESH RADHAKRISHNAN z
- Cited by 8 (0 self) – Add To MetaCart
-
Hierarchically and 1-Dimensional Periodically Specified Generalized CNF Satisfiability Problems with Applications
- with Applications 1 MADHAV V. MARATHE 2 HARRY B. HUNT III 3 RICHARD E. STEARNS 3 VENKATESH RADHAKRISHNAN 4
- Cited by 6 (6 self) – Add To MetaCart
-
The complexity of planar counting problems
- , VENKATESH RADHAKRISHNAN, RICHARD E. STEARNS RAPPORT : XAVIER PUJOL 1. INTRODUCTION Le thème de cet article
- Cited by 20 (0 self) – Add To MetaCart
-
Hierarchically Specified Unit Disk Graphs
- Hierarchically Specified Unit Disk Graphs 4 Madhav V. Marathe 3 Venkatesh Radhakrishnan 2
- Cited by 6 (3 self) – Add To MetaCart
-
The Complexity of Planar Counting Problems
- THE COMPLEXITY OF PLANAR COUNTING PROBLEMS # HARRY B. HUNT III + , MADHAV V. MARATHE # , VENKATESH
- Cited by 1 (0 self) – Add To MetaCart
-
Complexity of Hierarchically and One-dimensional Periodically-specified Problems I: Hardness Results
- .E. Stearns V. Radhakrishnan LOS ALAMOS NATIONAL LABORATORY Los Alamos National Laboratory, an affirmative
- Add To MetaCart
-
NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
- 1;2;3 MADHAV V. MARATHE 3;6 VENKATESH RADHAKRISHNAN 5 S. S. RAVI 1;2 DANIEL J. ROSENKRANTZ 1
- Cited by 68 (1 self) – Add To MetaCart

