Annegret Wagler - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

An algorithmic framework for network reconstructionMarkus Durzinsky, Annegret Wagler, Robert Weismantel. TCS, 412(26):2800-2815, 2011. [doi]

Automatic network reconstruction using ASPMarkus Durzinsky, Wolfgang Marwan, Max Ostrowski, Torsten Schaub, Annegret Wagler. tplp, 11(4-5):749-766, 2011. [doi]

Petri nets as a framework for the reconstruction and analysis of signal transduction pathways and regulatory networksWolfgang Marwan, Annegret Wagler, Robert Weismantel. nc, 10(2):639-654, 2011. [doi]

The combinatorics of modeling and analyzing biological systemsAnnegret Wagler, Robert Weismantel. nc, 10(2):655-681, 2011. [doi]

2009

Characterizing and bounding the imperfection ratio for some classes of graphsSylvain Coulonges, Arnaud PÃªcher, Annegret Wagler. mp, 118(1):37-46, 2009. [doi]

Cycle-based facets of chromatic scheduling polytopesJavier Marenco, Annegret Wagler. disopt, 6(1):51-63, 2009. [doi]

Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliquesJavier Marenco, Annegret Wagler. disopt, 6(1):64-78, 2009. [doi]

2008

2007

Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systemsJavier Marenco, Annegret Wagler. anor, 150(1):159-175, 2007. [doi]

On facets of stable set polytopes of claw-free graphs with stability number threeArnaud Pêcher, Pierre Pesneau, Annegret Wagler. endm, 28:185-190, 2007. [doi]

2006

On determining the imperfection ratioArie M. C. A. Koster, Annegret Wagler. endm, 25:177-181, 2006. [doi]

On the combinatorial structure of chromatic scheduling polytopesJavier Marenco, Annegret Wagler. DAM, 154(13):1865-1876, 2006. [doi]

On non-rank facets of stable set polytopes of webs with clique number fourArnaud Pêcher, Annegret Wagler. DAM, 154(9):1408-1415, 2006. [doi]

A construction for non-rank facets of stable set polytopes of websArnaud Pêcher, Annegret Wagler. ejc, 27(7):1172-1185, 2006. [doi]

Almost all webs are not rank-perfectArnaud Pêcher, Annegret Wagler. mp, 105(2-3):311-328, 2006. [doi]

Generalized clique family inequalities for claw-free graphsArnaud Pêcher, Annegret Wagler. endm, 25:117-121, 2006. [doi]

2005

On strongly circular-perfectnessSylvain Coulonges, Arnaud Pêcher, Annegret Wagler. endm, 22:369-374, 2005. [doi]

The combinatorial stages of chromatic scheduling polytopesJavier Marenco, Annegret Wagler. endm, 19:63-69, 2005. [doi]

Three classes of minimal circular-imperfect graphsArnaud Pêcher, Annegret Wagler, Xuding Zhu. endm, 19:9-15, 2005. [doi]

On rank-perfect subclasses of near-bipartite graphsAnnegret Wagler. 4or, 3(4):329-336, 2005. [doi]

2004

Perfectness is an Elusive Graph PropertyStefan Hougardy, Annegret Wagler. siamcomp, 34(1):109-117, 2004. [doi]

Combinatorial equivalence of Chromatic Scheduling PolytopesJavier Marenco, Annegret Wagler. endm, 18:177-180, 2004. [doi]

Antiwebs are rank-perfectAnnegret Wagler. 4or, 2(2):149-152, 2004. [doi]

2003

On Non-Rank Facets of Stable Set Polytopes of Webs with Clique Number Four-Extended Abstract-Arnaud Pêcher, Annegret Wagler. endm, 13:93-96, 2003. [doi]

2001

Minimally Non-Preperfect Graphs of Small Maximum DegreeZsolt Tuza, Annegret Wagler. gc, 17(4):759-773, 2001. [doi]

Critical and Anticritical Edges in Perfect GraphsAnnegret Wagler. criwg 2001: 317-328 [doi]

1999

Critical Edges in Perfect Line Graphs and some Polyhedral ConsequencesAnnegret Wagler. DAM, 95(1-3):455-466, 1999. [doi]