( en | de | ru )

 

Disambiguation of "Maffioli, Francesco"

Author of the publication

copydeleteadd this publication to your clipboard
A particular class of graphic matroids.

, and . Electron. Notes Discret. Math., (2004)

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. You can also use the button next to the name to display some publications already assigned to the person.

Francesco Bettella

Protein secondary structure prediction using optimized scoring functions: a comparative statistical method. FU Berlin, (2009)

Francesco Pinosa

Francesco Solimena

Francesco Borgosano

Francesco Falvo

 

Other publications of authors with the same name

Random Pseudo-Polynomial Algorithms for Exact Matroid Problems., , and . J. Algorithms, 13 (2): 258-273 (1992)The k best spanning arborescences of a network., , and . Networks, 10 (2): 91-109 (1980)Approximability of hard combinatorial optimization problems: an introduction., and . Ann. Oper. Res., 96 (1-4): 221-236 (2000)A tree partitioning dynamic policy for OVSF codes assignment in wideband CDMA., , and . IEEE Trans. Wirel. Commun., 3 (4): 1013-1017 (2004)Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases., , , and . WEA, volume 3059 of Lecture Notes in Computer Science, page 14-29. Springer, (2004)On Minimum Changeover Cost Arborescences., , and . SEA, volume 6630 of Lecture Notes in Computer Science, page 112-123. Springer, (2011)On the complexity of finding multi-constrained spanning trees., , and . Discret. Appl. Math., 5 (1): 39-50 (1983)Minimum cut bases in undirected networks., , , and . Discret. Appl. Math., 158 (4): 277-290 (2010)Preface., and . Discret. Appl. Math., 42 (2): 119 (1993)On the Approximability of some Maximum Spanning Tree Problems., , and . LATIN, volume 911 of Lecture Notes in Computer Science, page 300-310. Springer, (1995)