{"entities":{"Q1188643":{"pageid":1199392,"ns":120,"title":"Item:Q1188643","lastrevid":69851862,"modified":"2026-04-13T10:46:24Z","type":"item","id":"Q1188643","labels":{"en":{"language":"en","value":"Graph-theoretic concepts in computer science. 15th international workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 45983"}},"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":"Q1188643$9562FCB7-F26C-4F34-A67D-A4F9C89763DF","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"367517a820f73dd7e6f1560cc0553b177e439dcd","datavalue":{"value":{"text":"Graph-theoretic concepts in computer science. 15th international workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1188643$9B152991-3633-41A0-90E0-84D111D61580","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"c6726c6c82fb6f4df78a53fa8f6ad50054b94a64","datavalue":{"value":"0759.00013","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1188643$0A34A6FF-E2EE-4509-A7FA-275102303CFE","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"e5f0cf6f93b8b8f9a20a7116b3e1e20b7b948fd3","datavalue":{"value":"10.1007/3-540-52292-1","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1188643$BA6ED6D8-C2B7-416E-87D5-34BCC2B0FBBC","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":"Q1188643$C236A870-8C97-4465-A8F0-FA5A4C353076","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"4f64992dbeef321276c91b04bb85fa175c4114d8","datavalue":{"value":{"time":"+1993-01-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":"Q1188643$496E1F47-812C-46A9-A4CF-01F08183CDF1","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"da56d7656a35d308e3a2b7230a741f9708f9642b","datavalue":{"value":"The articles of this volume will be reviewed individually.  Indexed articles:  \\textit{Madhavapeddy, Seshu; Sudborough, I. Hal}, Disjoint paths in the hypercube, 3-18 [Zbl 0768.68163]  \\textit{Capocelli, Renato M.; Gargano, Luisa; Vaccaro, Ugo}, Time bounds for broadcasting in bounded degree graphs, 19-33 [Zbl 0768.68123]  \\textit{Das, A.; Thulasiraman, K.; Agarwal, V. K.; Lakshmanan, K. B.}, \\(t/s\\)-diagnosable systems: A characterization and diagnosis algorithm, 34-45 [Zbl 0778.68016]  \\textit{Geva, Robert Y.; Paz, Azaria}, Toward a complete representation of graphoids in graphs. (Abridged version), 46-62 [Zbl 0768.68141]  \\textit{Ruland, Detlev}, CADULA -- A graph-based model for monitoring CAD-processes, 63-77 [Zbl 0788.68152]  \\textit{Vogler, Walter}, On hyperedge replacement and BNLC graph grammars, 78-93 [Zbl 0768.68186]  \\textit{Billaud, Michel; Lafon, Pierre; Metivier, Yves; Sopena, Eric}, Graph rewriting systems with priorities, 94-106 [Zbl 0768.68120]  \\textit{Habel, Annegret; Kreowski, Hans-J\u00f6rg}, Filtering hyperedge-replacement languages through compatible properties, 107-120 [Zbl 0787.68067]  \\textit{Schneider, H. J.}, Describing distributed systems by categorical graph grammars, 121-135 [Zbl 0768.68178]  \\textit{Bunke, H.; Haller, B.}, A parser for context free plex grammars, 136-150 [Zbl 0778.68054]  \\textit{Sch\u00fcrr, Andy}, Introduction to PROGRESS, an attribute graph grammar based specification language, 151-165 [Zbl 0788.68097]  \\textit{Brandenburg, Franz J.}, On the complexity of optimal drawings of graphs, 166-180 [Zbl 0768.68122]  \\textit{Sys\u0142o, Maciej M.}, Bounds to the page number of partially ordered sets, 181-195 [Zbl 0774.06002]  \\textit{Reich, Gabriele; Widmayer, Peter}, Beyond Steiner's problem: A VLSI oriented generalization, 196-210 [Zbl 0768.68176]  \\textit{Schiermeyer, Ingo}, A fast sequential and parallel algorithm for the computation of the k- closure of a graph, 211-217 [Zbl 0768.68028]  \\textit{Speckenmeyer, Ewald}, On feedback problems in digraphs, 218-231 [Zbl 0768.68181]  \\textit{Bodlaender, Hans L.}, Improved self-reduction algorithms for graphs with bounded treewidth, 232-244 [Zbl 0768.68033]  \\textit{Simon, Klaus}, Finding a minimal transitive reduction in a strongly connected digraph within linear time, 245-259 [Zbl 0768.68180]  \\textit{Henrich, Andreas; Six, Hans-Werner; Widmayer, Peter}, Paging binary trees with external balancing, 260-276 [Zbl 0768.68144]  \\textit{Lozano, Antonio; Balc\u00e1zar, Jos\u00e9 L.}, The complexity of graph problems for succinctly represented graphs, 277-286 [Zbl 0768.68053]  \\textit{Anderson, Richard; Kahan, Simon; Schlag, Martine}, An \\(O(n\\log n)\\) algorithm for 1-D tile compaction, 287-301 [Zbl 0778.68086]  \\textit{Menzel, K.; Monien, B.}, Weighted parallel triangulation of simple polygons, 302-315 [Zbl 0771.68105]  \\textit{Dehne, Frank; Rau-Chaplin, Andrew}, Implementing data structures on a hypercube multiprocessor, and applications in parallel computational geometry, 316-329 [Zbl 0768.68010]  \\textit{Roos, Thomas}, k-nearest-neighbor Voronoi diagrams for sets of convex polygons, line segments and points, 330-340 [Zbl 0779.68090]  \\textit{van Kreveld, Marc J.; Berg, Mark T.}, Finding squares and rectangles in sets of points, 341-355 [Zbl 0783.68133]  \\textit{Klein, Rolf}, Combinatorial properties of abstract Voronoi diagrams, 356-369 [Zbl 0778.68089]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1188643$AF49A6DA-9E6A-4514-B58E-984D31906661","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1188643$959C25A4-78A2-4885-90AC-2DD522A0526B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1188643$BF9B3DDC-7CAF-44E6-9D45-2D44C108A32D","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"23c7d5845f380c48ece6c9feaea3c3444bcdb617","datavalue":{"value":"45983","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1188643$41DD38C9-ECAD-407B-B069-5065F3E3B51E","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a1cdf035bab68790e1b5d11b72a7f2b7d8f9afcc","datavalue":{"value":"Castle Rolduc (Netherlands)","type":"string"},"datatype":"string"},"type":"statement","id":"Q1188643$A47D3262-8E07-406B-9F4E-BB6815205C07","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9cc61f3061db35c19dbc3691ea1c8ffa98df95eb","datavalue":{"value":"Graph-theoretic concepts","type":"string"},"datatype":"string"},"type":"statement","id":"Q1188643$33B84612-41D9-4A4F-827D-4AC72A693193","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1962714433072f6fde50215713abc1bc262405eb","datavalue":{"value":"Computer Science","type":"string"},"datatype":"string"},"type":"statement","id":"Q1188643$132BB392-20DC-46B6-BBBD-90AA281791DF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f7c2172f0a2ed6197400daa3f44dae0d79725b1a","datavalue":{"value":"Workshop","type":"string"},"datatype":"string"},"type":"statement","id":"Q1188643$1DABDAAA-E866-44E7-9822-A31879AA7D86","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q1188643$5AB56A6A-20C9-4990-9D48-3D0F68E0C248","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":"Q1188643$6D7DA7F0-F435-4229-A20A-91B437B36F63","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"ea1b521c1dfd47b54beaf5821759dbaf5e00c679","datavalue":{"value":"https://doi.org/10.1007/3-540-52292-1","type":"string"},"datatype":"url"},"type":"statement","id":"Q1188643$30622C05-A880-4DD5-9791-43CE72ABF0F7","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"1fd5b94b2938d97336773f259a78808a7a343507","datavalue":{"value":"W2477275781","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1188643$75C1A3F6-3FB5-4D55-B1C1-3BF45AFCCA43","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Graph-theoretic concepts in computer science. 15th international workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989. Proceedings","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Graph-theoretic_concepts_in_computer_science._15th_international_workshop_WG_%2789,_Castle_Rolduc,_The_Netherlands,_June_14-16,_1989._Proceedings"}}}}}