Publications of Annegret Wagler :

• Fleet management for autonomous vehicles using flows in time-expanded networks
  (with Sahar Bsaybes and Alain Quilliot) TOP, DOI: 10.1007/s11750-019-00506-4
• Fleet management for autonomous vehicles: Online PDP under special constraints
  (with Sahar Bsaybes and Alain Quilliot) RAIRO-Oper. Res., DOI: 10.1051/ro/2018042

• Lovasz-Schrijver PSD-operator on some graph classes defined by clique cutsets
  In: Lee J., Rinaldi G., Mahjoub A. (eds) Combinatorial Optimization: ISCO 2018.
  Lecture Notes in Computer Science, vol 10856. Springer, Cham
• On the Chvatal-rank of facets for the set covering polyhedron of circular matrices
  (with H. Kerevin, G. Nasini, L.M. Torres) Electronic Notes in Discrete Math. 69 (2018) 85--92 (ALIO/EURO 2018)
• Fleet management for autonomous vehicles using multicommodity coupled flows in time-expanded networks
  (with Sahar Bsaybes and Alain Quilliot) 17th International Symposium on Experimental Algorithms (SEA 2018),
  Leibniz International Proceedings in Informatics (LIPIcs) 103, DOI: 10.4230/LIPIcs.SEA.2018.25
• The Normal Graph Conjecture for two classes of sparse graphs
  (with A. Berry) Graphs and Combinatorics 34 (2018) 139-157
• Polyhedra associated with identifying codes
  (with G.R. Argiroffo, S.M. Bianchi, Y. Lucarini) Discrete Applied Mathematics 245 (2018) 16-27

• Fleet management for autonomous vehicles using flows in time-expanded networks
  (with Sahar Bsaybes and Alain Quilliot) Electronic Notes in Discrete Math. 62 (2017) 255-260 (LAGOS 2017)
• A linear-time algorithm for the identifying code problem on block graphs
  (with G.R. Argiroffo, S.M. Bianchi, Y. Lucarini) Electronic Notes in Discrete Math. 62 (2017) 249-254 (LAGOS 2017)
• Characterizing N+-perfect line graphs
  (with M. Escalante, G. Nasini) International Transactions in Operational Research 24 (2017) 325-337

• Lovasz-Schrijver PSD-operator on claw-free graphs
  (with S. Bianchi, M. Escalante, G. Nasini) R. Cerulli et al. (Eds.): ISCO 2016, LNCS 9849, pp. 59-70, 2016.
• Minimally LS+-imperfect claw-free graphs
  (with S. Bianchi, M. Escalante, G. Nasini) In Proc. of Bordeaux Graph Workshop 2016
• Analyzing the dynamics of discrete deterministic systems
  (with L.M. Torres) In IEEE Proc. of International Conference on Control, Decision and Information Technologies (CoDIT 2016), pg. 382-387
• Progress on the description of identifying code polyhedra for some families of split graphs
  (with G.R. Argiroffo, S.M. Bianchi) Discrete Optimization 22 (2016) 225-240

• Clique-perfectness of complements of line graphs
  (with F. Bonomo, G. Duran, M.D. Safe) Discrete Applied Mathematics 186 (2015) 19-44
• A polyhedral approach to locating-dominating sets in graphs
  (with G.R. Argiroffo, S.M. Bianchi) Electronic Notes in Discrete Math. 50 (2015) 89-94 (LAGOS 2015)
• On the Online Min-Wait Relocation Problem
  (with P. Halffmann, S.O. Krumke, A. Quilliot, J.T. Wegener) Electronic Notes in Discrete Math. 50 (2015) 281-286 (LAGOS 2015)
• The dynamics of deterministic systems - A survey
  (with L.M. Torres) CEUR Workshop Proceedings 1373 (2015) 1-20 (Special Issue BioPPN 2015)
• On the Online Max-Accept Relocation Problem
  (with P. Halffmann, S.O. Krumke, A. Quilliot, and J.-T. Wegener) In Proc. of Odysseus 2015, Ajaccio, France
• Fleet management of autonomous vehicles: VIPAFLEET
  (with Sahar Bsaybes, Alain Quilliot) In Proc. of CTW 2015, Istanbul, Turkey
