Annegret Wagler
Orcid: 0000-0002-6055-1176
According to our database1,
Annegret Wagler
authored at least 120 papers
between 1997 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2024
Solving the routing and spectrum assignment problem, driven by combinatorial properties.
Networks, March, 2024
Fundam. Informaticae, 2024
Discret. Math., 2024
A project and lift approach for a 2-commodity flow relocation model in a time expanded network.
Discret. Appl. Math., 2024
Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024
Proceedings of the Algorithms and Discrete Applied Mathematics, 2024
2023
Discret. Appl. Math., June, 2023
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., 2023
Proceedings of the 12th International Symposium on Information and Communication Technology, 2023
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023
A polyhedral study of a relaxation of the routing and spectrum allocation problem (Brief Announcement).
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023
2022
Discret. Appl. Math., 2022
Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs.
Discret. Appl. Math., 2022
Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022
A framework for routing and spectrum assignment in optical networks, driven by combinatorial properties.
Proceedings of the 10th International Network Optimization Conference, 2022
Optimal 1-Request Insertion for the Pickup and Delivery Problem with Transfers and Time Horizon.
Proceedings of the 11th International Conference on Operations Research and Enterprise Systems, 2022
2021
2020
Discret. Appl. Math., 2020
Linear-time algorithms for three domination-based separation problems in block graphs.
Discret. Appl. Math., 2020
Polyhedra Associated with Open Locating-Dominating and Locating Total-Dominating Sets in Graphs.
Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020
2019
RAIRO Oper. Res., 2019
The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019
A novel integer linear programming model for routing and spectrum assignment in optical networks.
Proceedings of the 2019 Federated Conference on Computer Science and Information Systems, 2019
2018
Electron. Notes Discret. Math., 2018
Fleet Management for Autonomous Vehicles Using Multicommodity Coupled Flows in Time-Expanded Networks.
Proceedings of the 17th International Symposium on Experimental Algorithms, 2018
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018
2017
Electron. Notes Discret. Math., 2017
Electron. Notes Discret. Math., 2017
2016
Proceedings of the Modeling in Systems Biology, The Petri Net Approach, 2016
Progress on the description of identifying code polyhedra for some families of split graphs.
Discret. Optim., 2016
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016
Proceedings of the International Conference on Control, 2016
2015
Electron. Notes Discret. Math., 2015
Polyhedral studies of vertex coloring problems: The asymmetric representatives formulation.
CoRR, 2015
CoRR, 2015
ReOpt: an Algorithm with a Quality Guaranty for Solving the Static Relocation Problem.
CoRR, 2015
Fleet management of autonomous vehicles: VIPAFLEET.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015
Locating-dominating sets in some families of split graphs.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015
Proceedings of the 6th International Workshop on Biological Processes & Petri Nets co-located with 36th International Conference on Application and Theory of Petri Nets and Concurreny (PETRI NETS 2015), 2015
2014
it Inf. Technol., 2014
Int. J. Comput. Math., 2014
Preprocessing for Network Reconstruction: Feasibility Test and Handling Infeasibility.
Fundam. Informaticae, 2014
Eur. J. Comb., 2014
Discret. Math. Theor. Comput. Sci., 2014
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014
Proceedings of the 5th International Workshop on Biological Processes & Petri Nets co-located with 35th International Conference on Application and Theory of Petri Nets and Concurreny (PETRI NETS 2014), 2014
Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow.
Proceedings of the Large-Scale Networks in Engineering and Life Sciences, 2014
2013
Analyzing the dynamics of deterministic systems from a hypergraph theoretical point of view.
RAIRO Oper. Res., 2013
Math. Program., 2013
Electron. Notes Discret. Math., 2013
Discret. Appl. Math., 2013
Optimal cut-times finding strategies for collecting a target component from overloaded elution chromatograms.
Comput. Chem. Eng., 2013
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013
Reconstructing X'-deterministic extended Petri nets from experimental time-series data X'.
Proceedings of the International Workshop on Biological Processes & Petri Nets, 2013
2012
Polynomial time computability of some graph parameters for superclasses of perfect graphs.
Int. J. Math. Oper. Res., 2012
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012
2011
Petri nets as a framework for the reconstruction and analysis of signal transduction pathways and regulatory networks.
Nat. Comput., 2011
Electron. Notes Discret. Math., 2011
Reconstruction of extended Petri nets from time series data and its application to signal transduction and to gene regulatory networks.
BMC Syst. Biol., 2011
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011
2010
Int. Trans. Oper. Res., 2010
Electron. Notes Discret. Math., 2010
Electron. Notes Discret. Math., 2010
Electron. Notes Discret. Math., 2010
Discret. Math., 2010
2009
Math. Program., 2009
On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs.
Electron. Notes Discret. Math., 2009
Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques.
Discret. Optim., 2009
2008
RAIRO Oper. Res., 2008
Math. Methods Oper. Res., 2008
Automatic reconstruction of molecular and genetic networks from discrete time series data.
Biosyst., 2008
Proceedings of the Computational Methods in Systems Biology, 6th International Conference, 2008
2007
Electron. Notes Discret. Math., 2007
Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems.
Ann. Oper. Res., 2007
2006
Electron. Notes Discret. Math., 2006
Eur. J. Comb., 2006
Discret. Appl. Math., 2006
Discret. Appl. Math., 2006
2005
Electron. Notes Discret. Math., 2005
Electron. Notes Discret. Math., 2005
2004
Electron. Notes Discret. Math., 2004
Proceedings of the Sharpest Cut, 2004
2003
On Non-Rank Facets of Stable Set Polytopes of Webs with Clique Number Four-Extended Abstract-.
Electron. Notes Discret. Math., 2003
2002
2001
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001
1999
Discret. Appl. Math., 1999
1997