Search the dblp DataBase

Publications of Author

1. Annegret Wagler
   Critical and Anticritical Edges in Perfect Graphs. [Citation Graph (0, 0)][DBLP]
   WG, 2001, pp:317-328 [Conf]
   
2. Annegret Wagler
   Antiwebs are rank-perfect. [Citation Graph (0, 0)][DBLP]
   4OR, 2004, v:2, n:2, pp:149-152 [Journal]
   
3. Annegret Wagler
   On rank-perfect subclasses of near-bipartite graphs. [Citation Graph (0, 0)][DBLP]
   4OR, 2005, v:3, n:4, pp:329-336 [Journal]
   
4. Annegret Wagler
   Critical Edges in Perfect Line Graphs and some Polyhedral Consequences. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1999, v:95, n:1-3, pp:455-466 [Journal]
   
5. Javier Marenco, Annegret Wagler
   On the combinatorial structure of chromatic scheduling polytopes. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2006, v:154, n:13, pp:1865-1876 [Journal]
   
6. Arnaud Pêcher, Annegret Wagler
   On non-rank facets of stable set polytopes of webs with clique number four. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2006, v:154, n:9, pp:1408-1415 [Journal]
   
7. Arnaud Pêcher, Annegret Wagler
   A construction for non-rank facets of stable set polytopes of webs. [Citation Graph (0, 0)][DBLP]
   Eur. J. Comb., 2006, v:27, n:7, pp:1172-1185 [Journal]
   
8. Zsolt Tuza, Annegret Wagler
   Minimally Non-Preperfect Graphs of Small Maximum Degree. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2001, v:17, n:4, pp:759-773 [Journal]
   
9. Arnaud Pêcher, Annegret Wagler
   Almost all webs are not rank-perfect. [Citation Graph (0, 0)][DBLP]
   Math. Program., 2006, v:105, n:2-3, pp:311-328 [Journal]
   
10. Stefan Hougardy, Annegret Wagler
    Perfectness is an Elusive Graph Property. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:34, n:1, pp:109-117 [Journal]
    
11. 
    A Combinatorial Approach to Reconstruct Petri Nets from Experimental Data. [Citation Graph (, )][DBLP]
    
    
12. 
    On classes of minimal circular-imperfect graphs. [Citation Graph (, )][DBLP]
    
    
13. 
    Constructions for normal graphs and some consequences. [Citation Graph (, )][DBLP]