Federico Malucelli Coauthor index DBLP Vis pubzone.org

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

DBLP keys2009
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLStefano Gualandi, Federico Malucelli: Constraint programming-based column generation. 4OR 7(2): 113-137 (2009)
2008
27no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLStefano Gualandi, Federico Malucelli: Exact Graph Coloring via Hybrid Approaches. CTW 2008: 32-34
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdoardo Amaldi, Antonio Capone, Matteo Cesana, Ilario Filippini, Federico Malucelli: Optimization models and methods for planning wireless mesh networks. Computer Networks 52(11): 2159-2171 (2008)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPietro Belotti, Antonio Capone, Giuliana Carello, Federico Malucelli: Multi-layer MPLS network design: The impact of statistical multiplexing. Computer Networks 52(6): 1291-1307 (2008)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFederico Malucelli, Stefano Pallottino, Daniele Pretolani: The stack loading and unloading problem. Discrete Applied Mathematics 156(17): 3248-3266 (2008)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdoardo Amaldi, Antonio Capone, Federico Malucelli: Radio planning and coverage optimization of 3G cellular networks. Wireless Networks 14(4): 435-447 (2008)
2007
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdoardo Amaldi, Antonio Capone, Matteo Cesana, Federico Malucelli: Optimization Models for the Radio Planning of Wireless Mesh Networks. Networking 2007: 287-298
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFederico Malucelli, Sara Nicoloso: Shiftable intervals. Annals OR 150(1): 137-157 (2007)
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPietro Belotti, Federico Malucelli, Lorenzo Brunetta: Multicommodity network design with discrete node costs. Networks 49(1): 90-99 (2007)
2006
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdoardo Amaldi, Pietro Belotti, Antonio Capone, Federico Malucelli: Optimizing base station location and configuration in UMTS networks. Annals OR 146(1): 135-151 (2006)
2005
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFederico Malucelli, Sara Nicoloso: Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings. Electronic Notes in Discrete Mathematics 22: 507-513 (2005)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTeodor Gabriel Crainic, Federico Malucelli, Maddalena Nonato, François Guertin: Meta-Heuristics for a Class of Demand-Responsive Transit Systems. INFORMS Journal on Computing 17(1): 10-24 (2005)
2004
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdoardo Amaldi, Antonio Capone, Matteo Cesana, Luigi Fratta, Federico Malucelli: Algorithms for WLAN Coverage Planning. EuroNGI Workshop 2004: 52-65
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRoberto Aringhieri, Maurizio Bruglieri, Federico Malucelli, Maddalena Nonato: An asymmetric vehicle routing problem arising in the collection and disposal of special waste. Electronic Notes in Discrete Mathematics 17: 41-47 (2004)
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPietro Belotti, Federico Malucelli: Network design with grooming constraints. Electronic Notes in Discrete Mathematics 17: 51-56 (2004)
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLorenzo Brunetta, Federico Malucelli, Peter Värbrand, Di Yuan: Joint Optical Network Design, Routing and Wavelength Assignment by Integer Programming. Telecommunication Systems 26(1): 53-67 (2004)
2003
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdoardo Amaldi, Antonio Capone, Federico Malucelli, Francesco Signori: Radio Planning and Optimization of W-CDMA Systems. PWC 2003: 437-447
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRoberto Aringhieri, Pierre Hansen, Federico Malucelli: Chemical trees enumeration algorithms. 4OR 1(1): 67-83 (2003)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRoberto Aringhieri, Federico Malucelli: Optimal Operations Management and Network Planning of a District Heating System with a Combined Heat and Power Plant. Annals OR 120(1-4): 173-199 (2003)
9Electronic 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)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdoardo Amaldi, Antonio Capone, Federico Malucelli: Discrete models and algorithms for packet scheduling in smart antennas. Electronic Notes in Discrete Mathematics 13: 1-4 (2003)
2002
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlberto Caprara, Federico Malucelli, Daniele Pretolani: On bandwidth-2 graphs. Discrete Applied Mathematics 117(1-3): 1-13 (2002)
2001
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdoardo Amaldi, Antonio Capone, Federico Malucelli: Discrete models and algorithms for the capacitated location problems arising in UMTS network planning. DIAL-M 2001: 1-8
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFederico Malucelli, Sara Nicoloso: Optimal partition of a bipartite graph into non-crossing matchings. Electronic Notes in Discrete Mathematics 10: 187-191 (2001)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRoberto Aringhieri, Pierre Hansen, Federico Malucelli: A Linear Algorithm for the Hyper-Wiener Index of Chemical Trees. Journal of Chemical Information and Computer Sciences 41(4): 958-963 (2001)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSang Nguyen, Stefano Pallottino, Federico Malucelli: A Modeling Framework for Passenger Assignment on a Transport Network with Timetables. Transportation Science 35(3): 238-249 (2001)
2000
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFederico Malucelli, Sara Nicoloso: Shiftable Intervals. Electronic Notes in Discrete Mathematics 5: 214-217 (2000)
1993
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFederico Malucelli, Thomas Ottmann, Daniele Pretolani: Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem. Discrete Applied Mathematics 47(2): 175-179 (1993)

Coauthor Index

1Edoardo Amaldi [6] [8] [12] [16] [19] [22] [23] [26]
2Roberto Aringhieri [4] [10] [11] [15]
3Pietro Belotti [14] [19] [20] [25]
4Maurizio Bruglieri [15]
5Lorenzo Brunetta [13] [20]
6Antonio Capone [6] [8] [12] [16] [19] [22] [23] [25] [26]
7Alberto Caprara [7]
8Giuliana Carello [25]
9Matteo Cesana [16] [22] [26]
10Teodor Gabriel Crainic [17]
11Mauro Dell'Amico [9]
12Ilario Filippini [26]
13Luigi Fratta [16]
14Stefano Gualandi [27] [28]
15François Guertin [17]
16Pierre Hansen [4] [11]
17Francesco Maffioli [9]
18Sang Nguyen [3]
19Sara Nicoloso [2] [5] [18] [21]
20Maddalena Nonato [15] [17]
21Thomas Ottmann [1]
22Stefano Pallottino [3] [24]
23Daniele Pretolani [1] [7] [24]
24Francesco Signori [12]
25Peter Värbrand [13]
26Di Yuan [13]

Colors in the list of coauthors

Copyright © Sat Nov 28 20:06:51 2009 by Michael Ley (ley@uni-trier.de)