A unified approach for domination and packing problems in graphs.

Graciela L. Nasini

Erica Hinrichsen Graciela L. Nasini Natalí Vansteenkiste A unified approach for domination and packing problems in graphs. 2026 236-247 392 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2026.06.002 db/journals/dam/dam392.html#HinrichsenNV26 streams/journals/dam

Mauro Lucci Graciela L. Nasini Paola B. Tolomei Luis Miguel Torres New framework for conflict-free coloring of hypergraphs and other graph coloring problems. 357-364 2025 LAGOS https://doi.org/10.1016/j.procs.2025.10.319 conf/lagos/2025 db/conf/lagos/lagos2025.html#LucciNTT25

Mauro Lucci Graciela L. Nasini Daniel Severín 0001 Solving the List Coloring Problem through a branch-and-price algorithm. 899-912 2024 315 Eur. J. Oper. Res. 3 https://doi.org/10.1016/j.ejor.2024.01.038 db/journals/eor/eor315.html#LucciNS24 streams/journals/eor

Alberto José Ferrari Valeria A. Leoni Graciela L. Nasini Gabriel Valiente Minimizing External Vertices in Hypergraph Orientations. 125-136 2024 ISCO https://doi.org/10.1007/978-3-031-60924-4_10 conf/iscopt/2024 db/conf/iscopt/isco2024.html#FerrariLNV24

Luciana Melchiori Graciela L. Nasini Jorge M. Montagna Gabriela Corsano Resources synchronization in a full truckload pickup and delivery problem: An exact approach. 106118 2023 151 Comput. Oper. Res. https://doi.org/10.1016/j.cor.2022.106118 db/journals/cor/cor151.html#MelchioriNMC23

Silvia M. Bianchi Mariana S. Escalante Graciela L. Nasini Annegret K. Wagler Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs. 70-86 2023 June 332 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2023.01.012 db/journals/dam/dam332.html#BianchiENW23

Erica Hinrichsen Graciela L. Nasini Natalí Vansteenkiste On general packing functions in graphs (Brief Announcement). 367-369 2023 LAGOS https://doi.org/10.1016/j.procs.2023.08.249 conf/lagos/2023 db/conf/lagos/lagos2023.html#HinrichsenNV23

Mauro Lucci Daniel E. Severín Graciela L. Nasini Solving the List Coloring Problem through a Branch-and-Price algorithm. 2023 abs/2304.10995 CoRR https://doi.org/10.48550/arXiv.2304.10995 db/journals/corr/corr2304.html#abs-2304-10995

Silvia M. Bianchi Graciela L. Nasini Paola B. Tolomei Luis Miguel Torres On dominating set polyhedra of circular interval graphs. 112283 2021 344 Discret. Math. 4 https://doi.org/10.1016/j.disc.2020.112283 db/journals/dm/dm344.html#BianchiNTT21

Graciela L. Nasini Pablo Daniel Torres Grundy dominating sequences on X-join product. 138-149 2020 284 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2020.03.016 db/journals/dam/dam284.html#NasiniT20

Silvia M. Bianchi Graciela L. Nasini Paola B. Tolomei Luis Miguel Torres Circuits and Circulant Minors. 147-158 2019 conf/lagos/2019 LAGOS https://doi.org/10.1016/j.entcs.2019.08.014 https://www.wikidata.org/entity/Q113317418 db/journals/entcs/entcs346.html#BianchiNTT19 Mauro Lucci Graciela L. Nasini Daniel Severín 0001 A Branch and Price Algorithm for List Coloring Problem. 613-624 2019 conf/lagos/2019 LAGOS https://doi.org/10.1016/j.entcs.2019.08.054 https://www.wikidata.org/entity/Q113317375 db/journals/entcs/entcs346.html#LucciNS19

Bostjan Bresar Tim Kos Graciela L. Nasini Pablo Daniel Torres Total dominating sequences in trees, split graphs, and under modular decomposition. 16-30 2018 28 Discret. Optim. https://doi.org/10.1016/j.disopt.2017.10.002 db/journals/disopt/disopt28.html#BresarKNT18

