Publications by Annegret Wagler

Articles in Journals / Proceedings

• Wing-triangulated graphs are perfect (with S. Hougardy and V.B. Le),
Journal of Graph Theory 24 (1997) 25-31.

• On Critically Perfect Graphs, Journal of Graph Theory 32 (1999) 394-404.

• Critical Edges in Perfect Line Graphs and Some Polyhedral Consequences,
Discrete Applied Mathematics 95 (1999) 455-466. pdf

• Minimally Non-Preperfect Graphs of Small Maximum Degree (with Zsolt Tuza),
Graphs and Combinatorics 17 (2001) 759-773. pdf

• Critical and Anticritical Edges in Perfect Graphs,
In: Graph-Theoretic Concepts in Computer Science (WG 2001), A. Brandstädt, V.B. Le (eds.)
Lecture Nodes in Computer Science 2204, Springer (2001) 317-327. pdf

• Rank-Perfect and Weakly Rank-Perfect Graphs,
Mathematical Methods of Operations Research 95 (2002) 127-149.

• Relaxing Perfectness: Which Graphs are 'Almost' Perfect?,
In: The Sharpest Cut - Impact of Manfred Padberg and His Work, M. Grötschel (ed.) SIAM/MPS Series on Optimization 4, Philadelphia, 2004.

• Antiwebs are Rank-Perfect, 4OR 2 (2004) 149-152.

• Perfectness is an Elusive Graph Property (with S. Hougardy),
SIAM Journal on Computing 34 (2004) 109-117. pdf

• On rank-perfect subclasses of near-bipartite graphs, 4OR 3 (2005) 329-336. pdf

• On Non-Rank Facets of Stable Set Polytopes of Webs with Clique Number Four (with A. Pecher),
Discrete Applied Mathematics 154 (2006) 1408-1415. pdf

• A construction for non-rank facets of stable set polytopes of webs (with A. Pecher),
European Journal of Combinatorics 27 (2006) 1172-1185. pdf

• Almost all webs are not rank-perfect (with A. Pecher),
Mathematical Programming B 105 (2006) 311-328. pdf

• The Normal Graph Conjecture is true for circulants,
In: Graph Theory, Trends in Mathematics, Birkhäuser (2006) 365-374.

• On the combinatorial structure of chromatic scheduling polytopes (with J. Marenco),
Discrete Applied Mathematics 154 (2006) 1865-1876. pdf

• Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems (with J. Marenco),
Annals of Operations Research 150 (2007) 159-175.

• A mathematical approach to solve the network reconstruction problem (with W. Marwan and R. Weismantel),
Math. Methods of Operations Research 67 (2008) 117-132.

• On classes of minimal circular-imperfect graphs (with A. Pecher),
Discrete Applied Mathematics 156 (2008) 998-1010.

• Automatic reconstruction of molecular and genetic networks from experimental time series data (with M. Durzinsky, W. Marwan, and R. Weismantel)
BioSystems 93 (2008) 181-190.

• Comparing imperfection ratio and imperfection index for graph classes (with A. Koster)
RAIRO Operations Research 42 (2008) 485-500

• A combinatorial approach to reconstruct Petri nets from experimental data (with M. Durzinsky and R. Weismantel)
In: M. Heiner and A.M. Uhrmacher (edts.), CSMB 2008, Lecture Notes in Bioinformatics 5307 (2008) 328-346

• Constructions for normal graphs and some consequences
Discrete Applied Mathematics 156 (2008) 3329-3338

• Characterizing and bounding the imperfection ratio for some graph classes (with S. Coulonge and A. Pecher)
Mathematical Programming A 118 (2009) 37-46

• Cycle-based facets of chromatic scheduling polytopes (with J. Marenco)
Discrete Optimization 6 (2009) 51-63

• Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques (with J. Marenco)
Discrete Optimization 6 (2009) 64-78

Accepted Papers

• Triangle-free strongly circular-perfect graphs (with S. Coulonges and A. Pecher)
To appear in: Discrete Mathematics, special issue ICGT05

• On the Chvatal-rank of quasi-line graphs (with A. Pecher) To appear in: RAIRO

• The combinatorics of modeling and analysing biological systems (with R. Weismantel)
To appear in: Natural Computing (DOI 10.1007/s11047-009-9165-5)

• Petri nets as a framework for the reconstruction and modification of signal transduction pathways and regulatory networks (with W. Marwan and R. Weismantel)
To appear in: Natural Computing (DOI 10.1007/s11047-009-9152-x)

• On the Chvatal-rank of linear relaxations of the stable set polytope (with E. Holm and L.M. Torres)
Preprint 09-36, To appear in: International Transactions in Operational Research

• An algorithmic framework for network reconstruction (with M. Durzinsky and R. Weismantel)
Preprint 09-30, To appear in: Journal of Theoretical Computer Science

Submitted Papers

• The extreme points of QSTAB(G) and its implications (with A. Koster)

• Generalized clique family inequalities for claw-free graphs (with A. Pecher)

• Results and conjectures on the stable set polytope of claw-free graphs (with A. Pecher)

• Circular-imperfection of triangle-free graphs (with J. Kuhpfahl and C. Wagner)

• On some graph classes related to perfect graphs: a survey (with F. Bonomo, G. Duran, M.D. Safe)

• Encoding the dynamics of deterministic systems (with L.M. Torres)
Preprint 09-29

Theses

• Spezielle Klassen perfekter Graphen, insbesondere wing-perfekte Graphen,
Diploma thesis, University of Technology Berlin, October 1994. (In German.)

• Critical Edges in Perfect Graphs,
Ph. D. Dissertation, University of Technology Berlin, May 2000 Thesis
Published as book: pp. 128 S., paperback, DM 38,-- (ISBN 3-89712-953-1) Göttingen, Cuvillier-Verlag, 2000.

• Beyond Perfection: On Relaxations and Superclasses,
Habilitation thesis, Otto-von-Guericke-University Magdeburg, January 2007.

Other Publications

• Frequenzplanung für Punkt-zu-Mehrpunkt-Funksysteme (with A. Bley, A . Eisenblätter, M. Grötschel, and R. Wessäly),
  Abschlussbericht zu einem Projekt in Kooperation mit BOSCH Telecom, Backnang (1999)

• Auf dem Weg von der Vermutung zum Theorem: Die Starke-Perfekte-Graphen-Vermutung (with M.~Henk),
  DMV-Mitteilungen 3-2002