| 2008 |
|---|
| 13 | EE | Markus Durzinsky,
Annegret Wagler,
Robert Weismantel:
A Combinatorial Approach to Reconstruct Petri Nets from Experimental Data.
CMSB 2008: 328-346 |
| 12 | EE | Markus Durzinsky,
Annegret Wagler,
Robert Weismantel,
Wolfgang Marwan:
Automatic reconstruction of molecular and genetic networks from discrete time series data.
Biosystems 93(3): 181-190 (2008) |
| 11 | EE | Arnaud Pêcher,
Annegret Wagler:
On classes of minimal circular-imperfect graphs.
Discrete Applied Mathematics 156(7): 998-1010 (2008) |
| 2006 |
|---|
| 10 | EE | Javier Marenco,
Annegret Wagler:
On the combinatorial structure of chromatic scheduling polytopes.
Discrete Applied Mathematics 154(13): 1865-1876 (2006) |
| 9 | EE | Arnaud Pêcher,
Annegret Wagler:
On non-rank facets of stable set polytopes of webs with clique number four.
Discrete Applied Mathematics 154(9): 1408-1415 (2006) |
| 8 | EE | Arnaud Pêcher,
Annegret Wagler:
A construction for non-rank facets of stable set polytopes of webs.
Eur. J. Comb. 27(7): 1172-1185 (2006) |
| 7 | EE | Arnaud Pêcher,
Annegret Wagler:
Almost all webs are not rank-perfect.
Math. Program. 105(2-3): 311-328 (2006) |
| 2005 |
|---|
| 6 | EE | Annegret Wagler:
On rank-perfect subclasses of near-bipartite graphs.
4OR 3(4): 329-336 (2005) |
| 2004 |
|---|
| 5 | EE | Annegret Wagler:
Antiwebs are rank-perfect.
4OR 2(2): 149-152 (2004) |
| 4 | EE | Stefan Hougardy,
Annegret Wagler:
Perfectness is an Elusive Graph Property.
SIAM J. Comput. 34(1): 109-117 (2004) |
| 2001 |
|---|
| 3 | EE | Annegret Wagler:
Critical and Anticritical Edges in Perfect Graphs.
WG 2001: 317-328 |
| 2 | EE | Zsolt Tuza,
Annegret Wagler:
Minimally Non-Preperfect Graphs of Small Maximum Degree.
Graphs and Combinatorics 17(4): 759-773 (2001) |
| 1999 |
|---|
| 1 | EE | Annegret Wagler:
Critical Edges in Perfect Line Graphs and some Polyhedral Consequences.
Discrete Applied Mathematics 95(1-3): 455-466 (1999) |
