Table of Contents

• Research work with Bruno SimeoneRonald I. Becker. 1-3 [doi]
• Incompatibility graphs and data miningEndre Boros, Vincenzo Spinelli, Federica Ricca. 4-7 [doi]
• Control and voting power in complex shareholding networksYves Crama. 8-9 [doi]
• Graph sandwich problemsMartin Charles Golumbic. 10 [doi]
• Bruno Simeone's Work in ClusteringPierre Hansen. 11 [doi]
• Separating negative and positive points with the minimum number of boxesPaolo Serafini. 12-15 [doi]
• Resources and transmission formats allocation in OFDMA networksAndrea Abrardo, Marco Belleschi, Paolo Detti. 19-22 [doi]
• Modeling and solving aircrafts scheduling problem in ground controlLudovica Adacher, Marta Flamini. 23-26 [doi]
• Network design with SRG based protectionBernardetta Addis, Giuliana Carello, Federico Malucelli. 27-31 [doi]
• Scheduling problems with unreliable jobs and machinesAlessandro Agnetis, Paolo Detti, Patrick Martineau. 32-35 [doi]
• Models and Algorithms for the Bin Packing Problem with Fragile ObjectsManuel A. Alba Martínez, François Clautiaux, Mauro Dell'Amico, Manuel Iori. 36-39 [doi]
• New upper bound for the number of maximal bicliques of a bipartite graphAlexandre Albano, Alair Do Lago. 40-43 [doi]
• Binary Betting Strategies with Optimal Logarithmic GrowthKirsten Albrecht, Ulrich Faigle. 44-47 [doi]
• Formulations and heuristics for the k-Piecewise Affine Model Fitting problemEdoardo Amaldi, Stefano Coniglio, Leonardo Taccari. 48-51 [doi]
• On cycle bases with limited edge overlapEdoardo Amaldi, Claudio Iuliano, Romeo Rizzi. 52-55 [doi]
• Sorting Common Operations to Minimize Tardy JobsClaudio Arbib, Giovanni Felici, Mara Servilio. 56-59 [doi]
• Generalized row family inequalities for the set covering polyhedronGabriela R. Argiroffo, Annegret Wagler. 60-63 [doi]
• One Minimum-Cost Network Flow Problem to Identify a Graph's Connected ComponentsJoanna Bauer. 64-67 [doi]
• Computing the differential of a graphSergio Bermudo, Henning Fernau. 68-71 [doi]
• Enumeration of Labeled Split Graphs and Counts of Important SuperclassesVladislav Bína. 72-75 [doi]
• Local Computation of Vertex ColoringsThomas Böhme, Jens Schreyer. 76-79 [doi]
• A primal algorithm for the minimum weight clique cover problem on a class of claw-free perfect graphsFlavia Bonomo, Gianpaolo Oriolo, Claudia Snels. 80-83 [doi]
• Characterization of classical graph classes by weighted clique graphsFlavia Bonomo, Jayme Luiz Szwarcfiter. 84-87 [doi]
• The gateway location problem for hazardous material transportationMaurizio Bruglieri, Paola Cappanera, Maddalena Nonato. 88-92 [doi]
• Labeling of Oriented Planar GraphsTiziana Calamoneri, Blerina Sinaimeri. 93-96 [doi]
• Effective drawing of proportional symbol maps using GRASPRafael G. Cano, Guilherme Kunigami, Cid C. de Souza, Pedro J. de Rezende. 97-100 [doi]
• Sensor Network Localization Using Compressed Extended Kalman FilterMarco Carli, Federica Pascucci. 101-104 [doi]
• A Generalized Stochastic Knapsack Problem with Application in Call Admission ControlMarco Cello, Giorgio Gnecco, Mario Marchese, Marcello Sanguineti. 105-108 [doi]
• A partial characterization by forbidden subgraphs of edge path graphsMárcia R. Cerioli, Hugo Imperiano Nobrega, Petrúcio Viana. 109-112 [doi]
• Combined Location and Routing Problems in Drug DistributionAlberto Ceselli, Giovanni Righini, Emanuele Tresoldi. 113-117 [doi]
• The impact of the norm on the k-Hyperplane Clustering problem: relaxations, restrictions, approximation factors, and exact formulationsStefano Coniglio. 118-121 [doi]
• A Lagrangian Relaxation Approach for Gene Regulatory NetworksRoberto Cordone, Guglielmo Lulli. 122-125 [doi]
• Bound constraints for Point Packing in a SquareAlberto Costa, Pierre Hansen, Leo Liberti. 126-129 [doi]
• Bicolored independent sets and bicliquesJean-François Couturier, Dieter Kratsch. 130-133 [doi]
• New Results for the Directed Network Diversion ProblemChristopher Cullenbine, R. Kevin Wood, Alexandra Newman. 134-137 [doi]
• A New Feasibility Pump-Like Heuristic for Mixed Integer ProblemsMarianna De Santis, Stefano Lucidi, Francesco Rinaldi. 138-141 [doi]
• Continuous Reformulations for Zero-one Programming ProblemsMarianna De Santis, Stefano Lucidi, Francesco Rinaldi. 142-145 [doi]
• The maximum labeled clique problemPaolo Dell'Olmo, Raffaele Cerulli, Francesco Carrabs. 146-149 [doi]
• The Pickup and Delivery Problem with Incompatibility ConstraintsPablo Factorovich, Isabel Méndez-Díaz, Paula Zabala. 150-153 [doi]
• Representations of Power Series over Word AlgebrasUlrich Faigle, Alexander Schönhuth. 154-157 [doi]
• The Boat and Barge ProblemMette Gamst, Niels Hvidberg Kjeldsen. 158-161 [doi]
• A Probabilistic Cellular Automata algorithm for the clique problemAlexandre Gaudilliere, Antonio Iovanella, Benedetto Scoppola, Elisabetta Scoppola, Massimiliano Viale. 162-164 [doi]
• Odd cyclic surface separators in planar graphsPetr A. Golovach, Marcin Kaminski, Dimitrios M. Thilikos. 165-167 [doi]
• Computing Derivatives via Compression: An Exact SchemeShahadat Hossain. 168-172 [doi]
• Improved Taxation Rate for Bin Packing GamesWalter Kern, Xian Qiu. 173-176 [doi]
• Decomposition of Tutte PolynomialMartin Kochol. 177-179 [doi]
• Approximability of the Two-Stage Knapsack problem with discretely distributed weightsStefanie Kosuch. 180-183 [doi]
• Computing the Grothendieck constant of some graph classesMonique Laurent, Antonios Varvitsiotis. 184-188 [doi]
• Branch-and-Prune trees with bounded widthLeo Liberti, Benoît Masson, Carlile Lavor, Antonio Mucherino. 189-193 [doi]
• Discounted Markov Decision Processes and Algorithms for Solving Stochastic Control Problem on NetworksDmitrii Lozovanu, Stefan Pickl. 194-197 [doi]
• Infeasible path formulations for the time-dependent TSP with time windowsIsabel Méndez-Díaz, Juan José Miranda Bront, Paolo Toth, Paula Zabala. 198-202 [doi]
• A hereditary view on efficient dominationMartin Milanic. 203-206 [doi]
• On the Robust Knapsack ProblemMichele Monaci, Ulrich Pferschy. 207-210 [doi]
• Sparsifying Distance Matrices for Protein-Protein Structure AlignmentsAntonio Mucherino, Inken Wohlers, Gunnar W. Klau, Rumen Andonov. 211-214 [doi]
• Minimally 2-connected graphs and colouring problemsN. Narayanan. 215-218 [doi]
• Bipartite finite Toeplitz graphsSara Nicoloso, Ugo Pietropaoli. 219-222 [doi]
• A reduction algorithm for the weighted stable set problem in claw-free graphsPaolo Nobili, Antonio Sassano. 223-226 [doi]
• Edge-chromatic sums of regular and bipartite graphsPetros A. Petrosyan, Rafael R. Kamalian. 227-230 [doi]
• Range minimization problems in path-facility location on treesJusto Puerto, Federica Ricca, Andrea Scozzari. 231-234 [doi]
• The price of equity in the HazmatFabio Roda, Pierre Hansen, Leo Liberti. 235-238 [doi]
• On graph of order-n with the metric dimension n-3Suhadi Wido Saputro, Rinovia Simanjuntak, Saladin Uttunggadewa, Hilda Assiyatun, Edy Tri Baskoro, A. N. M. Salman. 239-243 [doi]
• Matchings in balanced hypergraphsRobert Scheidweiler, Eberhard Triesch. 244-247 [doi]
• Efficient enumeration of optimal and approximate solutions of a scheduling problemSergey Sevastyanov, Bertrand M. T. Lin. 248-251 [doi]
• Majorization and the minimum number of dominating setsZdzislaw Skupien. 252-254 [doi]
• Reducing the minimum T-cut problem to polynomial size linear programmingRüdiger Stephan. 255-258 [doi]
• The dynamics of deterministic systems from a hypergraph theoretical point of viewLuis Miguel Torres, Annegret Katrin Wagler. 259-262 [doi]
• An Evolutionary Algorithm for the Multiobjective Risk-Equity Constrained Routing ProblemNora Touati Moungla, Dimo Brockhoff. 263-266 [doi]
• Popular RankingAnke van Zuylen, Frans Schalekamp, David P. Williamson. 267-270 [doi]
• Locally optimal dissimilar paths in road networksStéphanie Vanhove, Veerle Fack. 271-274 [doi]
• Searching Circulant GraphsÖznur Yasar Diner, Danny Dyer. 275-278 [doi]