dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Francesco Maffioli Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2011
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGiulia Galbiati, Stefano Gualandi, Francesco Maffioli: On Minimum Changeover Cost Arborescences. SEA 2011: 112-123
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdoardo Amaldi, Giulia Galbiati, Francesco Maffioli: On minimum reload cost paths, tours, and flows. Networks 57(3): 254-260 (2011)
2010
51no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLStefano Gualandi, Francesco Maffioli, Claudio Magni: A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem. CTW 2010: 69-72
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFlorentine Bunke, Horst W. Hamacher, Francesco Maffioli, Anne M. Schwahn: Minimum cut bases in undirected networks. Discrete Applied Mathematics 158(4): 277-290 (2010)
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGiulia Galbiati, Stefano Gualandi, Francesco Maffioli: On Minimum Reload Cost Cycle Cover. Electronic Notes in Discrete Mathematics 36: 81-88 (2010)
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGiulia Galbiati, Stefano Gualandi, Francesco Maffioli: Computational experience with a SDP-based algorithm for maximum cut with limited unbalance. Networks 55(3): 247-255 (2010)
2008
47no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdoardo Amaldi, Giulia Galbiati, Francesco Maffioli: On minimum reload cost paths, tours and flows. CTW 2008: 112-115
2007
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPietro Belotti, Martine Labbé, Francesco Maffioli, Malick M. Ndiaye: A branch-and-cut method for the obnoxious p -median problem. 4OR 5(4): 299-314 (2007)
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrancesco Maffioli, Romeo Rizzi, Stefano Benati: Least and most colored bases. Discrete Applied Mathematics 155(15): 1958-1970 (2007)
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGiulia Galbiati, Francesco Maffioli: Approximation algorithms for maximum cut with limited unbalance. Theor. Comput. Sci. 385(1-3): 78-87 (2007)
2006
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGiulia Galbiati, Francesco Maffioli: Approximating Maximum Cut with Limited Unbalance. WAOA 2006: 202-213
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaurizio Bruglieri, Matthias Ehrgott, Horst W. Hamacher, Francesco Maffioli: An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints. Discrete Applied Mathematics 154(9): 1344-1357 (2006)
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrancesco Maffioli, Norma Zagaglia Salvi: On some properties of base-matroids. Discrete Applied Mathematics 154(9): 1401-1407 (2006)
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLUlrich Faigle, Leo Liberti, Francesco Maffioli, Stefan Pickl: Graphs and combinatorial optimization. Discrete Optimization 3(3): 179 (2006)
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGiulia Galbiati, Francesco Maffioli: Approximating Max Cut with Limited Unbalance. Electronic Notes in Discrete Mathematics 25: 101-104 (2006)
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaurizio Bruglieri, Francesco Maffioli, Marco Trubian: Solving minimum K-cardinality cut problems in planar graphs. Networks 48(4): 195-208 (2006)
2005
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrancesco Maffioli: In: Alexander Schrijver, Editors, Combinatorial Optimization-Polyhedra and Efficiency or All You Wanted to Know about Polyhedral Combinatorics and Never Dared to Ask. European Journal of Operational Research 163(1): 284-286 (2005)
2004
36no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLeo Liberti, Francesco Maffioli: CTW04 Workshop on Graphs and Combinatorial Optimization, Scientific Program, Villa Vigoni, Menaggio (CO), Italy, 31st May to 2nd June 2004 CTW 2004
35no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrancesco Maffioli, Norma Zagaglia Salvi: A Particular Class of Graphic Matroids. CTW 2004: 192-195
34no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdoardo Amaldi, Leo Liberti, Francesco Maffioli: Algorithms for Finding Minimum Fundamental Cycle Bases in Graphs. CTW 2004: 33-36
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdoardo Amaldi, Leo Liberti, Nelson Maculan, Francesco Maffioli: Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases. WEA 2004: 14-29
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRoberto Cordone, Francesco Maffioli: On the complexity of graph tree partition problems. Discrete Applied Mathematics 134(1-3): 51-65 (2004)
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaurizio Bruglieri, Francesco Maffioli, Matthias Ehrgott: Cardinality constrained minimum cut problems: complexity and algorithms. Discrete Applied Mathematics 137(3): 311-341 (2004)
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLeo Liberti, Francesco Maffioli: Preface. Electronic Notes in Discrete Mathematics 17: 1 (2004)
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrancesco Maffioli, Norma Zagaglia Salvi: A particular class of graphic matroids. Electronic Notes in Discrete Mathematics 17: 219-222 (2004)
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdoardo Amaldi, Leo Liberti, Francesco Maffioli, Nelson Maculan: Algorithms for finding minimum fundamental cycle bases in graphs. Electronic Notes in Discrete Mathematics 17: 29-33 (2004)
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMauro Dell'Amico, Francesco Maffioli, Maria Luisa Merani: A tree partitioning dynamic policy for OVSF codes assignment in wideband CDMA. IEEE Transactions on Wireless Communications 3(4): 1013-1017 (2004)
2003
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrancesco Maffioli: The vehicle routing problem: A book review. 4OR 1(2): 149-153 (2003)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMauro Dell'Amico, Francesco Maffioli, Federico Malucelli: The Base-matroid and Inverse Combinatorial Optimization Problems. Discrete Applied Mathematics 128(2-3): 337-353 (2003)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPaola Cappanera, Giorgio Gallo, Francesco Maffioli: Discrete facility location and routing of obnoxious activities. Discrete Applied Mathematics 133(1-3): 3-28 (2003)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrancesco Maffioli, Norma Zagaglia Salvi: On Some Properties of Base-matroids. Electronic Notes in Discrete Mathematics 13: 69-70 (2003)
2001
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRoberto Cordone, Francesco Maffioli: Coloured Ant System and Local Search to Design Local Telecommunication Networks. EvoWorkshops 2001: 60-69
2000
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLorenzo Brunetta, Francesco Maffioli, Marco Trubian: Solving the feedback vertex set problem on undirected graphs. Discrete Applied Mathematics 101(1-3): 37-51 (2000)
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMauro Dell'Amico, Francesco Maffioli: Combining Linear and Non-Linear Objectives in Spanning Tree Problems. J. Comb. Optim. 4(2): 253-269 (2000)
1999
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGiulia Galbiati, Francesco Maffioli, Carlo Viola: Randomized Algorithms over Finite Fields for the Exact Parity Base Problem. J. Complexity 15(4): 537-556 (1999)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMauro Dell'Amico, Andrea Lodi, Francesco Maffioli: Solution of the Cumulative Assignment Problem With a Well-Structured Tabu Search Method. J. Heuristics 5(2): 123-143 (1999)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMauro Dell'Amico, Martine Labbé, Francesco Maffioli: Exact solution of the SONET Ring Loading Problem. Oper. Res. Lett. 25(3): 119-129 (1999)
1998
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMauro Dell'Amico, Francesco Maffioli, Marco Trubian: New bounds for optimum traffic assignment in satellite communication. Computers & OR 25(9): 729-743 (1998)
1997
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGiulia Galbiati, Angelo Morzenti, Francesco Maffioli: On the Approximability of Some Maximum Spanning Tree Problems. Theor. Comput. Sci. 181(1): 107-118 (1997)
1996
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMauro Dell'Amico, Francesco Maffioli: on Some Multicriteria Arborescence Problems: Complexity and Algorithms. Discrete Applied Mathematics 65(1-3): 191-206 (1996)
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMauro Dell'Amico, Martine Labbé, Francesco Maffioli: Complexity of spanning tree problems with leaf-dependent objectives. Networks 27(3): 175-181 (1996)
1995
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGiulia Galbiati, Angelo Morzenti, Francesco Maffioli: On the Approximability of some Maximum Spanning Tree Problems. LATIN 1995: 300-310
1994
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGiulia Galbiati, Francesco Maffioli: on the Computation of Pfaffians. Discrete Applied Mathematics 51(3): 269-275 (1994)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGiulia Galbiati, Francesco Maffioli, Angelo Morzenti: A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem. Inf. Process. Lett. 52(1): 45-49 (1994)
1993
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGiulia Galbiati, Francesco Maffioli: Preface. Discrete Applied Mathematics 42(2): 119 (1993)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrancesco Maffioli: In Memoriam Paolo M. Camerini. Discrete Applied Mathematics 42(2): 121-122 (1993)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSung-Jin Chung, Horst W. Hamacher, Francesco Maffioli, Katta G. Murty: Note on Combinatorial Optimization with Max-Linear Objective Functions. Discrete Applied Mathematics 42(2): 139-145 (1993)
1992
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPaolo M. Camerini, Giulia Galbiati, Francesco Maffioli: Random Pseudo-Polynomial Algorithms for Exact Matroid Problems. J. Algorithms 13(2): 258-273 (1992)
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGiulia Galbiati, Francesco Maffioli: Constructing an Exact Parity Base Is in RNC2. Parallel Processing Letters 2: 301-309 (1992)
1990
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPaolo M. Camerini, Giulia Galbiati, Francesco Maffioli: Modular Arithmetic and Randomization for Exact Matroid Problems. IPCO 1990: 101-113
1975
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrancesco Maffioli: Subgradient Optimization, Matroid Problems and Heuristic Evaluation. Optimization Techniques 1975: 389-396
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPaolo M. Camerini, Francesco Maffioli: Bounds for 3-Matroid Intersection Problems. Inf. Process. Lett. 3(3): 81-83 (1975)
1973
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrancesco Maffioli: On Constrained Diameter and Medium Optimal Spanning Trees. Optimization Techniques 1973: 110-117

