Silvia M. Bianchi

Dipayan Chakraborty

Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2023

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

[BibT_eX]

[DOI]

Discret. Appl. Math., June, 2023

2022

Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

2021

On dominating set polyhedra of circular interval graphs.

[BibT_eX]

[DOI]

Discret. Math., 2021

2020

Linear-time algorithms for three domination-based separation problems in block graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Polyhedra Associated with Open Locating-Dominating and Locating Total-Dominating Sets in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2019

Circuits and Circulant Minors.

[BibT_eX]

[DOI]

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations.

[BibT_eX]

[DOI]

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

2018

Polyhedra associated with identifying codes in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

2017

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

[BibT_eX]

[DOI]

Math. Program., 2017

A linear-time algorithm for the identifying code problem on block graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

2016

Progress on the description of identifying code polyhedra for some families of split graphs.

[BibT_eX]

[DOI]

Discret. Optim., 2016

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

[BibT_eX]

[DOI]

M. S. Montelar

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

A polyhedral approach to locating-dominating sets in graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Locating-dominating sets in some families of split graphs.

[BibT_eX]

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

The minor inequalities in the description of the set covering polyhedron of circulant matrices.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2014

Some advances on the set covering polyhedron of circulant matrices.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Study of Identifying Code Polyhedra for Some Families of Split 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

Polyhedra associated with identifying codes.

[BibT_eX]

[DOI]

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

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 behavior of the N+-operator under blocker duality.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

2010

The set covering problem on circulant matrices: polynomial instances and the relation with the dominating set problem on webs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

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

[BibT_eX]

[DOI]

M. S. Montelar

Electron. Notes Discret. Math., 2010

Row family inequalities for the set covering polyhedron.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

The nonidealness index of rank-ideal matrices.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

2009

On the dominating set polytope of web graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

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

[BibT_eX]

[DOI]

M. S. Montelar

Electron. Notes Discret. Math., 2009

On the set covering polyhedron of circulant matrices.

[BibT_eX]

[DOI]

Discret. Optim., 2009

2008

Some insight into characterizations of minimally nonideal matrices.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2008

The nonidealness index of circulant matrices.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

2006

On a certain class of nonideal clutters.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Clutter nonidealness.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

2005

Lehman's equation on near-ideal clutters.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

2004

Lift and project relaxations for the matching and related polytopes.

[BibT_eX]

[DOI]

Néstor E. Aguilera