Leo Liberti Vis

*	2009
32		Sonia Cafieri, Antonio Mucherino, Giacomo Nannicini, Fabien Tarissan, Leo Liberti: Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009 CTW 2009
31	EE	Gérard Cornuéjols, Leo Liberti, Giacomo Nannicini: Improved Strategies for Branching on General Disjunctions. CTW 2009: 144-145
30	EE	Fabio Roda, Leo Liberti, Franco Raimondi: Combinatorial Optimization Based Recommender Systems. CTW 2009: 175-179
29	EE	Andrea Bettinelli, Leo Liberti, Franco Raimondi, David Savourey: The Anonymous Subgraph Problem. CTW 2009: 269-274
28	EE	Antonio Mucherino, Leo Liberti, Carlile Lavor, Nelson Maculan: Comparisons between an exact and a metaheuristic algorithm for the molecular distance geometry problem. GECCO 2009: 333-340
27	EE	Carlile Lavor, Leo Liberti, Antonio Mucherino, Nelson Maculan: On a discretizable subclass of instances of the molecular distance geometry problem. SAC 2009: 804-805
26	EE	Carlile Lavor, Leo Liberti, Nelson Maculan: Molecular Distance Geometry Problem. Encyclopedia of Optimization 2009: 2304-2311
25	EE	Hanif D. Sherali, Leo Liberti: Reformulation-Linearization Technique for Global Optimization. Encyclopedia of Optimization 2009: 3263-3268
24	EE	Leo Liberti, Nelson Maculan: Reformulation techniques in mathematical programming. Discrete Applied Mathematics 157(6): 1165-1166 (2009)
23	EE	Leo Liberti, Carlile Lavor, Nelson Maculan, Marco Antonio Chaer Nascimento: Reformulation in mathematical programming: An application to quantum chemistry. Discrete Applied Mathematics 157(6): 1309-1318 (2009)
22	EE	Leo Liberti, Carlile Lavor, Nelson Maculan, Fabrizio Marinelli: Double variable neighbourhood search with smoothing for the molecular distance geometry problem. J. Global Optimization 43(2-3): 207-218 (2009)
	2008
21	EE	Leo Liberti, Franco Raimondi: The Secret Santa Problem. AAIM 2008: 271-279
20	EE	Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti: Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks. COCOA 2008: 225-234
19	EE	Leo Liberti: Automatic Generation of Symmetry-Breaking Constraints. COCOA 2008: 328-338
18		Giacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes: Bidirectional A* on Time-dependent Graphs. CTW 2008: 132-135
17		Leo Liberti: Reformulations in Mathematical Programming: Definitions. CTW 2008: 66-70
16	EE	Kanika Dhyani, Leo Liberti: Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem. MCO 2008: 87-96
15	EE	Giacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes: Bidirectional A* Search for Time-Dependent Fast Paths. WEA 2008: 334-346
	2007
14		Leo Liberti: A useful characterization of the feasible region of binary linear programs. CTW 2007: 103-106
13		Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti: Fast point-to-point shortest path queries on dynamic road networks with interfal data. CTW 2007: 115-118
12		Marie-Christine Plateau, Leo Liberti, Laurent Alfandari: Edge cover by bipartite subgraphs. CTW 2007: 127-132
11	EE	Leo Liberti: Compact linearization for binary quadratic problems. 4OR 5(3): 231-245 (2007)
10	EE	Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti: Fast paths in large-scale dynamic road networks CoRR abs/0704.1068: (2007)
9	EE	Sergei Kucherenko, Pietro Belotti, Leo Liberti, Nelson Maculan: New formulations for the Kissing Number Problem. Discrete Applied Mathematics 155(14): 1837-1841 (2007)
	2006
8	EE	Ulrich Faigle, Leo Liberti, Francesco Maffioli, Stefan Pickl: Graphs and combinatorial optimization. Discrete Optimization 3(3): 179 (2006)
	2004
7	EE	Edoardo Amaldi, Leo Liberti, Nelson Maculan, Francesco Maffioli: Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases. WEA 2004: 14-29
6	EE	Leo Liberti: Reformulation and convex relaxation techniques for global optimization. 4OR 2(3): 255-258 (2004)
5	EE	Leo Liberti, Francesco Maffioli: Preface. Electronic Notes in Discrete Mathematics 17: 1 (2004)
4	EE	Leo Liberti, Nelson Maculan, Sergei Kucherenko: The Kissing Number Problem: A New Result from Global Optimization. Electronic Notes in Discrete Mathematics 17: 203-207 (2004)
3	EE	Edoardo 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)
	2002
2	EE	Leo Liberti: Performance Comparison of Function Evaluation Methods CoRR cs.SC/0206010: (2002)
	1999
1		Leo Liberti: Structure of the Invertible CA Transformations Group. J. Comput. Syst. Sci. 59(3): 521-536 (1999)

Coauthor Index

1	Laurent Alfandari	[12]
2	Edoardo Amaldi	[3] [7]
3	Philippe Baptiste	[10] [13] [20]
4	Gilles Barbier	[10]
5	Pietro Belotti	[9]
6	Andrea Bettinelli	[29]
7	Sonia Cafieri	[32]
8	Gérard Cornuéjols	[31]
9	Daniel Delling	[15] [18]
10	Kanika Dhyani	[16]
11	Ulrich Faigle	[8]
12	Daniel Krob	[10] [13] [20]
13	Sergei Kucherenko	[4] [9]
14	Carlile Lavor	[22] [23] [26] [27] [28]
15	Nelson Maculan	[3] [4] [7] [9] [22] [23] [24] [26] [27] [28]
16	Francesco Maffioli	[3] [5] [7] [8]
17	Fabrizio Marinelli	[22]
18	Antonio Mucherino	[27] [28] [32]
19	Giacomo Nannicini	[10] [13] [15] [18] [20] [31] [32]
20	Marco Antonio Chaer Nascimento	[23]
21	Stefan Pickl (Stefan Wolfgang Pickl)	[8]
22	Marie-Christine Plateau	[12]
23	Franco Raimondi	[21] [29] [30]
24	Fabio Roda	[30]
25	David Savourey	[29]
26	Dominik Schultes	[15] [18]
27	Hanif D. Sherali	[25]
28	Fabien Tarissan	[32]

Colors in the list of coauthors