default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12. CTW 2013: Enschede, Netherlands
- Kamiel Cornelissen, Ruben Hoeksma, Johann L. Hurink, Bodo Manthey:
12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Enschede, Netherlands, May 21-23, 2013. CTIT Workshop Proceedings WP 13-01, 2013 - Nair Maria Maia de Abreu, Maria Aguieiras A. de Freitas, Renata R. Del-Vecchio:
Simultaneously integral graphs on three associated matrices. CTW 2013: 7-10 - Stephan Dominique Andres, Winfried Hochstättler:
Perfect digraphs and a strong perfect digraph theorem. CTW 2013: 11-13 - Danilo Artigas, Simone Dantas, Mitre Costa Dourado, Jayme Luiz Szwarcfiter:
Geodetic sets and periphery. CTW 2013: 15-18 - Damián Bakarcic, Gabriela Di Piazza, Isabel Méndez-Díaz, Paula Zabala:
An IP based heuristic algorithm for the vehicle and crew scheduling pick-up and delivery problem with time windows. CTW 2013: 19-22 - Karl Bringmann, Benjamin Doerr, Adrian Neumann, Jakub Sliacan:
Online checkpointing with improved worst-case guarantees. CTW 2013: 23-26 - Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin:
Smoothed analysis of the successive shortest path algorithm. CTW 2013: 27-30 - Christoph Buchheim, Laura Klein:
The spanning tree problem with one quadratic term. CTW 2013: 31-34 - Christina Büsing, Fabio D'Andreagiovanni, Annie Raymond:
Robust optimization under multiband uncertainty. CTW 2013: 35-38 - Eglantine Camby, Oliver Schaudt:
Connected dominating set in graphs without long paths and cycles. CTW 2013: 39-42 - Márcia R. Cerioli, Daniel F. D. Posner:
Total L(2, 1)-coloring of graphs. CTW 2013: 43-46 - Sourav Chakraborty, Akshay Kamath, Rameshwar Pratap:
Testing uniformity of stationary distribution. CTW 2013: 47-50 - Yonah Cherniavsky, Avraham Goldstein, Vadim E. Levit:
Balanced Abelian group valued functions on directed graphs: Extended abstract. CTW 2013: 51-54 - Hebert Coelho, Luérbio Faria, Sylvain Gravier, Sulamita Klein:
An oriented 8-coloring for acyclic oriented graphs with maximum degree 3. CTW 2013: 55-58 - Stefano Coniglio:
Bound-optimal cutting planes. CTW 2013: 59-62 - Fernanda Couto, Luérbio Faria, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
On specifying boundary conditions for the graph sandwich problem. CTW 2013: 63-66 - Jean-François Couturier, Mathieu Liedloff:
A tight bound on the number of minimal dominating sets in split graph. CTW 2013: 67-70 - Radu Curticapean, Marvin Künnemann:
A quantization framework for smoothed analysis on Euclidean optimization problems. CTW 2013: 71-74 - Elias Dahlhaus:
Linear time and almost linear time cases for minimal elimination orderings. CTW 2013: 75-78 - Simone Dantas, Celina M. H. de Figueiredo, Giuseppe Mazzuoccolo, Myriam Preissmann, Vinícius Fernandes dos Santos, Diana Sasaki:
On total coloring and equitable total coloring of cubic graphs with large girth. CTW 2013: 79-83 - Ekrem Duman, Ahmet Altun:
Routing ATM loading vehicles. CTW 2013: 85-88 - Michael Etscheid:
Performance guarantees for scheduling algorithms under perturbed machine speeds. CTW 2013: 89-92 - Ulrich Faigle, Alexander Schönhuth:
Observation and evolution of finite-dimensional Markov systems. CTW 2013: 93-97 - Philipp von Falkenhausen, Tobias Harks:
Optimal cost sharing for capacitated facility location games. CTW 2013: 99-102 - Á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 - Mirjam Friesen, Dirk Oliver Theis:
Fooling-sets and rank in nonzero characteristic. CTW 2013: 107-111 - Giulia Galbiati, Stefano Gualandi:
Coloring of paths into forests. CTW 2013: 113-116 - Valentin Garnero, Ignasi Sau, Dimitrios M. Thilikos:
A linear kernel for planar red-blue dominating set. CTW 2013: 117-120 - 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 - Ruben Hoeksma, Marc Uetz:
Two-dimensional optimal mechanism design for a single machine scheduling problem. CTW 2013: 125-127 - Olivier Hudry:
Application of the descent with mutations (DWM) metaheuristic to the computation of a median equivalence relation. CTW 2013: 129-132 - 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 - 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 - Uéverton dos Santos Souza, Fábio Protti, Maise Dantas da Silva:
Parameterized and/or graph solution. CTW 2013: 205-208 - Thatchaphol Saranurak:
Finding the colors of the secret in Mastermind. CTW 2013: 209-212 - 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 - Ayumi Igarashi, Yoshitsugu Yamamoto:
Computational complexity of the average covering tree value. CTW 2013: 223-226
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.
last updated on 2025-11-07 00:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
