Wing-triangulated graphs are perfect. - Stefan Hougardy; Van Bang Le; Annegret Wagler (J. Graph Theory, 1997)

Critical Edges in Perfect Line Graphs and some Polyhedral Consequences. - Annegret Wagler (Discret. Appl. Math., 1999)

On critically perfect graphs. - Annegret Wagler (J. Graph Theory, 1999)

Critical and Anticritical Edges in Perfect Graphs. - Annegret Wagler (WG, 2001)

Minimally Non-Preperfect Graphs of Small Maximum Degree. - Zsolt Tuza; Annegret Wagler (Graphs Comb., 2001)

Rank-perfect and" weakly rank-perfect graphs. - Annegret Katrin Wagler (Math. Methods Oper. Res., 2002)

On Non-Rank Facets of Stable Set Polytopes of Webs with Clique Number Four-Extended Abstract-. - Arnaud Pêcher; Annegret Wagler (Electron. Notes Discret. Math., 2003)

Relaxing Perfectness: Which Graphs Are "Almost" Perfect? - Annegret Katrin Wagler (The Sharpest Cut, 2004)

Antiwebs are rank-perfect. - Annegret Wagler (4OR, 2004)

Combinatorial equivalence of Chromatic Scheduling Polytopes. - Javier Marenco; Annegret Wagler (Electron. Notes Discret. Math., 2004)

Perfectness is an Elusive Graph Property. - Stefan Hougardy; Annegret Wagler (SIAM J. Comput., 2004)

On rank-perfect subclasses of near-bipartite graphs. - Annegret Wagler (4OR, 2005)

On strongly circular-perfectness. - Sylvain Coulonges; Arnaud Pêcher; Annegret Wagler (Electron. Notes Discret. Math., 2005)

The combinatorial stages of chromatic scheduling polytopes. - Javier Marenco; Annegret Wagler (Electron. Notes Discret. Math., 2005)

Three classes of minimal circular-imperfect graphs. - Arnaud Pêcher; Annegret Wagler; Xuding Zhu (Electron. Notes Discret. Math., 2005)

On the combinatorial structure of chromatic scheduling polytopes. - Javier Marenco; Annegret Wagler (Discret. Appl. Math., 2006)

On non-rank facets of stable set polytopes of webs with clique number four. - Arnaud Pêcher; Annegret Wagler (Discret. Appl. Math., 2006)

A construction for non-rank facets of stable set polytopes of webs. - Arnaud Pêcher; Annegret Wagler (Eur. J. Comb., 2006)

On determining the imperfection ratio. - Arie M. C. A. Koster; Annegret Wagler (Electron. Notes Discret. Math., 2006)

Generalized clique family inequalities for claw-free graphs. - Arnaud Pêcher; Annegret Wagler (Electron. Notes Discret. Math., 2006)

Almost all webs are not rank-perfect. - Arnaud Pêcher; Annegret Wagler (Math. Program., 2006)

Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems. - Javier Marenco; Annegret Wagler (Ann. Oper. Res., 2007)

Circular-imperfection of triangle-free graphs. - Jens Kuhpfahl; Annegret Katrin Wagler; Christian Wagner 006 (Electron. Notes Discret. Math., 2007)

On facets of stable set polytopes of claw-free graphs with stability number three. - Arnaud Pêcher; Pierre Pesneau; Annegret Wagler (Electron. Notes Discret. Math., 2007)

A note on the Chvátal-rank of clique family inequalities. - Arnaud Pêcher; Annegret Wagler (RAIRO Oper. Res., 2007)

A Combinatorial Approach to Reconstruct Petri Nets from Experimental Data. - Markus Durzinsky; Annegret Wagler; Robert Weismantel (CMSB, 2008)

Automatic reconstruction of molecular and genetic networks from discrete time series data. - Markus Durzinsky; Annegret Wagler; Robert Weismantel; Wolfgang Marwan (Biosyst., 2008)

On classes of minimal circular-imperfect graphs. - Arnaud Pêcher; Annegret Wagler (Discret. Appl. Math., 2008)

Constructions for normal graphs and some consequences. - Annegret Wagler (Discret. Appl. Math., 2008)

