10. CTW 2011: Villa Mondragone, Frascati, Italy

Session in memory of Bruno Simeone

• Ronald I. Becker:
  Research work with Bruno Simeone. 1-3
  
• Endre Boros, Vincenzo Spinelli, Federica Ricca:
  Incompatibility graphs and data mining. 4-7
  
• Yves Crama:
  Control and voting power in complex shareholding networks. 8-9
  
• Martin Charles Golumbic:
  Graph sandwich problems. 10
  
• Pierre Hansen:
  Bruno Simeone's Work in Clustering. 11
  
• Paolo Serafini:
  Separating negative and positive points with the minimum number of boxes. 12-15
  

Contributed Abstracts

• Andrea Abrardo, Marco Belleschi, Paolo Detti:
  Resources and transmission formats allocation in OFDMA networks. 19-22
  
• Ludovica Adacher, Marta Flamini:
  Modeling and solving aircrafts scheduling problem in ground control. 23-26
  
• Bernardetta Addis, Giuliana Carello, Federico Malucelli:
  Network design with SRG based protection. 27-31
  
• Alessandro Agnetis, Paolo Detti, Patrick Martineau:
  Scheduling problems with unreliable jobs and machines. 32-35
  
• Manuel Alba, François Clautiaux, Mauro Dell'Amico, Manuel Iori:
  Models and Algorithms for the Bin Packing Problem with Fragile Objects. 36-39
  
• Alexandre Albano, Alair Do Lago:
  New upper bound for the number of maximal bicliques of a bipartite graph. 40-43
  
• Kirsten Albrecht, Ulrich Faigle:
  Binary Betting Strategies with Optimal Logarithmic Growth. 44-47
  
• Edoardo Amaldi, Stefano Coniglio, Leonardo Taccari:
  Formulations and heuristics for the k-Piecewise Affine Model Fitting problem. 48-51
  
• Edoardo Amaldi, Claudio Iuliano, Romeo Rizzi:
  On cycle bases with limited edge overlap. 52-55
  
• Claudio Arbib, Giovanni Felici, Mara Servilio:
  Sorting Common Operations to Minimize Tardy Jobs. 56-59
  
• Gabriela R. Argiroffo, Annegret Wagler:
  Generalized row family inequalities for the set covering polyhedron. 60-63
  
• Joanna Bauer:
  One Minimum-Cost Network Flow Problem to Identify a Graph's Connected Components. 64-67
  
• Sergio Bermudo, Henning Fernau:
  Computing the differential of a graph. 68-71
  
• Vladislav Bína:
  Enumeration of Labeled Split Graphs and Counts of Important Superclasses. 72-75
  
• Thomas Böhme, Jens Schreyer:
  Local Computation of Vertex Colorings. 76-79
  
• Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels:
  A primal algorithm for the minimum weight clique cover problem on a class of claw-free perfect graphs. 80-83
  
• Flavia Bonomo, Jayme Luiz Szwarcfiter:
  Characterization of classical graph classes by weighted clique graphs. 84-87
  
• Maurizio Bruglieri, Paola Cappanera, Maddalena Nonato:
  The gateway location problem for hazardous material transportation. 88-92
  
• Tiziana Calamoneri, Blerina Sinaimeri:
  Labeling of Oriented Planar Graphs. 93-96
  
• Rafael G. Cano, Guilherme Kunigami, Cid C. de Souza, Pedro J. de Rezende:
  Effective drawing of proportional symbol maps using GRASP. 97-100
  
• Marco Carli, Federica Pascucci:
  Sensor Network Localization Using Compressed Extended Kalman Filter. 101-104
  
• Marco Cello, Giorgio Gnecco, Mario Marchese, Marcello Sanguineti:
  A Generalized Stochastic Knapsack Problem with Application in Call Admission Control. 105-108
  
• Márcia R. Cerioli, Hugo Imperiano Nobrega, Petrucio Viana:
  A partial characterization by forbidden subgraphs of edge path graphs. 109-112
  
• Alberto Ceselli, Giovanni Righini, Emanuele Tresoldi:
  Combined Location and Routing Problems in Drug Distribution. 113-117
  
• Stefano Coniglio:
  The impact of the norm on the k-Hyperplane Clustering problem: relaxations, restrictions, approximation factors, and exact formulations. 118-121
  
• Roberto Cordone, Guglielmo Lulli:
  A Lagrangian Relaxation Approach for Gene Regulatory Networks. 122-125
  
• Alberto Costa, Pierre Hansen, Leo Liberti:
  Bound constraints for Point Packing in a Square. 126-129
  
• Jean-François Couturier, Dieter Kratsch:
  Bicolored independent sets and bicliques. 130-133
  
• Christopher Cullenbine, R. Kevin Wood, Alexandra Newman:
  New Results for the Directed Network Diversion Problem. 134-137
  
