{"entities":{"Q684569":{"pageid":686418,"ns":120,"title":"Item:Q684569","lastrevid":63584145,"modified":"2026-04-11T14:09:29Z","type":"item","id":"Q684569","labels":{"en":{"language":"en","value":"Graph-theoretic concepts in computer science. 18th international workshop, WG '92, Wiesbaden-Naurod, Germany, June 18-20, 1992. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 419011"}},"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":"Q684569$DCC97689-71BE-43F4-A31A-E5718DB5FD49","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"113d6d890df714042c2dfd990a80c051f73ab000","datavalue":{"value":{"text":"Graph-theoretic concepts in computer science. 18th international workshop, WG '92, Wiesbaden-Naurod, Germany, June 18-20, 1992. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q684569$9B6D3173-9C8C-409B-9E0F-EE09AAE1C0DB","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"f1ae4186c139f05474b03e8e443ab016e2349316","datavalue":{"value":"0866.00058","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q684569$546017A1-D093-4040-8851-10407EEAC779","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"eee965fc9a9796629c8b1199f52b09e2d0e92873","datavalue":{"value":"10.1007/3-540-56402-0","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q684569$55F2BF45-83EA-4B3C-8DFA-D597E0C531C5","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":"Q684569$5B7D0CA7-BA10-40D8-8155-686C70D6C492","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"fc70e0fe82d354b90b4fac4c3dadc569c3253975","datavalue":{"value":{"time":"+1993-09-21T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q684569$B9E79581-96A5-4E6E-BA17-599B441D260A","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"bdf705003634c1120deeed45d94cf70894ab466d","datavalue":{"value":"The articles of this volume will be reviewed individually.  Indexed articles:  \\textit{Brandst\u00e4dt, Andreas}, On improved time bounds for permutation graph problems, 1-10 [Zbl 0789.68105]  \\textit{Hsu, Wen-Lian}, A simple test for interval graphs, 11-16 [Zbl 0789.68110]  \\textit{Felsner, Stefan}, Tolerance graphs and orders, 17-26 [Zbl 0791.05096]  \\textit{Jansen, Klaus}, On scheduling problems restricted to interval orders, 27-36 [Zbl 0789.68007]  \\textit{Bodlaender, Hans L.; Jansen, Klaus; Woeginger, Gerhard J.}, Scheduling with incompatible jobs, 37-49 [Zbl 0791.68011]  \\textit{Jansen, Klaus; Scheffler, Petra}, Generalized coloring for tree-like graphs, 50-59 [Zbl 0795.05057]  \\textit{Dahlhaus, Elias}, Optimal (parallel) algorithms for the all-to-all vertices distance problem for certain graph classes, 60-69 [Zbl 0789.68062]  \\textit{Hromkovi\u010d, Juraj}, Topology of parallel networks and computational complexity, 70-77 [Zbl 0789.68064]  \\textit{Preilowski, W.}, Parallel triangulation of nonconvex polytopes, 78-89 [Zbl 0789.68067]  \\textit{Bodlaender, Hans L.}, Kayles on special classes of graphs -- An application of Sprague-Grundy theory, 90-102 [Zbl 0789.68104]  \\textit{Chen, Jianer}, A linear time algorithm for isomorphism of graphs of bounded average genus, 103-113 [Zbl 0790.05081]  \\textit{Bhatia, Dinesh; Leighton, Tom; Makedon, Fillia; Norton, Carolyn H.}, Improved algorithms for routing on two-dimensional grids, 114-122 [Zbl 0844.90052]  \\textit{Ihler, Edmund}, Minimum rectilinear Steiner trees for intervals on two parallel lines, 123-134 [Zbl 0789.68111]  \\textit{Gerstel, O.; Zaks, S.}, A new characterization of tree medians with applications to distributed algorithms, 135-144 [Zbl 0791.05085]  \\textit{Dinitz, Efim}, The 3-edge-components and a structural description of all 3-edge-cuts in a graph, 145-157 [Zbl 0789.05077]  \\textit{Chen, Jianer; Kanevsky, Arkady}, On assembly of four-connected graphs. (Extended abstract), 158-169 [Zbl 0789.05055]  \\textit{Jamison, Beverly; Olariu, Stephan}, On the homogeneous decomposition of graphs, 170-183 [Zbl 0789.05079]  \\textit{Das, Sajal K.; Mao, Aisheng}, Embeddings in recursive combinatorial networks, 184-204 [Zbl 0789.68005]  \\textit{Thorup, Mikkel}, On shortcutting digraphs, 205-211 [Zbl 0793.68117]  \\textit{Cournier, Alain; Habib, Michel}, An efficient algorithm to recognize prime undirected graphs, 212-224 [Zbl 0925.05051]  \\textit{Felsner, Stefan; Wagner, Dorothea}, On the complexity of partial order properties, 225-235 [Zbl 0802.68064]  \\textit{Mosbah, Mohamed}, Probabilistic graph grammars, 236-247 [Zbl 0789.68085]  \\textit{Parisi-Presicce, Francesco}, Single vs. double pushout derivations of graphs, 248-262 [Zbl 0925.68282]  \\textit{Kant, Goos}, Hexagonal grid drawings, 263-276 [Zbl 0925.05056]  \\textit{Erwig, Martin}, Graph algorithms = iteration + data structures? The structure of graph algorithms and a corresponding style of programming, 277-292 [Zbl 0789.68107]  \\textit{Alimonti, Paola; Feuerstein, Esteban}, Petri nets, hypergraphs and conflicts. (Preliminary version), 293-309 [Zbl 0795.68148]  \\textit{Gergov, Jordan; Meinel, Christoph}, Analysis and manipulation of Boolean functions in terms of decision graphs, 310-320 [Zbl 0789.68108]  \\textit{O'Reilly, Una-May; Santoro, Nicola}, The expressiveness of silence: Tight bounds for synchronous communication of information using bits and silence, 321-332 [Zbl 0806.90041]  \\textit{Litovsky, Igor; M\u00e9tivier, Yves; Zielonka, Wies\u0142aw}, The power and the limitations of local computations on graphs, 333-345 [Zbl 0791.68131]","type":"string"},"datatype":"string"},"type":"statement","id":"Q684569$5924AA70-C66F-4EB3-8207-A9A966369F75","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q684569$B1A4B6F7-1ECF-4F34-833E-3FE6DF472E2B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q684569$1C30040D-F070-40A6-A8E5-EAA58A262157","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q684569$18DE4BC4-00F1-4E5A-900D-AEA954D9E624","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"f1a97a7188d4143e338e99eba7d65493911702cf","datavalue":{"value":"05Cxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q684569$DAB69221-9A73-4E7F-A9D6-AA834325BD4C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q684569$8EB37B0D-C0A5-4FDE-9F91-F7376DF5048C","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"5c71b5422e28148b75c2ca116adb09999ab35187","datavalue":{"value":"419011","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q684569$9B392379-6AD4-435F-95F4-382D158C02BE","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ca4e11b30678ac668b6aaed8c48fc9182e8be198","datavalue":{"value":"Wiesbaden-Naurod (Germany)","type":"string"},"datatype":"string"},"type":"statement","id":"Q684569$11BD6A8D-41BD-4967-8569-366B29A49A13","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f7c2172f0a2ed6197400daa3f44dae0d79725b1a","datavalue":{"value":"Workshop","type":"string"},"datatype":"string"},"type":"statement","id":"Q684569$22168AD1-045E-4908-B91C-CA473AED0E64","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q684569$B52521D5-C015-482E-9197-F58879ACA335","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"380c7e6a73d37e3b1da3c98430f36ad1e3f159d8","datavalue":{"value":"WG '92","type":"string"},"datatype":"string"},"type":"statement","id":"Q684569$E8EDC0B6-C8D1-41FE-ACEB-9ED9A3ADB25A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9cc61f3061db35c19dbc3691ea1c8ffa98df95eb","datavalue":{"value":"Graph-theoretic concepts","type":"string"},"datatype":"string"},"type":"statement","id":"Q684569$8C1F95C0-4985-4CA1-AB0E-FE269B275531","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"fa78ad5518ca246bcf12a7a95d0f4aea27c592e5","datavalue":{"value":"Computer science","type":"string"},"datatype":"string"},"type":"statement","id":"Q684569$95DEC194-B5F8-41FA-8B14-325BC9CF58F6","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":"Q684569$F8D4D8D0-C785-41A6-93D3-9F856D24F0F9","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"386cda6f7ed1918b19e764b79cffb0a9b5804454","datavalue":{"value":"https://doi.org/10.1007/3-540-56402-0","type":"string"},"datatype":"url"},"type":"statement","id":"Q684569$B95B4305-B924-401B-A871-51621B3E35C4","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"623522191968bac015ed6c6ecdf5f69d45af2523","datavalue":{"value":"W2498125457","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q684569$421A04E3-4D6A-4F79-BF0D-BF59E2DB1938","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Graph-theoretic concepts in computer science. 18th international workshop, WG '92, Wiesbaden-Naurod, Germany, June 18-20, 1992. Proceedings","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Graph-theoretic_concepts_in_computer_science._18th_international_workshop,_WG_%2792,_Wiesbaden-Naurod,_Germany,_June_18-20,_1992._Proceedings"}}}}}