Laplace's Equation and Network Flows. - T. C. Hu (Oper. Res., 1967)

A Decomposition Algorithm for Shortest Paths in a Network. - T. C. Hu (Oper. Res., 1968)

Some problems in discrete optimization. - T. C. Hu (Math. Program., 1971)

Least Upper Bound on the Cost of Optimum Binary Search Trees. - T. C. Hu; Kay Chen Tan (Acta Informatica, 1972)

A Comment on the Double-Chained Tree. - T. C. Hu (Commun. ACM, 1972)

Two-commodity cut-packing problem. - T. C. Hu (Math. Program., 1973)

Optimum Communication Spanning Trees. - T. C. Hu (SIAM J. Comput., 1974)

Shortest string containing all permutations. - P. J. Koutas; T. C. Hu (Discret. Math., 1975)

Technical Note - Optimality of a Heuristic Solution for a Class of Knapsack Problems. - T. C. Hu; Melanie L. Lenard (Oper. Res., 1976)

Error Bounds and the Applicability of the Greedy Solution to the Coin-Changing Problem. - B. N. Tien; T. C. Hu (Oper. Res., 1977)

Tree decomposition algorithm for large networks. - W. J. Blewett; T. C. Hu (Networks, 1977)

Generating Binary Trees Lexicographically. - Frank Ruskey; T. C. Hu (SIAM J. Comput., 1977)

Assignment of Task in a Distributed Processor System with Limited Memory. - Gururaj S. Rao; Harold S. Stone; T. C. Hu (IEEE Trans. Computers, 1979)

Some Theorems about Matrix Multiplication (Extended Abstract) - T. C. Hu; M. T. Shing (FOCS, 1980)

Circular Cuts in a Network. - T. C. Hu; Frank Ruskey (Math. Oper. Res., 1980)

An O(n) Algorithm to Find a Near-Optimum Partition of a Convex Polygon. - T. C. Hu; M. T. Shing (J. Algorithms, 1981)

Computation of Matrix Chain Products. Part I. - T. C. Hu; M. T. Shing (SIAM J. Comput., 1982)

Optimum reduction of programmable logic array. - T. C. Hu; Yue-Sun Kuo (DAC, 1983)

Multiterminal Flows in Outerplanar Networks. - T. C. Hu; M. T. Shing (J. Algorithms, 1983)

Computation of Matrix Chain Products. Part II. - T. C. Hu; M. T. Shing (SIAM J. Comput., 1984)

A heuristic algorithm for PLA block folding. - Yue-Sun Kuo; C. Chen; T. C. Hu (DAC, 1985)

Triangulations (tilings) and certain block triangular matrices. - George B. Dantzig; Alan J. Hoffman; T. C. Hu (Math. Program., 1985)

A decomposition algorithm for multi-terminal networks flows. - M. T. Shing; T. C. Hu (Discret. Appl. Math., 1986)

An effective algorithm for optimal PLA column folding. - Yue-Sun Kuo; T. C. Hu (Integr., 1987)

Some Optimum Algorithms for Scheduling Problems with Changeover Costs. - T. C. Hu; Yue-Sun Kuo; Frank Ruskey (Oper. Res., 1987)

Graph folding and programmable logic array. - T. C. Hu; Yue-Sun Kuo (Networks, 1987)

Binary Search on a Tape. - T. C. Hu; Michelle L. Wachs (SIAM J. Comput., 1987)

Every Tree is Graceful (But Some are More Graceful than Others). - T. C. Hu; Andrew B. Kahng (Applied Geometry And Discrete Mathematics, 1990)

Ancestor tree for arbitrary multi-terminal cut functions. - Chung-Kuan Cheng; T. C. Hu (Ann. Oper. Res., 1991)

The Orientation of Modules Based on Graph Decomposition. - Chung-Kuan Cheng; So-Zen Yao; T. C. Hu (IEEE Trans. Computers, 1991)

An optimal probe testing algorithm for the connectivity verification of MCM substrates. - So-Zen Yao; Nan-Chi Chou; Chung-Kuan Cheng; T. C. Hu (ICCAD, 1992)

Maximum Concurrent Flows and Minimum Cuts. - Chung-Kuan Cheng; T. C. Hu (Algorithmica, 1992)

A Direct Combination of the Prim and Dijkstra Constructions for Improved Performance-driven Global Routing. - Charles J. Alpert; T. C. Hu; Jen-Hsin Huang; Andrew B. Kahng (ISCAS, 1993)

Optimal robust path planning in general environments. - T. C. Hu; Andrew B. Kahng; Gabriel Robins (IEEE Trans. Robotics Autom., 1993)

A multi-probe approach for MCM substrate testing. - So-Zen Yao; Nan-Chi Chou; Chung-Kuan Cheng; T. C. Hu (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1994)

Block-oriented programmable design with switching network interconnect. - Chingwei Yeh; Lung-Tien Liu; Chung-Kuan Cheng; T. C. Hu; S. Ahmed; M. Liddel (IEEE Trans. Very Large Scale Integr. Syst., 1994)

Optimum Alphabetic Binary Trees. - T. C. Hu; J. David Morgenthaler (Combinatorics and Computer Science, 1995)

Performance-Driven Partitioning Using a Replication Graph Approach. - Lung-Tien Liu; Ming-Ter Kuo; Chung-Kuan Cheng; T. C. Hu (DAC, 1995)

Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods. - T. C. Hu; Andrew B. Kahng; Chung-Wen Albert Tsao (INFORMS J. Comput., 1995)

Prim-Dijkstra tradeoffs for improved performance-driven routing tree design. - Charles J. Alpert; T. C. Hu; Dennis J.-H. Huang; Andrew B. Kahng; David R. Karger (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1995)

A replication cut for two-way partitioning. - Lung-Tien Liu; Ming-Ter Kuo; Chung-Kuan Cheng; T. C. Hu (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1995)

Physical design: mathematical models and methods. - T. C. Hu (ISPD, 1997)

Optimal Integer Alphabetic Trees in Linear Time. - T. C. Hu; Lawrence L. Larmore; J. David Morgenthaler (ESA, 2005)

The Unbounded Knapsack Problem. - T. C. Hu; Leo Landa; Man-tak Shing (Bonn Workshop of Combinatorial Optimization, 2008)

Optimal Alphabetic Ternary Trees. - J. David Morgenthaler; T. C. Hu (CoRR, 2014)

Theory and Algorithms of Physical Design. - Chung-Kuan Cheng; T. C. Hu; Andrew B. Kahng (ISPD, 2018)