Mariana S. Escalante

CoRR, May, 2026

The 1-persistency of the clique relaxation of the stable set polytope: A focus on some forbidden structures.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2026

2025

The Minimum Clique Routing Problem on Cycles.

[BibT_eX]

[DOI]

Networks, 2025

Integer linear programs for the power dominating set problem with channel limitation.

[BibT_eX]

[DOI]

Mauro Lucci

Diego Delle Donne

Proceedings of the XIII Latin-American Algorithms, Graphs and Optimization Symposium, 2025

On total {k}-domination in caterpillar graphs.

[BibT_eX]

[DOI]

María Inés Lopez Pujato

Paola B. Tolomei

Proceedings of the XIII Latin-American Algorithms, Graphs and Optimization Symposium, 2025

Stretching Operations Applied to Cliques of Edge Intersection Graphs of Paths in Trees.

[BibT_eX]

[DOI]

Victoria Kaial

Annegret K. Wagler

Proceedings of the XIII Latin-American Algorithms, Graphs and Optimization Symposium, 2025

2024

On the Complexity of the Minimum Chromatic Violation Problem.

[BibT_eX]

[DOI]

Diego Delle Donne

María Elisa Ugarte

Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024

1-Persistency of the Clique Relaxation of the Stable Set Polytope.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024

2023

Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., June, 2023

Characterization of graphs with perfect closed neighbourhood matrices.

[BibT_eX]

[DOI]

Erica G. Hinrichsen

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2020

The minimum chromatic violation problem: A polyhedral approach.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2018

Packing functions and graphs with perfect closed neighbourhood matrices.

[BibT_eX]

[DOI]

Erica G. Hinrichsen

Valeria Leoni

CoRR, 2018

2017

Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs.

[BibT_eX]

[DOI]

Math. Program., 2017

Characterizing N+-perfect line graphs.

[BibT_eX]

[DOI]

Annegret K. Wagler

Int. Trans. Oper. Res., 2017

The minimum chromatic violation problem: a polyhedral study.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

2016

Lift-and-project ranks of the stable set polytope of joined a-perfect graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Lovász-Schrijver PSD-Operator on Claw-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015

The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity.

[BibT_eX]

[DOI]

Javier Marenco

Ann. Oper. Res., 2015

2014

Some advances on Lovász-Schrijver semidefinite programming relaxations of the fractional stable set polytope.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

On the facets of lift-and-project relaxations under graph operations.

[BibT_eX]

[DOI]

Pablo G. Fekete

Discret. Appl. Math., 2014

Lovász and Schrijver N_+ -Relaxation on Web Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013

Lovász-Schrijver SDP-operator and a superclass of near-perfect graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

A note on the disjunctive index of joined a-perfect graphs.

[BibT_eX]

[DOI]

M. Susana Montelar

Electron. Notes Discret. Math., 2013

The 2-dominating set polytope of cycles and related graph classes.

[BibT_eX]

[DOI]

Gabriela R. Argiroffo

María Elisa Ugarte

Electron. Notes Discret. Math., 2013

2012

Lift-and-project ranks of the set covering polytope of circulant matrices.

[BibT_eX]

[DOI]

M. Susana Montelar

Discret. Appl. Math., 2012

2011

A polyhedral study of the single-item lot-sizing problem with continuous start-up costs.

[BibT_eX]

[DOI]

Javier L. Marenco

Electron. Notes Discret. Math., 2011

Near-perfect graphs with polyhedral N+(G).

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Some advances on Lovász-Schrijver N+(⋅) relaxations of the fractional stable set polytope.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

On the facets of the lift-and-project relaxations of graph subdivisions.

[BibT_eX]

[DOI]

Pablo G. Fekete

Electron. Notes Discret. Math., 2011

On the behavior of the N+-operator under blocker duality.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

2010

The Shapley value for arbitrary families of coalitions.

[BibT_eX]

[DOI]

Silvia C. Di Marco

Eur. J. Oper. Res., 2010

A comparison between lift-and-project indices and imperfection ratio on web graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

On the k-dominating set polytope of web graphs.

[BibT_eX]

[DOI]

Gabriela R. Argiroffo

María Elisa Ugarte

Electron. Notes Discret. Math., 2010

A polyhedral approach to the stability of a family of coalitions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

2009

Strength of facets for the set covering and set packing polyhedra on circulant matrices.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

2006

Minimal N+-rank graphs: Progress on Lipták and Tunçel's conjecture.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2006

On the commutativity of antiblocker diagrams under lift-and-project operators.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

2004

Note on Lift-and-Project Ranks and Antiblocker Duality.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

On minimal N+- rank graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

2002

A Generalization of the Perfect Graph Theorem Under the Disjunctive Index.

[BibT_eX]

[DOI]

Math. Oper. Res., 2002

The disjunctive procedure and blocker duality.

[BibT_eX]

[DOI]