Annegret Katrin Wagler

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 22

Top Topics

Fleet Management

Graph Theoretic

Top Venues

Discret. Appl. Math.

Electron. Notes Discret. Math.

Publications

Pedro H. Fernandes da Silva, Hervé Kerivin, Juan Pablo Nant, Annegret Katrin Wagler
Solving the routing and spectrum assignment problem, driven by combinatorial properties. Networks 83 (2) (2024)
Dipayan Chakraborty, Annegret Katrin Wagler
Open-Separating Dominating Codes in Graphs. ISCO (2024)
Victoria Kaial, Hervé Kerivin, Annegret Katrin Wagler
On non-superperfection of edge intersection graphs of paths. Discret. Optim. 54 (2024)
Silvia M. Bianchi, Dipayan Chakraborty, Yanina Lucarini, Annegret Katrin Wagler
Location-Domination Type Problems Under the Mycielski Construction. CALDAM (2024)
Dipayan Chakraborty, Annegret Katrin Wagler
Open-separating dominating codes in graphs. CoRR (2024)
Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael A. Henning, Annegret Katrin Wagler
Progress towards the two-thirds conjecture on locating-total dominating sets. Discret. Math. 347 (12) (2024)
Dipayan Chakraborty, Annegret Katrin Wagler
On full-separating sets in graphs. CoRR (2024)
Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Annegret Katrin Wagler
Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs. Discret. Appl. Math. 332 (2023)
Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret Katrin Wagler
On Three Domination-Based Identification Problems in Block Graphs. CALDAM (2023)
Annegret Katrin Wagler
On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets. Discret. Appl. Math. 308 (2022)
Arnaud Pêcher, Annegret Katrin Wagler
On circular-perfect graphs: A survey. Eur. J. Comb. 91 (2021)
Flavia Bonomo-Braberman, Guillermo Durán, Martín D. Safe, Annegret Katrin Wagler
On some graph classes related to perfect graphs: A survey. Discret. Appl. Math. 281 (2020)
Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret Katrin Wagler
Linear-time algorithms for three domination-based separation problems in block graphs. Discret. Appl. Math. 281 (2020)
Sahar Bsaybes, Alain Quilliot, Annegret Katrin Wagler
Fleet management for autonomous vehicles: Online PDP under special constraints. RAIRO Oper. Res. 53 (3) (2019)
Sahar Bsaybes, Alain Quilliot, Annegret Katrin Wagler
Fleet Management for Autonomous Vehicles Using Multicommodity Coupled Flows in Time-Expanded Networks. SEA (2018)
Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret Katrin Wagler
Polyhedra associated with identifying codes in graphs. Discret. Appl. Math. 245 (2018)
Aline Parreau, Annegret Katrin Wagler
On three domination numbers in block graphs. CoRR (2018)
Sahar Bsaybes, Alain Quilliot, Annegret Katrin Wagler
Fleet management for autonomous vehicles: Online PDP under special constraints. CoRR (2017)
Sahar Bsaybes, Alain Quilliot, Annegret Katrin Wagler
Fleet management for autonomous vehicles using flows in time-expanded networks. Electron. Notes Discret. Math. 62 (2017)
Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret Katrin Wagler
A linear-time algorithm for the identifying code problem on block graphs. Electron. Notes Discret. Math. 62 (2017)
Luis Miguel Torres, Annegret Katrin Wagler
Analyzing the dynamics of discrete deterministic systems. CoDIT (2016)
Sahar Bsaybes, Alain Quilliot, Annegret Katrin Wagler
Fleet management for autonomous vehicles. CoRR (2016)
Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler
Clique-perfectness of complements of line graphs. Discret. Appl. Math. 186 (2015)
Sahar Bsaybes, Alain Quilliot, Annegret Katrin Wagler, Jan-Thierry Wegener
Two Flow-Based Approaches for the Static Relocation Problem in Carsharing Systems. CoRR (2015)
Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Katrin Wagler
A polyhedral approach to locating-dominating sets in graphs. Electron. Notes Discret. Math. 50 (2015)
Sahar Bsaybes, Sven O. Krumke, Alain Quilliot, Annegret Katrin Wagler, Jan-Thierry Wegener
ReOpt: an Algorithm with a Quality Guaranty for Solving the Static Relocation Problem. CoRR (2015)
Pascal Halffmann, Sven O. Krumke, Alain Quilliot, Annegret Katrin Wagler, Jan-Thierry Wegener
On the Online Min-Wait Relocation Problem. Electron. Notes Discret. Math. 50 (2015)
Luis Miguel Torres, Annegret Katrin Wagler
The dynamics of deterministic systems - A survey. BioPPN@Petri Nets (2015)
Annegret Katrin Wagler, Jan-Thierry Wegener
Preprocessing for Network Reconstruction: Feasibility Test and Handling Infeasibility. Fundam. Informaticae 135 (4) (2014)
Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler
Clique-perfectness and balancedness of some graph classes. Int. J. Comput. Math. 91 (10) (2014)
Sven O. Krumke, Alain Quilliot, Annegret Katrin Wagler, Jan-Thierry Wegener
Relocation in Carsharing Systems Using Flows in Time-Expanded Networks. SEA (2014)
Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler
Balancedness of subclasses of circular-arc graphs. Discret. Math. Theor. Comput. Sci. 16 (3) (2014)
Arnaud Pêcher, Annegret Katrin Wagler
Computing clique and chromatic number of circular-perfect graphs in polynomial time. Math. Program. 141 (1-2) (2013)
Sven O. Krumke, Alain Quilliot, Annegret Katrin Wagler, Jan-Thierry Wegener
Models and Algorithms for Carsharing Systems and Related Problems. Electron. Notes Discret. Math. 44 (2013)
Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler
On minimal forbidden subgraph characterizations of balanced graphs. Discret. Appl. Math. 161 (13-14) (2013)
Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Katrin Wagler
Polyhedra associated with identifying codes. Electron. Notes Discret. Math. 44 (2013)
Annegret Katrin Wagler, Jan-Thierry Wegener
Preprocessing for Network Reconstruction: Feasibility Test and Handling Infeasibility. CS&P (2013)
Luis Miguel Torres, Annegret Katrin Wagler
Analyzing the dynamics of deterministic systems from a hypergraph theoretical point of view. RAIRO Oper. Res. 47 (3) (2013)
Annegret Katrin Wagler, Jan-Thierry Wegener
On Minimality and Equivalence of Petri Nets. Fundam. Informaticae 128 (1-2) (2013)
Arnaud Pêcher, Annegret Katrin Wagler
Polynomial time computability of some graph parameters for superclasses of perfect graphs. Int. J. Math. Oper. Res. 4 (3) (2012)
Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler
Clique-perfectness of complements of line graphs. Electron. Notes Discret. Math. 37 (2011)
Eugenia Holm, Luis Miguel Torres, Annegret Katrin Wagler
A lower bound on the Chvátal-rank of Antiwebs. Electron. Notes Discret. Math. 37 (2011)
Luis Miguel Torres, Annegret Katrin Wagler
Encoding the dynamics of deterministic systems. Math. Methods Oper. Res. 73 (3) (2011)
Luis Miguel Torres, Annegret Katrin Wagler
The dynamics of deterministic systems from a hypergraph theoretical point of view. CTW (2011)
Arnaud Pêcher, Annegret Katrin Wagler
Computing the clique number of a-perfect graphs in polynomial time. Electron. Notes Discret. Math. 38 (2011)
Arnaud Pêcher, Annegret Katrin Wagler
Clique and chromatic number of circular-perfect graphs. Electron. Notes Discret. Math. 36 (2010)
Eugenia Holm, Luis Miguel Torres, Annegret Katrin Wagler
On the Chvátal-rank of Antiwebs. Electron. Notes Discret. Math. 36 (2010)
Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler
Balancedness of some subclasses of circular-arc graphs. Electron. Notes Discret. Math. 36 (2010)
Luis Miguel Torres, Annegret Katrin Wagler
Model reconstruction for discrete deterministic systems. Electron. Notes Discret. Math. 36 (2010)
Arnaud Pêcher, Annegret Katrin Wagler
On facets of stable set polytopes of claw-free graphs with stability number 3. Discret. Math. 310 (3) (2010)
Eugenia Holm, Luis Miguel Torres, Annegret Katrin Wagler
On the Chvátal rank of linear relaxations of the stable set polytope. Int. Trans. Oper. Res. 17 (6) (2010)
Arnaud Pêcher, Annegret Katrin Wagler
On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs. Electron. Notes Discret. Math. 35 (2009)
Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler
On minimal forbidden subgraph characterizations of balanced graphs. Electron. Notes Discret. Math. 35 (2009)
Sylvain Coulonges, Arnaud Pêcher, Annegret Katrin Wagler
Triangle-free strongly circular-perfect graphs. Discret. Math. 309 (11) (2009)
Arie M. C. A. Koster, Annegret Katrin Wagler
Comparing Imperfection Ratio and Imperfection Index for Graph Classes. RAIRO Oper. Res. 42 (4) (2008)
Jens Kuhpfahl, Annegret Katrin Wagler, Christian Wagner
Circular-imperfection of triangle-free graphs. Electron. Notes Discret. Math. 29 (2007)
Annegret Katrin Wagler
Rank-perfect and" weakly rank-perfect graphs. Math. Methods Oper. Res. 56 (1) (2002)