Annegret Wagler

According to our database1, Annegret Wagler authored at least 102 papers between 1997 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
On circular-perfect graphs: A survey.
Eur. J. Comb., 2021

2020
On some graph classes related to perfect graphs: A survey.
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
Fleet management for autonomous vehicles: Online PDP under special constraints.
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
The Normal Graph Conjecture for Two Classes of Sparse Graphs.
Graphs Comb., 2018

On the Chvátal-rank of facets for the set covering polyhedron of circular matrices.
Electron. Notes Discret. Math., 2018

Polyhedra associated with identifying codes in graphs.
Discret. Appl. Math., 2018

On three domination numbers in block graphs.
CoRR, 2018

Fleet Management for Autonomous Vehicles Using Multicommodity Coupled Flows in Time-Expanded Networks.
Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

Lovász-Schrijver PSD-Operator on Some Graph Classes Defined by Clique Cutsets.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2017
Characterizing N+-perfect line graphs.
Int. Trans. Oper. Res., 2017

Fleet management for autonomous vehicles using flows in time-expanded networks.
Electron. Notes Discret. Math., 2017

A linear-time algorithm for the identifying code problem on block graphs.
Electron. Notes Discret. Math., 2017

2016
Prediction of Network Structure.
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

Fleet management for autonomous vehicles.
CoRR, 2016

Lovász-Schrijver PSD-Operator on Claw-Free Graphs.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

Analyzing the dynamics of discrete deterministic systems.
Proceedings of the International Conference on Control, 2016

2015
On the Online Min-Wait Relocation Problem.
Electron. Notes Discret. Math., 2015

A polyhedral approach to locating-dominating sets in graphs.
Electron. Notes Discret. Math., 2015

Polyhedral studies of vertex coloring problems: The asymmetric representatives formulation.
CoRR, 2015

Two Flow-Based Approaches for the Static Relocation Problem in Carsharing Systems.
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

The dynamics of deterministic systems - A survey.
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
Automatic network reconstruction from experimental time-series data: A survey.
it Inf. Technol., 2014

Clique-perfectness and balancedness of some graph classes.
Int. J. Comput. Math., 2014

Preprocessing for Network Reconstruction: Feasibility Test and Handling Infeasibility.
Fundam. Informaticae, 2014

Computing the clique number of <i>a</i>a-perfect graphs in polynomial time.
Eur. J. Comb., 2014

Balancedness of subclasses of circular-arc graphs.
Discret. Math. Theor. Comput. Sci., 2014

Relocation in Carsharing Systems Using Flows in Time-Expanded Networks.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Study of Identifying Code Polyhedra for Some Families of Split Graphs.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

Integrating a priori knowledge in automatic network reconstruction.
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

Computing clique and chromatic number of circular-perfect graphs in polynomial time.
Math. Program., 2013

On Minimality and Equivalence of Petri Nets.
Fundam. Informaticae, 2013

Models and Algorithms for Carsharing Systems and Related Problems.
Electron. Notes Discret. Math., 2013

Polyhedra associated with identifying codes.
Electron. Notes Discret. Math., 2013

Optimal cut-times finding strategies for collecting a target component from overloaded elution chromatograms.
Comput. Chem. Eng., 2013

The Normal Graph Conjecture for Classes of Sparse Graphs.
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

Triangulation and Clique Separator Decomposition of Claw-Free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011
Automatic network reconstruction using ASP.
Theory Pract. Log. Program., 2011

An algorithmic framework for network reconstruction.
Theor. Comput. Sci., 2011

The combinatorics of modeling and analyzing biological systems.
Nat. Comput., 2011

Petri nets as a framework for the reconstruction and analysis of signal transduction pathways and regulatory networks.
Nat. Comput., 2011

Encoding the dynamics of deterministic systems.
Math. Methods Oper. Res., 2011

Computing the clique number of a-perfect graphs in polynomial time.
Electron. Notes Discret. Math., 2011

A lower bound on the Chvátal-rank of Antiwebs.
Electron. Notes Discret. Math., 2011

