Monaldo Mastrolilli

	2009
39		Monaldo Mastrolilli, Ola Svensson: Improved Bounds for Flow Shop Scheduling. ICALP (1) 2009: 677-688
38		Christoph Ambühl, Monaldo Mastrolilli: Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem. Algorithmica 53(4): 488-503 (2009)
	2008
37		Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson: Approximating Single Machine Scheduling with Scenarios. APPROX-RANDOM 2008: 153-164
36		Monaldo Mastrolilli, Ola Svensson: (Acyclic) JobShops are Hard to Approximate. FOCS 2008: 583-592
35		Christian Blum, Carlos Cotta, Antonio J. Fernández, José E. Gallardo, Monaldo Mastrolilli: Hybridizations of Metaheuristics With Branch & Bound Derivates. Hybrid Metaheuristics 2008: 85-116
34		Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli: Grouping Techniques for Scheduling Problems: Simpler and Faster. Algorithmica 51(2): 183-199 (2008)
	2007
33		Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson: Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling. FOCS 2007: 329-337
32		Christian Blum, Monaldo Mastrolilli: Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge. Hybrid Metaheuristics 2007: 123-139
31		Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson: Scheduling with Precedence Constraints of Low Fractional Dimension. IPCO 2007: 130-144
30		Roberto Montemanni, J. Barta, Monaldo Mastrolilli, Luca Maria Gambardella: The Robust Traveling Salesman Problem with Interval Data. Transportation Science 41(3): 366-381 (2007)
	2006
29		Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson: Approximating Precedence-Constrained Single Machine Scheduling by Coloring. APPROX-RANDOM 2006: 15-26
28		Christoph Ambühl, Monaldo Mastrolilli: Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem. ESA 2006: 28-39
27		Monaldo Mastrolilli, Marcus Hutter: Hybrid rounding techniques for knapsack problems. Discrete Applied Mathematics 154(4): 640-649 (2006)
26		Monaldo Mastrolilli: A linear time approximation scheme for the single machine scheduling problem with controllable processing times. J. Algorithms 59(1): 37-52 (2006)
	2005
25		Monaldo Mastrolilli, Leonora Bianchi: Core instances for testing: A case study. European Journal of Operational Research 166(1): 51-62 (2005)
24		Monaldo Mastrolilli, Luca Maria Gambardella: Maximum satisfiability: How good are tabu search and plateau moves in the worst-case? European Journal of Operational Research 166(1): 63-76 (2005)
23		Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba: Approximation schemes for job shop scheduling problems with controllable processing times. European Journal of Operational Research 167(2): 297-319 (2005)
22		Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba: Approximation algorithms for flexible job shop problems. Int. J. Found. Comput. Sci. 16(2): 361-379 (2005)
21		Christoph Ambühl, Monaldo Mastrolilli: On-line scheduling to minimize max flow time: an optimal preemptive algorithm. Oper. Res. Lett. 33(6): 597-602 (2005)
	2004
20		Monaldo Mastrolilli, Luca Maria Gambardella: MAX-2-SAT: How Good Is Tabu Search in the Worst-Case? AAAI 2004: 173-178
19		Leonora Bianchi, Mauro Birattari, Marco Chiarandini, Max Manfrin, Monaldo Mastrolilli, Luis Paquete, Olivia Rossi-Doria, Tommaso Schiavinotto: Applications Metaheuristics for the Vehicle Routing Problem with Stochastic Demands. PPSN 2004: 450-460
18		Klaus Jansen, Monaldo Mastrolilli: Approximation schemes for parallel machine scheduling problems with controllable processing times. Computers & OR 31(10): 1565-1581 (2004)
17		Monaldo Mastrolilli: Scheduling To Minimize Max Flow Time: Off-Line And On-Line Algorithms. Int. J. Found. Comput. Sci. 15(2): 385-401 (2004)
	2003
16		Klaus Jansen, Marian Margraf, Monaldo Mastrolilli, José D. P. Rolim: Experimental and Efficient Algorithms, Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings Springer 2003
15		Monaldo Mastrolilli: Scheduling to Minimize Max Flow Time: Offline and Online Algorithms. FCT 2003: 49-60
14		Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli: On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates. ISAAC 2003: 319-328
13		Monaldo Mastrolilli, Leonora Bianchi: Core Instances for Testing: A Case Study. WEA 2003: 209-221
12		Monaldo Mastrolilli, Marcus Hutter: Hybrid Rounding Techniques for Knapsack Problems CoRR cs.CC/0305002: (2003)
11		Monaldo Mastrolilli: Notes on Max Flow Time Minimization with Controllable Processing Times. Computing 71(4): 375-386 (2003)
10		Monaldo Mastrolilli: Efficient Approximation Schemes for Scheduling Problems with Release Dates and Delivery Times. J. Scheduling 6(6): 521-531 (2003)
	2002
9		Olivia Rossi-Doria, Michael Sampels, Mauro Birattari, Marco Chiarandini, Marco Dorigo, Luca Maria Gambardella, Joshua D. Knowles, Max Manfrin, Monaldo Mastrolilli, Ben Paechter, Luis Paquete, Thomas Stützle: A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem. PATAT 2002: 329-354
8		Michael Sampels, Christian Blum, Monaldo Mastrolilli, Olivia Rossi-Doria: Metaheuristics for Group Shop Scheduling. PPSN 2002: 631-640
7		Monaldo Mastrolilli: A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times. SWAT 2002: 51-59
	2001
6		Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli: Grouping Techniques for Scheduling Problems: Simpler and Faster. ESA 2001: 206-217
5		Monaldo Mastrolilli: Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems. FCT 2001: 525-534
4		Monaldo Mastrolilli: Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints. FSTTCS 2001: 268-279
3		Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba: Job Shop Scheduling Problems with Controllable Processing Times. ICTCS 2001: 107-122
	2000
2		Klaus Jansen, Monaldo Mastrolilli: Parallel Machine Scheduling Problems with Controllable Processing Times. ICALP Satellite Workshops 2000: 179-190
1		Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba: Approximation Algorithms for Flexible Job Shop Problems. LATIN 2000: 68-77

Coauthor Index

1	Christoph Ambühl	[21] [28] [29] [31] [33] [38]
2	J. Barta	[30]
3	Leonora Bianchi	[13] [19] [25]
4	Mauro Birattari	[9] [19]
5	Christian Blum	[8] [32] [35]
6	Marco Chiarandini	[9] [19]
7	Carlos Cotta	[35]
8	Marco Dorigo	[9]
9	Antonio J. Fernández (Antonio José Fernández Leiva)	[35]
10	Aleksei V. Fishkin	[6] [14] [34]
11	José E. Gallardo	[35]
12	Luca Maria Gambardella	[9] [20] [24] [30]
13	Marcus Hutter	[12] [27]
14	Klaus Jansen	[1] [2] [3] [6] [14] [16] [18] [22] [23] [34]
15	Joshua D. Knowles	[9]
16	Max Manfrin	[9] [19]
17	Marian Margraf	[16]
18	Roberto Montemanni	[30]
19	Nikolaus Mutsanas	[31] [37]
20	Ben Paechter	[9]
21	Luis Paquete	[9] [19]
22	José D. P. Rolim	[16]
23	Olivia Rossi-Doria	[8] [9] [19]
24	Michael Sampels	[8] [9]
25	Tommaso Schiavinotto	[19]
26	Roberto Solis-Oba	[1] [3] [22] [23]
27	Thomas Stützle	[9]
28	Ola Svensson	[29] [31] [33] [36] [37] [39]

Colors in the list of coauthors