Annegret Wagler

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 23

Top Topics

Bounded Treewidth

Integer Linear Programming

Fleet Management

Graph Theoretic

Top Venues

Discret. Appl. Math.

Publications

José Luis Figueroa González, Mourad Baïou, Alain Quilliot, Hélène Toussaint, Annegret Wagler
A project and lift approach for a 2-commodity flow relocation model in a time expanded network. Discret. Appl. Math. 356 (2024)
Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret Wagler
On Three Domination-based Identification Problems in Block Graphs. Fundam. Informaticae 191 (3-4) (2024)
Federico Bertero, Hervé Kerivin, Javier Marenco, Annegret Wagler
A polyhedral study of a relaxation of the routing and spectrum allocation problem (Brief Announcement). LAGOS (2023)
José Luis Figueroa, Alain Quilliot, Hélène Toussaint, Annegret Wagler
Optimal Paths with Impact on a Constraint System: An Application to the 1-Request Insertion for the Pickup and Delivery Problem with Transfers. SN Comput. Sci. 4 (1) (2023)
José Luis Figueroa González, Alain Quilliot, Hélène Toussaint, Annegret Wagler
Managing a Time Expanded Network through Project-and-Lift. SoICT (2023)
José Luis Figueroa González, Alain Quilliot, Hélène Toussaint, Annegret Wagler
Managing Time Expanded Networks through Project and Lift: the Lift Issue. LAGOS (2023)
Pedro H. Fernandes da Silva, Hervé Kervin, Juan Pablo Nant, Annegret Wagler
A framework for routing and spectrum assignment in optical networks, driven by combinatorial properties. INOC (2022)
Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret Wagler
Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs. Discret. Appl. Math. 322 (2022)
José Luis Figueroa González, Mourad Baïou, Alain Quilliot, Hélène Toussaint, Annegret Wagler
Branch-and-Cut for a 2-Commodity Flow Relocation Model with Time Constraints. ISCO (2022)
Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael A. Henning, Annegret Wagler
Progress towards the two-thirds conjecture on locating-total dominating sets. CoRR (2022)
José L. Figueroa, Alain Quilliot, Hélène Toussaint, Annegret Wagler
Optimal 1-Request Insertion for the Pickup and Delivery Problem with Transfers and Time Horizon. ICORES (2022)
Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret Wagler
Polyhedra Associated with Open Locating-Dominating and Locating Total-Dominating Sets in Graphs. ISCO (2020)
Youssouf Hadhbi, Hervé Kerivin, Annegret Wagler
A novel integer linear programming model for routing and spectrum assignment in optical networks. FedCSIS (2019)
Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret Wagler
The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations. LAGOS (2019)
Graciela L. Nasini, Luis Miguel Torres, Hervé Kerivin, Annegret Wagler
On the Chvátal-rank of facets for the set covering polyhedron of circular matrices. Electron. Notes Discret. Math. 69 (2018)
Anne Berry, Annegret Wagler
The Normal Graph Conjecture for Two Classes of Sparse Graphs. Graphs Comb. 34 (1) (2018)
Annegret Wagler
Lovász-Schrijver PSD-Operator on Some Graph Classes Defined by Clique Cutsets. ISCO (2018)
Mariana S. Escalante, Graciela L. Nasini, Annegret Wagler
Characterizing N+-perfect line graphs. Int. Trans. Oper. Res. 24 (1-2) (2017)
Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Wagler
Progress on the description of identifying code polyhedra for some families of split graphs. Discret. Optim. 22 (2016)
Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Annegret Wagler
Lovász-Schrijver PSD-Operator on Claw-Free Graphs. ISCO (2016)
Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Wagler
Locating-dominating sets in some families of split graphs. CTW (2015)
Victor A. Campos, Ricardo C. Corrêa, Diego Delle Donne, Javier Marenco, Annegret Wagler
Polyhedral studies of vertex coloring problems: The asymmetric representatives formulation. CoRR (2015)
Sahar Bsaybes, Alain Quilliot, Annegret Wagler
Fleet management of autonomous vehicles: VIPAFLEET. CTW (2015)
Marie C. F. Favre, Wolfgang Marwan, Annegret Wagler
Integrating a priori knowledge in automatic network reconstruction. BioPPN@Petri Nets (2014)
Annegret Wagler
Automatic network reconstruction from experimental time-series data: A survey. it Inf. Technol. 56 (2) (2014)
Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Wagler
Study of Identifying Code Polyhedra for Some Families of Split Graphs. ISCO (2014)
Arnaud Pêcher, Annegret Wagler
a-perfect graphs in polynomial time. Eur. J. Comb. 35 (2014)
Anne Berry, Annegret Wagler
The Normal Graph Conjecture for Classes of Sparse Graphs. WG (2013)
Balamurali Sreedhar, Annegret Wagler, Malte Kaspereit, Andreas Seidel-Morgenstern
Optimal cut-times finding strategies for collecting a target component from overloaded elution chromatograms. Comput. Chem. Eng. 49 (2013)
Marie C. F. Favre, Annegret Wagler
Reconstructing X'-deterministic extended Petri nets from experimental time-series data X'. BioPPN@Petri Nets (2013)
Annegret Wagler, Jan-Thierry Wegener
On Minimality and Equivalence of Petri Nets. CS&P (2012)
Anne Berry, Annegret Wagler
Triangulation and Clique Separator Decomposition of Claw-Free Graphs. WG (2012)
Markus Durzinsky, Annegret Wagler, Robert Weismantel
An algorithmic framework for network reconstruction. Theor. Comput. Sci. 412 (26) (2011)
Wolfgang Marwan, Annegret Wagler, Robert Weismantel
Petri nets as a framework for the reconstruction and analysis of signal transduction pathways and regulatory networks. Nat. Comput. 10 (2) (2011)
Max Ostrowski, Torsten Schaub, Markus Durzinsky, Wolfgang Marwan, Annegret Wagler
Automatic Network Reconstruction using ASP CoRR (2011)
Markus Durzinsky, Wolfgang Marwan, Max Ostrowski, Torsten Schaub, Annegret Wagler
Automatic network reconstruction using ASP. Theory Pract. Log. Program. 11 (4-5) (2011)
Gabriela R. Argiroffo, Annegret Wagler
Generalized row family inequalities for the set covering polyhedron. CTW (2011)
Annegret Wagler, Robert Weismantel
The combinatorics of modeling and analyzing biological systems. Nat. Comput. 10 (2) (2011)
Markus Durzinsky, Annegret Wagler, Wolfgang Marwan
Reconstruction of extended Petri nets from time series data and its application to signal transduction and to gene regulatory networks. BMC Syst. Biol. 5 (2011)
Javier Marenco, Annegret Wagler
Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques. Discret. Optim. 6 (1) (2009)
Sylvain Coulonges, Arnaud Pêcher, Annegret Wagler
Characterizing and bounding the imperfection ratio for some classes of graphs. Math. Program. 118 (1) (2009)
Javier Marenco, Annegret Wagler
Cycle-based facets of chromatic scheduling polytopes. Discret. Optim. 6 (1) (2009)
Arnaud Pêcher, Annegret Wagler
On classes of minimal circular-imperfect graphs. Discret. Appl. Math. 156 (7) (2008)
Markus Durzinsky, Annegret Wagler, Robert Weismantel, Wolfgang Marwan
Automatic reconstruction of molecular and genetic networks from discrete time series data. Biosyst. 93 (3) (2008)
Markus Durzinsky, Annegret Wagler, Robert Weismantel
A Combinatorial Approach to Reconstruct Petri Nets from Experimental Data. CMSB (2008)
Annegret Wagler
Constructions for normal graphs and some consequences. Discret. Appl. Math. 156 (17) (2008)
Wolfgang Marwan, Annegret Wagler, Robert Weismantel
A mathematical approach to solve the network reconstruction problem. Math. Methods Oper. Res. 67 (1) (2008)
Javier Marenco, Annegret Wagler
Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems. Ann. Oper. Res. 150 (1) (2007)
Arnaud Pêcher, Pierre Pesneau, Annegret Wagler
On facets of stable set polytopes of claw-free graphs with stability number three. Electron. Notes Discret. Math. 28 (2007)
Arnaud Pêcher, Annegret Wagler
A note on the Chvátal-rank of clique family inequalities. RAIRO Oper. Res. 41 (3) (2007)
Arnaud Pêcher, Annegret Wagler
On non-rank facets of stable set polytopes of webs with clique number four. Discret. Appl. Math. 154 (9) (2006)
Arie M. C. A. Koster, Annegret Wagler
On determining the imperfection ratio. Electron. Notes Discret. Math. 25 (2006)
Arnaud Pêcher, Annegret Wagler
Almost all webs are not rank-perfect. Math. Program. 105 (2-3) (2006)
Arnaud Pêcher, Annegret Wagler
Generalized clique family inequalities for claw-free graphs. Electron. Notes Discret. Math. 25 (2006)
Javier Marenco, Annegret Wagler
On the combinatorial structure of chromatic scheduling polytopes. Discret. Appl. Math. 154 (13) (2006)
Arnaud Pêcher, Annegret Wagler
A construction for non-rank facets of stable set polytopes of webs. Eur. J. Comb. 27 (7) (2006)
Arnaud Pêcher, Annegret Wagler, Xuding Zhu
Three classes of minimal circular-imperfect graphs. Electron. Notes Discret. Math. 19 (2005)
Annegret Wagler
On rank-perfect subclasses of near-bipartite graphs. 4OR 3 (4) (2005)
Javier Marenco, Annegret Wagler
The combinatorial stages of chromatic scheduling polytopes. Electron. Notes Discret. Math. 19 (2005)
Sylvain Coulonges, Arnaud Pêcher, Annegret Wagler
On strongly circular-perfectness. Electron. Notes Discret. Math. 22 (2005)
Javier Marenco, Annegret Wagler
Combinatorial equivalence of Chromatic Scheduling Polytopes. Electron. Notes Discret. Math. 18 (2004)
Annegret Wagler
Antiwebs are rank-perfect. 4OR 2 (2) (2004)
Stefan Hougardy, Annegret Wagler
Perfectness is an Elusive Graph Property. SIAM J. Comput. 34 (1) (2004)
Arnaud Pêcher, Annegret Wagler
On Non-Rank Facets of Stable Set Polytopes of Webs with Clique Number Four-Extended Abstract-. Electron. Notes Discret. Math. 13 (2003)
Annegret Wagler
Critical and Anticritical Edges in Perfect Graphs. WG (2001)
Zsolt Tuza, Annegret Wagler
Minimally Non-Preperfect Graphs of Small Maximum Degree. Graphs Comb. 17 (4) (2001)
Annegret Wagler
On critically perfect graphs. J. Graph Theory 32 (4) (1999)
Annegret Wagler
Critical Edges in Perfect Line Graphs and some Polyhedral Consequences. Discret. Appl. Math. 95 (1-3) (1999)
Stefan Hougardy, Van Bang Le, Annegret Wagler
Wing-triangulated graphs are perfect. J. Graph Theory 24 (1) (1997)