Graciela L. Nasini Luis Miguel Torres Hervé Kerivin Annegret K. Wagler On the Chvátal-rank of facets for the set covering polyhedron of circular matrices. 85-92 2018 69 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2018.07.012 db/journals/endm/endm69.html#NasiniTKW18

Mauro Lucci Graciela L. Nasini Daniel Severín 0001 A Branch and Price Algorithm for List Coloring Problem. 2018 abs/1812.00040 CoRR http://arxiv.org/abs/1812.00040 db/journals/corr/corr1812.html#abs-1812-00040

Mariana S. Escalante Graciela L. Nasini Annegret K. Wagler Characterizing N+-perfect line graphs. 325-337 2017 24 Int. Trans. Oper. Res. 1-2 https://doi.org/10.1111/itor.12275 db/journals/itor/itor24.html#EscalanteNW17

Silvia M. Bianchi Mariana S. Escalante Graciela L. Nasini Levent Tunçel Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs. 201-223 2017 162 Math. Program. 1-2 https://doi.org/10.1007/s10107-016-1035-1 db/journals/mp/mp162.html#BianchiENT17

Silvia M. Bianchi Mariana S. Escalante Graciela L. Nasini Annegret K. Wagler Lovász-Schrijver PSD-Operator on Claw-Free Graphs. 59-70 2016 ISCO https://doi.org/10.1007/978-3-319-45587-7_6 conf/iscopt/2016 db/conf/iscopt/isco2016.html#MianchiENW16

Isabel Méndez-Díaz Graciela L. Nasini Daniel E. Severín A DSATUR-based algorithm for the Equitable Coloring Problem. 41-50 2015 57 Comput. Oper. Res. https://doi.org/10.1016/j.cor.2014.11.014 db/journals/cor/cor57.html#Mendez-DiazNS15

Graciela L. Nasini Pablo Daniel Torres Some links between identifying codes and separating, dominating and total dominating sets in graphs. 181-186 2015 50 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2015.07.031 db/journals/endm/endm50.html#NasiniT15

Graciela L. Nasini Daniel E. Severín Pablo Daniel Torres On the Packing Chromatic Number on Hamming Graphs and General Graphs. 2015 abs/1510.05524 CoRR http://arxiv.org/abs/1510.05524 db/journals/corr/corr1510.html#NasiniST15

Gabriela R. Argiroffo Graciela L. Nasini Pablo Daniel Torres The packing coloring problem for lobsters and partner limited graphs. 373-382 2014 164 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2012.08.008 db/journals/dam/dam164.html#ArgiroffoNT14

Isabel Méndez-Díaz Graciela L. Nasini Daniel E. Severín A polyhedral approach for the equitable coloring problem. 413-426 2014 164 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2012.11.018 db/journals/dam/dam164.html#Mendez-DiazNS14

Silvia M. Bianchi Mariana S. Escalante Graciela L. Nasini Levent Tunçel Some advances on Lovász-Schrijver semidefinite programming relaxations of the fractional stable set polytope. 460-469 2014 164 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2013.03.028 db/journals/dam/dam164.html#BianchiENT14

Valeria A. Leoni Graciela L. Nasini Limited Packing and Multiple Domination problems: Polynomial time reductions. 547-553 2014 164 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2013.10.023 db/journals/dam/dam164.html#LeoniN14

Silvia M. Bianchi Graciela L. Nasini Paola B. Tolomei Some advances on the set covering polyhedron of circulant matrices. 59-70 2014 166 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2013.10.005 db/journals/dam/dam166.html#BianchiNT14

Silvia M. Bianchi Graciela L. Nasini Paola B. Tolomei The minor inequalities in the description of the set covering polyhedron of circulant matrices. 69-85 2014 79 Math. Methods Oper. Res. 1 https://doi.org/10.1007/s00186-013-0453-6 db/journals/mmor/mmor79.html#BianchiNT14

