AAAAAA
Results:
1-19
|
Results: 19
Authors:
KHULLER S
RIVLIN E
ROSENFELD A
Citation: S. Khuller et al., GRAPHBOTS - COOPERATIVE MOTION PLANNING IN DISCRETE SPACES, IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 28(1), 1998, pp. 29-38
Authors:
KHULLER S
Citation: S. Khuller, PROBLEMS, Journal of algorithms, 28(1), 1998, pp. 192-195
Authors:
GUHA S
KHULLER S
Citation: S. Guha et S. Khuller, APPROXIMATION ALGORITHMS FOR CONNECTED DOMINATING SETS, Algorithmica, 20(4), 1998, pp. 374-387
Authors:
FEKETE SP
KHULLER S
KLEMMSTEIN M
RAGHAVACHARI B
YOUNG N
Citation: Sp. Fekete et al., A NETWORK-FLOW TECHNIQUE FOR FINDING LOW-WEIGHT BOUNDED-DEGREE SPANNING-TREES, Journal of algorithms, 24(2), 1997, pp. 310-324
Authors:
KHULLER S
RAGHAVACHARI B
ROSENFELD A
Citation: S. Khuller et al., LANDMARKS IN GRAPHS, Discrete applied mathematics, 70(3), 1996, pp. 217-229
Authors:
KHULLER S
RAGHAVACHARI B
YOUNG N
Citation: S. Khuller et al., ON STRONGLY CONNECTED DIGRAPHS WITH BOUNDED CYCLE LENGTH, Discrete applied mathematics, 69(3), 1996, pp. 281-289
Authors:
KHULLER S
RAGHAVACHARI B
Citation: S. Khuller et B. Raghavachari, IMPROVED APPROXIMATION ALGORITHMS FOR UNIFORM CONNECTIVITY PROBLEMS, Journal of algorithms, 21(2), 1996, pp. 434-450
Authors:
KHULLER S
RAGHAVACHARI B
YOUNG N
Citation: S. Khuller et al., LOW-DEGREE SPANNING-TREES OF SMALL WEIGHT, SIAM journal on computing, 25(2), 1996, pp. 355-368
Authors:
KHULLER S
MATIAS Y
Citation: S. Khuller et Y. Matias, A SIMPLE RANDOMIZED SIEVE ALGORITHM FOR THE CLOSEST-PAIR PROBLEM, Information and computation, 118(1), 1995, pp. 34-37
Authors:
AGGARWAL A
BARNOY A
KHULLER S
KRAVETS D
SCHIEBER B
Citation: A. Aggarwal et al., EFFICIENT MINIMUM-COST MATCHING AND TRANSPORTATION USING THE QUADRANGLE INEQUALITY, Journal of algorithms, 19(1), 1995, pp. 116-143
Authors:
KHULLER S
RAGHAVACHARI B
YOUNG N
Citation: S. Khuller et al., BALANCING MINIMUM SPANNING-TREES AND SHORTEST-PATH TREES, Algorithmica, 14(4), 1995, pp. 305-321
Authors:
KHULLER S
RAGHAVACHARI B
YOUNG N
Citation: S. Khuller et al., APPROXIMATING THE MINIMUM EQUIVALENT DIGRAPH, SIAM journal on computing, 24(4), 1995, pp. 859-872
Authors:
KHULLER S
MITCHELL SG
VAZIRANI VV
Citation: S. Khuller et al., ONLINE ALGORITHMS FOR WEIGHTED BIPARTITE MATCHING AND STABLE MARRIAGES, Theoretical computer science, 127(2), 1994, pp. 255-267
Authors:
KHULLER S
VISHKIN U
YOUNG N
Citation: S. Khuller et al., A PRIMAL-DUAL PARALLEL APPROXIMATION TECHNIQUE APPLIED TO WEIGHTED SET AND VERTEX COVERS, Journal of algorithms, 17(2), 1994, pp. 280-289
Authors:
KHULLER S
NAOR JS
Citation: S. Khuller et Js. Naor, FLOW IN PLANAR GRAPHS WITH VERTEX CAPACITIES, Algorithmica, 11(3), 1994, pp. 200-225
Authors:
KHULLER S
RAGHAVACHARI B
YOUNG N
Citation: S. Khuller et al., DESIGNING MULTICOMMODITY FLOW TREES, Information processing letters, 50(1), 1994, pp. 49-55
Authors:
KHULLER S
VISHKIN U
Citation: S. Khuller et U. Vishkin, BICONNECTIVITY APPROXIMATIONS AND GRAPH CARVINGS, Journal of the Association for Computing Machinery, 41(2), 1994, pp. 214-235
Authors:
KHULLER S
NAOR J
KLEIN P
Citation: S. Khuller et al., THE LATTICE STRUCTURE OF FLOW IN PLANAR GRAPHS, SIAM journal on discrete mathematics, 6(3), 1993, pp. 477-490
Authors:
ARKIN EM
KHULLER S
MITCHELL JSB
Citation: Em. Arkin et al., GEOMETRIC KNAPSACK-PROBLEMS, Algorithmica, 10(5), 1993, pp. 399-427
Risultati:
1-19
|