• Locating-dominating sets in some families of split graphs
  (with G.R. Argiroffo, S.M. Bianchi) In Proc. of CTW 2015, Istanbul, Turkey

• Combinatorial optimization: The interplay of graph theory, linear and integer programming illustrated on network flow
  In: Large Scale Networks in Engineering and Life Sciences,  Peter Benner, Rolf Findeisen, Dietrich Flockerzi, Udo Reichl, Kai Sundmacher, Editor(s), Birkhauser 2014, pp 225-262
• Automatic network reconstruction from experimental time-series data: A survey
  it - Information Technology. Volume 56, Issue 2, Pages 46-54 (issue on "Petri nets in the Life sciences", Ina Koch, Wolfgang Reisig, Falk Schreiber (eds.))
• Computing the clique number of a-perfect graphs in polynomial time
  (with A. Pecher) European Journal of Combinatorial Theory 35 (2014) 449-458
• Balancedness of subclasses of circular-arc graphs
  (with F. Bonomo, G. Duran, M.D. Safe) Discrete Mathematics and Theoretical Computer Science 16(3) (2014), 1-22
• Preprocessing for Network Reconstruction: Feasibility Test and Handling Infeasibility
  (with J.-T. Wegener) Fundamenta Informaticae 135 (2014) 521-535
• Clique-perfectness and balancedness of some graph classes
  (with F. Bonomo, G. Duran, M.D. Safe) International Journal of Computer Mathematics 91 (2014) 2118-2141
• Integrating prior knowledge in Automatic Network Reconstruction
  (with M.C.F. Favre, W. Marwan) CEUR Workshop Proceedings 1159 (2014) 45-59 (Special Issue BioPPN 2014)
• Relocation in carsharing systems using flows in time-expanded networks
  (with S.O. Krumke, A. Quilliot, J.-T. Wegener) Lecture Notes in Computer Science 8504 (2014) 87-98 (Special Issue SEA 2014)
• Study of identifying code polyhedra for some families of split graphs
  (with G.R. Argiroffo, S.M. Bianchi) Lecture Notes in Computer Science 8596 (2014) 13-25 (Special Issue ISCO 2014)
• Identifying codes for families of split graphs
  (extended abstract, with G.R. Argiroffo, S.M. Bianchi) In Proc. of ICGT 2014, Grenoble, France
• How unique is Lovasz's theta function?
  (extended abstract, with A. Pecher, O. Serra, X. Zhu) In Proc. of Alio/Euro 2014, Montevideo, Uruguay
• Characterizing N+-perfect line graphs
  (extended abstract, with M. Escalante, G. Nasini) In Proc. of Alio/Euro 2014, Montevideo, Uruguay
• On identifying code polyhedra of families of suns
  (extended abstract, with G.R. Argiroffo, S.M. Bianchi) In Proc. of Alio/Euro 2014, Montevideo, Uruguay

• Beyond Perfection: Computational Results for Superclasses
  (with A. Pecher) In: Facets of Combinatorial Optimization, M. Jünger, G. Reinelt (eds.), Springer-Verlag Berlin Heidelberg 2013, pp. 133-161
• On minimal forbidden subgraph characterizations of balanced graphs
  (with F. Bonomo, G. Duran, M.D. Safe) Discrete Applied Mathematics 161 (13-14) (2013), 1925-1942
• On minimality and equivalence of Petri nets
  (with J.-T. Wegener) Fundamenta Informaticae 128 (2013) 209-222
• Computing clique and chromatic number of circular-perfect graphs in polynomial time
  (with A. Pecher) Math. Programming A 141 (2013) 121-133
• Preprocessing for Network Reconstruction: Feasibility Test and Handling Infeasibility
  (extended abstract, with J.-T. Wegener) CEUR Workshop Proceedings 1032 (2013) 434-447 (Special Issue CS&P 2013)
• The Normal Graph Conjecture for classes of sparse graphs
  (with A. Berry) Lecture Notes in Computer Science 8165 (2013) 64-75 (Special Issue WG 2013)
