12th Cologne-Twente workshop on graphs and combinatorial optimization (CTW 2013)

Weare pleased to present this special issue ofDiscrete AppliedMathematics, which is devoted to the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2013), held at the University of Twente, Enschede, The Netherlands, between May 21 and May 23, 2013. More than 80 scientists from all over the world attended the workshop, and we take this opportunity to thank all CTW 2013 participants for their presentations and lively discussions at the workshop. After the workshop, we invited the participants and the community at large to submit manuscripts with research results related to the themes and topics of the workshop. From the submitted manuscripts, we have selected, after a careful refereeing process, twelve articles to be included in this special issue. We thank the reviewers for their insightful reports and the authors for the quality of their contributions. Special thanks are due to Endre Boros, Editor-in-Chief, who accepted to host this issue dedicated to CTW 2013 in Discrete Applied Mathematics, thereby following a long tradition. We also thank Katie D’Agosta, Publications Manager, for her help and valuable support. The CTW started as a series of biennial meetings at the Universities of Cologne in Germany and Twente in the Netherlands. Ever-increasing interest has turned the CTW into a now annual event with several other universities as additional partners. The scope of the workshop comprises the theory and applications of discrete algorithms, graphs, and combinatorial structures in a broad sense. We hope for a continuing interest in these CTW workshops and are looking forward to contributions in the future from all interested researchers.

[1]  Fedor V. Fomin,et al.  Exact exponential algorithms , 2013, CACM.

[2]  Dieter Kratsch,et al.  On Independent Sets and Bicliques in Graphs , 2008, Algorithmica.

[3]  D. R. Fulkerson,et al.  Blocking and anti-blocking pairs of polyhedra , 1971, Math. Program..

[4]  Matthew Richardson,et al.  Mining knowledge-sharing sites for viral marketing , 2002, KDD.

[5]  Jørgen Bang-Jensen,et al.  Finding an induced subdivision of a digraph , 2011, Electron. Notes Discret. Math..

[6]  Ton Kloks,et al.  New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs , 2002, WG.

[7]  David Bryant,et al.  The complexity of the breakpoint median problem , 1998 .

[8]  Sulamita Klein,et al.  Complexity of graph partition problems , 1999, STOC '99.

[9]  Maciej Liskiewicz,et al.  A new upper bound for the traveling salesman problem in cubic graphs , 2012, J. Discrete Algorithms.

[10]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[11]  Ruben Hoeksma,et al.  Two Dimensional Optimal Mechanism Design for a Sequencing Problem , 2012, IPCO.

[12]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

[13]  Alberto Cavicchioli,et al.  Special Classes of Snarks , 2003 .

[14]  W. Ewens,et al.  The chromosome inversion problem , 1982 .

[15]  Roger B. Myerson,et al.  Optimal Auction Design , 1981, Math. Oper. Res..

[16]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[17]  Günter Rote,et al.  Minimum-weight triangulation is NP-hard , 2006, JACM.

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  Harold N. Gabow,et al.  Forests, frames, and games: Algorithms for matroid sums and applications , 1992, STOC '88.

[20]  Paul G. Spirakis,et al.  A Hamiltonian Approach to the Assignment of Non-reusable Frequencies , 1998, FSTTCS.

[21]  J. Anthonisse.  The rush in a directed graph , 1971 .

[22]  E. Purington.  Mathematics 10 , 1967, IEEE Spectrum.

[23]  Ortrud R. Oellermann,et al.  Rebuilding convex sets in graphs , 2005, Discret. Math..

[24]  Bruno Courcelle,et al.  The Monadic Second order Logic of Graphs VI: on Several Representations of Graphs By Relational Structures , 1994, Discret. Appl. Math..

[25]  Tommy R. Jensen,et al.  Graph Coloring Problems , 1994 .

[26]  Qian-Ping Gu,et al.  Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set , 2010, LATIN.

[27]  David Eppstein,et al.  Single‐Strip Triangulation of Manifolds with Arbitrary Topology , 2004, Comput. Graph. Forum.

[28]  Agnieszka Rusinowska,et al.  Measuring Power and Satisfaction in Societies with Opinion Leaders: Dictator and Opinion Leaders , 2009 .