Mariana S. Escalante Graciela L. Nasini Lovász and Schrijver N_+ -Relaxation on Web Graphs. 221-229 2014 ISCO https://doi.org/10.1007/978-3-319-09174-7_19 conf/iscopt/2014 db/conf/iscopt/isco2014.html#EscalanteN14 Isabel Méndez-Díaz Graciela L. Nasini Daniel E. Severín A Tabu Search Heuristic for the Equitable Coloring Problem. 347-358 2014 ISCO https://doi.org/10.1007/978-3-319-09174-7_30 conf/iscopt/2014 db/conf/iscopt/isco2014.html#Mendez-DiazNS14

Isabel Méndez-Díaz Graciela L. Nasini Daniel E. Severín An exact DSatur-based algorithm for the Equitable Coloring Problem. 2014 abs/1405.7011 CoRR http://arxiv.org/abs/1405.7011 db/journals/corr/corr1405.html#Mendez-DiazNS14

Isabel Méndez-Díaz Graciela L. Nasini Daniel E. Severín A tabu search heuristic for the Equitable Coloring Problem. 2014 abs/1405.7020 CoRR http://arxiv.org/abs/1405.7020 db/journals/corr/corr1405.html#Mendez-DiazNS14a

Silvia M. Bianchi Mariana S. Escalante Graciela L. Nasini Levent Tunçel Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs. 2014 abs/1411.2069 CoRR http://arxiv.org/abs/1411.2069 db/journals/corr/corr1411.html#BianchiENT14

Maria Patricia Dobson Valeria A. Leoni Graciela L. Nasini A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games. 54-60 2013 10 Discret. Optim. 1 https://doi.org/10.1016/j.disopt.2012.10.004 db/journals/disopt/disopt10.html#DobsonLN13

Isabel Méndez-Díaz Graciela L. Nasini Daniel E. Severín An exact DSatur-based algorithm for the Equitable Coloring Problem. 281-286 2013 44 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2013.10.044 db/journals/endm/endm44.html#Mendez-DiazNS13

Silvia M. Bianchi Mariana S. Escalante Graciela L. Nasini Levent Tunçel Lovász-Schrijver SDP-operator and a superclass of near-perfect graphs. 339-344 2013 44 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2013.10.053 db/journals/endm/endm44.html#BianchiENT13

Isabel Méndez-Díaz Graciela L. Nasini Daniel E. Severín A new DSATUR-based algorithm for the Equitable Coloring Problem. 2013 CoRR http://arxiv.org/abs/1306.1758 abs/1306.1758 db/journals/corr/corr1306.html#Mendez-DiazNS13

Gabriela R. Argiroffo Graciela L. Nasini Pablo Daniel Torres The Packing Coloring Problem for (q, q-4) Graphs. 309-319 2012 ISCO https://doi.org/10.1007/978-3-642-32147-4_28 conf/iscopt/2012 db/conf/iscopt/isco2012.html#ArgiroffoNT12

Silvia M. Bianchi Mariana S. Escalante Graciela L. Nasini On the behavior of the N+-operator under blocker duality. 396-399 2011 159 Discret. Appl. Math. 5 https://doi.org/10.1016/j.dam.2010.11.023 db/journals/dam/dam159.html#BianchiEN11

Isabel Méndez-Díaz Graciela L. Nasini Daniel E. Severín Polyhedral results for the Equitable Coloring Problem. 159-164 2011 37 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2011.05.028 db/journals/endm/endm37.html#Mendez-DiazNS11

Silvia M. Bianchi Mariana S. Escalante Graciela L. Nasini Levent Tunçel Some advances on Lovász-Schrijver N+(⋅) relaxations of the fractional stable set polytope. 189-194 2011 37 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2011.05.033 db/journals/endm/endm37.html#BianchiENT11

Maria Patricia Dobson Valeria A. Leoni Graciela L. Nasini Polynomial reductions between the Limited Packing and Tuple Domination problems in graphs. 207-212 2011 37 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2011.05.036 db/journals/endm/endm37.html#DobsonLN11

