T. C. Hu

Proceedings of the 2018 International Symposium on Physical Design, 2018

2014

Optimal Alphabetic Ternary Trees.

[BibT_eX]

[DOI]

J. David Morgenthaler

CoRR, 2014

2008

The Unbounded Knapsack Problem.

[BibT_eX]

[DOI]

Leo Landa

Man-tak Shing

Proceedings of the Research Trends in Combinatorial Optimization, 2008

2005

Optimal Integer Alphabetic Trees in Linear Time.

[BibT_eX]

[DOI]

Lawrence L. Larmore

J. David Morgenthaler

Proceedings of the Algorithms, 2005

1997

Physical design: mathematical models and methods.

[BibT_eX]

[DOI]

Proceedings of the 1997 International Symposium on Physical Design, 1997

1995

A replication cut for two-way partitioning.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1995

Prim-Dijkstra tradeoffs for improved performance-driven routing tree design.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1995

Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods.

[BibT_eX]

[DOI]

Chung-Wen Albert Tsao

INFORMS J. Comput., 1995

Performance-Driven Partitioning Using a Replication Graph Approach.

[BibT_eX]

Proceedings of the 32st Conference on Design Automation, 1995

Optimum Alphabetic Binary Trees.

[BibT_eX]

[DOI]

J. David Morgenthaler

Proceedings of the Combinatorics and Computer Science, 1995

1994

Block-oriented programmable design with switching network interconnect.

[BibT_eX]

[DOI]

IEEE Trans. Very Large Scale Integr. Syst., 1994

A multi-probe approach for MCM substrate testing.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1994

1993

Optimal robust path planning in general environments.

[BibT_eX]

[DOI]

Gabriel Robins

IEEE Trans. Robotics Autom., 1993

A Direct Combination of the Prim and Dijkstra Constructions for Improved Performance-driven Global Routing.

[BibT_eX]

Proceedings of the 1993 IEEE International Symposium on Circuits and Systems, 1993

1992

Maximum Concurrent Flows and Minimum Cuts.

[BibT_eX]

[DOI]

Algorithmica, 1992

An optimal probe testing algorithm for the connectivity verification of MCM substrates.

[BibT_eX]

[DOI]

Proceedings of the 1992 IEEE/ACM International Conference on Computer-Aided Design, 1992

1991

The Orientation of Modules Based on Graph Decomposition.

[BibT_eX]

[DOI]

So-Zen Yao

IEEE Trans. Computers, 1991

Ancestor tree for arbitrary multi-terminal cut functions.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1991

1990

Every Tree is Graceful (But Some are More Graceful than Others).

[BibT_eX]

[DOI]

Proceedings of the Applied Geometry And Discrete Mathematics, 1990

1987

Binary Search on a Tape.

[BibT_eX]

[DOI]

Michelle L. Wachs

SIAM J. Comput., 1987

Graph folding and programmable logic array.

[BibT_eX]

[DOI]

Networks, 1987

Some Optimum Algorithms for Scheduling Problems with Changeover Costs.

[BibT_eX]

[DOI]

Frank Ruskey

Oper. Res., 1987

An effective algorithm for optimal PLA column folding.

[BibT_eX]

[DOI]

Integr., 1987

1986

A decomposition algorithm for multi-terminal networks flows.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1986

1985

Triangulations (tilings) and certain block triangular matrices.

[BibT_eX]

[DOI]

George B. Dantzig

Alan J. Hoffman

Math. Program., 1985

A heuristic algorithm for PLA block folding.

[BibT_eX]

[DOI]

C. Chen

Proceedings of the 22nd ACM/IEEE conference on Design automation, 1985

1984

Computation of Matrix Chain Products. Part II.

[BibT_eX]

[DOI]

SIAM J. Comput., 1984

1983

Multiterminal Flows in Outerplanar Networks.

[BibT_eX]

[DOI]

J. Algorithms, 1983

Optimum reduction of programmable logic array.

[BibT_eX]

[DOI]

Proceedings of the 20th Design Automation Conference, 1983

1982

Computation of Matrix Chain Products. Part I.

[BibT_eX]

[DOI]

SIAM J. Comput., 1982

1981

An O(n) Algorithm to Find a Near-Optimum Partition of a Convex Polygon.

[BibT_eX]

[DOI]

J. Algorithms, 1981

1980

Circular Cuts in a Network.

[BibT_eX]

[DOI]

Frank Ruskey

Math. Oper. Res., 1980

Some Theorems about Matrix Multiplication (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979

Assignment of Task in a Distributed Processor System with Limited Memory.

[BibT_eX]

[DOI]

Gururaj S. Rao

Harold S. Stone

IEEE Trans. Computers, 1979

1977

Generating Binary Trees Lexicographically.

[BibT_eX]

[DOI]

Frank Ruskey

SIAM J. Comput., 1977

Tree decomposition algorithm for large networks.

[BibT_eX]

[DOI]

W. J. Blewett

Networks, 1977

Error Bounds and the Applicability of the Greedy Solution to the Coin-Changing Problem.

[BibT_eX]

[DOI]

B. N. Tien

Oper. Res., 1977

1976

Technical Note - Optimality of a Heuristic Solution for a Class of Knapsack Problems.

[BibT_eX]

[DOI]

Melanie L. Lenard

Oper. Res., 1976

1975

Shortest string containing all permutations.

[BibT_eX]

[DOI]

P. J. Koutas

Discret. Math., 1975

1974

Optimum Communication Spanning Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 1974

1973

Two-commodity cut-packing problem.

[BibT_eX]

[DOI]

Math. Program., 1973

1972

A Comment on the Double-Chained Tree.

[BibT_eX]

[DOI]

Commun. ACM, 1972

Least Upper Bound on the Cost of Optimum Binary Search Trees.

[BibT_eX]

[DOI]

Kay Chen Tan

Acta Informatica, 1972

1971

Some problems in discrete optimization.

[BibT_eX]

[DOI]

Math. Program., 1971

1968

A Decomposition Algorithm for Shortest Paths in a Network.

[BibT_eX]

[DOI]

Oper. Res., 1968

1967

Laplace's Equation and Network Flows.

[BibT_eX]

[DOI]