Clique-perfectness of complements of line graphs.
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

The dynamics of deterministic systems from a hypergraph theoretical point of view.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

Generalized row family inequalities for the set covering polyhedron.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010
On the Chvátal rank of linear relaxations of the stable set polytope.
Int. Trans. Oper. Res., 2010

Model reconstruction for discrete deterministic systems.
Electron. Notes Discret. Math., 2010

Clique and chromatic number of circular-perfect graphs.
Electron. Notes Discret. Math., 2010

On the Chvátal-rank of Antiwebs.
Electron. Notes Discret. Math., 2010

Balancedness of some subclasses of circular-arc graphs.
Electron. Notes Discret. Math., 2010

On facets of stable set polytopes of claw-free graphs with stability number 3.
Discret. Math., 2010

2009
Characterizing and bounding the imperfection ratio for some classes of graphs.
Math. Program., 2009

On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs.
Electron. Notes Discret. Math., 2009

On minimal forbidden subgraph characterizations of balanced graphs.
Electron. Notes Discret. Math., 2009

Triangle-free strongly circular-perfect graphs.
Discret. Math., 2009

Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques.
Discret. Optim., 2009

Cycle-based facets of chromatic scheduling polytopes.
Discret. Optim., 2009

2008
Comparing Imperfection Ratio and Imperfection Index for Graph Classes.
RAIRO Oper. Res., 2008

A mathematical approach to solve the network reconstruction problem.
Math. Methods Oper. Res., 2008

Constructions for normal graphs and some consequences.
Discret. Appl. Math., 2008

On classes of minimal circular-imperfect graphs.
Discret. Appl. Math., 2008

Automatic reconstruction of molecular and genetic networks from discrete time series data.
Biosyst., 2008

A Combinatorial Approach to Reconstruct Petri Nets from Experimental Data.
Proceedings of the Computational Methods in Systems Biology, 6th International Conference, 2008

2007
A note on the Chvátal-rank of clique family inequalities.
RAIRO Oper. Res., 2007

On facets of stable set polytopes of claw-free graphs with stability number three.
Electron. Notes Discret. Math., 2007

Circular-imperfection of triangle-free graphs.
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
Almost all webs are not rank-perfect.
Math. Program., 2006

Generalized clique family inequalities for claw-free graphs.
Electron. Notes Discret. Math., 2006

On determining the imperfection ratio.
Electron. Notes Discret. Math., 2006

A construction for non-rank facets of stable set polytopes of webs.
Eur. J. Comb., 2006

On non-rank facets of stable set polytopes of webs with clique number four.
Discret. Appl. Math., 2006

On the combinatorial structure of chromatic scheduling polytopes.
Discret. Appl. Math., 2006

2005
Three classes of minimal circular-imperfect graphs.
Electron. Notes Discret. Math., 2005

The combinatorial stages of chromatic scheduling polytopes.
Electron. Notes Discret. Math., 2005

On strongly circular-perfectness.
Electron. Notes Discret. Math., 2005

On rank-perfect subclasses of near-bipartite graphs.
4OR, 2005

2004
Perfectness is an Elusive Graph Property.
SIAM J. Comput., 2004

Combinatorial equivalence of Chromatic Scheduling Polytopes.
Electron. Notes Discret. Math., 2004

Antiwebs are rank-perfect.
4OR, 2004

Relaxing Perfectness: Which Graphs Are "Almost" Perfect?
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
Rank-perfect and" weakly rank-perfect graphs.
Math. Methods Oper. Res., 2002

2001
Minimally Non-Preperfect Graphs of Small Maximum Degree.
Graphs Comb., 2001

Critical and Anticritical Edges in Perfect Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

1999
On critically perfect graphs.
J. Graph Theory, 1999

Critical Edges in Perfect Line Graphs and some Polyhedral Consequences.
Discret. Appl. Math., 1999

1997
Wing-triangulated graphs are perfect.
J. Graph Theory, 1997


  Loading...