Gabriela R. Argiroffo Graciela L. Nasini Pablo Daniel Torres Polynomial instances of the Packing Coloring Problem. 363-368 2011 37 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2011.05.062 db/journals/endm/endm37.html#ArgiroffoNT11

Silvia M. Bianchi Mariana S. Escalante Graciela L. Nasini Levent Tunçel Near-perfect graphs with polyhedral N+(G). 393-398 2011 37 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2011.05.067 db/journals/endm/endm37.html#BianchiENT11a

Maria Patricia Dobson Valeria A. Leoni Graciela L. Nasini The multiple domination and limited packing problems in graphs. 1108-1113 2011 111 Inf. Process. Lett. 23-24 https://doi.org/10.1016/j.ipl.2011.09.002 db/journals/ipl/ipl111.html#DobsonLN11

Isabel Méndez-Díaz Graciela L. Nasini Daniel E. Severín A polyhedral approach for the Equitable Coloring Problem http://arxiv.org/abs/1106.3348 2011 CoRR abs/1106.3348 db/journals/corr/corr1106.html#abs-1106-3348

Isabel Méndez-Díaz Graciela L. Nasini Daniel E. Severín Polyhedral results for the Equitable Coloring Problem http://arxiv.org/abs/1106.3349 2011 CoRR abs/1106.3349 db/journals/corr/corr1106.html#abs-1106-3349

Maria Patricia Dobson Valeria A. Leoni Graciela L. Nasini The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems. 551-558 2010 36 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2010.05.070 db/journals/endm/endm36.html#DobsonLN10

Maria Patricia Dobson Valeria A. Leoni Graciela L. Nasini The k-limited packing and k-tuple domination problems in strongly chordal, P4-tidy and split graphs. 559-566 2010 36 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2010.05.071 db/journals/endm/endm36.html#DobsonLN10a

Silvia M. Bianchi Graciela L. Nasini Paola B. Tolomei The set covering problem on circulant matrices: polynomial instances and the relation with the dominating set problem on webs. 1185-1192 2010 36 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2010.05.150 db/journals/endm/endm36.html#BianchiNT10

Valeria A. Leoni Graciela L. Nasini On the computational complexity of combinatorial flexibility problems. 3330-3343 2010 87 Int. J. Comput. Math. 15 https://doi.org/10.1080/00207160903315516 db/journals/ijcm/ijcm87.html#LeoniN10

Silvia M. Bianchi Graciela L. Nasini Paola B. Tolomei On the dominating set polytope of web graphs. 121-126 2009 35 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2009.11.021 db/journals/endm/endm35.html#BianchiNT09

Valeria A. Leoni Maria Patricia Dobson Graciela L. Nasini Recognizing Edge-Perfect Graphs: some Polynomial Instances. 153-156 2009 CTW http://www.lix.polytechnique.fr/ctw09/ctw09-proceedings.pdf#page=165 conf/colognetwente/2009 db/conf/colognetwente/colognetwente2009.html#LeoniDN09

Néstor E. Aguilera Valeria A. Leoni Graciela L. Nasini Combinatorial flexibility problems and their computational complexity. 303-308 2008 30 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2008.01.052 db/journals/endm/endm30.html#AguileraLN08

Gabriela R. Argiroffo Silvia M. Bianchi Graciela L. Nasini Some insight into characterizations of minimally nonideal matrices. 245-256 2008 67 Math. Methods Oper. Res. 2 https://doi.org/10.1007/s00186-007-0176-7 db/journals/mmor/mmor67.html#ArgiroffoBN08

Néstor E. Aguilera Valeria A. Leoni Graciela L. Nasini Some flexibility problmes and their complexity. 5-8 2007 CTW conf/colognetwente/2007 db/conf/colognetwente/colognetwente2007.html#AguileraLN07

Gabriela R. Argiroffo Silvia M. Bianchi Graciela L. Nasini Clutter nonidealness. 1324-1334 2006 154 Discret. Appl. Math. 9 https://doi.org/10.1016/j.dam.2005.05.032 db/journals/dam/dam154.html#ArgiroffoBN06

