default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDValeria A. Leoni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Alberto José Ferrari, Valeria A. Leoni, Graciela L. Nasini, Gabriel Valiente:
Minimizing External Vertices in Hypergraph Orientations. ISCO 2024: 125-136- 2020
- [j20]Erica G. Hinrichsen, Valeria A. Leoni, Martín D. Safe
:
Labelled packing functions in graphs. Inf. Process. Lett. 154 (2020)
2010 – 2019
- 2019
- [j19]Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Maria Inés Lopez Pujato, Martin Milanic:
New algorithms for weighted k-domination and total k-domination problems in proper interval graphs. Theor. Comput. Sci. 795: 128-141 (2019) - [c6]Maria Patricia Dobson, Valeria A. Leoni, Maria Inés Lopez Pujato:
Tuple Domination on Graphs with the Consecutive-zeros Property. LAGOS 2019: 401-411 - 2018
- [j18]Gabriela R. Argiroffo, Valeria A. Leoni, Pablo Daniel Torres:
Complexity of k-tuple total and total {k}-dominations for some subclasses of bipartite graphs. Inf. Process. Lett. 138: 75-80 (2018) - [c5]Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Maria Inés Lopez Pujato, Martin Milanic:
Improved Algorithms for k-Domination and Total k-Domination in Proper Interval Graphs. ISCO 2018: 290-302 - [i1]Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Maria Inés Lopez Pujato, Martin Milanic:
New Algorithms for Weighted k-Domination and Total k-Domination Problems in Proper Interval Graphs. CoRR abs/1803.04327 (2018) - 2017
- [j17]Maria Patricia Dobson, Erica G. Hinrichsen, Valeria A. Leoni:
On the complexity of the {k}-packing function problem. Int. Trans. Oper. Res. 24(1-2): 347-354 (2017) - [j16]Gabriela R. Argiroffo, Valeria A. Leoni, Pablo Daniel Torres:
On the complexity of the labeled domination problem in graphs. Int. Trans. Oper. Res. 24(1-2): 355-367 (2017) - 2016
- [c4]Valeria A. Leoni, Maria Patricia Dobson:
Towards a Polynomial Equivalence Between k -Packing Functions and k-Limited Packings in Graphs. ISCO 2016: 160-165 - 2015
- [j15]Valeria A. Leoni, Maria Patricia Dobson, Erica G. Hinrichsen:
NP-completeness of the {k}-packing function problem in graphs. Electron. Notes Discret. Math. 50: 115-120 (2015) - [j14]Gabriela R. Argiroffo, Valeria A. Leoni, Pablo Daniel Torres:
On the complexity of {k}-domination and k-tuple domination in graphs. Inf. Process. Lett. 115(6-8): 556-561 (2015) - [j13]Maria Patricia Dobson, Erica G. Hinrichsen, Valeria A. Leoni:
Generalized limited packings of some graphs with a limited number of P4-partners. Theor. Comput. Sci. 579: 1-8 (2015) - 2014
- [j12]Valeria A. Leoni, Graciela L. Nasini:
Limited Packing and Multiple Domination problems: Polynomial time reductions. Discret. Appl. Math. 164: 547-553 (2014) - [c3]Valeria Alejandra Leoni, Erica G. Hinrichsen:
k -Packing Functions of Graphs. ISCO 2014: 325-335 - 2013
- [j11]Maria Patricia Dobson, Valeria A. Leoni, Graciela L. Nasini:
A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games. Discret. Optim. 10(1): 54-60 (2013) - [j10]Gabriela R. Argiroffo, Valeria A. Leoni, Pablo Daniel Torres:
{k}-domination for chordal graphs and related graph classes. Electron. Notes Discret. Math. 44: 219-224 (2013) - 2011
- [j9]Maria Patricia Dobson, Valeria A. Leoni, Graciela L. Nasini:
Polynomial reductions between the Limited Packing and Tuple Domination problems in graphs. Electron. Notes Discret. Math. 37: 207-212 (2011) - [j8]Maria Patricia Dobson, Valeria A. Leoni, Graciela L. Nasini:
The multiple domination and limited packing problems in graphs. Inf. Process. Lett. 111(23-24): 1108-1113 (2011) - 2010
- [j7]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. Electron. Notes Discret. Math. 36: 551-558 (2010) - [j6]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. Electron. Notes Discret. Math. 36: 559-566 (2010) - [j5]Valeria A. Leoni, Graciela L. Nasini:
On the computational complexity of combinatorial flexibility problems. Int. J. Comput. Math. 87(15): 3330-3343 (2010)
2000 – 2009
- 2009
- [c2]Valeria A. Leoni, Maria Patricia Dobson, Graciela L. Nasini:
Recognizing Edge-Perfect Graphs: some Polynomial Instances. CTW 2009: 153-156 - 2008
- [j4]Néstor E. Aguilera, Valeria A. Leoni:
Characterizations of postman sets. Discret. Math. 308(11): 2167-2174 (2008) - [j3]Néstor E. Aguilera, Valeria A. Leoni, Graciela L. Nasini:
Combinatorial flexibility problems and their computational complexity. Electron. Notes Discret. Math. 30: 303-308 (2008) - 2007
- [c1]Néstor E. Aguilera, Valeria A. Leoni, Graciela L. Nasini:
Some flexibility problmes and their complexity. CTW 2007: 5-8 - 2005
- [j2]Valeria A. Leoni, Graciela L. Nasini:
Note on: N.E. Aguilera, M.S. Escalante, G.L. Nasini, "The disjunctive procedure and blocker duality". Discret. Appl. Math. 150(1-3): 251-255 (2005) - 2004
- [j1]Néstor E. Aguilera, Valeria A. Leoni:
Characterizations of Postman Sets. Electron. Notes Discret. Math. 18: 5-10 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-05 21:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