A mathematical approach to solve the network reconstruction problem. - Wolfgang Marwan; Annegret Wagler; Robert Weismantel (Math. Methods Oper. Res., 2008)

Comparing Imperfection Ratio and Imperfection Index for Graph Classes. - Arie M. C. A. Koster; Annegret Katrin Wagler (RAIRO Oper. Res., 2008)

Cycle-based facets of chromatic scheduling polytopes. - Javier Marenco; Annegret Wagler (Discret. Optim., 2009)

Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques. - Javier Marenco; Annegret Wagler (Discret. Optim., 2009)

Triangle-free strongly circular-perfect graphs. - Sylvain Coulonges; Arnaud Pêcher; Annegret Katrin Wagler (Discret. Math., 2009)

On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs. - Arnaud Pêcher; Annegret Katrin Wagler (Electron. Notes Discret. Math., 2009)

Characterizing and bounding the imperfection ratio for some classes of graphs. - Sylvain Coulonges; Arnaud Pêcher; Annegret Wagler (Math. Program., 2009)

On facets of stable set polytopes of claw-free graphs with stability number 3. - Arnaud Pêcher; Annegret Katrin Wagler (Discret. Math., 2010)

Balancedness of some subclasses of circular-arc graphs. - Flavia Bonomo; Guillermo Durán; Martín Darío Safe; Annegret Katrin Wagler (Electron. Notes Discret. Math., 2010)

On the Chvátal-rank of Antiwebs. - Eugenia Holm; Luis Miguel Torres; Annegret Katrin Wagler (Electron. Notes Discret. Math., 2010)

Clique and chromatic number of circular-perfect graphs. - Arnaud Pêcher; Annegret Katrin Wagler (Electron. Notes Discret. Math., 2010)

Model reconstruction for discrete deterministic systems. - Luis Miguel Torres; Annegret Katrin Wagler (Electron. Notes Discret. Math., 2010)

On the Chvátal rank of linear relaxations of the stable set polytope. - Eugenia Holm; Luis Miguel Torres; Annegret Katrin Wagler (Int. Trans. Oper. Res., 2010)

Generalized row family inequalities for the set covering polyhedron. - Gabriela R. Argiroffo; Annegret Wagler (CTW, 2011)

The dynamics of deterministic systems from a hypergraph theoretical point of view. - Luis Miguel Torres; Annegret Katrin Wagler (CTW, 2011)

Reconstruction of extended Petri nets from time series data and its application to signal transduction and to gene regulatory networks. - Markus Durzinsky; Annegret Wagler; Wolfgang Marwan (BMC Syst. Biol., 2011)

A lower bound on the Chvátal-rank of Antiwebs. - Eugenia Holm; Luis Miguel Torres; Annegret Katrin Wagler (Electron. Notes Discret. Math., 2011)

Computing the clique number of a-perfect graphs in polynomial time. - Arnaud Pêcher; Annegret Katrin Wagler (Electron. Notes Discret. Math., 2011)

Encoding the dynamics of deterministic systems. - Luis Miguel Torres; Annegret Katrin Wagler (Math. Methods Oper. Res., 2011)

Petri nets as a framework for the reconstruction and analysis of signal transduction pathways and regulatory networks. - Wolfgang Marwan; Annegret Wagler; Robert Weismantel (Nat. Comput., 2011)

The combinatorics of modeling and analyzing biological systems. - Annegret Wagler; Robert Weismantel (Nat. Comput., 2011)

An algorithmic framework for network reconstruction. - Markus Durzinsky; Annegret Wagler; Robert Weismantel (Theor. Comput. Sci., 2011)

Automatic network reconstruction using ASP. - Markus Durzinsky; Wolfgang Marwan; Max Ostrowski; Torsten Schaub; Annegret Wagler (Theory Pract. Log. Program., 2011)

Triangulation and Clique Separator Decomposition of Claw-Free Graphs. - Anne Berry; Annegret Wagler (WG, 2012)

Polynomial time computability of some graph parameters for superclasses of perfect graphs. - Arnaud Pêcher; Annegret Katrin Wagler (Int. J. Math. Oper. Res., 2012)

Reconstructing X'-deterministic extended Petri nets from experimental time-series data X'. - Marie C. F. Favre; Annegret Wagler (BioPPN@Petri Nets, 2013)

The Normal Graph Conjecture for Classes of Sparse Graphs. - Anne Berry; Annegret Wagler (WG, 2013)

Optimal cut-times finding strategies for collecting a target component from overloaded elution chromatograms. - Balamurali Sreedhar; Annegret Wagler; Malte Kaspereit; Andreas Seidel-Morgenstern (Comput. Chem. Eng., 2013)

On minimal forbidden subgraph characterizations of balanced graphs. - Flavia Bonomo; Guillermo Durán; Martín Darío Safe; Annegret Katrin Wagler (Discret. Appl. Math., 2013)

Polyhedra associated with identifying codes. - Gabriela R. Argiroffo; Silvia M. Bianchi; Annegret Katrin Wagler (Electron. Notes Discret. Math., 2013)

Models and Algorithms for Carsharing Systems and Related Problems. - Sven O. Krumke; Alain Quilliot; Annegret Katrin Wagler; Jan-Thierry Wegener (Electron. Notes Discret. Math., 2013)

On Minimality and Equivalence of Petri Nets. - Annegret Katrin Wagler; Jan-Thierry Wegener (Fundam. Informaticae, 2013)

Computing clique and chromatic number of circular-perfect graphs in polynomial time. - Arnaud Pêcher; Annegret Katrin Wagler (Math. Program., 2013)

Analyzing the dynamics of deterministic systems from a hypergraph theoretical point of view. - Luis Miguel Torres; Annegret Katrin Wagler (RAIRO Oper. Res., 2013)

Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow. - Annegret Katrin Wagler (Large-Scale Networks in Engineering and Life Sciences, 2014)

Integrating a priori knowledge in automatic network reconstruction. - Marie C. F. Favre; Wolfgang Marwan; Annegret Wagler (BioPPN@Petri Nets, 2014)

Study of Identifying Code Polyhedra for Some Families of Split Graphs. - Gabriela R. Argiroffo; Silvia M. Bianchi; Annegret Wagler (ISCO, 2014)

Relocation in Carsharing Systems Using Flows in Time-Expanded Networks. - Sven O. Krumke; Alain Quilliot; Annegret Katrin Wagler; Jan-Thierry Wegener (SEA, 2014)

Balancedness of subclasses of circular-arc graphs. - Flavia Bonomo; Guillermo Durán; Martín Darío Safe; Annegret Katrin Wagler (Discret. Math. Theor. Comput. Sci., 2014)

Computing the clique number of aa-perfect graphs in polynomial time. - Arnaud Pêcher; Annegret Wagler (Eur. J. Comb., 2014)

Preprocessing for Network Reconstruction: Feasibility Test and Handling Infeasibility. - Annegret Katrin Wagler; Jan-Thierry Wegener (Fundam. Informaticae, 2014)

Clique-perfectness and balancedness of some graph classes. - Flavia Bonomo; Guillermo Durán; Martín Darío Safe; Annegret Katrin Wagler (Int. J. Comput. Math., 2014)

Automatic network reconstruction from experimental time-series data: A survey. - Annegret Wagler (it Inf. Technol., 2014)

The dynamics of deterministic systems - A survey. - Luis Miguel Torres; Annegret Katrin Wagler (BioPPN@Petri Nets, 2015)

Locating-dominating sets in some families of split graphs. - Gabriela R. Argiroffo; Silvia M. Bianchi; Annegret Wagler (CTW, 2015)

Fleet management of autonomous vehicles: VIPAFLEET. - Sahar Bsaybes; Alain Quilliot; Annegret Wagler (CTW, 2015)

ReOpt: an Algorithm with a Quality Guaranty for Solving the Static Relocation Problem. - Sahar Bsaybes; Sven O. Krumke; Alain Quilliot; Annegret Katrin Wagler; Jan-Thierry Wegener (CoRR, 2015)

Two Flow-Based Approaches for the Static Relocation Problem in Carsharing Systems. - Sahar Bsaybes; Alain Quilliot; Annegret Katrin Wagler; Jan-Thierry Wegener (CoRR, 2015)

