AAAAAA
Results:
1-9
|
Results: 9
Authors:
MARATHE MV
RAVI R
SUNDARAM R
RAVI SS
ROSENKRANTZ DJ
HUNT HB
Citation: Mv. Marathe et al., BICRITERIA NETWORK DESIGN-PROBLEMS, Journal of algorithms, 28(1), 1998, pp. 142-171
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:
MARATHE MV
RADHAKRISHNAN V
HUNT HB
RAVI SS
Citation: Mv. Marathe et al., HIERARCHICALLY SPECIFIED UNIT DISK GRAPHS, Theoretical computer science, 174(1-2), 1997, pp. 23-65
Authors:
MARATHE MV
HUNT HB
RAVI SS
Citation: Mv. Marathe et al., EFFICIENT APPROXIMATION ALGORITHMS FOR DOMATIC PARTITION AND ONLINE COLORING OF CIRCULAR ARC GRAPHS, Discrete applied mathematics, 64(2), 1996, pp. 135-149
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:
MARATHE MV
BREU H
HUNT HB
RAVI SS
ROSENKRANTZ DJ
Citation: Mv. Marathe et al., SIMPLE HEURISTICS FOR UNIT DISK GRAPHS, Networks, 25(2), 1995, pp. 59-68
Authors:
ROSENKRANTZ DJ
HUNT HB
Citation: Dj. Rosenkrantz et Hb. Hunt, THE COMPLEXITY OF PROCESSING HIERARCHICAL SPECIFICATIONS, SIAM journal on computing, 22(3), 1993, pp. 627-649
Risultati:
1-9
|