CTW 2013 - Accepted Papers

List of Accepted Papers – CTW 2013

Shariefuddin Pirzada, Muhammad Ali Khan and E Sampathkumar. Coloring of signed graphs
Ismael González Yero and Amaurys Rondón Aguilar. The double projection method for some domination related parameters in Cartesian product graphs
Monique Laurent and Zhao Sun. Handelman's hierarchy for the maximum stable set problem
Ayumi Igarashi and Yoshitsugu Yamamoto. Computational complexity of the average covering tree value
Haiko Muller and Sam Wilson. Characterising subclasses of perfect graphs with respect to partial orders related to edge contraction
Stephan Dominique Andres and Winfried Hochstättler. Perfect digraphs and a strong perfect digraph theorem
Christoph Buchheim and Laura Klein. The Spanning Tree Problem with One Quadratic Term
Maciej Liskiewicz and Martin R. Schuster. A New Upper Bound for the Traveling Salesman Problem in Cubic Graphs
Sebastiaan Joosten and Hans Zantema. Relaxation of 3-partition instances
Stefano Gualandi and Giulia Galbiati. Coloring of Paths into Forests
Xavier Molinero, Fabián Riquelme and Maria Serna. Star-shaped mediation in influence games
Eckhard Steffen. 1-factors and circuits of cubic graphs
Jean-François Couturier and Mathieu Liedloff. A tight bound on the number of minimal dominating sets in split graph
Andrea Munaro. The VC-Dimension of Graphs with Respect to k-Connected Subgraphs
Simone Dantas, Celina M. H. de Figueiredo, Giuseppe Mazzuoccolo, Myriam Preissmann, Vinícius F. Dos Santos and Diana Sasaki. On total coloring and equitable total coloring of cubic graphs with large girth
Valentin Garnero, Ignasi Sau and Dimitrios Thilikos. A linear kernel for planar red-blue dominating set
Fernanda Couto, Luerbio Faria, Sulamita Klein, Fabio Protti and Loana Nogueira. On specifying boundary conditions for the graph sandwich problem
Hebert Coelho, Luerbio Faria, Sylvain Gravier and Sulamita Klein. An oriented 8-coloring for acyclic oriented graphs with maximum degree 3
Michael Etscheid. Performance Guarantees for Scheduling Algorithms under Perturbed Machine Speeds
Rameshwar Pratap, Sourav Chakraborty and Akshay D Kamath. Testing Uniformity of Stationary Distribution
Kaio Karam and Diana Sasaki. Semi blowup and blowup snarks and Berge-Fulkerson Conjecture
Karl Bringmann, Benjamin Doerr, Adrian Neumann and Jakub Sliacan. Online Checkpointing with Improved Worst-Case Guarantees
Lara Turner, Matthias Ehrgott and Horst W. Hamacher. On the Generality of the Greedy Algorithm for Solving Matroid Problems
Thatchaphol Saranurak. Finding the Colors of the Secret in Mastermind
Ruben Hoeksma and Marc Uetz. Two-Dimensional Optimal Mechanism Design for a Single Machine Scheduling Problem
Djamal Rebaine and Alain Quilliot. Approximation results for the linear ordering\\ problem on interval graphs
Ueverton Souza, Fabio Protti and Maise Dantas Da Silva. Parameterized And/Or Graph Solution
Nair Abreu, Maria Freitas and Renata Del-Vecchio. Simultaneously integral graphs on three associated matrices
Ulrich Faigle and Alexander Schoenhuth. Observation and Evolution of Finite-dimensional Markov Systems
Isabel Mendez-Diaz, Federico Pousa and Paula Zabala. A Branch-and-Cut algorithm for the Angular TSP
Eglantine Camby and Oliver Schaudt. Connected Dominating Set in Graphs Without Long Paths And Cycles
Elias Dahlhaus. Linear and Almost Linear Time Cases for Minimal Elimination Orderings
Olivier Hudry. Application of the descent with mutations (DWM) metaheuristic to the computation of a median equivalence relation
Mirjam Friesen and Dirk Oliver Theis. Fooling-sets and rank in nonzero characteristic
Damián Bakarcic, Gabriela Di Piazza, Isabel Mendez-Diaz and Paula Zabala. An IP based heuristic algorithm for the Vehicle and Crew Scheduling Pick-up and Delivery Problem with Time Windows
Philipp von Falkenhausen and Tobias Harks. Optimal Cost Sharing for Capacitated Facility Location Games
Radu Curticapean and Marvin Künnemann. A Quantization Framework for Smoothed Analysis on Euclidean Optimization Problems
Jan Manuch, Murray Patterson, Roland Wittler, Cedric Chauve and Eric Tannier. Linearization of ancestral multichromosomal genomes
Sven de Vries. Graph Products for Faster Separation of $1$-Wheel Inequalities
Christina Büsing, Fabio D'Andreagiovanni and Annie Raymond. Robust Optimization Under Multiband Uncertainty
Fabio Roda. Hazmat transportation problem: instance size reduction through centrality erosion
Danilo Artigas, Simone Dantas, Mitre C. Dourado and Jayme L. Szwarcfiter. Geodetic Sets and Periphery
Yonah Cherniavsky, Avraham Goldstein and Vadim Levit. Balanced Abelian group valued labelings on directed graphs: Extended abstract
Márcia R. Cerioli and Daniel Posner. Total L(2,1)-coloring of graphs
Roland Kaschek and Alexander Krumpholz. A note on an extension of the Collatz function
Imran Khaliq and Gulshad Imran. Constructing Strategies in Subclasses of McNaughton Games
Stefano Coniglio. Bound-optimal cutting planes
Philipp Klodt and Anke Van Zuylen. Toward a precise integrality gap for triangle-free 2-matchings
Giovanni Righini, Angel Felipe Ortega, Maria Teresa Ortuno Sanchez and Gregorio Tirado Dominguez. Exact and heuristic algorithms for the green vehicle routing problem
Stefan Pickl and Dimitrii Lozovanu. Optimal Paths in Networks with Rated Transition Time Costs
Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey and Heiko Röglin. Smoothed Analysis of the Successive Shortest Path Algorithm