Abstract is missing.
- On the Smoothed Approximation Ratio of the 2-Opt Heuristic for the TSPMarvin Künnemann, Bodo Manthey. 1-4
- MC4, Copeland and restart probabilitiesDaniel Freund 0001, David P. Williamson. 5-8
- Distinguishing Number and Circulant GraphsKahina Meslem, Sylvain Gravier, Souad Slimani. 9-11
- Double Auction with Limited Cover Money ModelAli Haydar Özer. 12-15
- Submodular Function Maximization on the Bounded Integer LatticeCorinna Gottschalk, Britta Peis. 16-19
- Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract)Tiziana Calamoneri, Angelo Monti, Rossella Petreschi. 20-23
- Performance Comparison of Metaheuristics for the Obstacle Neutralization ProblemRamazan Algin, Ali Fuat Alkaya, Vural Aksakalli. 24-27
- Solving the Integrated Shipment Routing Problem of a LTL CarrierOkan Örsan Özener. 28-31
- Locating-dominating sets in some families of split graphsGabriela R. Argiroffo, Silvia M. Bianchi, Annegret Wagler. 32-35
- Solving Vertex Coloring Problems as Maximum Weighted Stable Set ProblemsDenis Cornaz, Fabio Furini, Enrico Malaguti. 36-39
- An Assignment Problem with Compactness Requirements: Models and AlgorithmsAlain Quilliot. 40-43
- Coloring Interval Graphs while Minimizing End-Point NumberAlain Quilliot. 44-47
- Lower Bounds for Cover-Free FamiliesNader H. Bshouty, Ali Z. Abdi. 48-51
- Forwarding Indices of Some Subdivision GraphsMohamed Amine Boutiche. 52-54
- Price of Fairness for Multiagent Subset Sum ProblemsGaia Nicosia, Andrea Pacifici, Ulrich Pferschy. 55-58
- Probabilistic constrained dominating treesPablo Adasme, Rafael Andrade, Abdel Lisser. 59-62
- Symmetry Handling via Symmetry Breaking PolytopesChristopher Hojny, Marc E. Pfetsch. 63-66
- On the non-unit count of interval graphsAlexander Apke, Rainer Schrader. 67-68
- Neighbor Rupture Degree of a Graph with Maximum ConnectivityGoksen Bacak-Turan, Ferhan Nihan Altundag. 69-72
- Facet-defining inequalities for the representatives k-fold coloring polytopeManoel B. Campêlo, Phablo F. S. Moura, Marcio C. Santos. 73-76
- Heuristic Solutions to a Mailroom Inserting Machine Planning ProblemAndrea Bettinelli, Sandro Bosio, Valentina Cacchiani. 77-80
- Heuristic algorithms for obtaining Polynomial Threshold Functions with low densitiesCan Eren Sezener, Erhan Öztop. 81-84
- Relaxed Locally Identifying Coloring of GraphsMéziane Aïder, Sylvain Gravier, Souad Slimani. 85-88
- An alternative proof for the constructive Asymmetric Lovász Local LemmaIoannis Giotis 0001, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos. 89-92
- Timber Game with CaterpillarsAna Luísa Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier. 93-96
- A Fixed Parameter Algorithm for Plane Subgraph CompletionDimitris Chatzidimitriou, Archontia C. Giannopoulou, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros. 97-100
- Stability of probablisitic two-stage permutation flowshop problemBouyahia Zied, Bellalouna Monia, Ghedira Khaled. 101-104
- The Graphs of Structured ProgrammingLucila M. S. Bento, Davidson R. Boccardo, Raphael Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter. 105-108
- The locating chromatic number of (n-3)-regular graphsSuhadi Wido Saputro. 109-112
- Bi-matrix Game with Random PayoffsVikas Vikram Singh, Oualid Jouini, Abdel Lisser. 113-116
- Convex recoloring: inapproximability and a polyhedral studyManoel B. Campêlo, Alexandre S. Freire, Phablo F. S. Moura, Yoshiko Wakabayashi. 117-120
- On Hamiltonian Cycles in Kneser GraphsFelipe De Campos Mesquita, Letícia Rodrigues Bueno, Rodrigo de Alencar Hausen, Uéverton dos Santos Souza. 121-124
- Equimatchable Graphs are C_2k+1-free for k ≥ 4Cemil Dibek, Tinaz Ekim, Didem Gözüpek, Mordechai Shalom. 125-128
- Minimum Cost Noncrossing Flow Problem on a Layered NetworkYavuz Bogaç Türkogullari, I. Kuban Altinel, Z. Caner Taskin, Zeynep Suvak, Necati Aras. 129-132
- Linear and cyclic distance-three labellings of treesDeborah King, Yang Li, Sanming Zhou. 133-136
- Recursive cube of ringsHamid Mokhtar, Sanming Zhou. 137-140
- A Branch-and-Price Algorithm for Optimal Decoding in LDPC-Based CommunicationsBanu Kabakulak, Z. Caner Taskin, Ali Emre Pusane. 141-144
- Sorting Separable Permutations by Restricted Multi-break RearrangementsLuís Felipe I. Cunha, Luis Antonio Brasil Kowada, Celina M. H. de Figueiredo. 145-148
- An Extension of Dirac's Theorem on HamiltonicityYasemin Büyükçolak, Didem Gözüpek, Sibel Özkan. 149-152
- Determining Nash Equilibria for Dynamic Positional Games on NetworksDmitrii Lozovanu, Stefan Pickl. 153-156
- Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex AlgorithmKamiel Cornelissen, Bodo Manthey. 157-160
- Competitive Analysis of the Storage Management ProblemEsther Mohr. 161-164
- Modeling Poset Convex SubsetsMaurice Queyranne, Laurence Wolsey. 165-168
- How to Hunt an Invisible Rabbit on a GraphTatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach, Michal Pilipczuk. 169-172
- Fleet management of autonomous vehicles: VIPAFLEETSahar Bsaybes, Alain Quilliot, Annegret Wagler. 173-176
- Computing Bounds for Eternal DominationAndrei Braga, Cid C. de Souza, Orlando Lee. 177-180
- On the decomposition of quaternary signed-graphic matroidsKonstantinos Papalamprou, Leonidas S. Pitsoulis, Eleni-Maria Vretta. 181-184
- A Generic Framework for Approximation Analysis for Algorithms for Star BicoloringDavid Juedes, Jeffrey Jones. 185-188
- On the Minimum and Maximum Selective Graph Coloring ProblemsMarc Demange, Tinaz Ekim, Bernard Ries. 189-192
- Modelling Rank Constraints in Mathematical ProgrammingGustavo Dias, Leo Liberti, Nelson Maculan. 193-196
- Complexity of Geodetic Number Problem in Graphs with Maximum Degree 4Uéverton S. Souza, Letícia Rodrigues Bueno, Lucia Draque Penso, Dieter Rautenbach, Fábio Protti. 197-200
- Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth GraphsDidem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks. 201-204
- Edge Coloring with Minimum Reload/Changeover CostsDidem Gözüpek, Mordechai Shalom. 205-208
- Algorithmic Aspects of the Positive Semidefinite Zero ForcingBoting Yang. 209-212
- Optimal pebbling of gridsErvin Györi, Gyula Y. Katona, László F. Papp. 213-216
- Mathematical programming algorithms for spatial cloakingAlberto Ceselli, Maria Luisa Damiani, Giovanni Righini, Diego Valorsi. 217-220
- The Offline Carpool ProblemSaad Mneimneh, Saman Farhat. 221-224
- The P3-Convexity in the Complementary Prism of a GraphMárcio Antônio Duarte, Lucia Draque Penso, Dieter Rautenbach, Uéverton S. Souza. 225-228
- A New TDVRP (Time Dependent Vehicle Routing Problem) Model and its Solution by Genetic AlgorithmM. Selcuk Korkmaz, Serol Bulkan, Ekrem Duman. 229-230
- On the forbidden induced subgraph probe problemFernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein. 231-234
- c^2-join of graphsM. A. Shalu, S. Devi Yamini. 235-238
- The Hamilton-Waterloo Problem with C4 and Cm FactorsUgur Odabasi, Sibel Özkan. 239-241
- Polynomial time algorithm for the k-in-a-tree problem on chordal graphsVinícius Fernandes dos Santos, Murilo V. G. da Silva, Jayme Luiz Szwarcfiter. 242-245
- Super Connectivity of Generalized Petersen GraphsGülnaz Boruzanli, John Baptist Gauci. 246-249
- Star Bi-Coloring of Bipartite Graphs using Column GenerationDaya Ram Gaur, Shahadat Hossain, Rishi Ranjan Singh. 250-253
- Developing an Exact Method for the Obstacle Neutralization ProblemDindar Öz, Ali Fuat Alkaya, Vural Aksakalli. 254-257
- Graphs with certain locating-chromatic numberEdy Tri Baskoro. 258-260
- Stochastic bilevel network design problemsChuan Xu, Alexei A. Gaivoronski, Abdel Lisser. 261-264
- Recognition of certain square geometric graphsHuda Chuangpishit, Jeannette C. M. Janssen. 265-268
- Balanced matchings, unbalanced ones and related problemsKatarzyna E. Paluch. 269-272
- A branch and price algorithm for the capacitated ring tree problemAlessandro Hill, Edna Ayako Hoshino. 273-276
- A Java Implementation of the Branch and Bound Algorithm : the Probabilistic Traveling Salesman ProblemSoumaya Sassi Mahfoudh, Walid Khaznaji, Monia Bellalouna. 277-280
- A Snail Heuristic for the Euclidean Traveling Salesman ProblemMonia Bellalouna, Walid Khaznaji, Mohamed Abdellahi Amar. 281-284
- Local metric dimension of subgraph-amalgamation of graphsGabriel A. Barragán-Ramírez, Rinovia Simanjuntak, Saladin Uttunggadewa, Suhadi Wido Saputro. 285-288
- On the intersection graphs of subspaces of a vector spaceMarcin Krzywkowski, Nader Jafari Rad, Sayyed Heidar Jafari. 289-291
- Broadcasts in Complementary PrismsIsma Bouchemakh, Ibrahim Boufelgha, Meriem Moulay. 292-294
- Approaches for optimizing cross-sell and up-sell opportunities in campaignsMustafa Agaoglu, Ekrem Duman, A. Hande Erol Binguler. 295-298