Coauthor Index

1Edoardo Amaldi [28] [33] [34] [47] [52]
2Pietro Belotti [46]
3Stefano Benati [45]
4Maurizio Bruglieri [31] [38] [42]
5Lorenzo Brunetta [21]
6Florentine Bunke [50]
7Paolo M. Camerini [2] [4] [6]
8Paola Cappanera [24]
9Sung-Jin Chung [7]
10Roberto Cordone [22] [32]
11Mauro Dell'Amico [13] [14] [16] [17] [18] [20] [25] [27]
12Matthias Ehrgott [31] [42]
13Ulrich Faigle [40]
14Giulia Galbiati [4] [5] [6] [9] [10] [11] [12] [15] [19] [39] [43] [44] [47] [48] [49] [52] [53]
15Giorgio Gallo [24]
16Stefano Gualandi [48] [49] [51] [53]
17Horst W. Hamacher [7] [42] [50]
18Martine Labbé [13] [17] [46]
19Leo Liberti [28] [30] [33] [34] [36] [40]
20Andrea Lodi [18]
21Nelson Maculan [28] [33]
22Claudio Magni [51]
23Federico Malucelli [25]
24Maria Luisa Merani [27]
25Angelo Morzenti [10] [12] [15]
26Katta G. Murty [7]
27Malick M. Ndiaye [46]
28Stefan Pickl (Stefan Wolfgang Pickl) [40]
29Romeo Rizzi [45]
30Norma Zagaglia Salvi [23] [29] [35] [41]
31Anne M. Schwahn [50]
32Marco Trubian [16] [21] [38]
33Carlo Viola [19]

Colors in the list of coauthors

Last update Sat Feb 11 22:55:45 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page