- Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract). CTW 2015: 20-23 - Manoel B. Campêlo, Alexandre S. Freire, Phablo F. S. Moura, Yoshiko Wakabayashi:
Convex recoloring: inapproximability and a polyhedral study. CTW 2015: 117-120 - Manoel B. Campêlo, Phablo F. S. Moura, Marcio Costa Santos:
Facet-defining inequalities for the representatives k-fold coloring polytope. CTW 2015: 73-76 - Alberto Ceselli, Maria Luisa Damiani, Giovanni Righini, Diego Valorsi:
Mathematical programming algorithms for spatial cloaking. CTW 2015: 217-220 - Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros:
A Fixed Parameter Algorithm for Plane Subgraph Completion. CTW 2015: 97-100 - Huda Chuangpishit, Jeannette C. M. Janssen:
Recognition of certain square geometric graphs. CTW 2015: 265-268 - Denis Cornaz, Fabio Furini, Enrico Malaguti:
Solving Vertex Coloring Problems as Maximum Weighted Stable Set Problems. CTW 2015: 36-39 - Kamiel Cornelissen, Bodo Manthey:
Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm. CTW 2015: 157-160 - Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein:
On the forbidden induced subgraph probe problem. CTW 2015: 231-234 - Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Celina M. H. de Figueiredo:
Sorting Separable Permutations by Restricted Multi-break Rearrangements. CTW 2015: 145-148 - Marc Demange, Tínaz Ekim, Bernard Ries:
On the Minimum and Maximum Selective Graph Coloring Problems. CTW 2015: 189-192 - Gustavo Dias, Leo Liberti, Nelson Maculan:
Modelling Rank Constraints in Mathematical Programming. CTW 2015: 193-196 - Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom:
Equimatchable Graphs are C_2k+1-free for k ≥ 4. CTW 2015: 125-128 - Márcio Antônio Duarte, Lucia Draque Penso, Dieter Rautenbach, Uéverton S. Souza:
The P3-Convexity in the Complementary Prism of a Graph. CTW 2015: 225-228 - Daniel Freund, David P. Williamson:
MC4, Copeland and restart probabilities. CTW 2015: 5-8 - Ana Luísa C. Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier:
Timber Game with Caterpillars. CTW 2015: 93-96 - Daya Ram Gaur, Shahadat Hossain, Rishi Ranjan Singh:
Star Bi-Coloring of Bipartite Graphs using Column Generation. CTW 2015: 250-253 - Ioannis Giotis, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos:
An alternative proof for the constructive Asymmetric Lovász Local Lemma. CTW 2015: 89-92 - Corinna Gottschalk, Britta Peis:
Submodular Function Maximization on the Bounded Integer Lattice. CTW 2015: 16-19 - Didem Gözüpek, Mordechai Shalom:
Edge Coloring with Minimum Reload/Changeover Costs. CTW 2015: 205-208 - Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks:
Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs. CTW 2015: 201-204 - Ervin Györi, Gyula Y. Katona, László F. Papp:
Optimal pebbling of grids. CTW 2015: 213-216 - Alessandro Hill, Edna Ayako Hoshino:
A branch and price algorithm for the capacitated ring tree problem. CTW 2015: 273-276 - Christopher Hojny, Marc E. Pfetsch:
Symmetry Handling via Symmetry Breaking Polytopes. CTW 2015: 63-66 - David Juedes, Jeffrey Jones:
A Generic Framework for Approximation Analysis for Algorithms for Star Bicoloring. CTW 2015: 185-188 - Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane:
A Branch-and-Price Algorithm for Optimal Decoding in LDPC-Based Communications. CTW 2015: 141-144 - Deborah King, Yang Li, Sanming Zhou:
Linear and cyclic distance-three labellings of trees. CTW 2015: 133-136 - M. Selcuk Korkmaz, Serol Bulkan, Ekrem Duman:
A New TDVRP (Time Dependent Vehicle Routing Problem) Model and its Solution by Genetic Algorithm. CTW 2015: 229-230 - Marcin Krzywkowski, Nader Jafari Rad, Sayyed Heidar Jafari:
On the intersection graphs of subspaces of a vector space. CTW 2015: 289-291 - Marvin Künnemann, Bodo Manthey:
On the Smoothed Approximation Ratio of the 2-Opt Heuristic for the TSP. CTW 2015: 1-4