Gianpaolo Oriolo Curriculum vitae et studiorum Università di Roma Tor Vergata, Facoltà di Ingegneria Dipartimento di Ingegneria Civile ed Ingegneria Informatica (Dept. of Civil Engineering and Computer Science) via del Politecnico, 1, 00133 - Roma, Italia tel: +39 06 7259 7797, fax: +39 06 7259 7305 oriolo@disp.uniroma2.it; http://www.disp.uniroma2.it/users/oriolo/ Current Position I am Full Professor of Operations Research. I am currently at the Engineer Faculty of Università di Roma Tor Vergata, where I m teaching Operations Research and Game Theory and Network Design. Research Topics My main area research is that of Combinatorial Otpimization. I am particurarly interested in: 1) Network Design problems, with a particular emphasis on issues of resiliency and robustness; 2) Polyhedral Combinatorics, with a focus on the independent set problem, from both the polyhedral and the algorithmic point of view. Education Bell Laboratories Postdoc (supervisor: Bruce Shepherd), Fundamental Mathematics Department Murray Hill, NJ, Stati Uniti Università di Roma La Sapienza Ph.D. in Operations Research (supervisor: Antonio Sassano) Università di Roma La Sapienza Degree in Electrical Engineering Temporary Positions Technischen Universität April-July 2012 Berlin, Germany Visiting Professor at: Combinatorial Optimization & Graph Algorithms group Univesidad de Buenos Aires April 2011 Buenos Aires, Argentina Visiting Professor at: Dep. de Computación Facultad de Ciencias Exactas y Nat. Université de Bordeaux June 2010 Bordeaux, France Visiting Professor at: Mathematics Institute of Bordeaux 1
Mc Gill University November 2008 Montreal, Canada Visiting Professor at: Discrete Math and Optimization Group Université de la Méditerranée June 2007 Marseille, France Visiting Professor at: Laboratoire d Informatique Fondamentale Bell Laboratories September 2005 Murray Hill, NJ, USA Visiting Professor at: Fundamental Mathematics Department Université de la Méditerranée June 2005 Marseille, France Visiting Professor at: Laboratoire d Informatique Fondamentale Blaise-Pascal Université May 2005 Clermont Ferrand, France Visiting Professor at: ISIMA Max-Planck-Institut fur Informatik July - August 2004 Saarbrucken, Germany Visiting Researcher at: Discrete Optimization Group Konrad-Zuse-Zentrum fur Informationstechnik - ZIB May 2004 Berlin, Germany Visiting Researcher at: Discrete Optimization Group University of Minnesota - IMA April 2003 Minneapolis, MN, Stati Uniti Visiting Researcher at: Insitute for Mathematics and its Applications Ecole Polytechnique Fédérale de Lausanne July 2002 Lausanne, Suisse Visiting Researcher at: Operations Research Group (ROSO) London School of Economics February - July 1999 London, England Visiting Researcher at: Center for Discrete and Applicable Mathematics Università di Roma Tor Vergata, Engineer Faculty since November 1997 Roma, Italy Assistant Professor (1997-04) and then Professor in Operations Research. Editorial Activity Area editor (Graphs and Networks), Operations Research Letters since 2009 Associate editor, Operations Research Letters 2006-2008 2
Research Projects Principal Investigator of the PRIN Project 2012-2014 Ottimizzazione Nonlineare Mista-Intera: Approcci e Applicazioni. The project is funded by the Italian Ministry for Education (MIUR) and deals with the design of advanced algorithms and approaches for the solution of non-linear mixed integer optimization problems. Chair of the project Sviluppo di efficienti soluzioni di ingegnerizzazione del traffico in un contesto basato su protocollo IP. The project is funded by Ericsson Labs Italy and deals with routing, protection and restoration problems for (robust) optical networks. It started in 2002 and has so far been renewed every year. Principal Investigator of the PRIN Project 2009-2011 Programmazione semidefinita e altre tecniche non lineari per problemi di ottimizzazione discreta. The project is funded by the Italian Ministry for Education (MIUR) and deals with the use of advanced non-linear techniques, such as semidefinite programming, for the solution of combinatorial optimization problems. Principal Investigator of the PRIN Project 2006-2008 Modelli ed algoritmi per l ottimizzazione robusta delle reti. The project was funded by the Italian Ministry for Education (MIUR) and it deals with the design of models and algorithms for robust network design. Selected Ph.D. Students Marco Senatore 2010-14 Gianmaria Leo 2009-13 Claudia Snels 2008-12 Yuri Faenza 2006-10 Laura Sanità 2005-09 Ugo Pietropaoli 2004-08 Patents G. Bottari, P. Iovanna, G. Oriolo, Routing thorugh network having optical and electrical layers, filed at the European Patent Office on 12/1/2010, ref. P30289. P. Iovanna, G. Oriolo, R. Sabella, L. Sanità, Communication network, Pub. No.: WO/2009/106153; International Application No.: PCT/EP2008/059528. 3
P. Iovanna, G. Oriolo, R. Sabella, P. Tou, Dynamic routing in packet switching multilayer communication networks, Pub. No.: WO/2004/002078; International Application No.: PCT/EP2002/005518. Selected Publications Journals or Conferences with a peer review process Faenza Y., Oriolo G., Stauffer G. Solving the maximum weighted stable set problem in claw-free graphs via decomposition, Journal of the ACM, vol. 61, no.4 pp. 1-41 (2014). Adjiashvili D., Oriolo G., Senatore M., The Online Replacement Path Problem, Proceedings of ESA 2013, pp 1 12 (2013). Oriolo G., Sanità L., Zenklusen R. Network Design with a Discrete Set of Traffic Matrices, Operation Research Letters, vol. 41, no.4 pp. 390-396 (2013). Bonomo F., Oriolo G., Snels C., Stauffer G., Minimum clique cover in claw-free perfect graphs and the weak Edmonds-Johnson property, Proceedings of IPCO 2013, pp 86 97 (2013). Bonomo F., Oriolo G., Snels C., Minimum weighted clique cover on strip-composed perfect graphs, Proceedings of WG 2012, LNCS, vol. 7551, pp 22 33 (2012). Bonomo F., Faenza Y., Oriolo G., On coloring problems with local constraints, Discrete Mathematics, vol 312, (2012), pp 2027-2039. Oriolo G., Pietropaoli U., Stauffer G., On the Recognition of Fuzzy Circular Interval Graphs, Discrete Mathematics, vol 312, (2012), pp 1426-1435. Faenza Y., Oriolo G., Stauffer G. Separating stable sets in claw-free graphs via Padberg- Rao and compact linear programs, Proceedings of SODA 2012 pp1298-1308. Bonomo F., Mattia S., Oriolo G. Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem, Theoretical Computer Science, vol. 412, pp. 6261-6268 (2011). Faenza Y., Oriolo G., Snels C., A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants), Operations Research Letters, vol 39, no. 3, (2011), pp 213 217. Faenza Y., Oriolo G., Stauffer G. An algorithmic decomposition of claw-free graphs leading to an O(n 3 )-algorithm for the weighted stable set problem, Proceedings of SODA 2011. Fiorini S., Oriolo G., Sanità L., Theis D.O. The VPN problems with concave costs, Siam Journal on Discrete Mathematics, vol 24, no.3 (2010), pp 1080-1090. 4
Grandoni F., Nicosia G., Oriolo G., Sanità L., Stable Routing under the Spanning Tree Protocol, Operation Research Letters,, vol. 38, no.5 (2010), pp. 399-404. Iovanna P., Nicosia G., Oriolo G., Sanità L., Sperduto E. Local Restoration for Trees and Arborescences. Proceedings of FiTraMen 2008, Lectures Notes in Computer Science, vol. 5464 (2009), Springer: Berlin, pp 130-140. Oriolo G., Stauffer G. Clique Circulants and the Stable Set Polytope of Fuzzy Circular Interval Graphs. Mathematical Programming, vol. 115, no.2 (2008), 291-317. Eisenbrand F., Oriolo G., Stauffer G., Ventura P. Circular One Matrices and the Stable Set Polytope of Quasi-Line Graphs. Combinatorica, vol 28, no.1 (2008) 45-67. As extended abstract appeared in: Proceedings of the Eleventh Conference on Integer Programming and Combinatorial Optimization (IPCO 05), Lecture Notes in Computer Science 3509 (2005), Springer: Berlin, 291-305. Mathematics of Operations Re- Oriolo G. Domination between Traffic Matrices. search, vol. 33 (2008), pp 91-96. Grandoni F., Kaibel V., Oriolo G., Skutella M. A Short Proof of the VPN Tree Routing Conjecture on Ring Networks. Operation Research Letters, vol 33, no.3 (2008), pp 361-365. Oriolo G., Pietropaoli U., Stauffer G., A new algorithm for the maximum weighted stable set problem in claw-free graphs. Proceedings of the thirteenth Conference on Integer Programming and Combinatorial Optimization (IPCO 08), Lectures Notes in Computer Science, vol. 5035 (2008), Springer: Berlin, 77-96. Eisenbrand F., Grandoni S., Oriolo G., Skutella M. New Approaches for Virtual Private Network Design. Siam Journal on Computing, vol 37, no. 3 (2007) pp 706-721. As extended abstract appeared in: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 05), Lecture Notes in Computer Science 3142 (2005), Springer: Berlin, 1151-1162. Chekuri C., Oriolo G., Shepherd B., Scutellá M.G. Hardness of Robust Network Design. Networks, vol. 50, no. 1 (2007), pp 50-54. As extended abstract appeared in: Proceedings of the 2nd International Network Optimization Conference (INOC 2005), vol. 2 (2005), 455-461. Mannino C., Oriolo G., Ricci F., Chandran S., The Independent Set Problem and the Thinness of a Graph, Operation Research Letters, vol. 35 no. 1 (2007), pp 10-16. Italiano G., Leonardi S., Oriolo G. Design of trees in the hose model: the balanced case, Operation Research Letters, vol. 34, no. 6 (2006), pp 601-606. As extended abstract appeared in: Proceedings of the third Conference on Approximation and Randomization Algorithms in Communication Networks (ARACNE 02), pp 65-76. Chandran S., Mannino C., Oriolo G., On the cubicity of Certain Graphs, Information Processing Letters, vol. 94 (2005), pp 113-118. 5
Oriolo G., Clique Family Inequalities for the Stable Set Polytope for Quasi-Line Graphs, Discrete Applied Mathematics, vol.132, no.1 (2004), pp 185-201. Liebling T., Oriolo G., Spille B., Stauffer G. On Non-Rank Facets of the Stable Set Polytope of Claw-Free Graphs and Circulant Graphs, Mathematical Methods of Operations Research, vol.59, no.1 (2004), pp 25-35. D Aprile P., Iovanna P., Oriolo G., Sabella R. Strategy for Dynamic Routing and Grooming of Data Flows into Lightpaths in New Generation Optical Network Based on the GMPLS Paradigm, Photonic Network Communications, vol. 7 no.2 (2004), pp 131-144. Brightwell G., Oriolo G., Sheperd F.B. Reserving Resilient Capacity with Upper Bounds Constraints, Networks, vol.41, no.2 (2003), pp 87-96. Nicosia G., Oriolo G. An Approximate A* Algorithm and its Application to the SCS Problem, Theoretical Computer Science, vol. 290, no.3 (2003), pp 2021-2089 Conte G., Ferlito F., Oriolo G., Razza F., Sabella R., Settembre M. Multilayer Solution for Path Provisioning in New-Generation Optical/MPLS Networks, Journal of Lightwave Technology, vol.21, no.5 (2003), pp 1141-55. Brightwell G., Oriolo G., Sheperd F.B. Reserving Resilient Capacity in a Network, Siam Journal on Discrete Mathematics, vol.14, no.4 (2001), pp 524-539. Agnetis A., Lucertini M., Nicoletti S., Nicolo F., Oriolo G., Pacciarelli D., Pacifici A., Rossi F., Scheduling Flexible Flow Lines in an Automobile Assembly Plant, European Journal of Operational Research, vol 2, no. 97 (1997), pp 348-362 (also as The Decision Process for the Material Flow Management in a FIAT Car Assembly Plant a chapter in: Optimization in Industry 3: Mathematical Programming and Modeling Techniques in Practice). Agnetis A., Oriolo G., The Machine Duplication Problem in a Job Shop with Two Jobs, International Transactions in Operational Research, vol. 2, no. 1 (1995), pp 45-60. Chapter of books Faenza Y., Oriolo G., Stauffer G., Ventura P., Stable Sets in Claw-Free Graphs: A Journey Through Algorithms and Polytopes in: Progress in Combinatorial Optimization, pp 41-79, ISTE Publishing Knowledge, Wiley. Agnetis A., Lucertini M., Nicolò F., Oriolo G., Pacciarelli D. The Decision Process for the Material Flow Management in a FIAT Car Assembly Plant, Chap. 5, in Optimization in Industry 3: Mathematical Programming and Modeling Techniques in Practice, John Wiley & Sons, Ltd, 1995. Other Oriolo G., Stauffer G, Ventura P., Stable sets in claw-free graphs: recent achievements and future challenges, invited survey for Optima 86 (2011). 6