CTW

Keyphrases

Publications

2015

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)
Andrea Bettinelli, Sandro Bosio, Valentina Cacchiani
Heuristic Solutions to a Mailroom Inserting Machine Planning Problem. CTW (2015)
Gülnaz Boruzanli, John Baptist Gauci
Super Connectivity of Generalized Petersen Graphs. CTW (2015)
Denis Cornaz, Fabio Furini, Enrico Malaguti
Solving Vertex Coloring Problems as Maximum Weighted Stable Set Problems. CTW (2015)
Alexander Apke, Rainer Schrader
On the non-unit count of interval graphs. CTW (2015)
Okan Örsan Özener
Solving the Integrated Shipment Routing Problem of a LTL Carrier. CTW (2015)
Maurice Queyranne, Laurence A. Wolsey
Modeling Poset Convex Subsets. CTW (2015)
Konstantinos Papalamprou, Leonidas S. Pitsoulis, Eleni-Maria E. Vretta
On the decomposition of quaternary signed-graphic matroids. CTW (2015)
Boting Yang
Algorithmic Aspects of the Positive Semidefinite Zero Forcing. CTW (2015)
Nader H. Bshouty, Ali Z. Abdi
Lower Bounds for Cover-Free Families. CTW (2015)
Corinna Gottschalk, Britta Peis
Submodular Function Maximization on the Bounded Integer Lattice. CTW (2015)
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan
An Extension of Dirac's Theorem on Hamiltonicity. CTW (2015)
Marvin Künnemann, Bodo Manthey
On the Smoothed Approximation Ratio of the 2-Opt Heuristic for the TSP. CTW (2015)
Edy Tri Baskoro
Graphs with certain locating-chromatic number. CTW (2015)
Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Celina M. H. de Figueiredo
Sorting Separable Permutations by Restricted Multi-break Rearrangements. CTW (2015)
Alberto Ceselli, Maria Luisa Damiani, Giovanni Righini, Diego Valorsi
Mathematical programming algorithms for spatial cloaking. CTW (2015)
Vikas Vikram Singh, Oualid Jouini, Abdel Lisser
Bi-matrix Game with Random Payoffs. CTW (2015)
Andrei Braga, Cid C. de Souza, Orlando Lee
Computing Bounds for Eternal Domination. CTW (2015)
Monia Bellalouna, Walid Khaznaji, Mohamed Abdellahi Amar
A Snail Heuristic for the Euclidean Traveling Salesman Problem. CTW (2015)
Esther Mohr
Competitive Analysis of the Storage Management Problem. CTW (2015)
Suhadi Wido Saputro
The locating chromatic number of (n-3)-regular graphs. CTW (2015)
Daniel Freund, David P. Williamson
MC4, Copeland and restart probabilities. CTW (2015)
Chuan Xu, Alexei A. Gaivoronski, Abdel Lisser
Stochastic bilevel network design problems. CTW (2015)
M. A. Shalu, S. Devi Yamini
c^2-join of graphs. CTW (2015)
Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom
Equimatchable Graphs are C_2k+1-free for k ≥ 4. CTW (2015)
Tiziana Calamoneri, Angelo Monti, Rossella Petreschi
Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract). CTW (2015)
Christopher Hojny, Marc E. Pfetsch
Symmetry Handling via Symmetry Breaking Polytopes. CTW (2015)
Gustavo Dias, Leo Liberti, Nelson Maculan
Modelling Rank Constraints in Mathematical Programming. CTW (2015)
Mohamed Amine Boutiche
Forwarding Indices of Some Subdivision Graphs. CTW (2015)
Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks
Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs. CTW (2015)
Manoel B. Campêlo, Phablo F. S. Moura, Marcio Costa Santos
Facet-defining inequalities for the representatives k-fold coloring polytope. CTW (2015)
Manoel B. Campêlo, Alexandre S. Freire, Phablo F. S. Moura, Yoshiko Wakabayashi
Convex recoloring: inapproximability and a polyhedral study. CTW (2015)
Didem Gözüpek, Mordechai Shalom
Edge Coloring with Minimum Reload/Changeover Costs. CTW (2015)
Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein
On the forbidden induced subgraph probe problem. CTW (2015)
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)
Ana Luísa Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier
Timber Game with Caterpillars. CTW (2015)
Ali Haydar Özer
Double Auction with Limited Cover Money Model. CTW (2015)
M. Selcuk Korkmaz, Serol Bulkan, Ekrem Duman
A New TDVRP (Time Dependent Vehicle Routing Problem) Model and its Solution by Genetic Algorithm. CTW (2015)
Dmitrii Lozovanu, Stefan Pickl
Determining Nash Equilibria for Dynamic Positional Games on Networks. CTW (2015)
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)
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)
Alessandro Hill, Edna Ayako Hoshino
A branch and price algorithm for the capacitated ring tree problem. CTW (2015)
Kahina Meslem, Sylvain Gravier, Souad Slimani
Distinguishing Number and Circulant Graphs. CTW (2015)
Huda Chuangpishit, Jeannette C. M. Janssen
Recognition of certain square geometric graphs. CTW (2015)
Marc Demange, Tínaz Ekim, Bernard Ries
On the Minimum and Maximum Selective Graph Coloring Problems. CTW (2015)
Zied Bouyahia, Monia Bellalouna, Khaled Ghédira
Stability of probablisitic two-stage permutation flowshop problem. CTW (2015)
Katarzyna E. Paluch
Balanced matchings, unbalanced ones and related problems. CTW (2015)
Kamiel Cornelissen, Bodo Manthey
Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm. CTW (2015)
Alain Quilliot
Coloring Interval Graphs while Minimizing End-Point Number. CTW (2015)
Alain Quilliot
An Assignment Problem with Compactness Requirements: Models and Algorithms. CTW (2015)