María Inés Lopez Pujato

activity

20182026

collaborators

5 papers

math.CO2026

Released packing functions in graphs

Pablo Fekete, Erica Hinrichsen, Valeria Leoni +1

We introduce and start the study of a variant of packing functions in graphs. Given a graph $G$ with vertex set $V$ and nonnegative integer vectors $k = (k_{v})_{v \in V}$ , $\b…

cs.DM2021

On the proper interval completion problem within some chordal subclasses

François Dross, Claire Hilaire, Ivo Koch +4

Given a property (graph class) $Π$ , a graph $G$ , and an integer $k$ , the \emph{ $Π$ -completion} problem consists in deciding whether we can turn $G$ into a graph with the property $…

math.CO2020

Efficient algorithms for tuple domination on co-biconvex graphs and web graphs

María Patricia Dobson, Valeria Leoni, María Inés Lopez Pujato

A vertex in a graph dominates itself and each of its adjacent vertices. The \emph{ $k$ -tuple domination problem}, for a fixed positive integer $k$ , is to find a minimum sized vertex…

math.CO2018

Tuple domination on graphs with the consecutive-zeros property

María Patricia Dobson, Valeria Leoni, María Inés Lopez Pujato

The $k$ -tuple domination problem, for a fixed positive integer $k$ , is to find a minimum sized vertex subset such that every vertex in the graph is dominated by at least $k$ vertic…

cs.DS2018

New Algorithms for Weighted $k$ -Domination and Total $k$ -Domination Problems in Proper Interval Graphs

Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni +2

Given a positive integer $k$ , a $k$ -dominating set in a graph $G$ is a set of vertices such that every vertex not in the set has at least $k$ neighbors in the set. A total $k$ -domi…