Annegret K. Wagler

138 papers B 5C 19Journal 100Unranked 10
YearRankTypeTitle / Venue / Authors
2026 J jnl
A polyhedral study of a relaxation of the routing and spectrum allocation problem.
Discret. Appl. Math.
Federico Bertero, Hervé Kerivin, Javier Marenco, Annegret K. Wagler
2026 J jnl
On full-separating sets and related codes in graphs.
Discret. Appl. Math.
Dipayan Chakraborty, Annegret K. Wagler
2026 J jnl
Routing and Spectrum Assignment in Elastic Optical Networks integrating Quality of Transmission requirements.
Eur. J. Oper. Res.
Pedro Henrique Fernandes da Silva, Hervé Kerivin, Michel Morvan, Annegret K. Wagler
2026 J jnl
The Interplay Between Domination and Separation in Graphs.
CoRR
Dipayan Chakraborty, Annegret K. Wagler
2025 — conf
On Full-Separating Sets in Graphs.
CALDAM
Dipayan Chakraborty, Annegret K. Wagler
2025 J jnl
On open-separating dominating codes in graphs.
Discret. Appl. Math.
Dipayan Chakraborty, Annegret K. Wagler
2025 C conf
Stretching Operations Applied to Cliques of Edge Intersection Graphs of Paths in Trees.
LAGOS
Mariana S. Escalante, Victoria Kaial, Annegret K. Wagler
2025 C conf
The Interplay Between Domination and Separation in Graphs.
LAGOS
Dipayan Chakraborty, Annegret K. Wagler
2024 J jnl
A project and lift approach for a 2-commodity flow relocation model in a time expanded network.
Discret. Appl. Math.
José Luis Figueroa González, Mourad Baïou, Alain Quilliot, Hélène Toussaint, Annegret K. Wagler
2024 — conf
Location-Domination Type Problems Under the Mycielski Construction.
CALDAM
Silvia M. Bianchi, Dipayan Chakraborty, Yanina Lucarini, Annegret K. Wagler
2024 J jnl
On Three Domination-based Identification Problems in Block Graphs.
Fundam. Informaticae
Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret K. Wagler
2024 J jnl
On full-separating sets in graphs.
CoRR
Dipayan Chakraborty, Annegret K. Wagler
2024 J jnl
On non-superperfection of edge intersection graphs of paths.
Discret. Optim.
Victoria Kaial, Hervé Kerivin, Annegret K. Wagler
2024 C conf
Open-Separating Dominating Codes in Graphs.
ISCO
Dipayan Chakraborty, Annegret K. Wagler
2024 J jnl
Open-separating dominating codes in graphs.
CoRR
Dipayan Chakraborty, Annegret K. Wagler
2024 J jnl
Progress towards the two-thirds conjecture on locating-total dominating sets.
Discret. Math.
Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael A. Henning, Annegret K. Wagler
2024 J jnl
Solving the routing and spectrum assignment problem, driven by combinatorial properties.
Networks
Pedro Henrique Fernandes da Silva, Hervé Kerivin, Juan Pablo Nant, Annegret K. Wagler
2023 C conf
A polyhedral study of a relaxation of the routing and spectrum allocation problem (Brief Announcement).
LAGOS
Federico Bertero, Hervé Kerivin, Javier Marenco, Annegret K. Wagler
2023 J jnl
Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs.
Discret. Appl. Math.
Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Annegret K. Wagler
2023 C conf
Managing Time Expanded Networks through Project and Lift: the Lift Issue.
LAGOS
José Luis Figueroa González, Alain Quilliot, Hélène Toussaint, Annegret K. Wagler
2023 — conf
Managing a Time Expanded Network through Project-and-Lift.
SoICT
José Luis Figueroa González, Alain Quilliot, Hélène Toussaint, Annegret K. Wagler
2023 — conf
On Three Domination-Based Identification Problems in Block Graphs.
CALDAM
Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret K. Wagler
2023 J jnl
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.
José Luis Figueroa, Alain Quilliot, Hélène Toussaint, Annegret K. Wagler
2022 C conf
A framework for routing and spectrum assignment in optical networks, driven by combinatorial properties.
INOC
Pedro Henrique Fernandes da Silva, Hervé Kervin, Juan Pablo Nant, Annegret K. Wagler
2022 C conf
Branch-and-Cut for a 2-Commodity Flow Relocation Model with Time Constraints.
ISCO
José Luis Figueroa González, Mourad Baïou, Alain Quilliot, Hélène Toussaint, Annegret K. Wagler
2022 J jnl
On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets.
Discret. Appl. Math.
Annegret K. Wagler
2022 C conf
Optimal 1-Request Insertion for the Pickup and Delivery Problem with Transfers and Time Horizon.
ICORES
José L. Figueroa, Alain Quilliot, Hélène Toussaint, Annegret K. Wagler
2022 J jnl
Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs.
Discret. Appl. Math.
Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret K. Wagler
2022 J jnl
Progress towards the two-thirds conjecture on locating-total dominating sets.
CoRR
Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael A. Henning, Annegret K. Wagler
2021 J jnl
On circular-perfect graphs: A survey.
Eur. J. Comb.
Arnaud Pêcher, Annegret K. Wagler
2020 J jnl
Linear-time algorithms for three domination-based separation problems in block graphs.
Discret. Appl. Math.
Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret K. Wagler
2020 J jnl
On some graph classes related to perfect graphs: A survey.
Discret. Appl. Math.
Flavia Bonomo-Braberman, Guillermo Durán, Martín D. Safe, Annegret K. Wagler
2020 C conf
Polyhedra Associated with Open Locating-Dominating and Locating Total-Dominating Sets in Graphs.
ISCO
Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret K. Wagler
2019 C conf
A novel integer linear programming model for routing and spectrum assignment in optical networks.
FedCSIS
Youssouf Hadhbi, Hervé Kerivin, Annegret K. Wagler
2019 J jnl
Fleet management for autonomous vehicles: Online PDP under special constraints.
RAIRO Oper. Res.
Sahar Bsaybes, Alain Quilliot, Annegret K. Wagler
2019 C conf
The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations.
LAGOS
Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret K. Wagler
2018 B conf
Fleet Management for Autonomous Vehicles Using Multicommodity Coupled Flows in Time-Expanded Networks.
SEA
Sahar Bsaybes, Alain Quilliot, Annegret K. Wagler
2018 C conf
Lovász-Schrijver PSD-Operator on Some Graph Classes Defined by Clique Cutsets.
ISCO
Annegret K. Wagler
2018 J jnl
On the Chvátal-rank of facets for the set covering polyhedron of circular matrices.
Electron. Notes Discret. Math.
Graciela L. Nasini, Luis Miguel Torres, Hervé Kerivin, Annegret K. Wagler
2018 J jnl
On three domination numbers in block graphs.
CoRR
Aline Parreau, Annegret K. Wagler
2018 J jnl
Polyhedra associated with identifying codes in graphs.
Discret. Appl. Math.
Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret K. Wagler
2018 J jnl
The Normal Graph Conjecture for Two Classes of Sparse Graphs.
Graphs Comb.
Anne Berry, Annegret K. Wagler
2017 J jnl
A linear-time algorithm for the identifying code problem on block graphs.
Electron. Notes Discret. Math.
Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret K. Wagler
2017 J jnl
Characterizing N+-perfect line graphs.
Int. Trans. Oper. Res.
Mariana S. Escalante, Graciela L. Nasini, Annegret K. Wagler
2017 J jnl
Fleet management for autonomous vehicles using flows in time-expanded networks.
Electron. Notes Discret. Math.
Sahar Bsaybes, Alain Quilliot, Annegret K. Wagler
2017 J jnl
Fleet management for autonomous vehicles: Online PDP under special constraints.
CoRR
Sahar Bsaybes, Alain Quilliot, Annegret K. Wagler
2016 C conf
Analyzing the dynamics of discrete deterministic systems.
CoDIT
Luis Miguel Torres, Annegret K. Wagler
2016 J jnl
Fleet management for autonomous vehicles.
CoRR
Sahar Bsaybes, Alain Quilliot, Annegret K. Wagler
2016 C conf
Lovász-Schrijver PSD-Operator on Claw-Free Graphs.
ISCO
Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Annegret K. Wagler
2016 — ch.
Prediction of Network Structure.
Modeling in Systems Biology, The Petri Net Approach
Annegret K. Wagler
2016 J jnl
Progress on the description of identifying code polyhedra for some families of split graphs.
Discret. Optim.
Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret K. Wagler
2015 J jnl
A polyhedral approach to locating-dominating sets in graphs.
Electron. Notes Discret. Math.
Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret K. Wagler
2015 J jnl
Clique-perfectness of complements of line graphs.
Discret. Appl. Math.
Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret K. Wagler
2015 C conf
Fleet management of autonomous vehicles: VIPAFLEET.
CTW
Sahar Bsaybes, Alain Quilliot, Annegret K. Wagler
2015 C conf
Locating-dominating sets in some families of split graphs.
CTW
Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret K. Wagler
2015 J jnl
On the Online Min-Wait Relocation Problem.
Electron. Notes Discret. Math.
Pascal Halffmann, Sven O. Krumke, Alain Quilliot, Annegret K. Wagler, Jan-Thierry Wegener
2015 J jnl
Polyhedral studies of vertex coloring problems: The asymmetric representatives formulation.
CoRR
Victor A. Campos, Ricardo C. Corrêa, Diego Delle Donne, Javier Marenco, Annegret K. Wagler
2015 — ed.
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), Brussels, Belgium, June 22, 2015.
BioPPN@Petri Nets
Monika Heiner, Annegret K. Wagler
2015 J jnl
ReOpt: an Algorithm with a Quality Guaranty for Solving the Static Relocation Problem.
CoRR
Sahar Bsaybes, Sven O. Krumke, Alain Quilliot, Annegret K. Wagler, Jan-Thierry Wegener
2015 — conf
The dynamics of deterministic systems - A survey.
BioPPN@Petri Nets
Luis Miguel Torres, Annegret K. Wagler
2015 J jnl
Two Flow-Based Approaches for the Static Relocation Problem in Carsharing Systems.
CoRR
Sahar Bsaybes, Alain Quilliot, Annegret K. Wagler, Jan-Thierry Wegener
2014 J jnl
Automatic network reconstruction from experimental time-series data: A survey.
it Inf. Technol.
Annegret K. Wagler
2014 J jnl
Balancedness of subclasses of circular-arc graphs.
Discret. Math. Theor. Comput. Sci.
Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret K. Wagler
2014 J jnl
Clique-perfectness and balancedness of some graph classes.
Int. J. Comput. Math.
Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret K. Wagler
2014 — ch.
Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow.
Large-Scale Networks in Engineering and Life Sciences
Annegret K. Wagler
2014 J jnl
Computing the clique number of
Eur. J. Comb.
Arnaud Pêcher, Annegret K. Wagler
2014 — conf
Integrating a priori knowledge in automatic network reconstruction.
BioPPN@Petri Nets
Marie C. F. Favre, Wolfgang Marwan, Annegret K. Wagler
2014 J jnl
Preprocessing for Network Reconstruction: Feasibility Test and Handling Infeasibility.
Fundam. Informaticae
Annegret K. Wagler, Jan-Thierry Wegener
2014 B conf
Relocation in Carsharing Systems Using Flows in Time-Expanded Networks.
SEA
Sven O. Krumke, Alain Quilliot, Annegret K. Wagler, Jan-Thierry Wegener
2014 C conf
Study of Identifying Code Polyhedra for Some Families of Split Graphs.
ISCO
Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret K. Wagler
2013 J jnl
Analyzing the dynamics of deterministic systems from a hypergraph theoretical point of view.
RAIRO Oper. Res.
Luis Miguel Torres, Annegret K. Wagler
2013 J jnl
Computing clique and chromatic number of circular-perfect graphs in polynomial time.
Math. Program.
Arnaud Pêcher, Annegret K. Wagler
2013 J jnl
Models and Algorithms for Carsharing Systems and Related Problems.
Electron. Notes Discret. Math.
Sven O. Krumke, Alain Quilliot, Annegret K. Wagler, Jan-Thierry Wegener
2013 J jnl
On Minimality and Equivalence of Petri Nets.
Fundam. Informaticae
Annegret K. Wagler, Jan-Thierry Wegener
2013 J jnl
On minimal forbidden subgraph characterizations of balanced graphs.
Discret. Appl. Math.
Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret K. Wagler
2013 J jnl
Optimal cut-times finding strategies for collecting a target component from overloaded elution chromatograms.
Comput. Chem. Eng.
Balamurali Sreedhar, Annegret K. Wagler, Malte Kaspereit, Andreas Seidel-Morgenstern
2013 J jnl
Polyhedra associated with identifying codes.
Electron. Notes Discret. Math.
Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret K. Wagler
2013 — conf
Preprocessing for Network Reconstruction: Feasibility Test and Handling Infeasibility.
CS&P
Annegret K. Wagler, Jan-Thierry Wegener
2013 — conf
Reconstructing X'-deterministic extended Petri nets from experimental time-series data X'.
BioPPN@Petri Nets
Marie C. F. Favre, Annegret K. Wagler
2013 B conf
The Normal Graph Conjecture for Classes of Sparse Graphs.
WG
Anne Berry, Annegret K. Wagler
2012 — conf
On Minimality and Equivalence of Petri Nets.
CS&P
Annegret K. Wagler, Jan-Thierry Wegener
2012 J jnl
Polynomial time computability of some graph parameters for superclasses of perfect graphs.
Int. J. Math. Oper. Res.
Arnaud Pêcher, Annegret K. Wagler
2012 B conf
Triangulation and Clique Separator Decomposition of Claw-Free Graphs.
WG
Anne Berry, Annegret K. Wagler
2011 J jnl
A lower bound on the Chvátal-rank of Antiwebs.
Electron. Notes Discret. Math.
Eugenia Holm, Luis Miguel Torres, Annegret K. Wagler
2011 J jnl
An algorithmic framework for network reconstruction.
Theor. Comput. Sci.
Markus Durzinsky, Annegret K. Wagler, Robert Weismantel
2011 J jnl
Automatic Network Reconstruction using ASP
CoRR
Max Ostrowski, Torsten Schaub, Markus Durzinsky, Wolfgang Marwan, Annegret K. Wagler
2011 J jnl
Automatic network reconstruction using ASP.
Theory Pract. Log. Program.
Markus Durzinsky, Wolfgang Marwan, Max Ostrowski, Torsten Schaub, Annegret K. Wagler
2011 J jnl
Clique-perfectness of complements of line graphs.
Electron. Notes Discret. Math.
Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret K. Wagler
2011 J jnl
Computing the clique number of a-perfect graphs in polynomial time.
Electron. Notes Discret. Math.
Arnaud Pêcher, Annegret K. Wagler
2011 J jnl
Encoding the dynamics of deterministic systems.
Math. Methods Oper. Res.
Luis Miguel Torres, Annegret K. Wagler
2011 C conf
Generalized row family inequalities for the set covering polyhedron.
CTW
Gabriela R. Argiroffo, Annegret K. Wagler
2011 J jnl
Petri nets as a framework for the reconstruction and analysis of signal transduction pathways and regulatory networks.
Nat. Comput.
Wolfgang Marwan, Annegret K. Wagler, Robert Weismantel
2011 J jnl
Reconstruction of extended Petri nets from time series data and its application to signal transduction and to gene regulatory networks.
BMC Syst. Biol.
Markus Durzinsky, Annegret K. Wagler, Wolfgang Marwan
2011 J jnl
The combinatorics of modeling and analyzing biological systems.
Nat. Comput.
Annegret K. Wagler, Robert Weismantel
2011 C conf
The dynamics of deterministic systems from a hypergraph theoretical point of view.
CTW
Luis Miguel Torres, Annegret K. Wagler
2010 J jnl
Balancedness of some subclasses of circular-arc graphs.
Electron. Notes Discret. Math.
Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret K. Wagler
2010 J jnl
Clique and chromatic number of circular-perfect graphs.
Electron. Notes Discret. Math.
Arnaud Pêcher, Annegret K. Wagler
2010 J jnl
Model reconstruction for discrete deterministic systems.
Electron. Notes Discret. Math.
Luis Miguel Torres, Annegret K. Wagler
2010 J jnl
On facets of stable set polytopes of claw-free graphs with stability number 3.
Discret. Math.
Arnaud Pêcher, Annegret K. Wagler
2010 J jnl
On the Chvátal rank of linear relaxations of the stable set polytope.
Int. Trans. Oper. Res.
Eugenia Holm, Luis Miguel Torres, Annegret K. Wagler
2010 J jnl
On the Chvátal-rank of Antiwebs.
Electron. Notes Discret. Math.
Eugenia Holm, Luis Miguel Torres, Annegret K. Wagler
2009 J jnl
Characterizing and bounding the imperfection ratio for some classes of graphs.
Math. Program.
Sylvain Coulonges, Arnaud Pêcher, Annegret K. Wagler
2009 J jnl
Cycle-based facets of chromatic scheduling polytopes.
Discret. Optim.
Javier Marenco, Annegret K. Wagler
2009 J jnl
Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques.
Discret. Optim.
Javier Marenco, Annegret K. Wagler
2009 J jnl
On minimal forbidden subgraph characterizations of balanced graphs.
Electron. Notes Discret. Math.
Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret K. Wagler
2009 J jnl
On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs.
Electron. Notes Discret. Math.
Arnaud Pêcher, Annegret K. Wagler
2009 J jnl
Triangle-free strongly circular-perfect graphs.
Discret. Math.
Sylvain Coulonges, Arnaud Pêcher, Annegret K. Wagler
2008 — conf
A Combinatorial Approach to Reconstruct Petri Nets from Experimental Data.
CMSB
Markus Durzinsky, Annegret K. Wagler, Robert Weismantel
2008 J jnl
A mathematical approach to solve the network reconstruction problem.
Math. Methods Oper. Res.
Wolfgang Marwan, Annegret K. Wagler, Robert Weismantel
2008 J jnl
Automatic reconstruction of molecular and genetic networks from discrete time series data.
Biosyst.
Markus Durzinsky, Annegret K. Wagler, Robert Weismantel, Wolfgang Marwan
2008 J jnl
Comparing Imperfection Ratio and Imperfection Index for Graph Classes.
RAIRO Oper. Res.
Arie M. C. A. Koster, Annegret K. Wagler
2008 J jnl
Constructions for normal graphs and some consequences.
Discret. Appl. Math.
Annegret K. Wagler
2008 J jnl
On classes of minimal circular-imperfect graphs.
Discret. Appl. Math.
Arnaud Pêcher, Annegret K. Wagler
2007 J jnl
A note on the Chvátal-rank of clique family inequalities.
RAIRO Oper. Res.
Arnaud Pêcher, Annegret K. Wagler
2007 J jnl
Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems.
Ann. Oper. Res.
Javier Marenco, Annegret K. Wagler
2007 J jnl
Circular-imperfection of triangle-free graphs.
Electron. Notes Discret. Math.
Jens Kuhpfahl, Annegret K. Wagler, Christian Wagner
2007 J jnl
On facets of stable set polytopes of claw-free graphs with stability number three.
Electron. Notes Discret. Math.
Arnaud Pêcher, Pierre Pesneau, Annegret K. Wagler
2006 J jnl
A construction for non-rank facets of stable set polytopes of webs.
Eur. J. Comb.
Arnaud Pêcher, Annegret K. Wagler
2006 J jnl
Almost all webs are not rank-perfect.
Math. Program.
Arnaud Pêcher, Annegret K. Wagler
2006 J jnl
Generalized clique family inequalities for claw-free graphs.
Electron. Notes Discret. Math.
Arnaud Pêcher, Annegret K. Wagler
2006 J jnl
On determining the imperfection ratio.
Electron. Notes Discret. Math.
Arie M. C. A. Koster, Annegret K. Wagler
2006 J jnl
On non-rank facets of stable set polytopes of webs with clique number four.
Discret. Appl. Math.
Arnaud Pêcher, Annegret K. Wagler
2006 J jnl
On the combinatorial structure of chromatic scheduling polytopes.
Discret. Appl. Math.
Javier Marenco, Annegret K. Wagler
2005 J jnl
On rank-perfect subclasses of near-bipartite graphs.
4OR
Annegret K. Wagler
2005 J jnl
On strongly circular-perfectness.
Electron. Notes Discret. Math.
Sylvain Coulonges, Arnaud Pêcher, Annegret K. Wagler
2005 J jnl
The combinatorial stages of chromatic scheduling polytopes.
Electron. Notes Discret. Math.
Javier Marenco, Annegret K. Wagler
2005 J jnl
Three classes of minimal circular-imperfect graphs.
Electron. Notes Discret. Math.
Arnaud Pêcher, Annegret K. Wagler, Xuding Zhu
2004 J jnl
Antiwebs are rank-perfect.
4OR
Annegret K. Wagler
2004 J jnl
Combinatorial equivalence of Chromatic Scheduling Polytopes.
Electron. Notes Discret. Math.
Javier Marenco, Annegret K. Wagler
2004 J jnl
Perfectness is an Elusive Graph Property.
SIAM J. Comput.
Stefan Hougardy, Annegret K. Wagler
2004 — ch.
Relaxing Perfectness: Which Graphs Are "Almost" Perfect?
The Sharpest Cut
Annegret K. Wagler
2003 J jnl
On Non-Rank Facets of Stable Set Polytopes of Webs with Clique Number Four-Extended Abstract-.
Electron. Notes Discret. Math.
Arnaud Pêcher, Annegret K. Wagler
2002 J jnl
Rank-perfect and" weakly rank-perfect graphs.
Math. Methods Oper. Res.
Annegret K. Wagler
2001 B conf
Critical and Anticritical Edges in Perfect Graphs.
WG
Annegret K. Wagler
2001 J jnl
Minimally Non-Preperfect Graphs of Small Maximum Degree.
Graphs Comb.
Zsolt Tuza, Annegret K. Wagler
1999 J jnl
Critical Edges in Perfect Line Graphs and some Polyhedral Consequences.
Discret. Appl. Math.
Annegret K. Wagler
1999 J jnl
On critically perfect graphs.
J. Graph Theory
Annegret K. Wagler
1997 J jnl
Wing-triangulated graphs are perfect.
J. Graph Theory
Stefan Hougardy, Van Bang Le, Annegret K. Wagler