Authors: HUNT HB MARATHE MV RADHAKRISHNAN V RAVI SS ROSENKRANTZ DJ STEARNS RE

Citation: Hb. Hunt et al., NC-APPROXIMATION SCHEMES FOR NP-HARD AND PSPACE-HARD PROBLEMS FOR GEOMETRIC GRAPHS, Journal of algorithms, 26(2), 1998, pp. 238-274

Authors: MARATHE MV HUNT HB STEARNS RE RADHAKRISHNAN V

Citation: Mv. Marathe et al., APPROXIMATION ALGORITHMS FOR PSPACE-HARD HIERARCHICALLY AND PERIODICALLY SPECIFIED PROBLEMS, SIAM journal on computing, 27(5), 1998, pp. 1237-1261

Authors: HUNT HB MARATHE MV RADHAKRISHNAN V STEARNS RE

Citation: Hb. Hunt et al., THE COMPLEXITY OF PLANAR COUNTING PROBLEMS, SIAM journal on computing, 27(4), 1998, pp. 1142-1167

Authors: STEARNS RE HUNT HB

Citation: Re. Stearns et Hb. Hunt, AN ALGEBRAIC MODEL FOR COMBINATORIAL PROBLEMS, SIAM journal on computing, 25(2), 1996, pp. 448-476

Authors: STEARNS RE

Citation: Re. Stearns, ITS TIME TO RECONSIDER TIME, Communications of the ACM, 37(11), 1994, pp. 95-99