{"entities":{"Q2488055":{"pageid":2498798,"ns":120,"title":"Item:Q2488055","lastrevid":44185647,"modified":"2025-11-20T16:38:53Z","type":"item","id":"Q2488055","labels":{"en":{"language":"en","value":"Graph-theoretic concepts in computer science. 30th international workshop, WG 2004, Bad Honnef, Germany, June 21--23, 2004. Revised papers."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2198078"}},"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":"Q2488055$BFE4091C-3999-4A6F-8811-C7FC0D535702","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"e09cc636ac22e92bfe83b2353614592a7d3c1443","datavalue":{"value":{"text":"Graph-theoretic concepts in computer science. 30th international workshop, WG 2004, Bad Honnef, Germany, June 21--23, 2004. Revised papers.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2488055$58E75832-F32C-4D36-B303-E5A6CBA1C982","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"d1835364fa87d395df308acce46fb04a35a15937","datavalue":{"value":"1067.68006","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2488055$2B12F480-2EA4-4134-BC80-E495EE2C8B87","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"85c07c7737819bff773f78e2590a3bb761fe677b","datavalue":{"value":{"entity-type":"item","numeric-id":162374,"id":"Q162374"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2488055$08133001-DAAA-4859-B431-D82A86DC6EF1","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"2c8161240b506a95f024b0718a56f9f3e2b0e7a2","datavalue":{"value":{"time":"+2005-08-23T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2488055$48388A4B-32F1-4CC8-9306-074F9E01C85B","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"4781f186e98fef770fd08b5e0ae8c2170b1449f6","datavalue":{"value":"The articles of this volume will be reviewed individually. The preceding workshop has been reviewed (see Zbl 1029.00043).  Indexed articles:  \\textit{Corneil, Derek G.}, Lexicographic breadth first search -- a survey, 1-19 [Zbl 1112.68414]  \\textit{Wattenhofer, Roger}, Wireless networking: Graph theory unplugged, 20-32 [Zbl 1112.68432]  \\textit{Nakano, Shin-ichi; Uno, Takeaki}, Constant time generation of trees with specified diameter, 33-45 [Zbl 1112.68426]  \\textit{Cornelsen, Sabine; Di Stefano, Gabriele}, Treelike comparability graphs: Characterization, recognition, and applications, 46-57 [Zbl 1112.68415]  \\textit{Fiala, Ji\u0159\u00ed; Golovach, Petr A.; Kratochv\u00edl, Jan}, Elegant distance constrained labelings of trees, 58-67 [Zbl 1112.68419]  \\textit{Dragan, Feodor F.; Yan, Chenyu; Corneil, Derek G.}, Collective tree spanners and routing in AT-free related graphs, 68-80 [Zbl 1112.68417]  \\textit{Bodlaender, Hans L.; Koster, Arie M. C. A.}, On the maximum cardinality search lower bound for treewidth, 81-92 [Zbl 1112.68409]  \\textit{Crespelle, Christophe; Paul, Christophe}, Fully-dynamic recognition algorithm and certificate for directed cographs, 93-104 [Zbl 1112.68416]  \\textit{Nikolopoulos, Stavros D.; Palios, Leonidas}, Recognizing HHD-free and Welsh-Powell opposition graphs, 105-116 [Zbl 1112.68428]  \\textit{Fouquet, Jean-Luc; Habib, Michel; de Montgolfier, Fabien; Vanherpe, Jean-Marie}, Bimodular decomposition of bipartite graphs, 117-128 [Zbl 1112.68421]  \\textit{Rao, Micha\u00ebl}, Coloring a graph using split decomposition, 129-141 [Zbl 1112.68430]  \\textit{Grandoni, Fabrizio; Italiano, Giuseppe F.}, Decremental clique problem, 142-153 [Zbl 1112.68422]  \\textit{Sawitzki, Daniel}, A symbolic approach to the all-pairs shortest-paths problem, 154-167 [Zbl 1112.68431]  \\textit{Moreno, Eduardo; Matamala, Mart\u00edn}, Minimal de Bruijn sequence in a language with forbidden substrings, 168-176 [Zbl 1112.68425]  \\textit{Baader, Franz}, A graph-theoretic generalization of the least common subsumer and the most specific concept in the description logic \\(\\mathcal{EL}\\), 177-188 [Zbl 1112.68407]  \\textit{Broersma, Hajo J.; Paulusma, Daniel; Smit, Gerard J. M.; Vlaardingerbroek, Frank; Woeginger, Gerhard J.}, The computational complexity of the minimum weight processor assignment problem, 189-200 [Zbl 1112.68411]  \\textit{Apollonio, Nicola; Caramia, Massimiliano; Italiano, Giuseppe F.}, A stochastic location problem with applications to tele-diagnostic, 201-213 [Zbl 1112.68406]  \\textit{Nieberg, Tim; Hurink, Johann; Kern, Walter}, A robust PTAS for maximum weight independent sets in unit disk graphs, 214-221 [Zbl 1112.68427]  \\textit{Goldengorin, Boris; Sierksma, Gerard; Turkensteen, Marcel}, Tolerance based algorithms for the ATSP, 222-234 [Zbl 1112.90376]  \\textit{Fellows, Mike; Heggernes, Pinar; Rosamond, Frances; Sloper, Christian; Telle, Jan Arne}, Finding \\(k\\) disjoint triangles in an arbitrary graph, 235-244 [Zbl 1112.68418]  \\textit{Fomin, Fedor V.; Kratsch, Dieter; Woeginger, Gerhard J.}, Exact (exponential) algorithms for the dominating set problem, 245-256 [Zbl 1112.68420]  \\textit{Chor, Benny; Fellows, Mike; Juedes, David}, Linear kernels in linear time, or how to save \\(k\\) colors in \\(O(n^{2})\\) steps, 257-269 [Zbl 1112.68412]  \\textit{Bonichon, Nicolas; Gavoille, Cyril; Hanusse, Nicolas; Poulalhon, Dominique; Schaeffer, Gilles}, Planar graphs, via well-orderly maps and trees, 270-284 [Zbl 1112.68410]  \\textit{Brimkov, Valentin E.; Barneva, Reneta P.; Klette, Reinhard; Straight, Joseph}, Efficient computation of the Lov\u00e1sz theta function for a class of circulant graphs, 285-295 [Zbl 1112.94311]  \\textit{Golin, Mordecai J.; Leung, Yiu Cho}, Unhooking circulant graphs: A combinatorial method for counting spanning trees and other parameters, 296-307 [Zbl 1112.05312]  \\textit{Chen, Zhi-Zhong; Tsukiji, Tatsuie}, Computing bounded-degree phylogenetic roots of disconnected graphs, 308-319 [Zbl 1112.92332]  \\textit{Rahman, Md. Saidur; Miura, Kazuyuki; Nishizeki, Takao}, Octagonal drawings of plane graphs with prescribed face areas, 320-331 [Zbl 1112.68429]  \\textit{Baur, Michael; Brandes, Ulrik}, Crossing reduction in circular layouts, 332-343 [Zbl 1112.68408]  \\textit{Costa Dourado, Mitre; Protti, F\u00e1bio; Szwarcfiter, Jayme Luiz}, Characterization and recognition of generalized clique-Helly graphs, 344-354 [Zbl 1112.05321]  \\textit{Conforti, Michele; Galluccio, Anna; Proietti, Guido}, Edge-connectivity augmentation and network matrices, 355-364 [Zbl 1112.68413]  \\textit{Ito, Takehiro; Zhou, Xiao; Nishizeki, Takao}, Partitioning a weighted graph to connected subgraphs of almost uniform size, 365-376 [Zbl 1112.68423]  \\textit{de Werra, Dominique; Demange, Marc; Monnot, Jerome; Paschos, Vangelis Th.}, The hypocoloring problem: Complexity and approximability results when the chromatic number is small, 377-388 [Zbl 1112.68433]  \\textit{Bietenhader, Thomas; Okamoto, Yoshio}, Core stability of minimum coloring games, 389-401 [Zbl 1112.91305]","type":"string"},"datatype":"string"},"type":"statement","id":"Q2488055$D2621F12-F06F-4B58-AA61-9D150843190A","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2488055$F75CCEC3-890C-41D8-8662-416AC4009875","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2488055$9A4C1DBC-E6BF-4254-A82E-552E9C32E38A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2488055$736415DE-3013-479E-9068-676EB7B3A8B3","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"946bcae1c56f78f4fbdeb860a7e001179498fc62","datavalue":{"value":"2198078","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2488055$E35C7932-4C6B-455D-B7F2-321DA6C4EDA8","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":"Q2488055$A7E49884-EFB5-40BB-AD8A-F00F8713D9D6","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"7435b5729839012f1a1a5c1727c307835fe27768","datavalue":{"value":"https://doi.org/10.1007/b104584","type":"string"},"datatype":"url"},"type":"statement","id":"Q2488055$7769541F-7888-4FEB-AB9F-A44A6190FC48","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"5a358f5cc5500402defeca85db4487ac1ae5d03c","datavalue":{"value":"W4211210842","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2488055$11680DD6-16EA-4D00-9F48-DDC0C2671B94","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"7bf7071582cf55fea27a06b3db3bfa75d2faa51e","datavalue":{"value":"10.1007/B104584","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2488055$CD27533E-6B3A-4646-AB5C-9815D9B58832","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:2488055","badges":[]}}}}}