An Evolution-Based Approach to Partitioning ASIC Systems. - Youssef Saab; Vasant B. Rao (DAC, 1989)

A Stochastic Algorithm for Circuit Bi-Partitioning. - Youssef Saab; Vasant B. Rao (Great Lakes Computer Science Conference, 1989)

Stochastic Evolution: a Fast Effective Heuristic for Some Generic Layout Problems. - Youssef Saab; Vasant B. Rao (DAC, 1990)

Fast effective heuristics for the graph bisectioning problem. - Youssef Saab; Vasant B. Rao (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1990)

Combinatorial optimization by stochastic evolution with applications to the physical design of VLSI circuits - Youssef Saab (1990)

Combinatorial optimization by stochastic evolution. - Youssef Saab; Vasant B. Rao (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1991)

CRIS: a test cultivation program for sequential VLSI circuits. - Daniel G. Saab; Youssef Saab; Jacob A. Abraham (ICCAD, 1992)

Post-analysis-based clustering dramatically improves the Fiduccia-Mattheyses algorithm. - Youssef Saab (EURO-DAC, 1993)

Iterative [simulation-based genetics + deterministic techniques]= complete ATPG0. - Daniel G. Saab; Youssef Saab; Jacob A. Abraham (ICCAD, 1994)

An Effective Solution to the Linear Placement Problem. - Youssef Saab; Cheng-Hua Chen (VLSI Design, 1994)

Iterative Improvement of Vertex Covers. - Youssef Saab (Inf. Process. Lett., 1995)

A Fast and Robust Network Bisection Algorithm. - Youssef Saab (IEEE Trans. Computers, 1995)

New Methods for the Construction of Test Cases for Partitioning Heuristics. - Youssef Saab (VLSI Design, 1995)

An improved linear placement algorithm using node compaction. - Youssef Saab (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1996)

Automatic test vector cultivation for sequential VLSI circuits using genetic algorithms. - Daniel G. Saab; Youssef Saab; Jacob A. Abraham (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1996)

A Fast Clustering-Based Min-Cut Placement Algorithm With Simulated-Annealing Performance. - Youssef Saab (VLSI Design, 1996)

Combinatorial Optimization by Dynamic Contraction. - Youssef Saab (J. Heuristics, 1997)

An Improved Algorithm for Intersecting Convex Polygons. - Youssef Saab (Inf. Process. Lett., 1997)

Shortest path planning on topographical maps. - Youssef Saab; Michael A. VanPutte (IEEE Trans. Syst. Man Cybern. Part A, 1999)

A New Effective And Efficient Multi-Level Partitioning Algorithm. - Youssef Saab (DATE, 2000)

Guest Editorial. - Youssef Saab (VLSI Design, 2000)

A New 2-way Multi-level Partitioning Algorithm. - Youssef Saab (VLSI Design, 2000)

A Fast and Effective Algorithm for the Feedback Arc Set Problem. - Youssef Saab (J. Heuristics, 2001)

A Contraction-based Ratio-cut Partitioning Algorithm. - Youssef Saab (VLSI Design, 2002)

An Effective Multilevel Algorithm for Bisecting Graphs and Hypergraphs. - Youssef Saab (IEEE Trans. Computers, 2004)