{"entities":{"Q5941845":{"pageid":8118647,"ns":120,"title":"Item:Q5941845","lastrevid":102010295,"modified":"2026-06-06T03:18:18Z","type":"item","id":"Q5941845","labels":{"en":{"language":"en","value":"6th Twente workshop on graphs and combinatorial optimization. Univ. of Twente, Enschede, Netherlands, May 26--28, 1999. Extended abstracts"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1641352"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5941845$DA59336D-796F-4A09-A31B-8B6B067F7463","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"fb658725230462320567d111bd543e9192d53154","datavalue":{"value":{"text":"6th Twente workshop on graphs and combinatorial optimization. Univ. of Twente, Enschede, Netherlands, May 26--28, 1999. Extended abstracts","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5941845$378BF219-D544-4B69-8E05-D71734473FA4","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"6f171b312810dff0df6c6a9b9836c00a8eea3f35","datavalue":{"value":"0968.90002","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5941845$1C768A86-D95C-440F-91C8-AF6C6C743186","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"a136d04e761e9859ba9ed38b65864112febfa028","datavalue":{"value":{"entity-type":"item","numeric-id":111211,"id":"Q111211"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5941845$D8BA9DAC-B6D3-413B-8D5F-F167F85C3E91","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"aeb0d8dbba3b369c80a2428e6e60e1d4a76d64f1","datavalue":{"value":{"time":"+2001-09-04T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5941845$ACE547C5-EDBE-4D7A-9459-79F6206FCBB4","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ecbbf3779c517fef97ab936b0a129d7ef035b583","datavalue":{"value":"90-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5941845$07FE464A-8BCA-46CF-9A65-1865F61D2A43","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5941845$2805737F-19E0-49ED-AA03-FC1887C54BAD","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"75f3fe233956e1432d667ff1fdc8bf323db3f7c3","datavalue":{"value":"1641352","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5941845$398102FA-C215-48AB-B4E1-7E6D88CF5FDA","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a7c916e33ad41d8ee37a6529cc49af28b9b65e95","datavalue":{"value":"Enschede (Netherlands)","type":"string"},"datatype":"string"},"type":"statement","id":"Q5941845$7612791E-2A25-455A-B634-A4E1DB6816CF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q5941845$CF25C9F6-7D61-4090-A2A7-B85D485B08CA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f7c2172f0a2ed6197400daa3f44dae0d79725b1a","datavalue":{"value":"Workshop","type":"string"},"datatype":"string"},"type":"statement","id":"Q5941845$AAA04DDA-525B-4B62-9195-493AA1497632","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1ffa564933f524de29864dca15094761842ee467","datavalue":{"value":"Twente workshop","type":"string"},"datatype":"string"},"type":"statement","id":"Q5941845$51049F80-2125-42EC-B85D-80E10BDAA69F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4533572b3722574538c247514089c7766b52bced","datavalue":{"value":"Graphs optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q5941845$36D57BF3-B9D8-4438-B7EF-5A1F98C55C73","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6fd501bec1e4c351a5bb7e183c0156e01d1981e2","datavalue":{"value":"Combinatorial optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q5941845$95641F3F-6AA4-4879-B90E-1CC281CC8F4D","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5941845$6F15F3A5-7C5C-422F-86D1-FF9B46BB13C2","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"f58244896378c91ae1f46933126784c3f4cac0ae","datavalue":{"value":"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\u00e4ttler, 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\u00edkov\u00e1, 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\u00e9; 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; \u00d6zl\u00fck, \u00d6zgur}, Solving the traveling circus problem by branch \\& cut, no pag., electronic only [Zbl 1038.90547]NEWLINENEWLINE\\textit{Hayer, M.; Hochst\u00e4ttler, 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\u017ear, Sandi; Milutinovi\u0107, Uro\u0161; 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\u00fcller, Haiko}, On the structure of graphs with bounded asteroidal number, no pag., electronic only [Zbl 1039.05534]NEWLINENEWLINE\\textit{K\u00f6hler, 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\u00fcgering, 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\u00fcrgen}, 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{\u00d6sterg\u00e5rd, 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\u0142}, Erd\u0151s-type condition for a graph to contain \\(k\\) independent edges, no pag., electronic only [Zbl 1072.05563]NEWLINENEWLINE\\textit{Zmazek, Bla\u017e; \u017derovnik, 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\u00e9lia Picinin; Szwarcfiter, Jayme L.}, Linear-time algorithms for maximum sets of sources and sinks, no pag., electronic only [Zbl 1072.05583]","type":"string"},"datatype":"string"},"type":"statement","id":"Q5941845$971FD514-3C5D-42A3-B24C-E73FA1110B74","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"6th Twente workshop on graphs and combinatorial optimization. Univ. of Twente, Enschede, Netherlands, May 26--28, 1999. Extended abstracts","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/6th_Twente_workshop_on_graphs_and_combinatorial_optimization._Univ._of_Twente,_Enschede,_Netherlands,_May_26--28,_1999._Extended_abstracts"}}}}}