[29]  Andreas Brandstädt,et al.  The Complexity of some Problems Related to Graph 3-colorability , 1998, Discret. Appl. Math..

[30]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[31]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[32]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[33]  David P. Williamson,et al.  Analyzing the Held-Karp TSP Bound: A Monotonicity Property with Application , 1990, Inf. Process. Lett..

[34]  T. Gallai.  Transitiv orientierbare Graphen , 1967 .

[35]  Nima Haghpanah,et al.  Bayesian optimal auctions via multi- to single-agent reduction , 2012, EC '12.

[36]  Sulamita Klein,et al.  Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs , 2013, Electron. Notes Discret. Math..

[37]  Andrzej Lingas,et al.  On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem , 1994, MFCS.

[38]  A. Assad,et al.  The quadratic minimum spanning tree problem , 1992 .

[39]  Richard Bellman,et al.  Dynamic Programming Treatment of the Travelling Salesman Problem , 1962, JACM.

[40]  Éric Sopena,et al.  Oriented graph coloring , 2001, Discret. Math..

[41]  Frank Harary,et al.  Convexity in graphs , 1981 .

[42]  L. Shapley.  A Value for n-person Games , 1988 .

[43]  Bodo Manthey,et al.  Smoothed Analysis: Analysis of Algorithms Beyond Worst Case , 2011, it Inf. Technol..

[44]  Andreas Brandstädt.  Partitions of graphs into one or two independent sets and cliques , 1996, Discret. Math..

[45]  Vadim E. Levit,et al.  Balanced Abelian group valued functions on directed graphs: Extended abstract , 2013, CTW.

[46]  Amos Fiat,et al.  On-line routing of virtual circuits with applications to load balancing and machine scheduling , 1997, JACM.

[47]  Colin McDiarmid,et al.  Total colouring regular bipartite graphs is NP-hard , 1994, Discret. Math..

[48]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.

[49]  C. N. Campos,et al.  Fulkerson's Conjecture and Loupekine snarks , 2014, Discret. Math..

[50]  Robert Carr,et al.  A new bound for the ratio between the 2-matching problem and its linear programming relaxation , 1999, Math. Program..

[51]  Jean-Marie Vanherpe,et al.  On Fulkerson conjecture , 2011, Discuss. Math. Graph Theory.

[52]  Frank Harary,et al.  Graph Theory , 2016 .

[53]  Yang-Byung Park,et al.  A heuristic for bi-objective vehicle routing with time window constraints , 1999 .

[54]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[55]  K. Taira.  Proof of Theorem 1.3 , 2004 .

[56]  G. Prins,et al.  Every generalized Petersen graph has a Tait coloring. , 1972 .

[57]  Peter Winkler,et al.  Counting linear extensions is #P-complete , 1991, STOC '91.

[58]  Celina M. H. de Figueiredo,et al.  The hunting of a snark with total chromatic number 5 , 2014, Discret. Appl. Math..

[59]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[60]  Martin Charles Golumbic,et al.  Trivially perfect graphs , 1978, Discret. Math..

[61]  D. Spielman,et al.  Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time , 2004 .

[62]  J. Moon,et al.  On cliques in graphs , 1965 .

[63]  W. Imrich,et al.  Handbook of Product Graphs, Second Edition , 2011 .

[64]  Tobias Harks,et al.  Optimal Cost Sharing for Resource Selection Games , 2013, Math. Oper. Res..

[65]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

[66]  Berthold Vöcking,et al.  Tight bounds for worst-case equilibria , 2002, SODA '02.

[67]  R. Sritharan.  Chordal bipartite completion of colored graphs , 2008, Discret. Math..

[68]  Celina M. H. de Figueiredo,et al.  The polynomial dichotomy for three nonempty part sandwich problems , 2010, Discret. Appl. Math..

[69]  André Raspaud,et al.  Good and Semi-Strong Colorings of Oriented Planar Graphs , 1994, Inf. Process. Lett..

[70]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[71]  Simone Dantas,et al.  On the contour of graphs , 2013, Discret. Appl. Math..

[72]  L. D. Moura,et al.  The YICES SMT Solver , 2006 .

[73]  Rolf Niedermeier,et al.  Polynomial-time data reduction for dominating set , 2002, JACM.

[74]  Jens Vygen,et al.  Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs , 2012, ArXiv.