Polyhedral studies of vertex coloring problems: The asymmetric representatives formulation. - Victor A. Campos; Ricardo C. Corrêa; Diego Delle Donne; Javier Marenco; Annegret Wagler (CoRR, 2015)

Clique-perfectness of complements of line graphs. - Flavia Bonomo; Guillermo Durán; Martín Darío Safe; Annegret Katrin Wagler (Discret. Appl. Math., 2015)

A polyhedral approach to locating-dominating sets in graphs. - Gabriela R. Argiroffo; Silvia M. Bianchi; Annegret Katrin Wagler (Electron. Notes Discret. Math., 2015)

On the Online Min-Wait Relocation Problem. - Pascal Halffmann; Sven O. Krumke; Alain Quilliot; Annegret Katrin Wagler; Jan-Thierry Wegener (Electron. Notes Discret. Math., 2015)

Analyzing the dynamics of discrete deterministic systems. - Luis Miguel Torres; Annegret Katrin Wagler (CoDIT, 2016)

Lovász-Schrijver PSD-Operator on Claw-Free Graphs. - Silvia M. Bianchi; Mariana S. Escalante; Graciela L. Nasini; Annegret Wagler (ISCO, 2016)

Fleet management for autonomous vehicles. - Sahar Bsaybes; Alain Quilliot; Annegret Katrin Wagler (CoRR, 2016)

Progress on the description of identifying code polyhedra for some families of split graphs. - Gabriela R. Argiroffo; Silvia M. Bianchi; Annegret Wagler (Discret. Optim., 2016)

Prediction of Network Structure. - Annegret Wagler (Modeling in Systems Biology, The Petri Net Approach, 2016)

A linear-time algorithm for the identifying code problem on block graphs. - Gabriela R. Argiroffo; Silvia M. Bianchi; Yanina Lucarini; Annegret Katrin Wagler (Electron. Notes Discret. Math., 2017)

Fleet management for autonomous vehicles using flows in time-expanded networks. - Sahar Bsaybes; Alain Quilliot; Annegret Katrin Wagler (Electron. Notes Discret. Math., 2017)

Characterizing N+-perfect line graphs. - Mariana S. Escalante; Graciela L. Nasini; Annegret Wagler (Int. Trans. Oper. Res., 2017)

Lovász-Schrijver PSD-Operator on Some Graph Classes Defined by Clique Cutsets. - Annegret Wagler (ISCO, 2018)

Fleet Management for Autonomous Vehicles Using Multicommodity Coupled Flows in Time-Expanded Networks. - Sahar Bsaybes; Alain Quilliot; Annegret Katrin Wagler (SEA, 2018)

On three domination numbers in block graphs. - Aline Parreau; Annegret Katrin Wagler (CoRR, 2018)

Polyhedra associated with identifying codes in graphs. - Gabriela R. Argiroffo; Silvia M. Bianchi; Yanina Lucarini; Annegret Katrin Wagler (Discret. Appl. Math., 2018)

On the Chvátal-rank of facets for the set covering polyhedron of circular matrices. - Graciela L. Nasini; Luis Miguel Torres; Hervé Kerivin; Annegret Wagler (Electron. Notes Discret. Math., 2018)

The Normal Graph Conjecture for Two Classes of Sparse Graphs. - Anne Berry; Annegret Wagler (Graphs Comb., 2018)

A novel integer linear programming model for routing and spectrum assignment in optical networks. - Youssouf Hadhbi; Hervé Kerivin; Annegret Wagler (FedCSIS, 2019)

The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations. - Gabriela R. Argiroffo; Silvia M. Bianchi; Yanina Lucarini; Annegret Wagler (LAGOS, 2019)

Fleet management for autonomous vehicles: Online PDP under special constraints. - Sahar Bsaybes; Alain Quilliot; Annegret Katrin Wagler (RAIRO Oper. Res., 2019)

Polyhedra Associated with Open Locating-Dominating and Locating Total-Dominating Sets in Graphs. - Gabriela R. Argiroffo; Silvia M. Bianchi; Yanina Lucarini; Annegret Wagler (ISCO, 2020)