• Polyhedra associated with identifying codes
  (extended abstract LAGOS 2013, with G.R. Argiroffo, S.M. Bianchi) Electronic Notes in Discrete Math. 44 (2013) 175-180
• Models and algorithms for carsharing systems and related problems
  (extended abstract LAGOS 2013, with S.O. Krumke, A. Quilliot, J.-T. Wegener) Electronic Notes in Discrete Math. 44 (2013) 201-206
• Analyzing the dynamics of deterministic systems from a hypergraph theoretical point of view
  (with L.M. Torres) RAIRO Operations Research 47 (2013) 321-330
• Reconstructing X'-deterministic extended Petri nets from experimental time-series data X'
  (extended abstract, with M. Favre) CEUR Workshop Proceedings 988 (2013) 45-59 (Special Issue BioPPN 2013)
• Reconstruction of extended Petri nets from time-series data by using logical control functions
  (with M. Durzinsky and W. Marwan) J. Math. Biology 66 (2013) 203-223
• Optimal cut-times finding strategies for collecting a target component in overloaded elution chromatography
  (with B. Sreedhar, M. Kaspereit, and A. Seidel-Morgenstern) Computers & Chemical Engineering 49 (2013) 158-169

• On minimality and equivalence of Petri nets
  (extended abstract, with J.-T. Wegener) CEUR Workshop Proceedings 928 (2012) 382-393 (Special Issue CS&P 2012)
• Triangulation and clique decomposition of claw-free graphs
  (with A. Berry) Lecture Notes in Computer Science 7551 (2012) 7-21 (Special Issue WG 2012)
• Polynomial time computability of some graph parameters for superclasses of perfect graphs
  (with A. Pecher) Int. J. Mathematics in Operational Research 4 (2012) 263-275

