- Sebastiaan J. C. Joosten, Hans Zantema:
Relaxation of 3-partition instances. CTW 2013: 133-136 - Kaio Karam, Diana Sasaki:
Semi blowup and blowup snarks and Berge-Fulkerson Conjecture. CTW 2013: 137-140 - Roland H. Kaschek, Alexander Krumpholz:
An extension of the Collatz function. CTW 2013: 141-144 - Imran Khaliq, Gulshad Imran:
Constructing strategies in subclasses of McNaughton games. CTW 2013: 145-149 - Philipp Klodt, Anke van Zuylen:
Toward a precise integrality gap for triangle-free 2-matchings. CTW 2013: 151-154 - Monique Laurent, Zhao Sun:
Handelman's hierarchy for the maximum stable set problem. CTW 2013: 155-158 - Maciej Liskiewicz, Martin R. Schuster:
A new upper bound for the traveling salesman problem in cubic graphs. CTW 2013: 159-162 - Ovidiu Listes:
Manufacturing process flexibility with robust optimization using AIMMS. CTW 2013: 163 - Dmitrii Lozovanu, Stefan Pickl:
Optimal paths in networks with rated transition time costs. CTW 2013: 165-168 - Ján Manuch, Murray Patterson, Roland Wittler, Cédric Chauve, Eric Tannier:
Linearization of ancestral multichromosomal genomes. CTW 2013: 169-173 - Isabel Méndez-Díaz, Federico Pousa, Paula Zabala:
A branch-and-cut algorithm for the angular TSP. CTW 2013: 175-178 - Xavier Molinero, Fabián Riquelme, Maria J. Serna:
Star-shaped mediation in influence games. CTW 2013: 179-182 - Haiko Müller, Samuel Wilson:
Characterising subclasses of perfect graphs with respect to partial orders related to edge contraction. CTW 2013: 183-186 - Andrea Munaro:
The VC-dimension of graphs with respect to k-connected subgraphs. CTW 2013: 187-190 - Ángel Felipe Ortega, María Teresa Ortuño Sánchez, Gregorio Tirado Domínguez, Giovanni Righini:
Exact and heuristic algorithms for the green vehicle routing problem. CTW 2013: 103-106 - Shariefuddin Pirzada, Muhammad Ali Khan, E. Sampathkumar:
Coloring of signed graphs. CTW 2013: 191-195 - Alain Quilliot, Djamal Rebaine:
Approximation results for the linear ordering problem on interval graphs. CTW 2013: 197-200 - Fabio Roda:
Hazmat transportation problem: instance size reduction through centrality erosion. CTW 2013: 201-204 - Thatchaphol Saranurak:
Finding the colors of the secret in Mastermind. CTW 2013: 209-212 - Uéverton dos Santos Souza, Fábio Protti, Maise Dantas da Silva:
Parameterized and/or graph solution. CTW 2013: 205-208 - Eckhard Steffen:
1-factors and circuits of cubic graphs. CTW 2013: 213-216 - Lara Turner, Matthias Ehrgott, Horst W. Hamacher:
On the generality of the greedy algorithm for solving matroid problems. CTW 2013: 217-220 - Sven de Vries:
Graph products for faster separation of 1-wheel inequalities. CTW 2013: 219-222 - Ismael González Yero, Amaurys Rondón Aguilar:
The double projection method for some domination related parameters in Cartesian product graphs. CTW 2013: 121-124