• Marianna De Santis, Stefano Lucidi, Francesco Rinaldi:
  A New Feasibility Pump-Like Heuristic for Mixed Integer Problems. 138-141
  
• Marianna De Santis, Stefano Lucidi, Francesco Rinaldi:
  Continuous Reformulations for Zero-one Programming Problems. 142-145
  
• Paolo Dell'Olmo, Raffaele Cerulli, Francesco Carrabs:
  The maximum labeled clique problem. 146-149
  
• Pablo Factorovich, Isabel Méndez-Díaz, Paula Zabala:
  The Pickup and Delivery Problem with Incompatibility Constraints. 150-153
  
• Ulrich Faigle, Alexander Schönhuth:
  Representations of Power Series over Word Algebras. 154-157
  
• Mette Gamst, Niels Hvidberg Kjeldsen:
  The Boat and Barge Problem. 158-161
  
• Alexandre Gaudilliere, Antonio Iovanella, Benedetto Scoppola, Elisabetta Scoppola, Massimiliano Viale:
  A Probabilistic Cellular Automata algorithm for the clique problem. 162-164
  
• Petr A. Golovach, Marcin Kaminski, Dimitrios M. Thilikos:
  Odd cyclic surface separators in planar graphs. 165-167
  
• Shahadat Hossain:
  Computing Derivatives via Compression: An Exact Scheme. 168-172
  
• Walter Kern, Xian Qiu:
  Improved Taxation Rate for Bin Packing Games. 173-176
  
• Martin Kochol:
  Decomposition of Tutte Polynomial. 177-179
  
• Stefanie Kosuch:
  Approximability of the Two-Stage Knapsack problem with discretely distributed weights. 180-183
  
• Monique Laurent, Antonios Varvitsiotis:
  Computing the Grothendieck constant of some graph classes. 184-188
  
• Leo Liberti, Benoît Masson, Carlile Lavor, Antonio Mucherino:
  Branch-and-Prune trees with bounded width. 189-193
  
• Dmitrii Lozovanu, Stefan Pickl:
  Discounted Markov Decision Processes and Algorithms for Solving Stochastic Control Problem on Networks. 194-197
  
• Isabel Méndez-Díaz, Juan José Miranda Bront, Paolo Toth, Paula Zabala:
  Infeasible path formulations for the time-dependent TSP with time windows. 198-202
  
• Martin Milanic:
  A hereditary view on efficient domination. 203-206
  
• Michele Monaci, Ulrich Pferschy:
  On the Robust Knapsack Problem. 207-210
  
• Antonio Mucherino, Inken Wohlers, Gunnar W. Klau, Rumen Andonov:
  Sparsifying Distance Matrices for Protein-Protein Structure Alignments. 211-214
  
• N. Narayanan:
  Minimally 2-connected graphs and colouring problems. 215-218
  
• Sara Nicoloso, Ugo Pietropaoli:
  Bipartite finite Toeplitz graphs. 219-222
  
• Paolo Nobili, Antonio Sassano:
  A reduction algorithm for the weighted stable set problem in claw-free graphs. 223-226
  
• Petros A. Petrosyan, Rafael R. Kamalian:
  Edge-chromatic sums of regular and bipartite graphs. 227-230
  
• Justo Puerto, Federica Ricca, Andrea Scozzari:
  Range minimization problems in path-facility location on trees. 231-234
  
• Fabio Roda, Pierre Hansen, Leo Liberti:
  The price of equity in the Hazmat. 235-238
  
• Suhadi Wido Saputro, Rinovia Simanjuntak, Saladin Uttunggadewa, Hilda Assiyatun, Edy Tri Baskoro, A. N. M. Salman:
  On graph of order-n with the metric dimension n-3. 239-243
  
• Robert Scheidweiler, Eberhard Triesch:
  Matchings in balanced hypergraphs. 244-247
  
• Sergey Sevastyanov, Bertrand M. T. Lin:
  Efficient enumeration of optimal and approximate solutions of a scheduling problem. 248-251
  
• Zdzislaw Skupien:
  Majorization and the minimum number of dominating sets. 252-254
  
• Rüdiger Stephan:
  Reducing the minimum T-cut problem to polynomial size linear programming. 255-258
  
• Luis Miguel Torres, Annegret Katrin Wagler:
  The dynamics of deterministic systems from a hypergraph theoretical point of view. 259-262
  
• Nora Touati Moungla, Dimo Brockhoff:
  An Evolutionary Algorithm for the Multiobjective Risk-Equity Constrained Routing Problem. 263-266
  
• Anke van Zuylen, Frans Schalekamp, David P. Williamson:
  Popular Ranking. 267-270
  
• Stéphanie Vanhove, Veerle Fack:
  Locally optimal dissimilar paths in road networks. 271-274
  
• Öznur Yasar Diner, Danny Dyer:
  Searching Circulant Graphs. 275-278
  

Last update Thu May 24 04:15:08 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page