AAAAAA
Results:
1-23
|
Results: 23
Authors:
EPPSTEIN D
Citation: D. Eppstein, FINDING THE K-SHORTEST PATHS, SIAM journal on computing (Print), 28(2), 1999, pp. 652-673
Authors:
EPPSTEIN D
GALIL Z
ITALIANO GF
SPENCER TH
Citation: D. Eppstein et al., SEPARATOR-BASED SPARSIFICATION - II - EDGE AND VERTEX CONNECTIVITY, SIAM journal on computing (Print), 28(1), 1999, pp. 341-381
Authors:
AMENTA N
BERN M
EPPSTEIN D
Citation: N. Amenta et al., THE CRUST AND THE BETA-SKELETON - COMBINATORIAL CURVE RECONSTRUCTION, Graphical models and image processing, 60(2), 1998, pp. 125-135
Authors:
EPPSTEIN D
Citation: D. Eppstein, GEOMETRIC LOWER BOUNDS FOR PARAMETRIC MATROID OPTIMIZATION, Discrete & computational geometry, 20(4), 1998, pp. 463-476
Authors:
EPPSTEIN D
Citation: D. Eppstein, GUEST EDITORS FOREWORD, Algorithmica, 22(3), 1998, pp. 233-234
Authors:
EPPSTEIN D
GALIL Z
ITALIANO GF
NISSENZWEIG A
Citation: D. Eppstein et al., SPARSIFICATION - A TECHNIQUE FOR SPEEDING-UP DYNAMIC GRAPH ALGORITHMS, JOURNAL OF THE ACM, 44(5), 1997, pp. 669-696
Authors:
EPPSTEIN D
HIRSCHBERG DS
Citation: D. Eppstein et Ds. Hirschberg, CHOOSING SUBSETS WITH MAXIMUM WEIGHTED AVERAGE, Journal of algorithms, 24(1), 1997, pp. 177-193
Authors:
EPPSTEIN D
Citation: D. Eppstein, MINIMUM RANGE BALANCED CUTS VIA DYNAMIC SUBSET SUMS, Journal of algorithms, 23(2), 1997, pp. 375-385
Authors:
EPPSTEIN D
PATERSON MS
YAO FF
Citation: D. Eppstein et al., ON NEAREST-NEIGHBOR GRAPHS, Discrete & computational geometry, 17(3), 1997, pp. 263-282
Authors:
EPPSTEIN D
Citation: D. Eppstein, DYNAMIC CONNECTIVITY IN DIGITAL IMAGES, Information processing letters, 62(3), 1997, pp. 121-126
Authors:
DOBKIN DP
EPPSTEIN D
MITCHELL DP
Citation: Dp. Dobkin et al., COMPUTING THE DISCREPANCY WITH APPLICATIONS TO SUPERSAMPLING PATTERNS, ACM transactions on graphics, 15(4), 1996, pp. 354-376
Authors:
EPPSTEIN D
GALIL Z
ITALIANO GF
SPENCER TH
Citation: D. Eppstein et al., SEPARATOR BASED SPARSIFICATION .1. PLANARITY TESTING AND MINIMUM SPANNING-TREES, Journal of computer and system sciences, 52(1), 1996, pp. 3-27
Authors:
EPPSTEIN D
Citation: D. Eppstein, DYNAMIC EUCLIDEAN MINIMUM SPANNING-TREES AND EXTREMA OF BINARY FUNCTIONS, Discrete & computational geometry, 13(1), 1995, pp. 111-122
Authors:
EPPSTEIN D
Citation: D. Eppstein, ASYMPTOTIC SPEED-UPS IN CONSTRUCTIVE SOLID GEOMETRY, Algorithmica, 13(5), 1995, pp. 462-471
Authors:
EPPSTEIN D
Citation: D. Eppstein, OFFLINE ALGORITHMS FOR DYNAMIC MINIMUM SPANNING TREE PROBLEMS, Journal of algorithms, 17(2), 1994, pp. 237-250
Authors:
ARONOV B
BERN M
EPPSTEIN D
Citation: B. Aronov et al., ON THE NUMBER OF MINIMAL-1-STEINER TREES, Discrete & computational geometry, 12(1), 1994, pp. 29-34
Authors:
EPPSTEIN D
ERICKSON J
Citation: D. Eppstein et J. Erickson, ITERATED NEAREST NEIGHBORS AND FINDING MINIMAL POLYTOPES, Discrete & computational geometry, 11(3), 1994, pp. 321-350
Authors:
EPPSTEIN D
Citation: D. Eppstein, APPROXIMATING THE MINIMUM WEIGHT STEINER TRIANGULATION, Discrete & computational geometry, 11(2), 1994, pp. 163-191
Authors:
BERN M
DOBKIN D
EPPSTEIN D
GROSSMAN R
Citation: M. Bern et al., VISIBILITY WITH A MOVING POINT-OF-VIEW, Algorithmica, 11(4), 1994, pp. 360-378
Authors:
BERN M
EPPSTEIN D
GILBERT J
Citation: M. Bern et al., PROVABLY GOOD MESH GENERATION, Journal of computer and system sciences, 48(3), 1994, pp. 384-409
Authors:
EPPSTEIN D
Citation: D. Eppstein, ARBORICITY AND BIPARTITE SUBGRAPH LISTING ALGORITHMS, Information processing letters, 51(4), 1994, pp. 207-211
Authors:
EPPSTEIN D
Citation: D. Eppstein, CONNECTIVITY, GRAPH MINORS, AND SUBGRAPH MULTIPLICITY, Journal of graph theory, 17(3), 1993, pp. 409-416
Authors:
BERN M
EDELSBRUNNER H
EPPSTEIN D
MITCHELL S
TAN TS
Citation: M. Bern et al., EDGE INSERTION FOR OPTIMAL TRIANGULATIONS, Discrete & computational geometry, 10(1), 1993, pp. 47-65
Risultati:
1-23
|