{"entities":{"Q5901415":{"pageid":8009045,"ns":120,"title":"Item:Q5901415","lastrevid":97590743,"modified":"2026-06-05T15:03:25Z","type":"item","id":"Q5901415","labels":{"en":{"language":"en","value":"Fast enumeration algorithms for non-crossing geometric graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 5507887"}},"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":"Q5901415$1490696A-D5AE-4AB4-AAEA-5B67C7ED887C","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"61213232efafad1c9c93d6016d74623e208f4608","datavalue":{"value":{"text":"Fast enumeration algorithms for non-crossing geometric graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5901415$5E47C78E-350E-42C1-B4D9-998A4019DFBB","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"cfbc83a7b43363313494007e788cd603c5af8c17","datavalue":{"value":"1221.05295","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5901415$79607118-87C0-4B5C-A8C0-85F0631DF390","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"1bdb63a8a6a284c82a82329bc361ac15e8089517","datavalue":{"value":"10.1145/1377676.1377733","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5901415$CA589D75-1A64-429C-8193-5F02E2264F3D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"857bf70e7d30bebc99244cb54d69e95a358f4fc1","datavalue":{"value":{"entity-type":"item","numeric-id":202561,"id":"Q202561"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5901415$D7F91154-FEC9-496C-B2BC-3DDCD12E6A58","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b13125cd9ec0e8ca7493d04b3c5c31be29c414cc","datavalue":{"value":{"entity-type":"item","numeric-id":262308,"id":"Q262308"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5901415$6C745F53-93A2-4F43-893C-DE174DAE9894","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"3dcc7051725ceb73efbc4f74374638babf99a732","datavalue":{"value":{"entity-type":"item","numeric-id":3602897,"id":"Q3602897"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5901415$2AA6FE2B-CE3D-407A-A59E-9F1C11FE4AF9","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"662c9d768c258b8c4aa4cc6d6ce95028979dfb46","datavalue":{"value":{"time":"+2009-02-12T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5901415$7D08D842-2A72-43D2-8AE5-149154E5E64E","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"9c67d0b38ad5529186f5c03985dedff3dbf7807d","datavalue":{"value":"http://hdl.handle.net/2433/84844","type":"string"},"datatype":"url"},"type":"statement","id":"Q5901415$0F1DD1A7-256A-4691-A054-771881F65B2B","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"749b7137f279a66a306e75e15f613231b281c1c5","datavalue":{"value":"05C85","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5901415$4C52E97C-FB6A-43EB-A875-A10C114B101C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1de0493fc6f7fe4361a54e7c2f5546e4ec52adf0","datavalue":{"value":"05C30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5901415$F0C3DBF1-495A-429D-8204-A7C110658C66","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"357c7c34a1a90d83243f17011b7aa90788d1792d","datavalue":{"value":"05C10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5901415$5A05E9FC-C696-4B50-9B91-9E6A6DDE1D65","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"104b7de0db6e25a40f17698c22749c9ae605e275","datavalue":{"value":"5507887","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5901415$E8BA7792-78B3-4FE9-974C-E040CEC1CFB2","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":"Q5901415$31187944-49B8-49F7-AB61-4D2D69ACCA4B","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"91515fd7d0b52812b43e8976f923271b8ab53092","datavalue":{"value":"W2017870334","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5901415$CFABF4B5-D612-4AE1-BA72-B332440AD0C0","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Fast enumeration algorithms for non-crossing geometric graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Fast_enumeration_algorithms_for_non-crossing_geometric_graphs"}}}}}