| Authors | Paper title |
|---|
| Huseyin Acan, Sankardeep Chakraborty, Seungbum Jo and Srinivasa Rao Satti | Succinct Data Structures for Families of Interval Graphs |
| Tommaso Adamo, Gianpaolo Ghiani and Emanuela Guerriero | An enhanced lower bound for the Time-Dependent Traveling Salesman Problem |
| Wissal Ben Amor, Amal Gassara and Ismael Bouassida Rodriguez | Extending Bigraphical Language with Labels |
| Saeid Kazemzadeh Azad | Combinatorial optimization in structural engineering: recent trends and future needs |
| Amotz Bar-Noy, Toni Böhnlein, David Peleg and Dror Rawitz | Vertex-Weighted Realizations of Graphs |
| Christoph Buchheim and Dorothee Henke | The robust bilevel continuous knapsack problem |
| Marco Casazza, Alberto Ceselli and Giovanni Righini | A single machine on-time-in-full scheduling problem |
| Martina Cerulli, Leo Liberti and Claudia D'Ambrosio | On aircraft deconfliction by bilevel programming |
| Victor Cohen and Axel Parmentier | Linear Programming for Decision Processes with Partial Information |
| Matteo Cosmi, Gaia Nicosia and Andrea Pacifici | Lower bounds for a meal pickup-and-delivery scheduling problem |
| Matthias Feldotto, Pascal Lenzner, Louise Molitor and Alexander Skopalik | From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation |
| Samuel Fiorini, Krystal Guo, Marco Macchia and Matthias Walter | Lower Bound Computations for the Nonnegative Rank |
| Luisa Frickes, Simone Dantas and Atílio G. Luiz | The Graceful Game |
| Damián-Emilio Gibaja-Romero and Vanessa Cruz-Molina | A colorful generalization for the Poison Game |
| Benjamin Gras and Mathieu Liedloff | Enumeration of Minimal Connected Dominating Sets in chordal bipartite graphs |
| Zhiwei Guo, Hajo Broersma, Binlong Li and Shenggui Zhang | Compatible spanning circuits in edge-colored Fan-type graphs |
| Tim A. Hartmann, Gerhard J. Woeginger, Stefan Lendl and Alexander Grigoriev | Dispersing obnoxious facilities on a graph |
| Zacharias Heinrich and Rüdiger Reischuk | Improved Dynamic Kernels for Hitting-Set |
| Michael A. Henning, Arti Pandey and Vikash Tripathi | Algorithm and Hardness Result for Semipaired Domination in Graphs |
| Gabriele Iommazzo, Claudia D'Ambrosio, Antonio Frangioni and Leo Liberti | Algorithmic configuration by learning and optimization |
| Reinoud Joosten and Lalla Ruiz Eduardo | Inductive Shapley values in cooperative transportation games |
| Thomas Lachmann and Stefan Lendl | Efficient Algorithms for the Recoverable (Robust) Selection Problem |
| Dmitrii Lozovanu and Stefan Pickl | Stationary Nash Equilibria Conditions for Stochastic Positional Games |
| Radu Mincu, Camelia Obreja and Alexandru Popa | The graceful chromatic number for some particular classes of graphs |
| Samuel Mohr | On Uniquely Colourable Graphs |
| Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy, Edoardo Polimeno and Giovanni Righini | Optimally rescheduling jobs under LIFO constraints |
| Temel Öncan, M. Hakan AkyÜz and I. Kuban Altinel | An exact algorithm for the maximum weight perfect matching problem with conflicts |
| Xavier Ouvrard, Jean-Marie Le Goff and Stephane Marchand-Maillet | Multi-diffusion in Hb-graphs |
| Axel Parmentier, Victor Cohen, Vincent Leclere, Guillaume Obozinski and Joseph Salmon | Mathematical programming for influence diagrams |
| Julie Poullet and Axel Parmentier | Ground staff shift planning under delay uncertainty at Air France |
| Andreas Schwenk | On the Problem Class of Optimal Technology Implementation into a Multisectoral Energy System (OTIMES) |
| Michal Stern and Nili Guttmann-Beck | Clustered Feasibility by Breaking |
| Florian Thaeter | Hardness of k-anonymous microaggregation |
| Veerle Timmermans, Britta Peis and Stefan Lendl | Matroid Sum with Cardinality Constraints on the Intersection |
| Benito van der Zander, Johannes Textor and Maciej Liskiewicz | Graphical Methods for Finding Instrumental Variables |
| Wei Zheng, Hajo Broersma and Ligong Wang | Toughness and forbidden subgraphs for hamiltonian-connected graphs |
| Qiannan Zhou, Hajo Broersma, Ligong Wang and Yong Lu | On sufficient spectral radius conditions for hamiltonicity |