[75]  Mingzhou Jin,et al.  A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem , 2007 .

[76]  Éric D. Taillard,et al.  A heuristic column generation method for the heterogeneous fleet VRP , 1999, RAIRO Oper. Res..

[77]  László Lovász,et al.  Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..

[78]  Celina M. H. de Figueiredo,et al.  On decision and optimization (k, l)-graph sandwich problems , 2004, Discret. Appl. Math..

[79]  Therese C. Biedl,et al.  Partitions of Graphs into Trees , 2006, GD.

[80]  Rudolf Müller,et al.  Optimal Mechanisms for Single Machine Scheduling , 2008, WINE.

[81]  Martin Charles Golumbic,et al.  Graph Sandwich Problems , 1995, J. Algorithms.

[82]  Alok Aggarwal,et al.  The angular-metric traveling salesman problem , 1997, SODA '97.

[83]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[84]  Rolf Niedermeier,et al.  Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems , 2000, SWAT.

[85]  Sulamita Klein,et al.  The Graph Sandwich Problem for P4-sparse graphs , 2009, Discret. Math..

[86]  Sulamita Klein,et al.  Packing r-Cliques in Weighted Chordal Graphs , 2005, Ann. Oper. Res..

[87]  Ján Manuch,et al.  Consistency of Sequence-Based Gene Clusters , 2011, J. Comput. Biol..

[88]  Fabio D'Andreagiovanni,et al.  New Results about Multi-band Uncertainty in Robust Optimization , 2012, SEA.

[89]  Michel Balinski,et al.  Integer Programming: Methods, Uses, Computations , 1965 .

[90]  Saïd Salhi,et al.  Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries , 2005, Eur. J. Oper. Res..

[91]  José Cáceres,et al.  Geodeticity of the contour of chordal graphs , 2008, Discret. Appl. Math..

[92]  Robert Ganian,et al.  New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes , 2010, SOFSEM.

[93]  Eddie Cheng,et al.  Wheel inequalities for stable set polytopes , 1997, Math. Program..

[94]  Ernesto Estrada.  Spectral theory of networks : from biomolecular to ecological systems , 2009 .

[95]  Michael J. Dinneen,et al.  Update games and update networks , 2003, J. Discrete Algorithms.

[96]  Rolf Niedermeier,et al.  Linear Problem Kernels for NP-Hard Problems on Planar Graphs , 2007, ICALP.

[97]  Sulamita Klein,et al.  List matrix partitions of chordal graphs , 2005, Theor. Comput. Sci..

[98]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[99]  Jochen Könemann,et al.  A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game , 2008, SIAM J. Comput..

[100]  René Beier,et al.  Random knapsack in expected polynomial time , 2004, J. Comput. Syst. Sci..

[101]  Yoav Shoham,et al.  Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations , 2009 .

[102]  Van de M. L. J. Vel.  Theory of convex structures , 1993 .

[103]  J. Cardinal,et al.  Approximation algorithms for covering problems in dense graphs , 2009 .

[104]  Roberto Cordone,et al.  Solving the Quadratic Minimum Spanning Tree Problem , 2012, Appl. Math. Comput..

[105]  Cyriel Rutten,et al.  Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling , 2010, LATIN.

[106]  Fedor V. Fomin,et al.  On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms , 2008, Algorithmica.

[107]  M. Rosenfeld,et al.  On the total coloring of certain graphs , 1971 .

[108]  Martin Dyer,et al.  Partitioning heuristics for two geometric maximization problems , 1984 .

[109]  Hans Zantema,et al.  Relaxation of 3-partition instances , 2013, CTW.

[110]  Klas Markström,et al.  Generation and properties of snarks , 2012, J. Comb. Theory B.

[111]  Sulamita Klein,et al.  List Partitions , 2003, SIAM J. Discret. Math..

[112]  M. Watkins,et al.  A theorem on tait colorings with an application to the generalized Petersen graphs , 1969 .

[113]  Heidi Gebauer.  Enumerating all Hamilton Cycles and Bounding the Number of Hamilton Cycles in 3-Regular Graphs , 2011, Electron. J. Comb..

[114]  René Beier,et al.  Typical Properties of Winners and Losers in Discrete Optimization , 2006, SIAM J. Comput..

