Abstract is missing.
- Simultaneously integral graphs on three associated matricesNair Maria Maia de Abreu, Maria Aguieiras A. de Freitas, Renata R. Del-Vecchio. 7-10
- Perfect digraphs and a strong perfect digraph theoremStephan Dominique Andres, Winfried Hochstättler. 11-13
- Geodetic sets and peripheryDanilo Artigas, Simone Dantas, Mitre Costa Dourado, Jayme Luiz Szwarcfiter. 15-18
- An IP based heuristic algorithm for the vehicle and crew scheduling pick-up and delivery problem with time windowsD. Bakarcic, G. Di Piazza, Isabel Méndez-Díaz, Paula Zabala. 19-22
- Online checkpointing with improved worst-case guaranteesKarl Bringmann, Benjamin Doerr, Adrian Neumann, Jakub Sliacan. 23-26
- Smoothed analysis of the successive shortest path algorithmTobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin. 27-30
- The spanning tree problem with one quadratic termChristoph Buchheim, Laura Klein. 31-34
- Robust optimization under multiband uncertaintyChristina Büsing, Fabio D'Andreagiovanni, Annie Raymond. 35-38
- Connected dominating set in graphs without long paths and cyclesEglantine Camby, Oliver Schaudt. 39-42
- Total L(2, 1)-coloring of graphsMárcia R. Cerioli, Daniel F. D. Posner. 43-46
- Testing uniformity of stationary distributionSourav Chakraborty, Akshay Kamath, Rameshwar Pratap. 47-50
- Balanced Abelian group valued functions on directed graphs: Extended abstractYonah Cherniavsky, Avraham Goldstein, Vadim E. Levit. 51-54
- An oriented 8-coloring for acyclic oriented graphs with maximum degree 3Hebert Coelho, Luerbio Faria, Sylvain Gravier, Sulamita Klein. 55-58
- Bound-optimal cutting planesStefano Coniglio. 59-62
- On specifying boundary conditions for the graph sandwich problemFernanda Couto, Luerbio Faria, Sulamita Klein, Loana Tito Nogueira, Fábio Protti. 63-66
- A tight bound on the number of minimal dominating sets in split graphJean-François Couturier, Mathieu Liedloff. 67-70
- A quantization framework for smoothed analysis on Euclidean optimization problemsRadu Curticapean, Marvin Künnemann. 71-74
- Linear time and almost linear time cases for minimal elimination orderingsElias Dahlhaus. 75-78
- On total coloring and equitable total coloring of cubic graphs with large girthSimone Dantas, C. M. H. de Figueiredo, Giuseppe Mazzuoccolo, M. Preissmann, V. F. dos Santos, D. Sasaki. 79-83
- Routing ATM loading vehiclesEkrem Duman, Ahmet Altun. 85-88
- Performance guarantees for scheduling algorithms under perturbed machine speedsMichael Etscheid. 89-92
- Observation and evolution of finite-dimensional Markov systemsUlrich Faigle, Alexander Schönhuth. 93-97
- Optimal cost sharing for capacitated facility location gamesPhilipp von Falkenhausen, Tobias Harks. 99-102
- Exact and heuristic algorithms for the green vehicle routing problemÁngel Felipe Ortega, M. Teresa Ortuño Sánchez, Gregorio Tirado Domínguez, Giovanni Righini. 103-106
- Fooling-sets and rank in nonzero characteristicMirjam Friesen, Dirk Oliver Theis. 107-111
- Coloring of paths into forestsGiulia Galbiati, Stefano Gualandi. 113-116
- A linear kernel for planar red-blue dominating setValentin Garnero, Ignasi Sau, Dimitrios M. Thilikos. 117-120
- The double projection method for some domination related parameters in Cartesian product graphsIsmael González Yero, Amaurys Rondón Aguilar. 121-124
- Two-dimensional optimal mechanism design for a single machine scheduling problemRuben Hoeksma, Marc Uetz. 125-127
- Application of the descent with mutations (DWM) metaheuristic to the computation of a median equivalence relationOlivier Hudry. 129-132
- Relaxation of 3-partition instancesSebastiaan J. C. Joosten, Hans Zantema. 133-136
- Semi blowup and blowup snarks and Berge-Fulkerson ConjectureK. Karam, D. Sasaki. 137-140
- An extension of the Collatz functionRoland Kaschek, Alexander Krumpholz. 141-144
- Constructing strategies in subclasses of McNaughton gamesImran Khaliq, Gulshad Imran. 145-149
- Toward a precise integrality gap for triangle-free 2-matchingsPhilipp Klodt, Anke van Zuylen. 151-154
- Handelman's hierarchy for the maximum stable set problemMonique Laurent, Zhao Sun. 155-158
- A new upper bound for the traveling salesman problem in cubic graphsMaciej Liskiewicz, Martin R. Schuster. 159-162
- Manufacturing process flexibility with robust optimization using AIMMSOvidiu Listes. 163
- Optimal paths in networks with rated transition time costsDmitrii Lozovanu, Stefan Pickl. 165-168
- Linearization of ancestral multichromosomal genomesJán Manuch, Murray Patterson, Roland Wittler, Cedric Chauve, Eric Tannier. 169-173
- A branch-and-cut algorithm for the angular TSPIsabel Méndez-Díaz, Federico Pousa, Paula Zabala. 175-178
- Star-shaped mediation in influence gamesXavier Molinero, Fabián Riquelme, Maria J. Serna. 179-182
- Characterising subclasses of perfect graphs with respect to partial orders related to edge contractionHaiko Müller, Samuel Wilson. 183-186
- The VC-dimension of graphs with respect to k-connected subgraphsAndrea Munaro. 187-190
- Coloring of signed graphsS. Pirzada, Muhammad Ali Khan, E. Sampathkumar. 191-195
- Approximation results for the linear ordering problem on interval graphsAlain Quilliot, Djamal Rebaine. 197-200
- Hazmat transportation problem: instance size reduction through centrality erosionFabio Roda. 201-204
- Parameterized and/or graph solutionUéverton dos Santos Souza, Fábio Protti, Maise Dantas da Silva. 205-208
- Finding the colors of the secret in MastermindThatchaphol Saranurak. 209-212
- 1-factors and circuits of cubic graphsEckhard Steffen. 213-216
- On the generality of the greedy algorithm for solving matroid problemsLara Turner, Matthias Ehrgott, Horst W. Hamacher. 217-220
- Graph products for faster separation of 1-wheel inequalitiesSven de Vries. 219-222