Combinatorial Algorithms for Integrated Circuit Layout is a comprehensive book that explores the combinatorial aspects of integrated circuit layout. The book is part of the Wiley–Teubner Series in Computer Science and is authored by Thomas Lengauer. It provides an in-depth overview of the most important combinatorial problems in circuit layout and describes their solutions. The book is intended for both practitioners in computer-aided design (CAD) and computer scientists and mathematicians interested in efficient combinatorial algorithms. The book is organized into two parts. Part I provides an introduction to the subject, covering the basics of circuit layout, optimization problems, graph algorithms, and operations research and statistics. Part II discusses the actual layout optimization problems, including circuit partitioning, placement, floorplanning, global routing, and detailed routing. The book also covers compaction, which is a crucial step in the layout process that ensures the design meets the fabrication process's rules. The book is written for a wide audience, including researchers, CAD tool builders, and people interested in algorithm design and analysis. It is structured to serve as both a reference and a textbook. The book includes over 150 exercises, many of which are open research problems marked with a star. The book also includes an extensive list of references to the literature and a detailed subject index to help readers locate key terms and concepts. The book is designed to be used as a textbook for graduate-level courses and as a reference for experts in CAD and optimization. It requires a basic understanding of algorithms and mathematical prerequisites such as linear algebra and linear programming. The book is also intended to be used as a basis for courses in computer science, electrical engineering, mathematics, and operations research. The role of Part I of the book depends on the background of the course participants and is decided by the lecturer in each case. Part II of the book relies heavily on the notation introduced in Part I, so even if the course participants know the material in Part I, they will have to refer back to it to understand the notation. The book is a valuable resource for those interested in the design and analysis of efficient combinatorial algorithms for integrated circuit layout. It provides a solid foundation for advanced research in the area and is an essential reference for practitioners and researchers in the field.Combinatorial Algorithms for Integrated Circuit Layout is a comprehensive book that explores the combinatorial aspects of integrated circuit layout. The book is part of the Wiley–Teubner Series in Computer Science and is authored by Thomas Lengauer. It provides an in-depth overview of the most important combinatorial problems in circuit layout and describes their solutions. The book is intended for both practitioners in computer-aided design (CAD) and computer scientists and mathematicians interested in efficient combinatorial algorithms. The book is organized into two parts. Part I provides an introduction to the subject, covering the basics of circuit layout, optimization problems, graph algorithms, and operations research and statistics. Part II discusses the actual layout optimization problems, including circuit partitioning, placement, floorplanning, global routing, and detailed routing. The book also covers compaction, which is a crucial step in the layout process that ensures the design meets the fabrication process's rules. The book is written for a wide audience, including researchers, CAD tool builders, and people interested in algorithm design and analysis. It is structured to serve as both a reference and a textbook. The book includes over 150 exercises, many of which are open research problems marked with a star. The book also includes an extensive list of references to the literature and a detailed subject index to help readers locate key terms and concepts. The book is designed to be used as a textbook for graduate-level courses and as a reference for experts in CAD and optimization. It requires a basic understanding of algorithms and mathematical prerequisites such as linear algebra and linear programming. The book is also intended to be used as a basis for courses in computer science, electrical engineering, mathematics, and operations research. The role of Part I of the book depends on the background of the course participants and is decided by the lecturer in each case. Part II of the book relies heavily on the notation introduced in Part I, so even if the course participants know the material in Part I, they will have to refer back to it to understand the notation. The book is a valuable resource for those interested in the design and analysis of efficient combinatorial algorithms for integrated circuit layout. It provides a solid foundation for advanced research in the area and is an essential reference for practitioners and researchers in the field.