[115]  Norman Zadeh,et al.  A bad network problem for the simplex method and other minimum cost flow algorithms , 1973, Math. Program..

[116]  David S. Johnson,et al.  Complexity Results for Multiprocessor Scheduling under Resource Constraints , 1975, SIAM J. Comput..

[117]  Russell Merris,et al.  Split graphs , 2003, Eur. J. Comb..

[118]  Erol Gelenbe,et al.  On the Optimum Checkpoint Interval , 1979, JACM.

[119]  Dimitrios M. Thilikos,et al.  (Meta) Kernelization , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[120]  Fedor V. Fomin,et al.  Finding Induced Subgraphs via Minimal Triangulations , 2009, STACS.

[121]  István Miklós,et al.  Approximating the number of Double Cut-and-Join scenarios , 2012, Theor. Comput. Sci..

[122]  Fabrizio Grandoni,et al.  Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications , 2008, TALG.

[123]  Andreas Björklund,et al.  The traveling salesman problem in bounded degree graphs , 2012, TALG.

[124]  Michal Pilipczuk,et al.  Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[125]  Ajit A. Diwan,et al.  Balanced group-labeled graphs , 2012, Discret. Math..

[126]  U. Faigle,et al.  The Shapley value for cooperative games under precedence constraints , 1992 .

[127]  Celina M. H. de Figueiredo,et al.  On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs , 2007, Theor. Comput. Sci..

[128]  Yuri Gurevich,et al.  Trees, automata, and games , 1982, STOC '82.

[129]  Sebastián Urrutia,et al.  Discrete optimization methods to determine trajectories for Dubins' vehicles , 2010, Electron. Notes Discret. Math..

[130]  Cyriel Rutten,et al.  Smoothed performance guarantees for local search , 2014, Math. Program..

[131]  Diana Sasaki,et al.  Snarks with total chromatic number 5 , 2015, Discret. Math. Theor. Comput. Sci..

[132]  Benjamin Doerr,et al.  Playing Mastermind With Many Colors , 2012, SODA.

[133]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[134]  Xiaofeng Wang,et al.  A note on Berge-Fulkerson coloring , 2009, Discret. Math..

[135]  Petra Schuurman,et al.  Performance Guarantees of Local Search for Multiprocessor Scheduling , 2007, INFORMS J. Comput..

[136]  Éva Tardos,et al.  Group strategy proof mechanisms via primal-dual algorithms , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[137]  Roman Vershynin,et al.  Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[138]  P. Seymour,et al.  The Strong Perfect Graph Theorem , 2002, math/0212070.

[139]  Eldar Fischer,et al.  On the Query Complexity of Testing Orientations for Being Eulerian , 2008, APPROX-RANDOM.

[140]  Mark de Berg,et al.  Optimal Binary Space Partitions for Segments in the Plane , 2012, Int. J. Comput. Geom. Appl..

[141]  José Cáceres,et al.  On geodetic sets formed by boundary vertices , 2006, Discret. Math..

[142]  Dekel Tsur,et al.  Testing Properties of Constraint-Graphs , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[143]  Donald Goldfarb,et al.  Steepest-edge simplex algorithms for linear programming , 1992, Math. Program..

[144]  Marcus Oswald,et al.  Speeding up IP-based algorithms for constrained quadratic 0–1 optimization , 2010, Math. Program..

[145]  Berthold Vöcking,et al.  Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP , 2007, SODA '07.

[146]  Jayme Luiz Szwarcfiter,et al.  On the computation of the hull number of a graph , 2009, Discret. Math..

[147]  Dmitrii Lozovanu,et al.  Optimization and Multiobjective Control of Time-Discrete Systems: Dynamic Networks and Multilayered Structures , 2009 .

[148]  Gergely J. Szöllosi,et al.  Evolution of gene neighborhoods within reconciled phylogenies , 2012, Bioinform..

[149]  Ali Haghani,et al.  A dynamic vehicle routing problem with time-dependent travel times , 2005, Comput. Oper. Res..

[150]  Sung-Pil Hong,et al.  Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications , 2013, J. Glob. Optim..

[151]  Saket Saurabh,et al.  A linear kernel for planar connected dominating set , 2011, Theor. Comput. Sci..

