Selected papers that cite this one
- Thomas Lengauer and Egon Wanke. Efficient decision procedures for graph properties on context-free graph languages. Journal of the ACM, 40(2):368-393, April 1993.
- M. V. Marathe, H. B. Hunt III, and S. S. Ravi. The complexity of approximation PSPACE-complete problems for hierarchical specifications. Nordic Journal of Computing, 1(3):275-316, Fall 1994.
- M. V. Marathe, H. B. Hunt III, R. E. Stearns, and V. Radhakrishnan. Approximation schemes for PSPACE-complete problems for succint specifications (preliminary version). In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 468-477, Montréal, Québec, Canada, 23-25 May 1994.
- Madhav V. Marathe, Harry B. Hunt III, Richard E. Stearns, and Venkatesh Radhakrishnan. Approximation algorithms for PSPACE-hard hierarchically and periodically specified problems. SIAM Journal on Computing, 27(5):1237-1261, October 1998.
- Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, and S. S. Ravi. Hierarchically specified unit disk graphs. Theoretical Computer Science, 174(1-2):23-65, 15 March 1997.