Mariana S. Escalante Graciela L. Nasini María del Carmen Varaldo On the commutativity of antiblocker diagrams under lift-and-project operators. 1845-1853 2006 154 Discret. Appl. Math. 13 https://doi.org/10.1016/j.dam.2006.03.026 db/journals/dam/dam154.html#EscalanteNV06

Gabriela R. Argiroffo Silvia M. Bianchi Graciela L. Nasini On a certain class of nonideal clutters. 1854-1864 2006 154 Discret. Appl. Math. 13 https://doi.org/10.1016/j.dam.2006.03.027 db/journals/dam/dam154.html#ArgiroffoBN06a

Mariana S. Escalante M. S. Montelar Graciela L. Nasini Minimal N+-rank graphs: Progress on Lipták and Tunçel's conjecture. 639-646 2006 34 Oper. Res. Lett. 6 https://doi.org/10.1016/j.orl.2005.10.008 https://www.wikidata.org/entity/Q123344904 db/journals/orl/orl34.html#EscalanteMN06

Valeria A. Leoni Graciela L. Nasini Note on: N.E. Aguilera, M.S. Escalante, G.L. Nasini, "The disjunctive procedure and blocker duality". 251-255 2005 150 Discret. Appl. Math. 1-3 https://doi.org/10.1016/j.dam.2004.09.020 db/journals/dam/dam150.html#LeoniN05

Gabriela R. Argiroffo Silvia M. Bianchi Graciela L. Nasini Lehman's equation on near-ideal clutters. 219-224 2005 19 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2005.05.030 db/journals/endm/endm19.html#ArgiroffoBN05

Néstor E. Aguilera Silvia M. Bianchi Graciela L. Nasini Lift and project relaxations for the matching and related polytopes. 193-212 2004 134 Discret. Appl. Math. 1-3 https://doi.org/10.1016/S0166-218X(03)00337-8 db/journals/dam/dam134.html#AguileraBN04

Gabriela R. Argiroffo Silvia M. Bianchi Graciela L. Nasini On a certain class of nonideal clutters. 25-30 2004 18 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2004.06.004 db/journals/endm/endm18.html#ArgiroffoBN04

Mariana S. Escalante M. S. Montelar Graciela L. Nasini On minimal N+- rank graphs. 109-114 2004 18 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2004.06.017 db/journals/endm/endm18.html#EscalanteMN04

Mariana S. Escalante Graciela L. Nasini María del Carmen Varaldo Note on Lift-and-Project Ranks and Antiblocker Duality. 115-119 2004 18 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2004.06.018 db/journals/endm/endm18.html#EscalanteNV04

Néstor E. Aguilera Mariana S. Escalante Graciela L. Nasini The disjunctive procedure and blocker duality. 1-13 2002 121 Discret. Appl. Math. 1-3 db/journals/dam/dam121.html#AguileraEN02 https://doi.org/10.1016/S0166-218X(01)00242-6

Néstor E. Aguilera Mariana S. Escalante Graciela L. Nasini A Generalization of the Perfect Graph Theorem Under the Disjunctive Index. 460-469 2002 27 Math. Oper. Res. 3 https://doi.org/10.1287/moor.27.3.460.309 db/journals/mor/mor27.html#AguileraEN02

Néstor E. Aguilera Gabriela R. Argiroffo Silvia M. Bianchi Bostjan Bresar Gabriela Corsano Maria Patricia Dobson Mariana S. Escalante Alberto José Ferrari Erica Hinrichsen Hervé Kerivin Tim Kos Valeria A. Leoni Mauro Lucci Luciana Melchiori Isabel Méndez-Díaz Jorge Marcelo MontagnaJorge M. Montagna M. Susana MontelarM. S. Montelar Daniel E. SeverínDaniel Severín 0001 Paola B. Tolomei Luis Miguel Torres Pablo Daniel Torres Levent Tunçel Gabriel Valiente Natalí Vansteenkiste María del Carmen Varaldo Annegret K. Wagler