GABRIEL VALIENTE; G. NASINI; ALBERTO FERRARI; VALERIA LEONI

Minimizing External Vertices in Hypergraph Orientations

LECTURE NOTES IN COMPUTER SCIENCE; Año: 2024

LEONI, V.; FERNÁNDEZ, LARA

New complexity results on Roman {2}-domination

RAIRO - RECHERCHE OPERATIONNELLE (OPERATIONS RESEARCH); Lugar: Paris; Año: 2023 vol. 57 p. 1905 - 1912

LINEAR ALGORITHM, CIRCULAR-ARC GRAPH SUBCLASS, AUGMENTED ADJACENCY MATRICES, MODULAR ARITHMETIC, BOUNDSDOBSON, M.P; LOPEZ PUJATO MARIA INES; LEONI, V.

k-tuple and k-tuple total dominations on web graphs

MATEMáTICA CONTEMPORâNEA; Año: 2021 vol. 48 p. 31 - 41

MARTIN SAFE; LEONI, V.; E. HINRICHSEN

Labelled packing functions in graphs

INFORMATION PROCESSING LETTERS; Lugar: Amsterdam; Año: 2020 vol. 154

CHIARELLI, NINA (UNIVERSIDAD OF PRIMORSKA, ESLOVENIA ); LEONI, V.; LOPEZ PUJANTO , MARÍA INÉS; MILANIC MARTIN (UNIVERSIDAD OF PRIMORSKA, ESLOVENIA ); HARTINGER, TATIANA (UNIVERSIDAD OF PRIMORSKA, ESLOVENIA )

New algorithms for weigthed k-domiantion and total k-domination in proper interval graphs

THEORETICAL COMPUTER SCIENCE; Lugar: Amsterdam; Año: 2019 vol. 795 p. 128 - 141

LEONI, V.; LOPEZ PUJATO MARIA INES; MILANIC, M.; HARTINGER, TATIANA (UNIVERSIDAD OF PRIMORSKA, ESLOVENIA ); CHIARELLI, NINA (UNIVERSIDAD OF PRIMORSKA, ESLOVENIA )

Improved Algorithms for k-Domination and Total k-Domination in Proper Interval Graphs

LECTURE NOTES IN COMPUTER SCIENCE; Año: 2018 p. 1 - 13

ARGIROFFO, GABRIELA; LEONI, VALERIA; TORRES, PABLO

Complexity of k-tuple total and total {k}-dominations for some subclasses of bipartite graphs

INFORMATION PROCESSING LETTERS; Lugar: Amsterdam; Año: 2018 vol. 138 p. 75 - 80

M.P. DOBSON; E. HINRICHSEN; LEONI, V.

On the complexity of the {k}-packing function problem

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH; Año: 2017 vol. 24 p. 347 - 354

ARGIROFFO, GABRIELA; LEONI, V.; TORRES, PABLO

On the complexity of the Labelled Domination Problem in Graphs

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH; Año: 2017 vol. 24 p. 355 - 367

DOBSON, M.P; LEONI, V.

Towards a polynomial equivalence between {k}-packing functions and k-imited packings in graphs

LECTURE NOTES IN COMPUTER SCIENCE; Año: 2016 vol. 9849 p. 160 - 165

M.P. DOBSON; E. HINRICHSEN; V. LEONI

Generalized limited packings of some graphs with a limited number of P_4-partners

THEORETICAL COMPUTER SCIENCE; Lugar: Amsterdam; Año: 2015 vol. 579 p. 1 - 8

G. ARGIROFFO; V. LEONI; P. TORRES

On the complexity of {k}-domination and k-tuple domination in graphs

INFORMATION PROCESSING LETTERS; Lugar: Amsterdam; Año: 2015 vol. 116 p. 556 - 561

E. HINRICHSEN; V. LEONI

{k}-packing functions of graphs

LECTURE NOTES IN COMPUTER SCIENCE; Año: 2014 vol. 8596 p. 325 - 335

V. LEONI; G. NASINI

Limited Packing and Multiple Domination problems: polynomial time reductions

DISCRETE APPLIED MATHEMATICS; Lugar: Amsterdam; Año: 2014 vol. 164 p. 547 - 553

M.P. DOBSON; E. HINRICHSEN; V. LEONI

Generalized limited packings of some graphs with a limited number of P_4-partners

THEORETICAL COMPUTER SCIENCE; Lugar: Amsterdam; Año: 2014

DOBSON, M.P; LEONI, V.; NASINI, G.

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

DISCRETE OPTIMIZATION; Lugar: Amsterdam; Año: 2013 vol. 10 p. 54 - 60

M. ESCALANTE, V. LEONI, G. NASINI

A graph theoretical model for the total balancedness of combinatorial optimization games

REVISTA DE LA UNIóN MATEMáTICA ARGENTINA; Lugar: Bahía Blanca; Año: 2012 vol. 53 p. 85 - 92

M. P. DOBSON ; V. LEONI; G. NASINI

The Limited Packing and Multiple Domination problems in graphs

INFORMATION PROCESSING LETTERS; Año: 2011 vol. 111 p. 1108 - 1113

V. A. LEONI, G. L. NASINI

On the computacional complexity of combinatorial flexibility problems

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS; Lugar: Greenwich; Año: 2010 vol. 87 p. 3330 - 3343

N.E. AGUILERA; V.A. LEONI

Characterizations of Postman Sets

DISCRETE MATHEMATICS; Año: 2008 vol. 308 p. 2167 - 2174

V. LEONI, G. NASINI

On the relationship between disjunctive relaxations and minors in packing and covering problems

REVISTA DE LA UNIóN MATEMáTICA ARGENTINA; Lugar: Bahía Blanca, Argentina; Año: 2005 vol. 46 p. 11 - 22

V. LEONI, G. NASINI

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

DISCRETE APPLIED MATHEMATICS; Lugar: Amsterdam; Año: 2005 vol. 150 p. 251 - 255

A. JEAN MARIE; M. TIDBALL, M. ESCALANTE, V. LEONI, H. PONCE DE LEÓN

On the influence of resequencing on the regularity of serviceA. Jean Marie

PERFORMANCE EVALUATION; Año: 1999 vol. 36 p. 115 - 135