Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Nasini, G.
93  Ergebnisse:
Personensuche X
?
1

Lovász–Schrijver SDP-operator, near-perfect graphs and near..:

Bianchi, S. ; Escalante, M. ; Nasini, G..
Mathematical Programming.  162 (2016)  1-2 - p. 201-223 , 2016
Link: https://doi.org/10.1007/..
 
?
2

Limited Packing and Multiple Domination problems: Polynomia..:

Leoni, V. ; Nasini, G.
Discrete Applied Mathematics.  164 (2014)  - p. 547-553 , 2014
Link: https://doi.org/10.1016/..
 
?
3

The packing coloring problem for lobsters and partner limit..:

Argiroffo, G. ; Nasini, G. ; Torres, P.
Discrete Applied Mathematics.  164 (2014)  - p. 373-382 , 2014
Link: https://doi.org/10.1016/..
 
?
4

Some advances on the set covering polyhedron of circulant m..:

Bianchi, S. ; Nasini, G. ; Tolomei, P.
Discrete Applied Mathematics.  166 (2014)  - p. 59-70 , 2014
Link: https://doi.org/10.1016/..
 
?
5

Some advances on Lovász–Schrijver semidefinite programming ..:

Bianchi, S. ; Escalante, M. ; Nasini, G..
Discrete Applied Mathematics.  164 (2014)  - p. 460-469 , 2014
Link: https://doi.org/10.1016/..
 
?
6

Lovász-Schrijver SDP-operator and a superclass of near-perf..:

Bianchi, S. ; Escalante, M. ; Nasini, G..
Electronic Notes in Discrete Mathematics.  44 (2013)  - p. 339-344 , 2013
Link: https://doi.org/10.1016/..
 
?
7

A characterization of edge-perfect graphs and the complexit..:

Dobson, M.P. ; Leoni, V. ; Nasini, G.
Discrete Optimization.  10 (2013)  1 - p. 54-60 , 2013
Link: https://doi.org/10.1016/..
 
?
8

Polynomial instances of the Packing Coloring Problem:

Argiroffo, G. ; Nasini, G. ; Torres, P.
Electronic Notes in Discrete Mathematics.  37 (2011)  - p. 363-368 , 2011
Link: https://doi.org/10.1016/..
 
?
9

Polyhedral results for the Equitable Coloring Problem:

Méndez-Diaz, I. ; Nasini, G. ; Severín, D.
Electronic Notes in Discrete Mathematics.  37 (2011)  - p. 159-164 , 2011
Link: https://doi.org/10.1016/..
 
?
10

Polynomial reductions between the Limited Packing and Tuple..:

Dobson, M.P. ; Leoni, V. ; Nasini, G.
Electronic Notes in Discrete Mathematics.  37 (2011)  - p. 207-212 , 2011
Link: https://doi.org/10.1016/..
 
?
11

The multiple domination and limited packing problems in gra..:

Dobson, M.P. ; Leoni, V. ; Nasini, G.
Information Processing Letters.  111 (2011)  23-24 - p. 1108-1113 , 2011
Link: https://doi.org/10.1016/..
 
?
12

On the computational complexity of combinatorial flexibilit..:

Leoni, V. A. ; Nasini, G. L.
International Journal of Computer Mathematics.  87 (2010)  15 - p. 3330-3343 , 2010
Link: https://doi.org/10.1080/..
 
?
13

The computational complexity of the Edge-Perfect Graph and ..:

Dobson, M.P. ; Leoni, V. ; Nasini, G.
Electronic Notes in Discrete Mathematics.  36 (2010)  - p. 551-558 , 2010
Link: https://doi.org/10.1016/..
 
?
14

The set covering problem on circulant matrices: polynomial ..:

Bianchi, S. ; Nasini, G. ; Tolomei, P.
Electronic Notes in Discrete Mathematics.  36 (2010)  - p. 1185-1192 , 2010
Link: https://doi.org/10.1016/..
 
?
15

The k-limited packing and k-tuple domination problems in st..:

Dobson, M.P. ; Leoni, V. ; Nasini, G.
Electronic Notes in Discrete Mathematics.  36 (2010)  - p. 559-566 , 2010
Link: https://doi.org/10.1016/..
 
1-15