default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic Notes in Discrete Mathematics, Volume 55
Volume 55, November 2016
- Alberto Ceselli
, Roberto Cordone, Giovanni Righini:
Preface. 1-3 - Marika Ivanová:
The Shared Broadcast Tree Problem and MST. 5-8 - Klaus Jansen, Denis Trystram:
Scheduling parallel jobs on heterogeneous platforms. 9-12 - Cláudia Marcela Justel, Carlos Rocha, Emanuelle Chaves:
Experiments with two heuristic algorithms for the Maximum Algebraic Connectivity Augmentation Problem. 13-16 - Roberto Cordone, Guglielmo Lulli:
Multimode extensions of Combinatorial Optimization problems. 17-20 - Alberto Ceselli, Marco Premoli, Stefano Secci:
Heuristics for static cloudlet location. 21-24 - Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia:
A preliminary analysis of the Distance Based Critical Node Problem. 25-28 - Valentina Cacchiani, Feng Jiang, Paolo Toth:
Timetable Optimization for High-Speed Trains at Chinese Railways. 29-32 - Maurizio Bruglieri, Roberto Cordone:
Partitioning a graph into minimum gap components. 33-36 - Isabella Lari, Justo Puerto, Federica Ricca, Andrea Scozzari:
Algorithms for uniform centered partitions of trees. 37-40 - Becky Callaghan, Saïd Salhi, Gábor Nagy:
Drezner's Exact Method for the Continuous p-Centre Problem Revisited. 41-44 - Gustavo Dias, Leo Liberti:
New methods for the Distance Geometry Problem. 45-48 - Jia Liu, Abdel Lisser, Zhiping Chen:
Stochastic geometric programming with joint probabilistic constraints. 49-52 - Leo Liberti, Pierre-Louis Poirion, Ky Khac Vu:
Solving LP using random projections. 53-56 - Pierre Hosteins, Roberto Cordone, Giovanni Righini:
The Prize-collecting Scheduling Problem with Deadlines. 57-60 - Marco Casazza, Alberto Ceselli:
Column generation for the variable cost and size bin packing problem with fragmentation. 61-64 - Maurizio Naldi, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Maximin Fairness in Project Budget Allocation. 65-68 - Luca Mencarelli, Claudia D'Ambrosio, Angelo Di Zio, Silvano Martello:
Heuristics for the General Multiple Non-linear Knapsack Problem. 69-72 - Marianna De Santis:
Dual approaches for a specific class of integer nonlinear programming problems. 73-76 - Borzou Rostami, Federico Malucelli:
A generalized Gilmore-Lawler procedure for the Quadratic Assignment Problem. 77-80 - Jean-Paul Doignon, Samuel Fiorini, Selim Rexhep:
The Linear Extension Polytope of a Poset. 81-84 - Evellyn Cavalcante, Johan Oppen, Phillippe Samer, Sebastián Urrutia:
Combinatorial Relaxation Bounds and Preprocessing for Berth Allocation Problems. 85-88 - Maurizio Bruglieri, Simona Mancini, Ferdinando Pezzella, Ornella Pisacane:
A new Mathematical Programming Model for the Green Vehicle Routing Problem. 89-92 - Paolo Gianessi, Alberto Ceselli, Lucas Létocart, Roberto Wolfler Calvo:
A Branch&Price&Cut algorithm for the Vehicle Routing Problem with Intermediate Replenishment Facilities. 93-96 - Anja Fischer, J. Fabian Meier, Ulrich Pferschy, Rostislav Stanek:
Linear Models and Computational Experiments for the Quadratic TSP. 97-100 - Ana Silva, Cláudia Linhares Sales:
Graphs with large girth are b-continuous. 101-104 - Christoph Brause, Trung Duy Doan, Ingo Schiermeyer:
Proper connection number 2, connectivity, and forbidden subgraphs. 105-108 - Christoph Brause, Trung Duy Doan, Ingo Schiermeyer:
On the minimum degree and the proper connection number of graphs. 109-112 - Parinya Chalermsook, Daniel Vaz:
A Note on Fractional Coloring and the Integrality gap of LP for Maximum Weight Independent Set. 113-116 - Sreekanth Gorla, Meghana Nasre:
List Coloring of Planar Graphs with Forbidden Cycles. 117-121 - Ömer Can Yavuzyilmaz, Enver Kayaaslan:
Subset matching and edge coloring in bipartite graphs. 123-126 - Christoph Brause, Trung Duy Doan, Ingo Schiermeyer:
On the chromatic number of (P5, K2, t)-free graphs. 127-130 - Pankaj Pundir, G. Ramakrishna:
On Minimum Average Stretch Spanning Trees in Grid Graphs. 131-134 - Christina Büsing, Sarah Kirchner, Annika Thome:
The Capacitated Budgeted Minimum Cost Flow Problem with Unit Upgrading Costs. 135-138 - Márcia R. Cerioli, Paloma T. Lima:
Intersection of Longest Paths in Graph Classes. 139-142 - Jochen Harant, Igor Fabrici, Stanislav Jendrol':
On Longest Cycles in Essentially 4-connected Planar Graphs. 143-146 - Sascha Kurz, Xavier Molinero, Martin Olsen, Maria José Serna Iglesias:
Dimension and codimension of simple games. 147-150 - Vikas Vikram Singh, Oualid Jouini, Abdel Lisser:
Equivalent Nonlinear Complementarity Problem for Chance-constrained Games. 151-154 - Dmitrii Lozovanu, Stefan Pickl:
Determining the Optimal Strategies for Zero-Sum Average Stochastic Positional Games. 155-159 - Rafael Veiga Pocai:
The Complexity of SIMPLE MAX-CUT on Comparability Graphs. 161-164 - Zsuzsa Mészáros-Karkus:
Hardness results for stable exchange problems. 165-168 - Julliano R. Nascimento, Erika M. M. Coelho, Hebert Coelho, Jayme Luiz Szwarcfiter:
On the Complexity of the P3-Hull Number of the Cartesian Product of Graphs. 169-172 - Carla Silva Oliveira, Leonardo Silva de Lima:
A lower bound for the sum of the two largest signless Laplacian eigenvalues. 173-176 - Zakir Deniz, Tínaz Ekim, Tatiana Romina Hartinger, Martin Milanic, Mordechai Shalom:
On Three Extensions of Equimatchable Graphs. 177-180 - Verónica Hernández, Domingo Pestana, José M. Rodríguez:
Diameter, minimum degree and hyperbolicity constant in graphs. 181-184 - Ulrich Faigle:
Weighted Graphs as Dynamical Interaction Systems. 185-189 - Ismael González Yero:
Vertices, edges, distances and metric dimension in graphs. 191-194 - Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
Squares of Low Clique Number. 195-198 - Keno Merckx, Jean Cardinal, Jean-Paul Doignon:
On the shelling antimatroids of split graphs. 199-202 - Jesmmer Alves, Diane Castonguay, Thomas Brüstle:
A Polynomial Recognition of Unit Forms. 203-206 - Amal Gassara, Ismael Bouassida Rodriguez, Mohamed Jmaiel, Khalil Drira:
Encoding Bigraphical Reactive Systems into Graph Transformation Systems. 207-210
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-05 22:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