• Computing the clique number of a-perfect graphs in polynomial time
  (extended abstract EuroComb'11, with A. Pecher) Electronic Notes in Discrete Math. 38 (2011) 705-710
• Reconstruction of extended Petri nets from time series data and its application to signal transduction and to gene regulatory networks
  (with M. Durzinsky and W. Marwan) BMC Systems Biology 5 (2011) 113
• Automatic Network Reconstruction using ASP
  (with M. Ostrowski, T. Schaub, M. Durzinsky, W. Marwan)
  Theory and Practice of Logic Programming 11 (2011) 749-766
  Special Issue for 27th Int. Conference on Logic Programming (ICLP'11)
• The dynamics of deterministic systems from a hypergraph theoretical point of view
  (extended abstract CTW'11, with L.M. Torres) Proc. of the Cologne-Twente Workshop, Frascati (2011) 259-262
• Generalized row family inequalities for the set covering polyhedron
  (extended abstract CTW'11, with G.R. Argiroffo) Proc. of the Cologne-Twente Workshop, Frascati (2011) 60-63
• Petri nets as a framework for the reconstruction and modification of signal transduction pathways and regulatory networks
  (with W. Marwan and R. Weismantel) Natural Computing 10 (2011) 639-654
• The combinatorics of modeling and analyzing biological systems
  (with R. Weismantel) Natural Computing 10 (2011) 655-681
• Clique-perfectness of complements of line graphs
  (extended abstract LAGOS'11, with F. Bonomo, G. Duran and M.D. Safe) Electronic Notes in Discrete Math. 37 (2011) 327-332
• A lower bound on the Chvatal-rank of antiwebs
  (extended abstract LAGOS'11, with E. Holm and L.M. Torres) Electronic Notes in Discrete Math. 37 (2011) 381-386
• An algorithmic framework for network reconstruction
  (with M. Durzinsky and R. Weismantel) Journal of Theoretical Computer Science 412 (2011) 2800-2815
• Encoding the dynamics of deterministic systems
  (with L.M. Torres) Math. Methods of Operations Research 73 (2011) 281-300

• Prediction of network structure
  In: Modeling in Systems Biology, I. Koch, F. Schreiber, W. Reisig (eds.) Computational Biology 16, Springer London, 2010, pp. 309-338
• On the Chvatal-rank of linear relaxations of the stable set polytope
  (with E. Holm and L.M. Torres) International Transactions in Operational Research 17 (2010) 827-849
• Model reconstruction for discrete deterministic systems
  (extended abstract, with L.M. Torres) Electronic Notes in Discrete Math. 36 (2010) 175-182
• On the Chvatal-rank of antiwebs
  (extended abstract, with E. Holm and L.M. Torres) Electronic Notes in Discrete Math. 36 (2010) 183-190
• Clique and chromatic number of circular-perfect graphs
  (extended abstract, with A. Pecher) Electronic Notes in Discrete Math. 36 (2010) 199-206
• Balancedness of some subclasses of circular-arc graphs
  (extended abstract, with F. Bonomo, G. Duran and M.D. Safe) Electronic Notes in Discrete Math. 36 (2010) 1121-1128
• On facets of stable set polytopes of claw-free graphs with stability number three
  (with A. Pecher) Discrete Mathematics 310 (2010) 493-498

• Characterizing and bounding the imperfection ratio for some graph classes
  (with S. Coulonge and A. Pecher) Mathematical Programming A 118 (2009) 37-46
• On polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs
  (extended abstract, with A. Pecher) Electronic Notes in Discrete Math. 35 (2009) 53-58
• On minimal forbidden induced subgraph characterizations of balanced graphs
  (extended abstract, with F. Bonomo, G. Duran and M.D. Safe) Electronic Notes in Discrete Math. 35 (2009) 41-46
• Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques
  (with J. Marenco) Discrete Optimization 6 (2009) 64-78
• Cycle-based facets of chromatic scheduling polytopes
  (with J. Marenco) Discrete Optimization 6 (2009) 51-63
• Triangle-free strongly circular-perfect graphs
  (with S. Coulonge and A. Pecher) Discrete Mathematics 309 (2009) 3632-3643

• A combinatorial approach to reconstruct Petri nets from experimental data
  (with M. Durzinsky and R. Weismantel) In: M. Heiner and A.M. Uhrmacher (eds.), CSMB 2008 Lecture Notes in Bioinformatics 5307 (2008) 328-346
• Modelling the dynamic behavior of deterministic biological systems
  (extended abstract, with L.M. Torres and R. Weismantel) Proc. of ALIO/EURO Workshop on Appl. Comb. Opt., Buenos Aires 2008 (ISBN 978-950-29-1116-8)
• Some results towards the description of the stable set polytope of claw-free graphs
  (extended abstract, with U. Pietropaoli) Proc. of ALIO/EURO Workshop on Appl. Comb. Opt., Buenos Aires 2008 (ISBN 978-950-29-1116-8)
• On the Chvatal-rank of linear relaxations of the stable set polytope
  (extended abstract, with E. Holm and L.M. Torres) Proc. of ALIO/EURO Workshop on Appl. Comb. Opt., Buenos Aires 2008 (ISBN 978-950-29-1116-8)
• On classes of minimal circular-imperfect graphs
  (with A. Pecher) Discrete Applied Mathematics 156 (2008) 998-1010
• Automatic reconstruction of molecular and genetic networks from experimental time series data
  (with M. Durzinsky, W. Marwan, and R. Weismantel) BioSystems 93 (2008) 181-190
• Comparing imperfection ratio and imperfection index for graph classes
  (with A. Koster) RAIRO Operations Research 42 (2008) 485-500
• A mathematical approach to solve the network reconstruction problem
  (with W. Marwan and R. Weismantel) Math. Methods of Operations Research 67 (2008) 117-132
• Constructions for normal graphs and some consequences
  Discrete Applied Mathematics 156 (2008) 3329-3338

• Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems
  (with J. Marenco) Annals of Operations Research 150 (2007) 159-175
• A note on the Chvatal-rank of clique family inequalities
  (with A. Pecher) RAIRO Operations Research 41 (2007) 289-294
• Circular-imperfection of triangle-free graphs
  (extended abstract EuroComb 2007, with J. Kuhpfahl and C. Wagner) Electronic Notes in Discrete Math. 29 (2007) 163-167
• The Normal Graph Conjecture is true for circulants
  In: Graph Theory in Paris, A. Bondy et al. (eds.) Trends in Mathematics, Birkhäuser, Basel (2007) 365-374

• Almost all webs are not rank-perfect
  (with A. Pecher) Mathematical Programming B 105 (2006) 311-328
• A construction for non-rank facets of stable set polytopes of webs
  (with A. Pecher) European Journal of Combinatorics 27 (2006) 1172-1185
• On non-rank facets of stable set polytopes of webs with clique number four
  (with A. Pecher) Discrete Applied Mathematics 154 (2006) 1408-1415
• Generalized clique family inequalities for claw-free graphs
  (extended abstract, with A. Pecher) Electronic Notes in Discrete Math. 25 (2006) 117-121
• On determining the imperfection ratio
  (extended abstract, with A. Koster) Electronic Notes in Discrete Math. 25 (2006) 177-181
• On the combinatorial structure of chromatic scheduling polytopes
  (with J. Marenco) Discrete Applied Mathematics 154 (2006) 1865-1876
• On facets of stable set polytope of claw-free graphs with maximum stable set size three
  (with A. Pecher, P. Pesneau) Electronic Notes in Discrete Mathematics 28 (2006) 185-190

• On strongly circular-perfectness
  (extended abstract, with S. Coulonges and A. Pecher) Electronic Notes in Discrete Math. 22 (2005) 369-374
• On rank-perfect subclasses of near-bipartite graphs
  4OR 3 (2005) 329-336
• Three classes of minimally circular-imperfect graphs
  (extended abstract, with A. Pecher and X. Zhu) Electronic Notes in Discrete Math. 19 (2005) 6-15
• The combinatorial stages of chromatic scheduling polytopes
  (extended abstract, with J. Marenco) Electronic Notes in Discrete Math. 19 (2005) 63-69

• Relaxing perfectness: Which graphs are 'almost' perfect?
  In: The Sharpest Cut - Impact of Manfred Padberg and His Work, M. Grötschel (ed.)
  SIAM/MPS Series on Optimization 4, Philadelphia, 2004, pp. 77-96
• Antiwebs are rank-perfect
  4OR 2 (2004) 149-152
• Combinatorial equivalence of chromatic scheduling polytopes
  (extended abstract, with J. Marenco) Electronic Notes in Discrete Math. 18 (2004) 177-180
• Perfectness is an elusive graph property
  (with S. Hougardy) SIAM Journal on Computing 34 (2004) 109-117

• A construction for non-rank facets of stable set polytopes of webs
  (with A. Pecher) Eurocomb 2003, Prague - ITI Series 145 (2003) 301-305
• On non-rank facets of stable set polytopes of webs with clique number four
  (extended abstract, with A. Pecher) Electronic Notes in Discrete Math. 13 (2003) 93-96

• Rank-perfect and weakly rank-perfect graphs
  Mathematical Methods of Operations Research 95 (2002) 127-149

• Minimally non-preperfect graphs of small maximum degree
  (with Z. Tuza) Graphs and Combinatorics 17 (2001) 759-773
• Critical and anticritical edges in perfect graphs
  In: Graph-Theoretic Concepts in Computer Science (WG 2001), A. Brandstädt, V.B. Le (eds.)
  Lecture Nodes in Computer Science 2204, Springer (2001) 317-327

• On critically perfect graphs
  Journal of Graph Theory 32 (1999) 394-404
• Critical edges in perfect line graphs and some polyhedral consequences
  Discrete Applied Mathematics 95 (1999) 455-466

• Wing-triangulated graphs are perfect
  (with S. Hougardy and V.B. Le) Journal of Graph Theory 24 (1997) 25-31

• Beyond Perfection: On Relaxations and Superclasses
  Habilitation thesis, Otto-von-Guericke-University Magdeburg, January 2007
• Critical Edges in Perfect Graphs
  Ph. D. Dissertation, University of Technology Berlin, May 2000 Thesis
  Published as book (ISBN 3-89712-953-1) Göttingen, Cuvillier-Verlag, 2000.
• Spezielle Klassen perfekter Graphen, insbesondere wing-perfekte Graphen
  Diploma thesis, University of Technology Berlin, October 1994. (In German.)




Annegret Wagler

updated: 10/2010