Graciela L. Nasini

Annegret Katrin Wagler

Discret. Appl. Math., June, 2023

Solving the List Coloring Problem through a Branch-and-Price algorithm.

[BibT_eX]

[DOI]

Mauro Lucci

CoRR, 2023

Resources synchronization in a full truckload pickup and delivery problem: An exact approach.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2023

2021

On dominating set polyhedra of circular interval graphs.

[BibT_eX]

[DOI]

Discret. Math., 2021

2020

Grundy dominating sequences on X-join product.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2019

A Branch and Price Algorithm for List Coloring Problem.

[BibT_eX]

[DOI]

Mauro Lucci

Daniel Severín

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

Circuits and Circulant Minors.

[BibT_eX]

[DOI]

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

2018

On the Chvátal-rank of facets for the set covering polyhedron of circular matrices.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2018

Total dominating sequences in trees, split graphs, and under modular decomposition.

[BibT_eX]

[DOI]

Discret. Optim., 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 Wagler

Int. Trans. Oper. Res., 2017

2016

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

[BibT_eX]

[DOI]

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

2015

Some links between identifying codes and separating, dominating and total dominating sets in graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

On the Packing Chromatic Number on Hamming Graphs and General Graphs.

[BibT_eX]

[DOI]

CoRR, 2015

A DSATUR-based algorithm for the Equitable Coloring Problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2015

2014

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

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2014

A polyhedral approach for the equitable coloring problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Limited Packing and Multiple Domination problems: Polynomial time reductions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 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

The packing coloring problem for lobsters and partner limited graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

A Tabu Search Heuristic for the Equitable Coloring Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

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

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013

An exact DSatur-based algorithm for the Equitable Coloring Problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

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

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games.

[BibT_eX]

[DOI]

Discret. Optim., 2013

A new DSATUR-based algorithm for the Equitable Coloring Problem.

[BibT_eX]

[DOI]

CoRR, 2013

2012

The Packing Coloring Problem for (q, q-4) Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011

The multiple domination and limited packing problems in graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Polyhedral results for the Equitable Coloring Problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Polynomial reductions between the Limited Packing and Tuple Domination problems in graphs.

[BibT_eX]

[DOI]

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

Polynomial instances of the Packing Coloring Problem.

[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

On the computational complexity of combinatorial flexibility problems.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2010

The k-limited packing and k-tuple domination problems in strongly chordal, P4-tidy and split graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 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

2009

On the dominating set polytope of web graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Recognizing Edge-Perfect Graphs: some Polynomial Instances.

[BibT_eX]

[DOI]

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

Some insight into characterizations of minimally nonideal matrices.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2008

Combinatorial flexibility problems and their computational complexity.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

2007

Some flexibility problmes and their complexity.

[BibT_eX]

Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2006

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

[BibT_eX]

[DOI]

M. S. Montelar

Oper. Res. Lett., 2006

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

[BibT_eX]

[DOI]

María del Carmen Varaldo

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

Note on: N.E. Aguilera, M.S. Escalante, G.L. Nasini, "The disjunctive procedure and blocker duality".

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

2004

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

[BibT_eX]

[DOI]

María del Carmen Varaldo

Electron. Notes Discret. Math., 2004

On minimal N+- rank graphs.

[BibT_eX]

[DOI]

M. S. Montelar

Electron. Notes Discret. Math., 2004

On a certain class of nonideal clutters.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

Lift and project relaxations for the matching and related polytopes.

[BibT_eX]

[DOI]

Discret. Appl. 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]