( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Where does galactic dust come from?

, , , , , , , и . (2017)cite arxiv:1707.05328Comment: 6 pages, 4 figures, submitted to MNRAS, comments are welcome.

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Giordano Paolo

Ventura Leite

Roberto Ventura

Maria Ventura

Rodolfo Ventura

 

Другие публикации лиц с тем же именем

Optimum Solution of the Closest String Problem via Rank Distance., , , и . ISCO, том 9849 из Lecture Notes in Computer Science, стр. 297-307. Springer, (2016)A compact linear program for testing optimality of perfect matchings., и . Oper. Res. Lett., 31 (3): 429-434 (2003)0/1 optimization and 0/1 primal separation are equivalent., , и . SODA, стр. 920-926. ACM/SIAM, (2002)An improved integer linear programming formulation for the closest 0-1 string problem., , и . Comput. Oper. Res., (2017)The mass-metallicity relations for gas and stars in star-forming galaxies: strong outflow vs variable IMF, , , , , , и . (2017)cite arxiv:1710.11135Comment: 25 pages, 23 figures, and 5 tables. Accepted for publication to MNRAS.A New Lower Bound for the Block Relocation Problem., , и . ICCL, том 11184 из Lecture Notes in Computer Science, стр. 168-174. Springer, (2018)The stable set polytope of claw-free graphs with stability number greater than three., , и . OR, стр. 47-52. Springer, (2011)Where does galactic dust come from?, , , , , , , и . (2017)cite arxiv:1707.05328Comment: 6 pages, 4 figures, submitted to MNRAS, comments are welcome.Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs., , , и . IPCO, том 3509 из Lecture Notes in Computer Science, стр. 291-305. Springer, (2005)The k-Gear Composition and the Stable Set Polytope., , , и . CTW, стр. 251-254. (2009)