UB Paderborn / Katalog / Suche / in CDI

The complexity of searching a graph

Journal of the ACM, 1988, Vol.35 (1), p.18-44

1988

Volltextzugriff (PDF)

Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing

SIAM review, 2002-03, Vol.44 (1), p.95-108

2002

Volltextzugriff (PDF)

Crossing Number is NP-Complete

SIAM journal on algebraic and discrete methods, 1983-09, Vol.4 (3), p.312-316

1983

Volltextzugriff (PDF)

The Rectilinear Steiner Tree Problem is NP-Complete

SIAM journal on applied mathematics, 1977-06, Vol.32 (4), p.826-834

1977

Volltextzugriff (PDF)

The Complexity of Flowshop and Jobshop Scheduling

Mathematics of operations research, 1976-05, Vol.1 (2), p.117-129

1976

Volltextzugriff (PDF)

The Complexity of Computing Steiner Minimal Trees

SIAM journal on applied mathematics, 1977-06, Vol.32 (4), p.835-859

1977

Volltextzugriff (PDF)

The Complexity of Coloring Circular Arcs and Chords

SIAM journal on algebraic and discrete methods, 1980-06, Vol.1 (2), p.216-227

1980

Volltextzugriff (PDF)

Scheduling file transfers

SIAM journal on computing, 1985-08, Vol.14 (3), p.744-780

1985

Volltextzugriff (PDF)

The Complexity of Near-Optimal Graph Coloring

Journal of the ACM, 1976-01, Vol.23 (1), p.43-49

1976

Volltextzugriff (PDF)

Diameter bounds for altered graphs

Journal of graph theory, 1984-12, Vol.8 (4), p.511-534

1984

Volltextzugriff (PDF)

One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties

Mathematics of operations research, 1988-05, Vol.13 (2), p.330-348

1988

Volltextzugriff (PDF)

An Application of Bin-Packing to Multiprocessor Scheduling

SIAM journal on computing, 1978-01, Vol.7 (1), p.1-17

1978

Volltextzugriff (PDF)

On Packing Two-Dimensional Bins

SIAM journal on algebraic and discrete methods, 1982-03, Vol.3 (1), p.66-76

1982

Volltextzugriff (PDF)

Scheduling Tasks with Nonuniform Deadlines on Two Processors

Journal of the ACM, 1976-07, Vol.23 (3), p.461-467

1976

Volltextzugriff (PDF)

Dynamic Bin Packing

SIAM journal on computing, 1983-05, Vol.12 (2), p.227-258

1983

Volltextzugriff (PDF)

Performance Guarantees for Scheduling Algorithms

Operations research, 1978-01, Vol.26 (1), p.3-21

1978

Volltextzugriff (PDF)

Complexity Results for Bandwidth Minimization

SIAM journal on applied mathematics, 1978-05, Vol.34 (3), p.477-495

1978

Volltextzugriff (PDF)

Optimal Binary Identification Procedures

SIAM journal on applied mathematics, 1972-09, Vol.23 (2), p.173-186

Garey, M. R.

1972

Volltextzugriff (PDF)

Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines

SIAM journal on computing, 1981-05, Vol.10 (2), p.256-269

1981

Volltextzugriff (PDF)

Asymptotic results for partial concentrators

IEEE transactions on communications, 1988-02, Vol.36 (2), p.214-217

1988

Volltextzugriff (PDF)

Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling

Journal of the ACM, 1993-11, Vol.40 (5), p.991-1018

1993

Volltextzugriff (PDF)

Scheduling Opposing Forests

SIAM journal on algebraic and discrete methods, 1983-03, Vol.4 (1), p.72-93

1983

Volltextzugriff (PDF)

Composing functions to minimize image size

SIAM journal on computing, 1985-05, Vol.14 (2), p.500-503

1985

Volltextzugriff (PDF)

Minimizing expected makespans on uniform processor systems

Advances in applied probability, 1987-03, Vol.19 (1), p.177-201

1987

Volltextzugriff (PDF)

Strong '' NP-Completeness Results: Motivation, Examples, and Implications

Journal of the ACM, 1978-07, Vol.25 (3), p.499-508

1978

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

The complexity of searching a graph

Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing

Crossing Number is NP-Complete

The Rectilinear Steiner Tree Problem is NP-Complete

The Complexity of Flowshop and Jobshop Scheduling

The Complexity of Computing Steiner Minimal Trees

The Complexity of Coloring Circular Arcs and Chords

Scheduling file transfers

The Complexity of Near-Optimal Graph Coloring

Diameter bounds for altered graphs

One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties

An Application of Bin-Packing to Multiprocessor Scheduling

On Packing Two-Dimensional Bins

Scheduling Tasks with Nonuniform Deadlines on Two Processors

Dynamic Bin Packing

Performance Guarantees for Scheduling Algorithms

Complexity Results for Bandwidth Minimization

Optimal Binary Identification Procedures

Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines

Asymptotic results for partial concentrators

Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling

Scheduling Opposing Forests

Composing functions to minimize image size

Minimizing expected makespans on uniform processor systems

Strong '' NP-Completeness Results: Motivation, Examples, and Implications

Suchergebnisse filtern