[152]  Bodo Manthey,et al.  Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals , 2011, Algorithmica.

[153]  Guillaume Fertin,et al.  Combinatorics of Genome Rearrangements , 2009, Computational molecular biology.

[154]  Madhu Sudan,et al.  Online algorithms for locating checkpoints , 1990, STOC '90.

[155]  Victor Neumann-Lara,et al.  The dichromatic number of a digraph , 1982, J. Comb. Theory, Ser. B.

[156]  Eugene L. Lawler,et al.  A Note on the Complexity of the Chromatic Number Problem , 1976, Inf. Process. Lett..

[157]  David Haussler,et al.  ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..

[158]  Daniel Bienstock,et al.  Histogram Models for Robust Portfolio Optimization , 2007 .

[159]  Lauri Ahlroth,et al.  Approximately Uniform Online Checkpointing with Bounded Memory , 2013, Algorithmica.

[160]  Pim van 't Hof,et al.  Minimal dominating sets in graph classes: Combinatorial bounds and enumeration , 2013, Theor. Comput. Sci..

[161]  Jens Stoye,et al.  A Unifying View of Genome Rearrangements , 2006, WABI.

[162]  L. Wolsey.  Heuristic analysis, linear programming and branch and bound , 1980 .

[163]  Dimitrios M. Thilikos,et al.  Bidimensionality and kernels , 2010, SODA '10.

[164]  Sulamita Klein,et al.  Partitioning chordal graphs into independent sets and cliques , 2004, Discret. Appl. Math..

[165]  Nader H. Bshouty,et al.  Optimal Algorithms for the Coin Weighing Problem with a Spring Scale , 2009, COLT.

[166]  Kazuo Iwama,et al.  An Improved Exact Algorithm for Cubic Graph TSP , 2007, COCOON.

[167]  Andrew V. Goldberg,et al.  Tight bounds on the number of minimum-mean cycle cancellations and related results , 1991, SODA '91.

[168]  Jonas Hägglund.  On Snarks that are far from being 3-Edge Colorable , 2016, Electron. J. Comb..

[169]  Sebastiaan J. C. Joosten.  Relaxations of the 3-partition problem , 2011 .

[170]  Ján Manuch,et al.  Tractability Results for the Consecutive-Ones Property with Multiplicity , 2011, CPM.

[171]  C. N. Campos,et al.  The total-chromatic number of some families of snarks , 2011, Discret. Math..

[172]  Dolf Talman,et al.  The Average Covering Tree Value for Directed Graph Games , 2012 .

[173]  Bernard B. Suh,et al.  Reconstructing contiguous regions of an ancestral genome. , 2006, Genome research.

[174]  J. Kleinberg,et al.  Networks, Crowds, and Markets , 2010 .

[175]  Jian Ma,et al.  DUPCAR: Reconstructing Contiguous Ancestral Regions with Duplications , 2008, J. Comput. Biol..

[176]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[177]  Adam Dunkels,et al.  Sensornet Checkpointing: Enabling Repeatability in Testbeds and Realism in Simulations , 2009, EWSN.

[178]  David P. Williamson,et al.  A proof of the Boyd-Carr conjecture , 2011, SODA.

[179]  Evangelos Markakis,et al.  Diffusion in Social Networks with Competing Products , 2011, SAGT.

[180]  Michel X. Goemans,et al.  Worst-case comparison of valid inequalities for the TSP , 1995, Math. Program..

[181]  Maurice Queyranne,et al.  Structure of a simple scheduling polyhedron , 1993, Math. Program..

[182]  Ekrem Duman,et al.  A TSP (1,2) application arising in cable assembly shops , 2005, J. Oper. Res. Soc..

[183]  Eric Sopena.  The chromatic number of oriented graphs , 1997 .

[184]  Marc Demange,et al.  Oriented Coloring: Complexity and Approximation , 2006, SOFSEM.

[185]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[186]  Aimo A. Törn,et al.  Global Optimization , 1999, Science.

[187]  Oscar H. Ibarra,et al.  Bounds for LPT Schedules on Uniform Processors , 1977, SIAM J. Comput..

[189]  Wei-Fan Wang.  Equitable Total Coloring of Graphs with Maximum Degree 3 , 2002, Graphs Comb..

[190]  David S. Johnson,et al.  The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..