Proceedings of the 1st Cologne Twente workshop on graphs and combinatorial optimization, Cologne, Germany, June 6--8, 2001. Extended abstracts (Q5941815)

The articles of this volume will be announced individually. An additional special volume of Discrete Appl. Math. is under preparation.NEWLINENEWLINEIndexed articles:NEWLINENEWLINE\textit{Broersma, Hajo (ed.); Faigle, Ulrich (ed.); Hurink, Johann (ed.); Pickl, Stefan (ed.)}, Preface, 1 [Zbl 1433.90006]NEWLINENEWLINE\textit{Bang-Jensen, Jørgen; Yeo, Anders}, Making a tournament \(k\)-arc-strong by reversing arcs, 2-5 [Zbl 1409.05093]NEWLINENEWLINE\textit{Berry, Anne; Bordat, Jean-Paul}, Moplex elimination orderings, 6-9 [Zbl 1409.05194]NEWLINENEWLINE\textit{Bolten, Eva; Schliep, Alexander; Schneckener, Sebastian; Schomburg, Dietmar; Schrader, Rainer}, Strongly connected components can predict protein structure, 10-13 [Zbl 1417.92115]NEWLINENEWLINE\textit{Bumb, A. F.; Kern, W.}, A simple dual ascent algorithm for the multilevel facility location problem, 14-17 [Zbl 1409.68329]NEWLINENEWLINE\textit{Calamoneri, Tiziana; Petreschi, Rossella}, \(\lambda\)-coloring of regular tiling (extended abstract), 18-21 [Zbl 1409.05051]NEWLINENEWLINE\textit{Ceroi, Stéphan}, Clique number and ball containment number of unit ball graphs, 22-25 [Zbl 1409.05146]NEWLINENEWLINE\textit{Meloni, C.}, A linear algorithm for the Hamiltonian completion number of the line graph of a cactus, 26 [Zbl 1409.05199]NEWLINENEWLINE\textit{Doerr, Benjamin; Srivastav, Anand}, Multicolor discrepancy of arithmetic progressions (extended abstract), 27-30 [Zbl 1409.05083]NEWLINENEWLINE\textit{Epping, Th.; Hochstättler, W.; Oertel, P.}, Some results on a paint shop problem for words, 31-33 [Zbl 1409.05006]NEWLINENEWLINE\textit{Fekete, Sándor P.; Köhler, Ekkehard; Teich, Jürgen}, Extending partial suborders, 34-37 [Zbl 1409.05095]NEWLINENEWLINE\textit{Finocchi, Irene; Petreschi, Rossella}, Tree partitioning via vertex deletion, 38-41 [Zbl 1409.05157]NEWLINENEWLINE\textit{Gropp, Harald}, Nonsymmetric configurations with line size \(k=4\), 42-45 [Zbl 1409.05034]NEWLINENEWLINE\textit{Kaderali, Lars; Schliep, Alexander}, A new algorithm for accelerating pair-wise computations of melting temperature, 46-49 [Zbl 1417.92117]NEWLINENEWLINE\textit{Kloock, M.}, Factorization as a SAT problem, 50-53 [Zbl 1409.68143]NEWLINENEWLINE\textit{Koster, Arie M. C. A.; Bodlaender, Hans L.; van Hoesel, Stan P. M.}, Treewidth: computational experiments, 54-57 [Zbl 1409.05176]NEWLINENEWLINE\textit{Lozovanu, D.}, Discrete optimal control problems and dynamic games with \(p\) players, 58-61 [Zbl 1433.49035]NEWLINENEWLINE\textit{Malafiejski, Michal}, The complexity of the chromatic sum problem on cubic planar graphs and regular graphs, 62 [Zbl 1409.05068]NEWLINENEWLINE\textit{Mishra, Sounaka; Sikdar, Kripasindhu}, On approximability of linear ordering and related NP-optimization problems on graphs (extended abstract), 63-66 [Zbl 1433.90204]NEWLINENEWLINE\textit{Nikolopoulus, Stavros D.}, Hamiltonian cycles in quasi-threshold graphs, 67 [Zbl 1409.05125]NEWLINENEWLINE\textit{Oriolo, Gianpaolo}, Clique covers in claw-free Berge graphs, 68-71 [Zbl 1409.05162]NEWLINENEWLINE\textit{Pickl, S.}, Combinatorial structures of max-type functions characterizing the optimal solution of the equivalence problem, 72-75 [Zbl 1433.90187]NEWLINENEWLINE\textit{Pop, P. C.; Kern, W.; Still, G.; Faigle, U.}, Relaxation methods for the Generalized Minimum Spanning Tree problem, 76-79 [Zbl 1409.05059]NEWLINENEWLINE\textit{Porschen, Stefan}, On covering \(\mathbb Z\)-grid points by rectangles, 80-83 [Zbl 1433.90183]NEWLINENEWLINE\textit{Santana, Roberto; Ochoa, Alberto; Soto, Marta R.}, On the use of factorized distribution algorithms for problems defined on graphs, 84 [Zbl 1433.90181]NEWLINENEWLINE\textit{Randerath, Bert; Schiermeyer, Ingo}, 3-colorability \(\in\mathrm{P}\) for \(P_{6}\)-free graphs, 85-89 [Zbl 1409.05090]NEWLINENEWLINE\textit{Schreyer, Jens; Walther, Hansjoachim}, Edge-oblique polyhedral graphs, 90-93 [Zbl 1409.05069]NEWLINENEWLINE\textit{Skupień, Zdzisław}, BCH codes are good for distance multicolorings with radio frequencies in hypercubes asymptotically, 94-97 [Zbl 1410.94119]NEWLINENEWLINE\textit{Bouchitté, Vincent; Kratsch, Dieter; Müller, Haiko; Todinca, Ioan}, On treewidth approximations, 98-101 [Zbl 1412.05055]NEWLINENEWLINE\textit{Mohamed, M. M. Ibrahim; Tawfik, B.}, A Prim-based heuristic algorithm for obstacle avoiding rectilinear Steiner minimal tree, 102-105 [Zbl 1412.05039]NEWLINENEWLINE\textit{Izhutkin, V. S.; Sushenzov, A. A.}, Study of methods of nonlinear optimization using computer means, 106-110 [Zbl 1433.90163]NEWLINENEWLINE\textit{Vernet, O.; Markenzon, L.}, Solving problems for maximal reducible flowgraphs, 111-114 [Zbl 1430.68249]NEWLINENEWLINE\textit{Niculitsa, Angela; Voloshin, Vitaly; Voss, Heinz-Jürgen}, Circular and uniquely colorable mixed hypergraphs, 115-118 [Zbl 1412.05142]NEWLINENEWLINE\textit{Wang, Ligong; Li, Xueliang; Zhang, Shenggui}, Some new families of integral trees with diameters 4 and 6, 119-123 [Zbl 1412.05062]NEWLINENEWLINE\textit{Weber, Gerhard-Wilhelm}, Impulses from results of inverse problems to discrete tomography (extended abstract), 124-127 [Zbl 1433.90209]NEWLINENEWLINE\textit{Li, Xueliang; Zhang, Shenggui; Broersma, Hajo}, Paths and cycles in colored graphs, 128-132 [Zbl 1412.05070]NEWLINENEWLINE\textit{Zmazek, Blaž; Žerovnik, Janez}, The obnoxious center problem on weighted cactus graphs (extended abstract), 133-136 [Zbl 1433.90083]