Search the dblp DataBase
Paolo Dell'Olmo :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Massimiliano Caramia , Paolo Dell'Olmo A Fast and Simple Local Search for Graph Coloring. [Citation Graph (0, 0)][DBLP ] Algorithm Engineering, 1999, pp:317-330 [Conf ] Massimiliano Caramia , Paolo Dell'Olmo , Giuseppe F. Italiano New Algorithms for Examination Timetabling. [Citation Graph (0, 0)][DBLP ] Algorithm Engineering, 2000, pp:230-242 [Conf ] Paolo Dell'Olmo , Enrico Nardelli , Maurizio Talamo , Paola Vocca A Mixed-Mode Man-Machine Interface for Interactive Problem Solving. [Citation Graph (0, 0)][DBLP ] Workstations for Experiments, 1989, pp:28-39 [Conf ] Giuseppe Confessore , Paolo Dell'Olmo , Stefano Giordani Vertex Partitioning of Crown-Free Interval Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1999, pp:391-401 [Conf ] Giuseppe Confessore , Paolo Dell'Olmo , Monica Gentili Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem. [Citation Graph (0, 0)][DBLP ] Computers & OR, 2005, v:32, n:, pp:2383-2405 [Journal ] Maciej Drozdowski , Paolo Dell'Olmo Scheduling multiprocessor tasks for mean flow time criterion. [Citation Graph (0, 0)][DBLP ] Computers & OR, 2000, v:27, n:6, pp:571-585 [Journal ] Massimiliano Caramia , Paolo Dell'Olmo , Monica Gentili , Pitu B. Mirchandani Delivery itineraries and distribution capacity of a freight network with time slots. [Citation Graph (0, 0)][DBLP ] Computers & OR, 2007, v:34, n:6, pp:1585-1600 [Journal ] Paolo Dell'Olmo , Raffaele Pesenti , Maria Grazia Speranza Editorial. [Citation Graph (0, 0)][DBLP ] Computers & OR, 2007, v:34, n:6, pp:1515- [Journal ] Lucio Bianco , Jacek Blazewicz , Paolo Dell'Olmo , Maciej Drozdowski Linear Algorithms for Preemptive Scheduling of Multiprocessor Tasks Subject to Minimal Lateness. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1997, v:72, n:1-2, pp:25-46 [Journal ] Lucio Bianco , Paolo Dell'Olmo , Maria Grazia Speranza Scheduling Independent Tasks with Multiple Modes. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1995, v:62, n:1-3, pp:35-50 [Journal ] Giuseppe Confessore , Paolo Dell'Olmo , Stefano Giordani An approximation result for a periodic allocation problem. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:53-72 [Journal ] Giuseppe Confessore , Paolo Dell'Olmo , Stefano Giordani An approximation result for the interval coloring problem on claw-free chordal graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:73-90 [Journal ] Giuseppe Confessore , Paolo Dell'Olmo , Stefano Giordani Complexity and approximation results for scheduling multiprocessor tasks on a ring. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2003, v:133, n:1-3, pp:29-44 [Journal ] Paolo Dell'Olmo , Pierre Hansen , Stefano Pallottino , Giovanni Storchi On uniform k -partition problems. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2005, v:150, n:1-3, pp:121-139 [Journal ] Paolo Dell'Olmo , Maria Grazia Speranza Approximation Algorithms for Partitioning Small Items in Unequal Bins to Minimize the Total Size. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1999, v:94, n:1-3, pp:181-191 [Journal ] Paolo Dell'Olmo , Maria Grazia Speranza , Zsolt Tuza Comparability Graph Augmentation for some Multiprocessor Scheduling Problems. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1997, v:72, n:1-2, pp:71-84 [Journal ] Massimiliano Caramia , Paolo Dell'Olmo A lower bound on the chromatic number of Mycielski graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:235, n:1-3, pp:79-86 [Journal ] Massimiliano Caramia , Paolo Dell'Olmo Constraint Propagation in Graph Coloring. [Citation Graph (0, 0)][DBLP ] J. Heuristics, 2002, v:8, n:1, pp:83-107 [Journal ] Lucio Bianco , Jacek Blazewicz , Paolo Dell'Olmo , Maciej Drozdowski Preemptive Scheduling of Multiprocessor Tasks on the Dedicated Processor System Subject to Minimal Lateness. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1993, v:46, n:3, pp:109-113 [Journal ] Jacek Blazewicz , Paolo Dell'Olmo , Maciej Drozdowski , Maria Grazia Speranza Scheduling Multiprocessor Tasks on Three Dedicated Processors. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1992, v:41, n:5, pp:275-280 [Journal ] Jacek Blazewicz , Paolo Dell'Olmo , Maciej Drozdowski , Maria Grazia Speranza Corrigendum: Scheduling Multiprocessor Tasks on Three Dedicated Processors. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1994, v:49, n:5, pp:269-270 [Journal ] Paolo Dell'Olmo , Stefano Giordani , Maria Grazia Speranza An Approximation Result for a Duo-Processor Task Scheduling Problem. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1997, v:61, n:4, pp:195-200 [Journal ] Paolo Dell'Olmo , Hans Kellerer , Maria Grazia Speranza , Zsolt Tuza A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:65, n:5, pp:229-233 [Journal ] Moshe Dror , Wieslaw Kubiak , Paolo Dell'Olmo Scheduling Chains to Minimize Mean Flow Time. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1997, v:61, n:6, pp:297-301 [Journal ] Massimiliano Caramia , Paolo Dell'Olmo , Giuseppe F. Italiano CHECKCOL: Improved local search for graph coloring. [Citation Graph (0, 0)][DBLP ] J. Discrete Algorithms, 2006, v:4, n:2, pp:277-298 [Journal ] Massimiliano Caramia , Paolo Dell'Olmo Solving the minimum-weighted coloring problem. [Citation Graph (0, 0)][DBLP ] Networks, 2001, v:38, n:2, pp:88-101 [Journal ] Massimiliano Caramia , Paolo Dell'Olmo Bounding vertex coloring by truncated multistage branch and bound. [Citation Graph (0, 0)][DBLP ] Networks, 2004, v:44, n:4, pp:231-242 [Journal ] Lucio Bianco , Jacek Blazewicz , Paolo Dell'Olmo , Maciej Drozdowski Scheduling Preemptive Multiprocessor Tasks on Dedicated Processors. [Citation Graph (0, 0)][DBLP ] Perform. Eval., 1994, v:20, n:4, pp:361-371 [Journal ] Lucio Bianco , Paolo Dell'Olmo , Stefano Giordani Scheduling models for air traffic control in terminal areas. [Citation Graph (0, 0)][DBLP ] J. Scheduling, 2006, v:9, n:3, pp:223-253 [Journal ] Paolo Dell'Olmo , Monica Gentili , Andrea Scozzari On finding dissimilar Pareto-optimal paths. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2005, v:162, n:1, pp:70-82 [Journal ] Paolo Dell'Olmo , Guglielmo Lulli A new hierarchical architecture for Air Traffic Management: Optimisation of airway capacity in a Free Flight scenario. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2003, v:144, n:1, pp:179-193 [Journal ] Jacek Blazewicz , Paolo Dell'Olmo , Maciej Drozdowski , Przemyslaw Maczka Scheduling multiprocessor tasks on parallel processors with limited availability. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2003, v:149, n:2, pp:377-389 [Journal ] Paolo Dell'Olmo , Maria Grazia Speranza , Zsolt Tuza Efficiency and effectiveness of normal schedules on three dedicated processors. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1997, v:164, n:1-3, pp:67-79 [Journal ] Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates. [Citation Graph (, )][DBLP ] Coloring graphs by iterated local search traversing feasible and infeasible solutions. [Citation Graph (, )][DBLP ] Search in 0.004secs, Finished in 0.007secs