Linear-time algorithms for three domination-based separation problems in block graphs. - Gabriela R. Argiroffo; Silvia M. Bianchi; Yanina Lucarini; Annegret Katrin Wagler (Discret. Appl. Math., 2020)

On some graph classes related to perfect graphs: A survey. - Flavia Bonomo-Braberman; Guillermo Durán; Martín D. Safe; Annegret Katrin Wagler (Discret. Appl. Math., 2020)

On circular-perfect graphs: A survey. - Arnaud Pêcher; Annegret Katrin Wagler (Eur. J. Comb., 2021)

Optimal 1-Request Insertion for the Pickup and Delivery Problem with Transfers and Time Horizon. - José L. Figueroa; Alain Quilliot; Hélène Toussaint; Annegret Wagler (ICORES, 2022)

A framework for routing and spectrum assignment in optical networks, driven by combinatorial properties. - Pedro Henrique Fernandes da Silva; Hervé Kervin; Juan Pablo Nant; Annegret Wagler (INOC, 2022)

Branch-and-Cut for a 2-Commodity Flow Relocation Model with Time Constraints. - José Luis Figueroa González; Mourad Baïou; Alain Quilliot; Hélène Toussaint; Annegret Wagler (ISCO, 2022)

Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs. - Gabriela R. Argiroffo; Silvia M. Bianchi; Yanina Lucarini; Annegret Wagler (Discret. Appl. Math., 2022)

On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets. - Annegret Katrin Wagler (Discret. Appl. Math., 2022)

A polyhedral study of a relaxation of the routing and spectrum allocation problem (Brief Announcement). - Federico Bertero; Hervé Kerivin; Javier Marenco; Annegret Wagler (LAGOS, 2023)

Managing Time Expanded Networks through Project and Lift: the Lift Issue. - José Luis Figueroa González; Alain Quilliot; Hélène Toussaint; Annegret Wagler (LAGOS, 2023)

Managing a Time Expanded Network through Project-and-Lift. - José Luis Figueroa González; Alain Quilliot; Hélène Toussaint; Annegret Wagler (SoICT, 2023)

Optimal Paths with Impact on a Constraint System: An Application to the 1-Request Insertion for the Pickup and Delivery Problem with Transfers. - José Luis Figueroa; Alain Quilliot; Hélène Toussaint; Annegret Wagler (SN Comput. Sci., 2023)

Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs. - Silvia M. Bianchi; Mariana S. Escalante; Graciela L. Nasini; Annegret Katrin Wagler (Discret. Appl. Math., 2023)

Location-Domination Type Problems Under the Mycielski Construction. - Silvia M. Bianchi; Dipayan Chakraborty; Yanina Lucarini; Annegret Katrin Wagler (CALDAM, 2024)

A project and lift approach for a 2-commodity flow relocation model in a time expanded network. - José Luis Figueroa González; Mourad Baïou; Alain Quilliot; Hélène Toussaint; Annegret Wagler (Discret. Appl. Math., 2024)

On non-superperfection of edge intersection graphs of paths. - Victoria Kaial; Hervé Kerivin; Annegret Katrin Wagler (Discret. Optim., 2024)

Progress towards the two-thirds conjecture on locating-total dominating sets. - Dipayan Chakraborty; Florent Foucaud; Anni Hakanen; Michael A. Henning; Annegret Katrin Wagler (Discret. Math., 2024)

On Three Domination-based Identification Problems in Block Graphs. - Dipayan Chakraborty; Florent Foucaud; Aline Parreau; Annegret Wagler (Fundam. Informaticae, 2024)

Solving the routing and spectrum assignment problem, driven by combinatorial properties. - Pedro Henrique Fernandes da Silva; Hervé Kerivin; Juan Pablo Nant; Annegret Katrin Wagler (Networks, 2024)

On Full-Separating Sets in Graphs. - Dipayan Chakraborty; Annegret Katrin Wagler (CALDAM, 2025)

On open-separating dominating codes in graphs. - Dipayan Chakraborty; Annegret Katrin Wagler (Discret. Appl. Math., 2025)