Marek Perkowski - for Advanced Design Automation. PACKAGE 19 - BASIC COMBINATORIAL PROBLEMS. .IP 1. K. Stoffers - Sequential Algorithm for the Determination of Maximum Compatibles. .IP 2. N. Funabiki et al - A Neural network parallel algorithm for clique vertex-partition poblems. .IP 3. David Smith - clique partitioning review. .IP 4. Bron et al - Finding All Cliques of an Undirected Graph. .IP 5. Mulligan and Cornell - Corrections to Bierstone's ALgorithm for Generating Cliques. .IP 6. Auguston and Minker - An Analysis of Some Graph Theoretical Cluster Techniques. .IP 7. Tseng and Siewiorek - Automated Synthesis of Data Paths in Digital Systems. .IP 8. Hoede - Hard Graphs for the Maximum Clique Problem. .IP 9. Ho and Lee - Efficient Parallel Algorithms for Finding Maximal Cliques, Clique Trees, and Minimum Coloring on Chordal Graphs. .IP 10. Balas and Yu - Finding a Maximum Clique in an Arbitrary Graph. .IP 11. Johnson and Yannakakis - On Generating all Maximal Independent Sets. .IP 12. Tsukijama et al - A New Algorithm for Generating all the Maximal Independent Sets. .IP 13. Griggs et al. - The Number of Maximal Independent Sets in a Connected Graph. .IP 14. Tarjan and Trojanowski - Finding a Maximum Independent Set. .IP 15. Furedi - The Number of Maximal Independent Sets in Connected Graphs. .IP 16. M. Luby - A Simple Parallel Algorithm for the Maximal Independent Set Problem. .IP 17. Loukakis and Touros - Determining the Number of Internal Stability of a Graph. .IP 18. Philipsen and Stok - Graph Coloring using Neural Networks. .IP 18. Shekhovtsov adn Yakovlev - Formalization and Solution of One Class of Covering Problems for the Design of Monitoring and Testing Systems. .IP 19. Kravets and Sergienko - Decomposition Method of Solving A Class of Combinatorial Optimization Problems. .IP 20. Murav'ev - Two Methods of Ordering Covering Elements for the Solution of the Set Covering Problem. .IP 21. Reusch - Generation of Prime Implicants from Subfunctions and a Unifying Approach to the Covering Problem. .IP 22. Roshchin and Sergenko - An Approach to the Solution of the Set Covering Problem. .IP 23. Reusch and Merzenich - Minimal Coverings for Incompletely Specified Sequential Machines. .IP 24 Erdos - Disjoint Cliques and Disjoint Maximal Independent Sets of Vertices in Graphs. .IP 25. Gregory and Pullman - On a Clique Covering Problem of Orlin. .IP 26. Hsu and Nemhauser - A Polynomial Algorithm for the Minimum Weighted Clique Cover Problem on Claw-Free Perfect Graphs. .IP 27. Hsu and Nemhauser - Algorithms for Minimum Covering by Cliques and Maximum Clique in Claw-Free Perfect Graphs. .IP 28. Gavril - Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph. .IP 29. Young Ph.D. Thesis, Univ. of Illinois Urbana -- The Minimal Covering Problem and Automated Design of Two-Level AND/OR Optimal Networks.