6th Twente workshop on graphs and combinatorial optimization. Univ. of Twente, Enschede, Netherlands, May 26--28, 1999. Extended abstracts (Q5941845)

From MaRDI portal





scientific article; zbMATH DE number 1641352
Language Label Description Also known as
English
6th Twente workshop on graphs and combinatorial optimization. Univ. of Twente, Enschede, Netherlands, May 26--28, 1999. Extended abstracts
scientific article; zbMATH DE number 1641352

    Statements

    6th Twente workshop on graphs and combinatorial optimization. Univ. of Twente, Enschede, Netherlands, May 26--28, 1999. Extended abstracts (English)
    0 references
    4 September 2001
    0 references
    Enschede (Netherlands)
    0 references
    Proceedings
    0 references
    Workshop
    0 references
    Twente workshop
    0 references
    Graphs optimization
    0 references
    Combinatorial optimization
    0 references
    The articles of this volume will be announced individually.NEWLINENEWLINEIndexed articles:NEWLINENEWLINE\textit{Arbib, Claudio}, A primal-dual property of the upper chromatic number of mixed hypergraphs, no pag., electronic only [Zbl 1039.05529]NEWLINENEWLINE\textit{Van Bang Le}, Bipartite-perfect graphs, no pag., electronic only [Zbl 1039.05512]NEWLINENEWLINE\textit{Blasum, Ulrich; Hochstättler, Winfried; Oertel, Peter}, STEINER-diagrams, no pag., electronic only [Zbl 1039.05530]NEWLINENEWLINE\textit{Bodlaender, Hans L.; Kloks, Ton; Niedermeier, Rolf}, SIMPLE MAX-CUT for unit interval graphs and graphs with few \(P4\)s, no pag., electronic only [Zbl 1038.90545]NEWLINENEWLINE\textit{Brandt, Stephan}, Triangle-free graphs without forbidden subgraphs, no pag., electronic only [Zbl 1039.05508]NEWLINENEWLINE\textit{Brinkmann, G.; McKay, B. D.}, Fast generation of some classes of planar graphs, no pag., electronic only [Zbl 1039.05531]NEWLINENEWLINE\textit{Brinkmann, G.; von Nathusius, U.; Palser, A. H. R.}, Fast generation of nanotube caps, no pag., electronic only [Zbl 1039.05537]NEWLINENEWLINE\textit{Chlebíková, Janka}, The structure of obstructions to treewidth and pathwidth, no pag., electronic only [Zbl 1039.05527]NEWLINENEWLINE\textit{Chepoi, Victor; Dragan, Feodor}, Distance approximating trees in graphs, no pag., electronic only [Zbl 1039.05504]NEWLINENEWLINE\textit{Fack, V.; Lievens, S.; Van der Jeugt, J.}, On bounds for the rotation distance between binary coupling trees, no pag., electronic only [Zbl 1039.05515]NEWLINENEWLINE\textit{Corinne, Feremans; Martine, Labbé; Gilbert, Laporte}, The generalized minimum spanning tree: polyhedra and branch-and-cut, no pag., electronic only [Zbl 1038.90546]NEWLINENEWLINE\textit{Fischermann, Miranca; Volkmann, Lutz}, Graphs having distance-\(n\) domination number half their order, no pag., electronic only [Zbl 1039.05522]NEWLINENEWLINE\textit{Greinus, J.; Brinkmann, G.}, Patches with minimal boundary length, no pag., electronic only [Zbl 1072.05538]NEWLINENEWLINE\textit{Gropp, Harald}, On triple systems, in particular those with 13 elements, no pag., electronic only [Zbl 1039.05503]NEWLINENEWLINE\textit{Guo, Yubao; Kwak, Jin Ho}, The cycle structure of regular multipartite tournaments, no pag., electronic only [Zbl 1039.05513]NEWLINENEWLINE\textit{Harmuth, Thomas}, The enumeration of cubic maps with given genus and given face degrees, no pag., electronic only [Zbl 1039.05514]NEWLINENEWLINE\textit{Hartmann, Mark; Özlük, Özgur}, Solving the traveling circus problem by branch \& cut, no pag., electronic only [Zbl 1038.90547]NEWLINENEWLINE\textit{Hayer, M.; Hochstättler, W.}, Test sets for vertex cover problems, no pag., electronic only [Zbl 1039.05532]NEWLINENEWLINE\textit{Hoffmann, Arne; Randerath, Bert; Volkmann, Lutz}, Maximal sets of 2-factors in complete equipartite graphs, no pag., electronic only [Zbl 1039.05525]NEWLINENEWLINE\textit{Jiang, Tao; Mubayi, Dhruv; Tuza, Zsolt; Voloshin, Vitaly; West, Douglas}, Chromatic spectrum is broken, no pag., electronic only [Zbl 1039.05509]NEWLINENEWLINE\textit{Klavžar, Sandi; Milutinović, Uroš; Petr, Ciril}, On the Frame-Stewarr algorithm for the multi-peg Tower of Hanoi problem (extended abstract), no pag., electronic only [Zbl 1039.05502]NEWLINENEWLINE\textit{Kloks, Ton; Kratsch, Dieter; Müller, Haiko}, On the structure of graphs with bounded asteroidal number, no pag., electronic only [Zbl 1039.05534]NEWLINENEWLINE\textit{Köhler, Ekkehard; Kriesell, Matthias}, Edge-dominating trails in AT-free graphs (extended abstract), no pag., electronic only [Zbl 1039.05523]NEWLINENEWLINE\textit{Koster, Arie M. C. A.; van Hoesel, Stan P. M.; Kolen, Antoon W. J.}, Solving frequency assignment problems via tree-decomposition, no pag., electronic only [Zbl 1038.90086]NEWLINENEWLINE\textit{Kratsch, Dieter; Stewart, Lorna}, Approximating bandwidth by mixing layouts of interval graphs, no pag., electronic only [Zbl 1039.05535]NEWLINENEWLINE\textit{Kriesell, Matthias}, Local spanning trees in graphs and hypergraphs decomposition with respect to edge connectivity, no pag., electronic only [Zbl 1039.05517]NEWLINENEWLINE\textit{Lakhal, J.; Litzler, L.}, An NC algorithm for the perfect matching problem in larger cycle-free graphs, no pag., electronic only [Zbl 1039.05536]NEWLINENEWLINE\textit{Lügering, Martin}, Provably good global routing of integrated circuits, no pag., electronic only [Zbl 1039.05538]NEWLINENEWLINE\textit{Markenzon, L.; Paciornik, N.}, Equilateral drawing of 2-connected planar chordal graphs, no pag., electronic only [Zbl 1072.05522]NEWLINENEWLINE\textit{Moukrim, Aziz}, Non-preemptive profile scheduling and quasi-interval orders, no pag., electronic only [Zbl 1072.90521]NEWLINENEWLINE\textit{Mulder, Henry Martyn}, Intersection graphs on trees with a tolerance, no pag., electronic only [Zbl 1072.05552]NEWLINENEWLINE\textit{Nakamura, M.}, Lifting and reduction of antimatroids, no pag., electronic only [Zbl 1072.05516]NEWLINENEWLINE\textit{Niculitsa, Angela; Voloshin, Vitaly; Voss, Heinz-Jürgen}, Circular and uniquely colorable mixed hypergraphs, no pag., electronic only [Zbl 1072.05528]NEWLINENEWLINE\textit{Niessen, Thomas; Kind, Jaakob}, Polyhedral sets and integer rounding, no pag., electronic only [Zbl 1072.05529]NEWLINENEWLINE\textit{Nikolopoulos, Stavros D.}, Coloring permutation graphs in parallel, no pag., electronic only [Zbl 1072.05576]NEWLINENEWLINE\textit{Östergård, Patric R. J.}, A new algorithm for the maximum-weight clique problem, no pag., electronic only [Zbl 1072.05577]NEWLINENEWLINE\textit{Pasechnik, Dmitrii V.}, Bipartite sandwiches: Semidefinite relaxations for maximum biclique, no pag., electronic only [Zbl 1072.05578]NEWLINENEWLINE\textit{Pyatkin, A. V.}, The incidentor coloring of multigraphs and its application in data networks, no pag., electronic only [Zbl 1072.05530]NEWLINENEWLINE\textit{Randerath, Bert; Volkmann, Lutz; Schiermeyer, Ingo; Tewes, Meike}, Vertex pancyclic graphs, no pag., electronic only [Zbl 1072.05541]NEWLINENEWLINE\textit{Rodrigues, R. M. N. D.; Abreu, N. M. M.; Markenzon, L.}, Maxregularity and maximal outerplanar graphs, no pag., electronic only [Zbl 1072.05523]NEWLINENEWLINE\textit{Schelten, Annette; Schiermeyer, Ingo}, 3-colored Ramsey numbers of odd cycles, no pag., electronic only [Zbl 1072.05551]NEWLINENEWLINE\textit{Srivastav, Anand; Schroeter, Hartmut; Michel, Christoph}, Alternating TSP and printed circuit board assembly, no pag., electronic only [Zbl 1072.90566]NEWLINENEWLINE\textit{Stamatiou, Yannis C.; Thilikos, Dimitrios M.}, Monotonicity and inert fugitive search games, no pag., electronic only [Zbl 1072.90524]NEWLINENEWLINE\textit{Tewes, Meike}, Pancyclic orderings of in-tournaments, no pag., electronic only [Zbl 1072.05533]NEWLINENEWLINE\textit{Thilikos, Dimitrios M.}, Quickly excluding \(K_{2,r}\) from planar graphs, no pag., electronic only [Zbl 1072.05580]NEWLINENEWLINE\textit{Tijdeman, R.}, Discrete tomography in four directions, no pag., electronic only [Zbl 1072.05518]NEWLINENEWLINE\textit{Vanherpe, J. M.}, On canonical decomposition of bipartite graphs, no pag., electronic only [Zbl 1072.05581]NEWLINENEWLINE\textit{Walther, Hansjoachim}, Polyhedral graphs with extreme numbers of types of faces, no pag., electronic only [Zbl 1072.05539]NEWLINENEWLINE\textit{Wang, Ligong; Li, Xueliang; Liu, Ruying}, Integral trees with diameter 6 or 8, no pag., electronic only [Zbl 1072.05548]NEWLINENEWLINE\textit{Wojda, A. Paweł}, Erdős-type condition for a graph to contain \(k\) independent edges, no pag., electronic only [Zbl 1072.05563]NEWLINENEWLINE\textit{Zmazek, Blaž; Žerovnik, Janez}, Algorithm for recognizing Cartesian graph bundles, no pag., electronic only [Zbl 1072.05582]NEWLINENEWLINE\textit{Reed, B.}, Introducing directed tree width, no pag., electronic only [Zbl 1072.05579]NEWLINENEWLINE\textit{de Figueiredo, Celina M. H.; Gimbel, John; de Mello, Célia Picinin; Szwarcfiter, Jayme L.}, Linear-time algorithms for maximum sets of sources and sinks, no pag., electronic only [Zbl 1072.05583]
    0 references

    Identifiers