Welcome to Advanced Seminar D homepage
Date  Subject  Source  Presented by 

18.3  Introduction  Paz  
25.3  pages 51–57  Algorithmic Graph Theory and Perfect Graphs  
pages 58–61  Algorithmic Graph Theory and Perfect Graphs  
15.4  pages 81–84 + 91–94  Algorithmic Graph Theory and Perfect Graphs  
pages 84–91  Algorithmic Graph Theory and Perfect Graphs  
29.4  Paper  Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph: F. Gavril 

pages 105–113  Algorithmic Graph Theory and Perfect Graphs  
6.5  pages 113–124  Algorithmic Graph Theory and Perfect Graphs  
pages 135139 + 149155  Algorithmic Graph Theory and Perfect Graphs  
13.5  pages 157–168  Algorithmic Graph Theory and Perfect Graphs  
pages 171–181  Algorithmic Graph Theory and Perfect Graphs  
20.5  pages 181–188  Algorithmic Graph Theory and Perfect Graphs  
pages 188–193  Algorithmic Graph Theory and Perfect Graphs  
27.5  pages 235242 + 248251  Algorithmic Graph Theory and Perfect Graphs  
To be announced  
3.6  Paper  Toughness, hamiltonicity and split graphs  
Paper  On Partitioning Interval Graphs into Proper Interval Subgraphs and Related Problems  
10.6  Paper  DOMINATING SETS AND DOMATIC NUMBER OF CIRCULAR ARC GRAPHS  
Paper  UNIT DISK GRAPHS  
17.6  Paper  MATRIX CHARACTERIZATIONS OF CIRCULARARC GRAPHS  
To be announced  
24.6  Paper  Listcoloring clawfree graphs with small clique number  
Paper  ON THE COMPLEXITY OF FINDING A SUN IN A GRAPH 