default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMariana S. Escalante
Person information
- affiliation: National University of Rosario, FCEIA, Rosario, Argentina
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c4]Diego Delle Donne, Mariana S. Escalante, Pablo G. Fekete, Lucía Moroni:
1-Persistency of the Clique Relaxation of the Stable Set Polytope. ISCO 2024: 71-84- [c3]Diego Delle Donne, Mariana S. Escalante, María Elisa Ugarte:
On the Complexity of the Minimum Chromatic Violation Problem. ISCO 2024: 152-162 - 2023
- [j30]Silvia M. Bianchi, Mariana S. Escalante
, Graciela L. Nasini, Annegret Katrin Wagler:
Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs. Discret. Appl. Math. 332: 70-86 (2023) - 2020
- [j29]Mónica Braga, Diego Delle Donne, Mariana S. Escalante, Javier Marenco, María Elisa Ugarte, María del Carmen Varaldo:
The minimum chromatic violation problem: A polyhedral approach. Discret. Appl. Math. 281: 69-80 (2020)
2010 – 2019
- 2018
- [i2]Mariana S. Escalante, Erica G. Hinrichsen, Valeria Leoni:
Packing functions and graphs with perfect closed neighbourhood matrices. CoRR abs/1812.09422 (2018) - 2017
- [j28]Mónica Braga, Diego Delle Donne, Mariana S. Escalante, Javier Marenco, María Elisa Ugarte, María del Carmen Varaldo:
The minimum chromatic violation problem: a polyhedral study. Electron. Notes Discret. Math. 62: 309-314 (2017) - [j27]Mariana S. Escalante, Graciela L. Nasini, Annegret Wagler:
Characterizing N+-perfect line graphs. Int. Trans. Oper. Res. 24(1-2): 325-337 (2017) - [j26]Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel:
Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs. Math. Program. 162(1-2): 201-223 (2017) - 2016
- [j25]Silvia M. Bianchi, Mariana S. Escalante, M. S. Montelar:
Lift-and-project ranks of the stable set polytope of joined a-perfect graphs. Discret. Appl. Math. 210: 176-184 (2016) - [c2]Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Annegret Wagler:
Lovász-Schrijver PSD-Operator on Claw-Free Graphs. ISCO 2016: 59-70 - 2015
- [j24]Mariana S. Escalante, Javier Marenco, María del Carmen Varaldo:
The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity. Ann. Oper. Res. 235(1): 233-258 (2015) - 2014
- [j23]Néstor E. Aguilera, Mariana S. Escalante, Pablo G. Fekete:
On the facets of lift-and-project relaxations under graph operations. Discret. Appl. Math. 164: 360-372 (2014) - [j22]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. Discret. Appl. Math. 164: 460-469 (2014) - [c1]Mariana S. Escalante, Graciela L. Nasini:
Lovász and Schrijver N_+ -Relaxation on Web Graphs. ISCO 2014: 221-229 - [i1]Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel:
Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs. CoRR abs/1411.2069 (2014) - 2013
- [j21]Gabriela R. Argiroffo, Mariana S. Escalante, María Elisa Ugarte:
The 2-dominating set polytope of cycles and related graph classes. Electron. Notes Discret. Math. 44: 269-274 (2013) - [j20]Silvia M. Bianchi, Mariana S. Escalante, M. Susana Montelar:
A note on the disjunctive index of joined a-perfect graphs. Electron. Notes Discret. Math. 44: 327-332 (2013) - [j19]Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel:
Lovász-Schrijver SDP-operator and a superclass of near-perfect graphs. Electron. Notes Discret. Math. 44: 339-344 (2013) - 2012
- [j18]Silvia M. Bianchi, Mariana S. Escalante, M. Susana Montelar:
Lift-and-project ranks of the set covering polytope of circulant matrices. Discret. Appl. Math. 160(18): 2555-2562 (2012) - 2011
- [j17]Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini:
On the behavior of the N+-operator under blocker duality. Discret. Appl. Math. 159(5): 396-399 (2011) - [j16]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. Electron. Notes Discret. Math. 37: 189-194 (2011) - [j15]Néstor E. Aguilera, Mariana S. Escalante, Pablo G. Fekete:
On the facets of the lift-and-project relaxations of graph subdivisions. Electron. Notes Discret. Math. 37: 201-206 (2011) - [j14]Mariana S. Escalante, Javier L. Marenco, María del Carmen Varaldo:
A polyhedral study of the single-item lot-sizing problem with continuous start-up costs. Electron. Notes Discret. Math. 37: 261-266 (2011) - [j13]Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel:
Near-perfect graphs with polyhedral N+(G). Electron. Notes Discret. Math. 37: 393-398 (2011) - 2010
- [j12]Néstor E. Aguilera, Mariana S. Escalante:
A polyhedral approach to the stability of a family of coalitions. Discret. Appl. Math. 158(5): 379-396 (2010) - [j11]Silvia M. Bianchi, M. S. Montelar, Mariana S. Escalante:
A comparison between lift-and-project indices and imperfection ratio on web graphs. Electron. Notes Discret. Math. 36: 1081-1088 (2010) - [j10]Gabriela R. Argiroffo, María Elisa Ugarte, Mariana S. Escalante:
On the k-dominating set polytope of web graphs. Electron. Notes Discret. Math. 36: 1161-1168 (2010) - [j9]Néstor E. Aguilera, Silvia C. Di Marco, Mariana S. Escalante:
The Shapley value for arbitrary families of coalitions. Eur. J. Oper. Res. 204(1): 125-138 (2010)
2000 – 2009
- 2009
- [j8]Silvia M. Bianchi, M. S. Montelar, Mariana S. Escalante:
Strength of facets for the set covering and set packing polyhedra on circulant matrices. Electron. Notes Discret. Math. 35: 109-114 (2009) - 2006
- [j7]Mariana S. Escalante, Graciela L. Nasini, María del Carmen Varaldo:
On the commutativity of antiblocker diagrams under lift-and-project operators. Discret. Appl. Math. 154(13): 1845-1853 (2006) - [j6]Mariana S. Escalante, M. S. Montelar, Graciela L. Nasini:
Minimal N+-rank graphs: Progress on Lipták and Tunçel's conjecture. Oper. Res. Lett. 34(6): 639-646 (2006) - 2004
- [j5]Mariana S. Escalante, M. S. Montelar, Graciela L. Nasini:
On minimal N+- rank graphs. Electron. Notes Discret. Math. 18: 109-114 (2004) - [j4]Mariana S. Escalante, Graciela L. Nasini, María del Carmen Varaldo:
Note on Lift-and-Project Ranks and Antiblocker Duality. Electron. Notes Discret. Math. 18: 115-119 (2004) - 2002
- [j3]Néstor E. Aguilera, Mariana S. Escalante, Graciela L. Nasini:
The disjunctive procedure and blocker duality. Discret. Appl. Math. 121(1-3): 1-13 (2002) - [j2]Néstor E. Aguilera, Mariana S. Escalante, Graciela L. Nasini:
A Generalization of the Perfect Graph Theorem Under the Disjunctive Index. Math. Oper. Res. 27(3): 460-469 (2002)
1990 – 1999
- 1999
- [j1]Alain Jean-Marie, Mabel Tidball, Mariana S. Escalante, Valeria Leoni, Hector Ponce de León:
On the Influence of Resequencing on the Regularity of Service. Perform. Evaluation 36-37(1-4): 115-135 (1999)
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 20:44 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:
