A Polynomial Time Algorithm for Optimal Routing around a Rectangle (Extended Abstract) - Andrea S. LaPaugh (FOCS, 1980)

The Subgraph Homeomorphism Problem. - Andrea S. LaPaugh; Ronald L. Rivest (J. Comput. Syst. Sci., 1980)

Total stuct-at-fault testing by circuit transformation. - Andrea S. LaPaugh; Richard J. Lipton (DAC, 1983)

Optimal choice of intermediate latching to maximize throughput in VLSI circuits. - Peter R. Cappello; Andrea S. LaPaugh; Kenneth Steiglitz (ICASSP, 1983)

Total Fault Testing Using the Bipartite Transformation. - Andrea S. LaPaugh; Richard J. Lipton (ITC, 1983)

Scheduling File Transfers in a Distributed Network. - Edward G. Coffman Jr.; M. R. Garey; David S. Johnson 001; Andrea S. LaPaugh (PODC, 1983)

The even-path problem for graphs and digraphs. - Andrea S. LaPaugh; Christos H. Papadimitriou (Networks, 1984)

Scheduling File Transfers. - Edward G. Coffman Jr.; M. R. Garey; David S. Johnson 001; Andrea S. LaPaugh (SIAM J. Comput., 1985)

Issues in synthesis of board-level systems. - Andrea S. LaPaugh; Wayne H. Wolf (RSP, 1990)

CLOVER: A Timing Constraints Verification System. - Dimitris Doukas; Andrea S. LaPaugh (DAC, 1991)

Editors' Introduction. - Andrea S. LaPaugh; Frank Thomson Leighton (Algorithmica, 1991)

How to Store a Triangular Matrix. - Andrea S. LaPaugh; Richard J. Lipton; Jonathan S. Sandberg (IEEE Trans. Computers, 1992)

Recontamination Does Not Help to Search a Graph. - Andrea S. LaPaugh (J. ACM, 1993)

Minimizing Channel Density by Lateral Shifting of Components. - David S. Johnson 001; Andrea S. LaPaugh; Ron Y. Pinter (SODA, 1994)

Layout Algorithms for VLSI deisgn. - Andrea S. LaPaugh (ACM Comput. Surv., 1996)

Case Study in Algorithms: VLSI Layout. - Andrea S. LaPaugh (The Computer Science and Engineering Handbook, 1997)

Rotation scheduling: a loop pipelining algorithm. - Liang-Fang Chao; Andrea S. LaPaugh; Edwin Hsing-Mean Sha (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1997)

Finding All Minimal Shapes in a Routing Channel. - Liang-Fang Chao; Andrea S. LaPaugh (Algorithmica, 1998)

VLSI Layout Algorithms. - Andrea S. LaPaugh (Algorithms and Theory of Computation Handbook, 1999)

Categorizing information objects from user access patterns. - Mao Chen 001; Andrea S. LaPaugh; Jaswinder Pal Singh (CIKM, 2002)

Predicting category accesses for a user in a structured information space. - Mao Chen 001; Andrea S. LaPaugh; Jaswinder Pal Singh (SIGIR, 2002)

Content Distribution for Publish/Subscribe Services. - Mao Chen 001; Andrea S. LaPaugh; Jaswinder Pal Singh (Middleware, 2003)

Subscription-Enhanced Content Delivery. - Mao Chen 001; Jaswinder Pal Singh; Andrea S. LaPaugh (WCW, 2003)

Estimating the maximum. - Ben Gum; Richard J. Lipton; Andrea S. LaPaugh; Faith E. Fich (J. Algorithms, 2005)

Enabling Author-Centric Ranking of Web Content. - Muneeb Ali; Andrea S. LaPaugh (WebDB, 2013)