default search action
13. CTW 2015: Istanbul, Turkey
- Ekrem Duman, Ali Fuat Alkaya:
13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, Istanbul, Turkey, May 26-28, 2015. 2015 - Marvin Künnemann, Bodo Manthey:
On the Smoothed Approximation Ratio of the 2-Opt Heuristic for the TSP. CTW 2015: 1-4 - Daniel Freund, David P. Williamson:
MC4, Copeland and restart probabilities. CTW 2015: 5-8 - Kahina Meslem, Sylvain Gravier, Souad Slimani:
Distinguishing Number and Circulant Graphs. CTW 2015: 9-11 - Ali Haydar Özer:
Double Auction with Limited Cover Money Model. CTW 2015: 12-15 - Corinna Gottschalk, Britta Peis:
Submodular Function Maximization on the Bounded Integer Lattice. CTW 2015: 16-19 - Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract). CTW 2015: 20-23 - Ramazan Algin, Ali Fuat Alkaya, Vural Aksakalli:
Performance Comparison of Metaheuristics for the Obstacle Neutralization Problem. CTW 2015: 24-27 - Okan Örsan Özener:
Solving the Integrated Shipment Routing Problem of a LTL Carrier. CTW 2015: 28-31 - Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Wagler:
Locating-dominating sets in some families of split graphs. CTW 2015: 32-35 - Denis Cornaz, Fabio Furini, Enrico Malaguti:
Solving Vertex Coloring Problems as Maximum Weighted Stable Set Problems. CTW 2015: 36-39 - Alain Quilliot:
An Assignment Problem with Compactness Requirements: Models and Algorithms. CTW 2015: 40-43 - Alain Quilliot:
Coloring Interval Graphs while Minimizing End-Point Number. CTW 2015: 44-47 - Nader H. Bshouty, Ali Z. Abdi:
Lower Bounds for Cover-Free Families. CTW 2015: 48-51 - Mohamed Amine Boutiche:
Forwarding Indices of Some Subdivision Graphs. CTW 2015: 52-54 - Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Price of Fairness for Multiagent Subset Sum Problems. CTW 2015: 55-58 - Pablo Adasme, Rafael Andrade, Abdel Lisser:
Probabilistic constrained dominating trees. CTW 2015: 59-62 - Christopher Hojny, Marc E. Pfetsch:
Symmetry Handling via Symmetry Breaking Polytopes. CTW 2015: 63-66 - Alexander Apke, Rainer Schrader:
On the non-unit count of interval graphs. CTW 2015: 67-68 - Goksen Bacak-Turan, Ferhan Nihan Altundag:
Neighbor Rupture Degree of a Graph with Maximum Connectivity. CTW 2015: 69-72 - 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 - Andrea Bettinelli, Sandro Bosio, Valentina Cacchiani:
Heuristic Solutions to a Mailroom Inserting Machine Planning Problem. CTW 2015: 77-80 - Can Eren Sezener, Erhan Öztop:
Heuristic algorithms for obtaining Polynomial Threshold Functions with low densities. CTW 2015: 81-84 - Méziane Aïder, Sylvain Gravier, Souad Slimani:
Relaxed Locally Identifying Coloring of Graphs. CTW 2015: 85-88 - 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 - Ana Luísa C. Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier:
Timber Game with Caterpillars. CTW 2015: 93-96 - 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 - Zied Bouyahia, Monia Bellalouna, Khaled Ghédira:
Stability of probablisitic two-stage permutation flowshop problem. CTW 2015: 101-104 - Lucila M. S. Bento, Davidson R. Boccardo, Raphael Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
The Graphs of Structured Programming. CTW 2015: 105-108 - Suhadi Wido Saputro:
The locating chromatic number of (n-3)-regular graphs. CTW 2015: 109-112 - Vikas Vikram Singh, Oualid Jouini, Abdel Lisser:
Bi-matrix Game with Random Payoffs. CTW 2015: 113-116 - Manoel B. Campêlo, Alexandre S. Freire, Phablo F. S. Moura, Yoshiko Wakabayashi:
Convex recoloring: inapproximability and a polyhedral study. CTW 2015: 117-120 - Felipe De Campos Mesquita, Letícia Rodrigues Bueno, Rodrigo de Alencar Hausen, Uéverton dos Santos Souza:
On Hamiltonian Cycles in Kneser Graphs. CTW 2015: 121-124 - 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 - Yavuz Bogaç Türkogullari, I. Kuban Altinel, Z. Caner Taskin, Zeynep Suvak, Necati Aras:
Minimum Cost Noncrossing Flow Problem on a Layered Network. CTW 2015: 129-132 - Deborah King, Yang Li, Sanming Zhou:
Linear and cyclic distance-three labellings of trees. CTW 2015: 133-136 - Hamid Mokhtar, Sanming Zhou:
Recursive cube of rings. CTW 2015: 137-140 - Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane:
A Branch-and-Price Algorithm for Optimal Decoding in LDPC-Based Communications. CTW 2015: 141-144 - 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 - Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan:
An Extension of Dirac's Theorem on Hamiltonicity. CTW 2015: 149-152 - Dmitrii Lozovanu, Stefan Pickl:
Determining Nash Equilibria for Dynamic Positional Games on Networks. CTW 2015: 153-156 - Kamiel Cornelissen, Bodo Manthey:
Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm. CTW 2015: 157-160 - Esther Mohr:
Competitive Analysis of the Storage Management Problem. CTW 2015: 161-164 - Maurice Queyranne, Laurence A. Wolsey:
Modeling Poset Convex Subsets. CTW 2015: 165-168 - Tatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach, Michal Pilipczuk:
How to Hunt an Invisible Rabbit on a Graph. CTW 2015: 169-172 - Sahar Bsaybes, Alain Quilliot, Annegret Wagler:
Fleet management of autonomous vehicles: VIPAFLEET. CTW 2015: 173-176 - Andrei Braga, Cid C. de Souza, Orlando Lee:
Computing Bounds for Eternal Domination. CTW 2015: 177-180 - Konstantinos Papalamprou, Leonidas S. Pitsoulis, Eleni-Maria E. Vretta:
On the decomposition of quaternary signed-graphic matroids. CTW 2015: 181-184 - David Juedes, Jeffrey Jones:
A Generic Framework for Approximation Analysis for Algorithms for Star Bicoloring. CTW 2015: 185-188 - 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 - Uéverton S. Souza, Letícia Rodrigues Bueno, Lucia Draque Penso, Dieter Rautenbach, Fábio Protti:
Complexity of Geodetic Number Problem in Graphs with Maximum Degree 4. CTW 2015: 197-200 - Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks:
Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs. CTW 2015: 201-204 - Didem Gözüpek, Mordechai Shalom:
Edge Coloring with Minimum Reload/Changeover Costs. CTW 2015: 205-208 - Boting Yang:
Algorithmic Aspects of the Positive Semidefinite Zero Forcing. CTW 2015: 209-212 - Ervin Györi, Gyula Y. Katona, László F. Papp:
Optimal pebbling of grids. CTW 2015: 213-216 - Alberto Ceselli, Maria Luisa Damiani, Giovanni Righini, Diego Valorsi:
Mathematical programming algorithms for spatial cloaking. CTW 2015: 217-220 - Saad Mneimneh, Saman Farhat:
The Offline Carpool Problem. CTW 2015: 221-224 - 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 - 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 - Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein:
On the forbidden induced subgraph probe problem. CTW 2015: 231-234 - M. A. Shalu, S. Devi Yamini:
c^2-join of graphs. CTW 2015: 235-238 - Ugur Odabasi, Sibel Özkan:
The Hamilton-Waterloo Problem with C4 and Cm Factors. CTW 2015: 239-241 - Vinícius Fernandes dos Santos, Murilo V. G. da Silva, Jayme Luiz Szwarcfiter:
Polynomial time algorithm for the k-in-a-tree problem on chordal graphs. CTW 2015: 242-245 - Gülnaz Boruzanli, John Baptist Gauci:
Super Connectivity of Generalized Petersen Graphs. CTW 2015: 246-249 - Daya Ram Gaur, Shahadat Hossain, Rishi Ranjan Singh:
Star Bi-Coloring of Bipartite Graphs using Column Generation. CTW 2015: 250-253 - Dindar Öz, Ali Fuat Alkaya, Vural Aksakalli:
Developing an Exact Method for the Obstacle Neutralization Problem. CTW 2015: 254-257 - Edy Tri Baskoro:
Graphs with certain locating-chromatic number. CTW 2015: 258-260 - Chuan Xu, Alexei A. Gaivoronski, Abdel Lisser:
Stochastic bilevel network design problems. CTW 2015: 261-264 - Huda Chuangpishit, Jeannette C. M. Janssen:
Recognition of certain square geometric graphs. CTW 2015: 265-268 - Katarzyna E. Paluch:
Balanced matchings, unbalanced ones and related problems. CTW 2015: 269-272 - Alessandro Hill, Edna Ayako Hoshino:
A branch and price algorithm for the capacitated ring tree problem. CTW 2015: 273-276 - Soumaya Sassi Mahfoudh, Walid Khaznaji, Monia Bellalouna:
A Java Implementation of the Branch and Bound Algorithm : the Probabilistic Traveling Salesman Problem. CTW 2015: 277-280 - Monia Bellalouna, Walid Khaznaji, Mohamed Abdellahi Amar:
A Snail Heuristic for the Euclidean Traveling Salesman Problem. CTW 2015: 281-284 - Gabriel A. Barragán-Ramírez, Rinovia Simanjuntak, Saladin Uttunggadewa, Suhadi Wido Saputro:
Local metric dimension of subgraph-amalgamation of graphs. CTW 2015: 285-288 - Marcin Krzywkowski, Nader Jafari Rad, Sayyed Heidar Jafari:
On the intersection graphs of subspaces of a vector space. CTW 2015: 289-291 - Isma Bouchemakh, Ibrahim Boufelgha, Meriem Moulay:
Broadcasts in Complementary Prisms. CTW 2015: 292-294 - Mustafa Agaoglu, Ekrem Duman, A. Hande Erol Binguler:
Approaches for optimizing cross-sell and up-sell opportunities in campaigns. CTW 2015: 295-298
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.