| 2009 |
|---|
| 26 | EE | Javier Marenco,
Annegret Wagler:
Cycle-based facets of chromatic scheduling polytopes.
Discrete Optimization 6(1): 51-63 (2009) |
| 25 | EE | Javier Marenco,
Annegret Wagler:
Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques.
Discrete Optimization 6(1): 64-78 (2009) |
| 2008 |
|---|
| 24 | EE | Markus Durzinsky,
Annegret Wagler,
Robert Weismantel:
A Combinatorial Approach to Reconstruct Petri Nets from Experimental Data.
CMSB 2008: 328-346 |
| 23 | 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) |
| 22 | EE | Annegret Wagler:
Constructions for normal graphs and some consequences.
Discrete Applied Mathematics 156(17): 3329-3338 (2008) |
| 21 | EE | Arnaud Pêcher,
Annegret Wagler:
On classes of minimal circular-imperfect graphs.
Discrete Applied Mathematics 156(7): 998-1010 (2008) |
| 2007 |
|---|
| 20 | EE | Javier Marenco,
Annegret Wagler:
Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems.
Annals OR 150(1): 159-175 (2007) |
| 19 | EE | Arnaud Pêcher,
Pierre Pesneau,
Annegret Wagler:
On facets of stable set polytopes of claw-free graphs with stability number three.
Electronic Notes in Discrete Mathematics 28: 185-190 (2007) |
| 18 | EE | Jens Kuhpfahl,
Annegret Katrin Wagler,
Christian Wagner:
Circular-imperfection of triangle-free graphs.
Electronic Notes in Discrete Mathematics 29: 163-167 (2007) |
| 2006 |
|---|
| 17 | EE | Javier Marenco,
Annegret Wagler:
On the combinatorial structure of chromatic scheduling polytopes.
Discrete Applied Mathematics 154(13): 1865-1876 (2006) |
| 16 | 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) |
| 15 | EE | Arnaud Pêcher,
Annegret Wagler:
Generalized clique family inequalities for claw-free graphs.
Electronic Notes in Discrete Mathematics 25: 117-121 (2006) |
| 14 | EE | Arie M. C. A. Koster,
Annegret Wagler:
On determining the imperfection ratio.
Electronic Notes in Discrete Mathematics 25: 177-181 (2006) |
| 13 | 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) |
| 12 | EE | Arnaud Pêcher,
Annegret Wagler:
Almost all webs are not rank-perfect.
Math. Program. 105(2-3): 311-328 (2006) |
| 2005 |
|---|
| 11 | EE | Annegret Wagler:
On rank-perfect subclasses of near-bipartite graphs.
4OR 3(4): 329-336 (2005) |
| 10 | EE | Javier Marenco,
Annegret Wagler:
The combinatorial stages of chromatic scheduling polytopes.
Electronic Notes in Discrete Mathematics 19: 63-69 (2005) |
| 9 | EE | Arnaud Pêcher,
Annegret Wagler,
Xuding Zhu:
Three classes of minimal circular-imperfect graphs.
Electronic Notes in Discrete Mathematics 19: 9-15 (2005) |
| 8 | EE | Sylvain Coulonges,
Arnaud Pêcher,
Annegret Wagler:
On strongly circular-perfectness.
Electronic Notes in Discrete Mathematics 22: 369-374 (2005) |
| 2004 |
|---|
| 7 | EE | Annegret Wagler:
Antiwebs are rank-perfect.
4OR 2(2): 149-152 (2004) |
| 6 | EE | Javier Marenco,
Annegret Wagler:
Combinatorial equivalence of Chromatic Scheduling Polytopes.
Electronic Notes in Discrete Mathematics 18: 177-180 (2004) |
| 5 | EE | Stefan Hougardy,
Annegret Wagler:
Perfectness is an Elusive Graph Property.
SIAM J. Comput. 34(1): 109-117 (2004) |
| 2003 |
|---|
| 4 | EE | Arnaud Pêcher,
Annegret Wagler:
On Non-Rank Facets of Stable Set Polytopes of Webs with Clique Number Four-Extended Abstract-.
Electronic Notes in Discrete Mathematics 13: 93-96 (2003) |
| 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) |
