Sinfonie Nr. 95 c-Moll - Taschenbuch

Buch in der Datenbank seit 2007-06-12T13:50:21+02:00 (Berlin)
Buch zuletzt gefunden am 2024-11-01T05:28:00+01:00 (Berlin)
ISBN/EAN: 3795768624

ISBN - alternative Schreibweisen:
3-7957-6862-4, 978-3-7957-6862-1
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: haydn joseph, ernst moll, eulenburg
Titel des Buches: londoner, sinfonie moll partitur, studienpartitur, haydn london, eulenburg score, symphony, joseph haydn

Daten vom Verlag:

Autor/in: Joseph Haydn
Titel: Eulenburg Studienpartituren; Sinfonie Nr. 95 c-Moll - Londoner Nr. 5". Hob. I: 95. Orchester. Studienpartitur. Schott Music 92 1971-04-01 GB PI; Noten | Studienpartitur (Broschur); Hardcover, Softcover / Musik/Musikalien; Komposition; Ernst Eulenburg; Orchester; Partitur; Orchester und formale Musik; Partituren, Libretti, Liedtexte 67 16.00 EUR 135 190 GB a:3:{s:4:"NAME";s:7:"Product";s:5:"ATTRS";a:1:{s:9:"datestamp";s:8:"20250122";}s:5:"CHILD";a:11:{i:0;a:2:{s:4:"NAME";s:15:"RecordReference";s:5:"CDATA";s:32:"8889eb3701f74a41802d1855c73fd2ba";}i:1;a:2:{s:4:"NAME";s:16:"NotificationType";s:5:"CDATA";s:2:"03";}i:2;a:2:{s:4:"NAME";s:17:"ProductIdentifier";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:13:"ProductIDType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:10:"IDTypeName";s:5:"CDATA";s:10:"VLB_ID_old";}i:2;a:2:{s:4:"NAME";s:7:"IDValue";s:5:"CDATA";s:7:"1928775";}}}i:3;a:2:{s:4:"NAME";s:17:"ProductIdentifier";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:13:"ProductIDType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:10:"IDTypeName";s:5:"CDATA";s:19:"Publishers Order No";}i:2;a:2:{s:4:"NAME";s:7:"IDValue";s:5:"CDATA";s:7:"ETP 480";}}}i:4;a:2:{s:4:"NAME";s:17:"ProductIdentifier";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:13:"ProductIDType";s:5:"CDATA";s:2:"02";}i:1;a:2:{s:4:"NAME";s:7:"IDValue";s:5:"CDATA";s:10:"3795768624";}}}i:5;a:2:{s:4:"NAME";s:17:"ProductIdentifier";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:13:"ProductIDType";s:5:"CDATA";s:2:"03";}i:1;a:2:{s:4:"NAME";s:7:"IDValue";s:5:"CDATA";s:13:"9783795768621";}}}i:6;a:2:{s:4:"NAME";s:17:"ProductIdentifier";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:13:"ProductIDType";s:5:"CDATA";s:2:"15";}i:1;a:2:{s:4:"NAME";s:7:"IDValue";s:5:"CDATA";s:13:"9783795768621";}}}i:7;a:2:{s:4:"NAME";s:17:"DescriptiveDetail";s:5:"CHILD";a:26:{i:0;a:2:{s:4:"NAME";s:18:"ProductComposition";s:5:"CDATA";s:2:"00";}i:1;a:2:{s:4:"NAME";s:11:"ProductForm";s:5:"CDATA";s:2:"PI";}i:2;a:2:{s:4:"NAME";s:18:"ProductFormFeature";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:22:"ProductFormFeatureType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:23:"ProductFormFeatureValue";s:5:"CDATA";s:3:"BLK";}i:2;a:2:{s:4:"NAME";s:29:"ProductFormFeatureDescription";s:5:"CDATA";s:2:"2%";}}}i:3;a:2:{s:4:"NAME";s:18:"ProductFormFeature";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:22:"ProductFormFeatureType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:23:"ProductFormFeatureValue";s:5:"CDATA";s:3:"BRN";}i:2;a:2:{s:4:"NAME";s:29:"ProductFormFeatureDescription";s:5:"CDATA";s:2:"7%";}}}i:4;a:2:{s:4:"NAME";s:18:"ProductFormFeature";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:22:"ProductFormFeatureType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:23:"ProductFormFeatureValue";s:5:"CDATA";s:3:"GRN";}i:2;a:2:{s:4:"NAME";s:29:"ProductFormFeatureDescription";s:5:"CDATA";s:2:"4%";}}}i:5;a:2:{s:4:"NAME";s:18:"ProductFormFeature";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:22:"ProductFormFeatureType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:23:"ProductFormFeatureValue";s:5:"CDATA";s:3:"YEL";}i:2;a:2:{s:4:"NAME";s:29:"ProductFormFeatureDescription";s:5:"CDATA";s:3:"88%";}}}i:6;a:2:{s:4:"NAME";s:22:"ProductFormDescription";s:5:"CDATA";s:34:"Noten | Studienpartitur (Broschur)";}i:7;a:2:{s:4:"NAME";s:18:"PrimaryContentType";s:5:"CDATA";s:2:"11";}i:8;a:2:{s:4:"NAME";s:7:"Measure";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:11:"MeasureType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:11:"Measurement";s:5:"CDATA";s:2:"19";}i:2;a:2:{s:4:"NAME";s:15:"MeasureUnitCode";s:5:"CDATA";s:2:"cm";}}}i:9;a:2:{s:4:"NAME";s:7:"Measure";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:11:"MeasureType";s:5:"CDATA";s:2:"02";}i:1;a:2:{s:4:"NAME";s:11:"Measurement";s:5:"CDATA";s:4:"13.5";}i:2;a:2:{s:4:"NAME";s:15:"MeasureUnitCode";s:5:"CDATA";s:2:"cm";}}}i:10;a:2:{s:4:"NAME";s:7:"Measure";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:11:"MeasureType";s:5:"CDATA";s:2:"08";}i:1;a:2:{s:4:"NAME";s:11:"Measurement";s:5:"CDATA";s:2:"67";}i:2;a:2:{s:4:"NAME";s:15:"MeasureUnitCode";s:5:"CDATA";s:2:"gr";}}}i:11;a:2:{s:4:"NAME";s:20:"CountryOfManufacture";s:5:"CDATA";s:2:"GB";}i:12;a:2:{s:4:"NAME";s:21:"ProductClassification";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:25:"ProductClassificationType";s:5:"CDATA";s:2:"04";}i:1;a:2:{s:4:"NAME";s:25:"ProductClassificationCode";s:5:"CDATA";s:8:"49040000";}}}i:13;a:2:{s:4:"NAME";s:10:"Collection";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:14:"CollectionType";s:5:"CDATA";s:2:"10";}i:1;a:2:{s:4:"NAME";s:20:"CollectionIdentifier";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:16:"CollectionIDType";s:5:"CDATA";s:2:"04";}i:1;a:2:{s:4:"NAME";s:7:"IDValue";s:5:"CDATA";s:5:"RF635";}}}i:2;a:2:{s:4:"NAME";s:11:"TitleDetail";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:9:"TitleType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:12:"TitleElement";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:17:"TitleElementLevel";s:5:"CDATA";s:2:"02";}i:1;a:2:{s:4:"NAME";s:9:"TitleText";s:5:"CDATA";s:27:"Eulenburg Studienpartituren";}}}}}}}i:14;a:2:{s:4:"NAME";s:11:"TitleDetail";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:9:"TitleType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:12:"TitleElement";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:17:"TitleElementLevel";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:9:"TitleText";s:5:"CDATA";s:22:"Sinfonie Nr. 95 c-Moll";}i:2;a:2:{s:4:"NAME";s:8:"Subtitle";s:5:"CDATA";s:57:"Londoner Nr. 5". Hob. I: 95. Orchester. Studienpartitur.";}}}}}i:15;a:2:{s:4:"NAME";s:11:"Contributor";s:5:"CHILD";a:8:{i:0;a:2:{s:4:"NAME";s:14:"SequenceNumber";s:5:"CDATA";s:1:"1";}i:1;a:2:{s:4:"NAME";s:15:"ContributorRole";s:5:"CDATA";s:3:"A06";}i:2;a:2:{s:4:"NAME";s:10:"PersonName";s:5:"CDATA";s:12:"Joseph Haydn";}i:3;a:2:{s:4:"NAME";s:18:"PersonNameInverted";s:5:"CDATA";s:13:"Haydn, Joseph";}i:4;a:2:{s:4:"NAME";s:14:"NamesBeforeKey";s:5:"CDATA";s:6:"Joseph";}i:5;a:2:{s:4:"NAME";s:8:"KeyNames";s:5:"CDATA";s:5:"Haydn";}i:6;a:2:{s:4:"NAME";s:15:"ContributorDate";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:19:"ContributorDateRole";s:5:"CDATA";s:2:"50";}i:1;a:3:{s:4:"NAME";s:4:"Date";s:5:"ATTRS";a:1:{s:10:"dateformat";s:2:"00";}s:5:"CDATA";s:8:"17320331";}}}i:7;a:2:{s:4:"NAME";s:15:"ContributorDate";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:19:"ContributorDateRole";s:5:"CDATA";s:2:"51";}i:1;a:3:{s:4:"NAME";s:4:"Date";s:5:"ATTRS";a:1:{s:10:"dateformat";s:2:"00";}s:5:"CDATA";s:8:"18090531";}}}}}i:16;a:2:{s:4:"NAME";s:11:"Contributor";s:5:"CHILD";a:8:{i:0;a:2:{s:4:"NAME";s:14:"SequenceNumber";s:5:"CDATA";s:1:"2";}i:1;a:2:{s:4:"NAME";s:15:"ContributorRole";s:5:"CDATA";s:3:"B01";}i:2;a:2:{s:4:"NAME";s:10:"PersonName";s:5:"CDATA";s:14:"Harry Newstone";}i:3;a:2:{s:4:"NAME";s:18:"PersonNameInverted";s:5:"CDATA";s:15:"Newstone, Harry";}i:4;a:2:{s:4:"NAME";s:14:"NamesBeforeKey";s:5:"CDATA";s:5:"Harry";}i:5;a:2:{s:4:"NAME";s:8:"KeyNames";s:5:"CDATA";s:8:"Newstone";}i:6;a:2:{s:4:"NAME";s:15:"ContributorDate";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:19:"ContributorDateRole";s:5:"CDATA";s:2:"50";}i:1;a:3:{s:4:"NAME";s:4:"Date";s:5:"ATTRS";a:1:{s:10:"dateformat";s:2:"00";}s:5:"CDATA";s:8:"19210621";}}}i:7;a:2:{s:4:"NAME";s:15:"ContributorDate";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:19:"ContributorDateRole";s:5:"CDATA";s:2:"51";}i:1;a:3:{s:4:"NAME";s:4:"Date";s:5:"ATTRS";a:1:{s:10:"dateformat";s:2:"00";}s:5:"CDATA";s:8:"20060416";}}}}}i:17;a:2:{s:4:"NAME";s:16:"EditionStatement";s:5:"CDATA";s:18:"New Urtext Edition";}i:18;a:2:{s:4:"NAME";s:6:"Extent";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:10:"ExtentType";s:5:"CDATA";s:2:"00";}i:1;a:2:{s:4:"NAME";s:11:"ExtentValue";s:5:"CDATA";s:2:"92";}i:2;a:2:{s:4:"NAME";s:10:"ExtentUnit";s:5:"CDATA";s:2:"03";}}}i:19;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:5:{i:0;a:1:{s:4:"NAME";s:11:"MainSubject";}i:1;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"26";}i:2;a:2:{s:4:"NAME";s:20:"SubjectSchemeVersion";s:5:"CDATA";s:3:"2.0";}i:3;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:4:"1598";}i:4;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:39:"Hardcover, Softcover / Musik/Musikalien";}}}i:20;a:3:{s:4:"NAME";s:7:"Subject";s:5:"ATTRS";a:1:{s:10:"sourcename";s:9:"Publisher";}s:5:"CHILD";a:5:{i:0;a:1:{s:4:"NAME";s:11:"MainSubject";}i:1;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"93";}i:2;a:2:{s:4:"NAME";s:20:"SubjectSchemeVersion";s:5:"CDATA";s:3:"1.6";}i:3;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:4:"AVSD";}i:4;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:11:"Komposition";}}}i:21;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"20";}i:1;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:15:"Ernst Eulenburg";}}}i:22;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"20";}i:1;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:9:"Orchester";}}}i:23;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"20";}i:1;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:8:"Partitur";}}}i:24;a:3:{s:4:"NAME";s:7:"Subject";s:5:"ATTRS";a:1:{s:10:"sourcename";s:9:"Publisher";}s:5:"CHILD";a:4:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"93";}i:1;a:2:{s:4:"NAME";s:20:"SubjectSchemeVersion";s:5:"CDATA";s:3:"1.6";}i:2;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:4:"AVLA";}i:3;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:27:"Orchester und formale Musik";}}}i:25;a:3:{s:4:"NAME";s:7:"Subject";s:5:"ATTRS";a:1:{s:10:"sourcename";s:9:"Publisher";}s:5:"CHILD";a:4:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"93";}i:1;a:2:{s:4:"NAME";s:20:"SubjectSchemeVersion";s:5:"CDATA";s:3:"1.6";}i:2;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:3:"AVQ";}i:3;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:31:"Partituren, Libretti, Liedtexte";}}}}}i:8;a:2:{s:4:"NAME";s:16:"CollateralDetail";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:11:"TextContent";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:8:"TextType";s:5:"CDATA";s:2:"03";}i:1;a:2:{s:4:"NAME";s:15:"ContentAudience";s:5:"CDATA";s:2:"00";}i:2;a:3:{s:4:"NAME";s:4:"Text";s:5:"ATTRS";a:2:{s:10:"textformat";s:2:"06";s:8:"language";s:3:"ger";}s:5:"CDATA";s:284:"Mit über 1.200 Titeln aus Orchester- und Chorliteratur, Kammermusik und Musiktheater ist die Edition Eulenburg die größte Partiturreihe der Welt. Sie deckt einen großen Teil der Musikgeschichte vom Barock bis zur klassischen Moderne ab und blickt auf eine lange Tradition zurück.";}}}i:1;a:2:{s:4:"NAME";s:18:"SupportingResource";s:5:"CHILD";a:4:{i:0;a:2:{s:4:"NAME";s:19:"ResourceContentType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:15:"ContentAudience";s:5:"CDATA";s:2:"00";}i:2;a:2:{s:4:"NAME";s:12:"ResourceMode";s:5:"CDATA";s:2:"03";}i:3;a:2:{s:4:"NAME";s:15:"ResourceVersion";s:5:"CHILD";a:10:{i:0;a:2:{s:4:"NAME";s:12:"ResourceForm";s:5:"CDATA";s:2:"02";}i:1;a:2:{s:4:"NAME";s:22:"ResourceVersionFeature";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:26:"ResourceVersionFeatureType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:12:"FeatureValue";s:5:"CDATA";s:4:"D502";}}}i:2;a:2:{s:4:"NAME";s:22:"ResourceVersionFeature";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:26:"ResourceVersionFeatureType";s:5:"CDATA";s:2:"02";}i:1;a:2:{s:4:"NAME";s:12:"FeatureValue";s:5:"CDATA";s:3:"648";}}}i:3;a:2:{s:4:"NAME";s:22:"ResourceVersionFeature";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:26:"ResourceVersionFeatureType";s:5:"CDATA";s:2:"03";}i:1;a:2:{s:4:"NAME";s:12:"FeatureValue";s:5:"CDATA";s:3:"460";}}}i:4;a:2:{s:4:"NAME";s:22:"ResourceVersionFeature";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:26:"ResourceVersionFeatureType";s:5:"CDATA";s:2:"04";}i:1;a:2:{s:4:"NAME";s:12:"FeatureValue";s:5:"CDATA";s:17:"9783795768621.jpg";}}}i:5;a:2:{s:4:"NAME";s:22:"ResourceVersionFeature";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:26:"ResourceVersionFeatureType";s:5:"CDATA";s:2:"06";}i:1;a:2:{s:4:"NAME";s:12:"FeatureValue";s:5:"CDATA";s:32:"733b8972e0ec48a903b7522f161e9488";}}}i:6;a:2:{s:4:"NAME";s:22:"ResourceVersionFeature";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:26:"ResourceVersionFeatureType";s:5:"CDATA";s:2:"07";}i:1;a:2:{s:4:"NAME";s:12:"FeatureValue";s:5:"CDATA";s:6:"114761";}}}i:7;a:2:{s:4:"NAME";s:22:"ResourceVersionFeature";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:26:"ResourceVersionFeatureType";s:5:"CDATA";s:2:"08";}i:1;a:2:{s:4:"NAME";s:12:"FeatureValue";s:5:"CDATA";s:64:"e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855";}}}i:8;a:2:{s:4:"NAME";s:12:"ResourceLink";s:5:"CDATA";s:47:"https://api.vlb.de/api/v1/cover/9783795768621/m";}i:9;a:2:{s:4:"NAME";s:11:"ContentDate";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:15:"ContentDateRole";s:5:"CDATA";s:2:"17";}i:1;a:3:{s:4:"NAME";s:4:"Date";s:5:"ATTRS";a:1:{s:10:"dateformat";s:2:"00";}s:5:"CDATA";s:8:"20240522";}}}}}}}}}i:9;a:2:{s:4:"NAME";s:16:"PublishingDetail";s:5:"CHILD";a:4:{i:0;a:2:{s:4:"NAME";s:9:"Publisher";s:5:"CHILD";a:4:{i:0;a:2:{s:4:"NAME";s:14:"PublishingRole";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:19:"PublisherIdentifier";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:15:"PublisherIDType";s:5:"CDATA";s:2:"05";}i:1;a:2:{s:4:"NAME";s:7:"IDValue";s:5:"CDATA";s:7:"5108882";}}}i:2;a:2:{s:4:"NAME";s:13:"PublisherName";s:5:"CDATA";s:12:"Schott Music";}i:3;a:2:{s:4:"NAME";s:7:"Website";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:11:"WebsiteRole";s:5:"CDATA";s:2:"02";}i:1;a:2:{s:4:"NAME";s:11:"WebsiteLink";s:5:"CDATA";s:38:"https://de.schott-music.com/shop/46717";}}}}}i:1;a:2:{s:4:"NAME";s:20:"CountryOfPublication";s:5:"CDATA";s:2:"GB";}i:2;a:2:{s:4:"NAME";s:16:"PublishingStatus";s:5:"CDATA";s:2:"04";}i:3;a:2:{s:4:"NAME";s:14:"PublishingDate";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:18:"PublishingDateRole";s:5:"CDATA";s:2:"01";}i:1;a:3:{s:4:"NAME";s:4:"Date";s:5:"ATTRS";a:1:{s:10:"dateformat";s:2:"00";}s:5:"CDATA";s:8:"19710401";}}}}}i:10;a:2:{s:4:"NAME";s:13:"ProductSupply";s:5:"CHILD";a:1:{i:0;a:2:{s:4:"NAME";s:12:"SupplyDetail";s:5:"CHILD";a:4:{i:0;a:2:{s:4:"NAME";s:8:"Supplier";s:5:"CHILD";a:4:{i:0;a:2:{s:4:"NAME";s:12:"SupplierRole";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:18:"SupplierIdentifier";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:14:"SupplierIDType";s:5:"CDATA";s:2:"05";}i:1;a:2:{s:4:"NAME";s:7:"IDValue";s:5:"CDATA";s:7:"5239424";}}}i:2;a:2:{s:4:"NAME";s:12:"SupplierName";s:5:"CDATA";s:31:"mds music distribution services";}i:3;a:2:{s:4:"NAME";s:7:"Website";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:11:"WebsiteRole";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:11:"WebsiteLink";s:5:"CDATA";s:26:"http://www.mds-partner.com";}}}}}i:1;a:2:{s:4:"NAME";s:19:"ProductAvailability";s:5:"CDATA";s:2:"20";}i:2;a:2:{s:4:"NAME";s:5:"Price";s:5:"CHILD";a:6:{i:0;a:2:{s:4:"NAME";s:9:"PriceType";s:5:"CDATA";s:2:"04";}i:1;a:2:{s:4:"NAME";s:11:"PriceStatus";s:5:"CDATA";s:2:"02";}i:2;a:2:{s:4:"NAME";s:11:"PriceAmount";s:5:"CDATA";s:5:"16.00";}i:3;a:2:{s:4:"NAME";s:3:"Tax";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:7:"TaxType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:11:"TaxRateCode";s:5:"CDATA";s:1:"R";}i:2;a:2:{s:4:"NAME";s:14:"TaxRatePercent";s:5:"CDATA";s:2:"10";}}}i:4;a:2:{s:4:"NAME";s:12:"CurrencyCode";s:5:"CDATA";s:3:"EUR";}i:5;a:2:{s:4:"NAME";s:9:"Territory";s:5:"CHILD";a:1:{i:0;a:2:{s:4:"NAME";s:17:"CountriesIncluded";s:5:"CDATA";s:2:"AT";}}}}}i:3;a:2:{s:4:"NAME";s:5:"Price";s:5:"CHILD";a:7:{i:0;a:2:{s:4:"NAME";s:9:"PriceType";s:5:"CDATA";s:2:"04";}i:1;a:2:{s:4:"NAME";s:20:"MinimumOrderQuantity";s:5:"CDATA";s:1:"1";}i:2;a:2:{s:4:"NAME";s:11:"PriceStatus";s:5:"CDATA";s:2:"02";}i:3;a:2:{s:4:"NAME";s:11:"PriceAmount";s:5:"CDATA";s:5:"15.50";}i:4;a:2:{s:4:"NAME";s:3:"Tax";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:7:"TaxType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:11:"TaxRateCode";s:5:"CDATA";s:1:"R";}i:2;a:2:{s:4:"NAME";s:14:"TaxRatePercent";s:5:"CDATA";s:1:"7";}}}i:5;a:2:{s:4:"NAME";s:12:"CurrencyCode";s:5:"CDATA";s:3:"EUR";}i:6;a:2:{s:4:"NAME";s:9:"Territory";s:5:"CHILD";a:1:{i:0;a:2:{s:4:"NAME";s:17:"CountriesIncluded";s:5:"CDATA";s:2:"DE";}}}}}}}}}}} 9783540479185 Frank Dehne Lecture Notes in Computer Science; Algorithms and Data Structures Third Workshop, WADS '93, Montreal, Canada, August 11-13, 1993. Proceedings Springer; Springer Berlin 636 2005-07-14 Berlin; Heidelberg; DE EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Algorithmen; Algorithms; Combinatorics; Complexity Theory; Datenstrukturen; Graph Theory; Kombinatorik; Komplexitätstheorie; algorithm; complexity; data structure; data structures; algorithm analysis and problem complexity; C; Theory of Computation; Programming Techniques; Analysis; Algorithms; Discrete Mathematics; Computer Science; Computerprogrammierung und Softwareentwicklung; Mathematische Analysis, allgemein; Algorithmen und Datenstrukturen; Diskrete Mathematik; BC eng 99.00 EUR Computing the all-pairs longest chains in the plane.- Towards a better understanding of pure packet routing.- Tolerating faults in meshes and other networks.- A generalization of binary search.- Groups and algebraic complexity.- Connected component and simple polygon intersection searching.- An optimal algorithm for finding the separation of simple polygons.- Balanced search trees made simple.- Probing a set of hyperplanes by lines and related problems.- A general lower bound on the I/O-complexity of comparison-based algorithms.- Point probe decision trees for geometric concept classes.- A dynamic separator algorithm.- Online load balancing of temporary tasks.- Connected domination and steiner set on asteroidal triple-free graphs.- The complexity of finding certain trees in tournaments.- Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract).- Separating the power of EREW and CREW PRAMs with small communication width.- Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs.- Parallel construction of quadtrees and quality triangulations.- Pattern matching for permutations.- Filling polyhedral molds.- Deferred-query—An efficient approach for problems on interval and circular-arc graphs.- On the complexity of graph embeddings.- Algorithms for polytope covering and approximation.- Global strategies for augmenting the efficiency of TSP heuristics.- Static and dynamic algorithms for k-point clustering problems.- Scalable algorithms for bichromatic line segment intersection problems on Coarse Grained Multicomputers.- Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract).- The K-D heap: Anefficient multi-dimensional priority queue.- A complete and efficient algorithm for the intersection of a general and a convex polyhedron.- Computing the smallest k-enclosing circle and related problems.- An index data structure for matrices, with applications to fast two-dimensional pattern matching.- A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects.- Further results on generalized intersection searching problems: Counting, reporting, and dynamization.- Generalized approximate algorithms for point set congruence.- Approximating shortest superstrings with constraints.- Tree reconstruction from partial orders.- Improved parallel depth-first search in undirected planar graphs.- On approximating the longest path in a graph.- Designing multi-commodity flow trees.- A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs.- On fat partitioning, fat covering and the union size of polygons.- A time-randomness tradeoff for selection in parallel.- Detecting race conditions in parallel programs that use one semaphore.- An algorithm for finding predecessors in integer sets.- The exhaustion of shared memory: Stochastic results.- Minimum weight euclidean matching and weighted relative neighborhood graphs.- Efficient approximate shortest-path queries among isothetic rectangular obstacles.- Counting and reporting red/blue segment intersections.- Repetitive hidden-surface-removal for polyhedral scenes.- On reconfigurability of VLSI linear arrays.- Reconstructing strings from substrings (Extended abstract).- Combinatorial complexity of signed discs.- Fast algorithms for one-dimensionsal compaction with jog insertion.- An optimal algorithm for roundness determination on convex polygons.- Practical algorithms on partial k-trees with an application to domination-like problems.- Greedy algorithms for the on-line steiner tree and generalized steiner problems. a:3:{s:4:"NAME";s:7:"Product";s:5:"ATTRS";a:1:{s:9:"datestamp";s:8:"20250122";}s:5:"CHILD";a:14:{i:0;a:2:{s:4:"NAME";s:15:"RecordReference";s:5:"CDATA";s:32:"888a3de9974d4ef4bfc043d989ca0838";}i:1;a:2:{s:4:"NAME";s:16:"NotificationType";s:5:"CDATA";s:2:"03";}i:2;a:2:{s:4:"NAME";s:17:"ProductIdentifier";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:13:"ProductIDType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:10:"IDTypeName";s:5:"CDATA";s:10:"VLB_ID_old";}i:2;a:2:{s:4:"NAME";s:7:"IDValue";s:5:"CDATA";s:7:"4969079";}}}i:3;a:2:{s:4:"NAME";s:17:"ProductIdentifier";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:13:"ProductIDType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:10:"IDTypeName";s:5:"CDATA";s:19:"Publishers Order No";}i:2;a:2:{s:4:"NAME";s:7:"IDValue";s:5:"CDATA";s:17:"978-3-540-47918-5";}}}i:4;a:2:{s:4:"NAME";s:17:"ProductIdentifier";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:13:"ProductIDType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:10:"IDTypeName";s:5:"CDATA";s:19:"Publishers Order No";}i:2;a:2:{s:4:"NAME";s:7:"IDValue";s:5:"CDATA";s:8:"11911937";}}}i:5;a:2:{s:4:"NAME";s:17:"ProductIdentifier";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:13:"ProductIDType";s:5:"CDATA";s:2:"02";}i:1;a:2:{s:4:"NAME";s:7:"IDValue";s:5:"CDATA";s:10:"354047918X";}}}i:6;a:2:{s:4:"NAME";s:17:"ProductIdentifier";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:13:"ProductIDType";s:5:"CDATA";s:2:"03";}i:1;a:2:{s:4:"NAME";s:7:"IDValue";s:5:"CDATA";s:13:"9783540479185";}}}i:7;a:2:{s:4:"NAME";s:17:"ProductIdentifier";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:13:"ProductIDType";s:5:"CDATA";s:2:"06";}i:1;a:2:{s:4:"NAME";s:7:"IDValue";s:5:"CDATA";s:21:"10.1007/3-540-57155-8";}}}i:8;a:2:{s:4:"NAME";s:17:"ProductIdentifier";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:13:"ProductIDType";s:5:"CDATA";s:2:"15";}i:1;a:2:{s:4:"NAME";s:7:"IDValue";s:5:"CDATA";s:13:"9783540479185";}}}i:9;a:2:{s:4:"NAME";s:17:"DescriptiveDetail";s:5:"CHILD";a:58:{i:0;a:2:{s:4:"NAME";s:18:"ProductComposition";s:5:"CDATA";s:2:"00";}i:1;a:2:{s:4:"NAME";s:11:"ProductForm";s:5:"CDATA";s:2:"EA";}i:2;a:2:{s:4:"NAME";s:17:"ProductFormDetail";s:5:"CDATA";s:4:"E107";}i:3;a:2:{s:4:"NAME";s:18:"ProductFormFeature";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:22:"ProductFormFeatureType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:23:"ProductFormFeatureValue";s:5:"CDATA";s:3:"BRN";}i:2;a:2:{s:4:"NAME";s:29:"ProductFormFeatureDescription";s:5:"CDATA";s:3:"23%";}}}i:4;a:2:{s:4:"NAME";s:18:"ProductFormFeature";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:22:"ProductFormFeatureType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:23:"ProductFormFeatureValue";s:5:"CDATA";s:3:"GRY";}i:2;a:2:{s:4:"NAME";s:29:"ProductFormFeatureDescription";s:5:"CDATA";s:2:"1%";}}}i:5;a:2:{s:4:"NAME";s:18:"ProductFormFeature";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:22:"ProductFormFeatureType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:23:"ProductFormFeatureValue";s:5:"CDATA";s:3:"SLV";}i:2;a:2:{s:4:"NAME";s:29:"ProductFormFeatureDescription";s:5:"CDATA";s:3:"75%";}}}i:6;a:2:{s:4:"NAME";s:18:"ProductFormFeature";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:22:"ProductFormFeatureType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:23:"ProductFormFeatureValue";s:5:"CDATA";s:3:"WHI";}i:2;a:2:{s:4:"NAME";s:29:"ProductFormFeatureDescription";s:5:"CDATA";s:2:"2%";}}}i:7;a:2:{s:4:"NAME";s:22:"ProductFormDescription";s:5:"CDATA";s:5:"eBook";}i:8;a:2:{s:4:"NAME";s:18:"PrimaryContentType";s:5:"CDATA";s:2:"10";}i:9;a:2:{s:4:"NAME";s:10:"Collection";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:14:"CollectionType";s:5:"CDATA";s:2:"10";}i:1;a:2:{s:4:"NAME";s:20:"CollectionIdentifier";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:16:"CollectionIDType";s:5:"CDATA";s:2:"04";}i:1;a:2:{s:4:"NAME";s:7:"IDValue";s:5:"CDATA";s:5:"RK676";}}}i:2;a:2:{s:4:"NAME";s:11:"TitleDetail";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:9:"TitleType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:12:"TitleElement";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:17:"TitleElementLevel";s:5:"CDATA";s:2:"02";}i:1;a:2:{s:4:"NAME";s:9:"TitleText";s:5:"CDATA";s:33:"Lecture Notes in Computer Science";}}}i:2;a:2:{s:4:"NAME";s:12:"TitleElement";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:17:"TitleElementLevel";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:10:"PartNumber";s:5:"CDATA";s:3:"709";}}}}}}}i:10;a:2:{s:4:"NAME";s:11:"TitleDetail";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:9:"TitleType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:12:"TitleElement";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:17:"TitleElementLevel";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:9:"TitleText";s:5:"CDATA";s:30:"Algorithms and Data Structures";}i:2;a:2:{s:4:"NAME";s:8:"Subtitle";s:5:"CDATA";s:75:"Third Workshop, WADS '93, Montreal, Canada, August 11-13, 1993. Proceedings";}}}}}i:11;a:2:{s:4:"NAME";s:11:"Contributor";s:5:"CHILD";a:6:{i:0;a:2:{s:4:"NAME";s:14:"SequenceNumber";s:5:"CDATA";s:1:"1";}i:1;a:2:{s:4:"NAME";s:15:"ContributorRole";s:5:"CDATA";s:3:"B01";}i:2;a:2:{s:4:"NAME";s:10:"PersonName";s:5:"CDATA";s:11:"Frank Dehne";}i:3;a:2:{s:4:"NAME";s:18:"PersonNameInverted";s:5:"CDATA";s:12:"Dehne, Frank";}i:4;a:2:{s:4:"NAME";s:14:"NamesBeforeKey";s:5:"CDATA";s:5:"Frank";}i:5;a:2:{s:4:"NAME";s:8:"KeyNames";s:5:"CDATA";s:5:"Dehne";}}}i:12;a:2:{s:4:"NAME";s:11:"Contributor";s:5:"CHILD";a:6:{i:0;a:2:{s:4:"NAME";s:14:"SequenceNumber";s:5:"CDATA";s:1:"2";}i:1;a:2:{s:4:"NAME";s:15:"ContributorRole";s:5:"CDATA";s:3:"B01";}i:2;a:2:{s:4:"NAME";s:10:"PersonName";s:5:"CDATA";s:19:"Jörg-Rüdiger Sack";}i:3;a:2:{s:4:"NAME";s:18:"PersonNameInverted";s:5:"CDATA";s:20:"Sack, Jörg-Rüdiger";}i:4;a:2:{s:4:"NAME";s:14:"NamesBeforeKey";s:5:"CDATA";s:14:"Jörg-Rüdiger";}i:5;a:2:{s:4:"NAME";s:8:"KeyNames";s:5:"CDATA";s:4:"Sack";}}}i:13;a:2:{s:4:"NAME";s:11:"Contributor";s:5:"CHILD";a:6:{i:0;a:2:{s:4:"NAME";s:14:"SequenceNumber";s:5:"CDATA";s:1:"3";}i:1;a:2:{s:4:"NAME";s:15:"ContributorRole";s:5:"CDATA";s:3:"B01";}i:2;a:2:{s:4:"NAME";s:10:"PersonName";s:5:"CDATA";s:14:"Nicola Santoro";}i:3;a:2:{s:4:"NAME";s:18:"PersonNameInverted";s:5:"CDATA";s:15:"Santoro, Nicola";}i:4;a:2:{s:4:"NAME";s:14:"NamesBeforeKey";s:5:"CDATA";s:6:"Nicola";}i:5;a:2:{s:4:"NAME";s:8:"KeyNames";s:5:"CDATA";s:7:"Santoro";}}}i:14;a:2:{s:4:"NAME";s:11:"Contributor";s:5:"CHILD";a:6:{i:0;a:2:{s:4:"NAME";s:14:"SequenceNumber";s:5:"CDATA";s:1:"4";}i:1;a:2:{s:4:"NAME";s:15:"ContributorRole";s:5:"CDATA";s:3:"B01";}i:2;a:2:{s:4:"NAME";s:10:"PersonName";s:5:"CDATA";s:14:"Sue Whitesides";}i:3;a:2:{s:4:"NAME";s:18:"PersonNameInverted";s:5:"CDATA";s:15:"Whitesides, Sue";}i:4;a:2:{s:4:"NAME";s:14:"NamesBeforeKey";s:5:"CDATA";s:3:"Sue";}i:5;a:2:{s:4:"NAME";s:8:"KeyNames";s:5:"CDATA";s:10:"Whitesides";}}}i:15;a:2:{s:4:"NAME";s:8:"Language";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:12:"LanguageRole";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:12:"LanguageCode";s:5:"CDATA";s:3:"eng";}}}i:16;a:2:{s:4:"NAME";s:6:"Extent";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:10:"ExtentType";s:5:"CDATA";s:2:"00";}i:1;a:2:{s:4:"NAME";s:11:"ExtentValue";s:5:"CDATA";s:3:"636";}i:2;a:2:{s:4:"NAME";s:10:"ExtentUnit";s:5:"CDATA";s:2:"03";}}}i:17;a:2:{s:4:"NAME";s:6:"Extent";s:5:"CHILD";a:4:{i:0;a:2:{s:4:"NAME";s:10:"ExtentType";s:5:"CDATA";s:2:"03";}i:1;a:2:{s:4:"NAME";s:11:"ExtentValue";s:5:"CDATA";s:2:"12";}i:2;a:2:{s:4:"NAME";s:16:"ExtentValueRoman";s:5:"CDATA";s:3:"XII";}i:3;a:2:{s:4:"NAME";s:10:"ExtentUnit";s:5:"CDATA";s:2:"03";}}}i:18;a:2:{s:4:"NAME";s:17:"IllustrationsNote";s:5:"CDATA";s:11:"XII, 636 p.";}i:19;a:2:{s:4:"NAME";s:16:"AncillaryContent";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:20:"AncillaryContentType";s:5:"CDATA";s:2:"26";}i:1;a:2:{s:4:"NAME";s:27:"AncillaryContentDescription";s:5:"CDATA";s:11:"XII, 636 p.";}}}i:20;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:3:{i:0;a:1:{s:4:"NAME";s:11:"MainSubject";}i:1;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"10";}i:2;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:9:"COM014000";}}}i:21;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:3:{i:0;a:1:{s:4:"NAME";s:11:"MainSubject";}i:1;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"12";}i:2;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:3:"UYA";}}}i:22;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:5:{i:0;a:1:{s:4:"NAME";s:11:"MainSubject";}i:1;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"26";}i:2;a:2:{s:4:"NAME";s:20:"SubjectSchemeVersion";s:5:"CDATA";s:3:"2.0";}i:3;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:4:"9632";}i:4;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:42:"Nonbooks, PBS / Informatik, EDV/Informatik";}}}i:23;a:3:{s:4:"NAME";s:7:"Subject";s:5:"ATTRS";a:1:{s:10:"sourcename";s:9:"Publisher";}s:5:"CHILD";a:5:{i:0;a:1:{s:4:"NAME";s:11:"MainSubject";}i:1;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"93";}i:2;a:2:{s:4:"NAME";s:20:"SubjectSchemeVersion";s:5:"CDATA";s:3:"1.6";}i:3;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:3:"UYA";}i:4;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:23:"Theoretische Informatik";}}}i:24;a:3:{s:4:"NAME";s:7:"Subject";s:5:"ATTRS";a:1:{s:10:"sourcename";s:3:"MVB";}s:5:"CHILD";a:4:{i:0;a:1:{s:4:"NAME";s:11:"MainSubject";}i:1;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"B8";}i:2;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:2:"10";}i:3;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:9:"Verstehen";}}}i:25;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"10";}i:1;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:9:"COM051000";}}}i:26;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"10";}i:1;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:9:"MAT034000";}}}i:27;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"10";}i:1;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:9:"COM051300";}}}i:28;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"10";}i:1;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:9:"MAT008000";}}}i:29;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"12";}i:1;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:2:"UM";}}}i:30;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"12";}i:1;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:3:"PBK";}}}i:31;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"12";}i:1;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:3:"UMB";}}}i:32;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"12";}i:1;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:3:"PBD";}}}i:33;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"20";}i:1;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:11:"Algorithmen";}}}i:34;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"20";}i:1;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:10:"Algorithms";}}}i:35;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"20";}i:1;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:13:"Combinatorics";}}}i:36;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"20";}i:1;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:17:"Complexity Theory";}}}i:37;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"20";}i:1;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:15:"Datenstrukturen";}}}i:38;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"20";}i:1;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:12:"Graph Theory";}}}i:39;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"20";}i:1;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:12:"Kombinatorik";}}}i:40;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"20";}i:1;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:20:"Komplexitätstheorie";}}}i:41;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"20";}i:1;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:9:"algorithm";}}}i:42;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"20";}i:1;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:10:"complexity";}}}i:43;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"20";}i:1;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:14:"data structure";}}}i:44;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"20";}i:1;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:15:"data structures";}}}i:45;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"20";}i:1;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:41:"algorithm analysis and problem complexity";}}}i:46;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"24";}i:1;a:2:{s:4:"NAME";s:17:"SubjectSchemeName";s:5:"CDATA";s:40:"Springer Nature Marketing Classification";}i:2;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:1:"C";}}}i:47;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:4:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"24";}i:1;a:2:{s:4:"NAME";s:17:"SubjectSchemeName";s:5:"CDATA";s:24:"Springer Nature Taxonomy";}i:2;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:4:"2981";}i:3;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:21:"Theory of Computation";}}}i:48;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:4:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"24";}i:1;a:2:{s:4:"NAME";s:17:"SubjectSchemeName";s:5:"CDATA";s:24:"Springer Nature Taxonomy";}i:2;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:4:"7055";}i:3;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:22:"Programming Techniques";}}}i:49;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:4:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"24";}i:1;a:2:{s:4:"NAME";s:17:"SubjectSchemeName";s:5:"CDATA";s:24:"Springer Nature Taxonomy";}i:2;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:4:"3076";}i:3;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:8:"Analysis";}}}i:50;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:4:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"24";}i:1;a:2:{s:4:"NAME";s:17:"SubjectSchemeName";s:5:"CDATA";s:24:"Springer Nature Taxonomy";}i:2;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:4:"5024";}i:3;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:10:"Algorithms";}}}i:51;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:4:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"24";}i:1;a:2:{s:4:"NAME";s:17:"SubjectSchemeName";s:5:"CDATA";s:24:"Springer Nature Taxonomy";}i:2;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:4:"4498";}i:3;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:20:"Discrete Mathematics";}}}i:52;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:4:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"24";}i:1;a:2:{s:4:"NAME";s:17:"SubjectSchemeName";s:5:"CDATA";s:34:"Springer Nature Subject Collection";}i:2;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:9:"SUCO11645";}i:3;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:16:"Computer Science";}}}i:53;a:3:{s:4:"NAME";s:7:"Subject";s:5:"ATTRS";a:1:{s:10:"sourcename";s:9:"Publisher";}s:5:"CHILD";a:4:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"93";}i:1;a:2:{s:4:"NAME";s:20:"SubjectSchemeVersion";s:5:"CDATA";s:3:"1.6";}i:2;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:2:"UM";}i:3;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:46:"Computerprogrammierung und Softwareentwicklung";}}}i:54;a:3:{s:4:"NAME";s:7:"Subject";s:5:"ATTRS";a:1:{s:10:"sourcename";s:9:"Publisher";}s:5:"CHILD";a:4:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"93";}i:1;a:2:{s:4:"NAME";s:20:"SubjectSchemeVersion";s:5:"CDATA";s:3:"1.6";}i:2;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:3:"PBK";}i:3;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:33:"Mathematische Analysis, allgemein";}}}i:55;a:3:{s:4:"NAME";s:7:"Subject";s:5:"ATTRS";a:1:{s:10:"sourcename";s:9:"Publisher";}s:5:"CHILD";a:4:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"93";}i:1;a:2:{s:4:"NAME";s:20:"SubjectSchemeVersion";s:5:"CDATA";s:3:"1.6";}i:2;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:3:"UMB";}i:3;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:31:"Algorithmen und Datenstrukturen";}}}i:56;a:3:{s:4:"NAME";s:7:"Subject";s:5:"ATTRS";a:1:{s:10:"sourcename";s:9:"Publisher";}s:5:"CHILD";a:4:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"93";}i:1;a:2:{s:4:"NAME";s:20:"SubjectSchemeVersion";s:5:"CDATA";s:3:"1.6";}i:2;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:3:"PBD";}i:3;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:19:"Diskrete Mathematik";}}}i:57;a:2:{s:4:"NAME";s:8:"Audience";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:16:"AudienceCodeType";s:5:"CDATA";s:2:"02";}i:1;a:2:{s:4:"NAME";s:20:"AudienceCodeTypeName";s:5:"CDATA";s:29:"Springer Nature Content Level";}i:2;a:2:{s:4:"NAME";s:17:"AudienceCodeValue";s:5:"CDATA";s:8:"Research";}}}}}i:10;a:2:{s:4:"NAME";s:16:"CollateralDetail";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:11:"TextContent";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:8:"TextType";s:5:"CDATA";s:2:"03";}i:1;a:2:{s:4:"NAME";s:15:"ContentAudience";s:5:"CDATA";s:2:"00";}i:2;a:3:{s:4:"NAME";s:4:"Text";s:5:"ATTRS";a:1:{s:10:"textformat";s:2:"06";}s:5:"CDATA";s:740:"The papers in this volume were presented at the Third Workshop on Algorithmsand Data Structures (WADS '93), held in Montreal, Canada, August 1993. The volume opens with five invited presentations: "Computing the all-pairs longest chains in the plane" by M.J. Atallah and D.Z. Chen, "Towards a better understanding of pure packet routing" by A. Borodin, "Tolerating faults in meshes and other networks" (abstract) by R. Cole, "A generalization of binary search" by R.M. Karp, and "Groups and algebraic complexity" (abstract) by A.C. Yao. The volume continues with 52 regular presentations selected from 165 submissions, each of which was evaluated by at least three program committee members, many of whom called upon additional reviewers.";}}}i:1;a:2:{s:4:"NAME";s:11:"TextContent";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:8:"TextType";s:5:"CDATA";s:2:"04";}i:1;a:2:{s:4:"NAME";s:15:"ContentAudience";s:5:"CDATA";s:2:"00";}i:2;a:3:{s:4:"NAME";s:4:"Text";s:5:"ATTRS";a:1:{s:10:"textformat";s:2:"06";}s:5:"CDATA";s:3735:"Computing the all-pairs longest chains in the plane.- Towards a better understanding of pure packet routing.- Tolerating faults in meshes and other networks.- A generalization of binary search.- Groups and algebraic complexity.- Connected component and simple polygon intersection searching.- An optimal algorithm for finding the separation of simple polygons.- Balanced search trees made simple.- Probing a set of hyperplanes by lines and related problems.- A general lower bound on the I/O-complexity of comparison-based algorithms.- Point probe decision trees for geometric concept classes.- A dynamic separator algorithm.- Online load balancing of temporary tasks.- Connected domination and steiner set on asteroidal triple-free graphs.- The complexity of finding certain trees in tournaments.- Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract).- Separating the power of EREW and CREW PRAMs with small communication width.- Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs.- Parallel construction of quadtrees and quality triangulations.- Pattern matching for permutations.- Filling polyhedral molds.- Deferred-query—An efficient approach for problems on interval and circular-arc graphs.- On the complexity of graph embeddings.- Algorithms for polytope covering and approximation.- Global strategies for augmenting the efficiency of TSP heuristics.- Static and dynamic algorithms for k-point clustering problems.- Scalable algorithms for bichromatic line segment intersection problems on Coarse Grained Multicomputers.- Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract).- The K-D heap: Anefficient multi-dimensional priority queue.- A complete and efficient algorithm for the intersection of a general and a convex polyhedron.- Computing the smallest k-enclosing circle and related problems.- An index data structure for matrices, with applications to fast two-dimensional pattern matching.- A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects.- Further results on generalized intersection searching problems: Counting, reporting, and dynamization.- Generalized approximate algorithms for point set congruence.- Approximating shortest superstrings with constraints.- Tree reconstruction from partial orders.- Improved parallel depth-first search in undirected planar graphs.- On approximating the longest path in a graph.- Designing multi-commodity flow trees.- A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs.- On fat partitioning, fat covering and the union size of polygons.- A time-randomness tradeoff for selection in parallel.- Detecting race conditions in parallel programs that use one semaphore.- An algorithm for finding predecessors in integer sets.- The exhaustion of shared memory: Stochastic results.- Minimum weight euclidean matching and weighted relative neighborhood graphs.- Efficient approximate shortest-path queries among isothetic rectangular obstacles.- Counting and reporting red/blue segment intersections.- Repetitive hidden-surface-removal for polyhedral scenes.- On reconfigurability of VLSI linear arrays.- Reconstructing strings from substrings (Extended abstract).- Combinatorial complexity of signed discs.- Fast algorithms for one-dimensionsal compaction with jog insertion.- An optimal algorithm for roundness determination on convex polygons.- Practical algorithms on partial k-trees with an application to domination-like problems.- Greedy algorithms for the on-line steiner tree and generalized steiner problems.";}}}i:2;a:2:{s:4:"NAME";s:18:"SupportingResource";s:5:"CHILD";a:4:{i:0;a:2:{s:4:"NAME";s:19:"ResourceContentType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:15:"ContentAudience";s:5:"CDATA";s:2:"00";}i:2;a:2:{s:4:"NAME";s:12:"ResourceMode";s:5:"CDATA";s:2:"03";}i:3;a:2:{s:4:"NAME";s:15:"ResourceVersion";s:5:"CHILD";a:10:{i:0;a:2:{s:4:"NAME";s:12:"ResourceForm";s:5:"CDATA";s:2:"02";}i:1;a:2:{s:4:"NAME";s:22:"ResourceVersionFeature";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:26:"ResourceVersionFeatureType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:12:"FeatureValue";s:5:"CDATA";s:4:"D502";}}}i:2;a:2:{s:4:"NAME";s:22:"ResourceVersionFeature";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:26:"ResourceVersionFeatureType";s:5:"CDATA";s:2:"02";}i:1;a:2:{s:4:"NAME";s:12:"FeatureValue";s:5:"CDATA";s:4:"1254";}}}i:3;a:2:{s:4:"NAME";s:22:"ResourceVersionFeature";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:26:"ResourceVersionFeatureType";s:5:"CDATA";s:2:"03";}i:1;a:2:{s:4:"NAME";s:12:"FeatureValue";s:5:"CDATA";s:3:"827";}}}i:4;a:2:{s:4:"NAME";s:22:"ResourceVersionFeature";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:26:"ResourceVersionFeatureType";s:5:"CDATA";s:2:"04";}i:1;a:2:{s:4:"NAME";s:12:"FeatureValue";s:5:"CDATA";s:17:"9783540479185.jpg";}}}i:5;a:2:{s:4:"NAME";s:22:"ResourceVersionFeature";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:26:"ResourceVersionFeatureType";s:5:"CDATA";s:2:"06";}i:1;a:2:{s:4:"NAME";s:12:"FeatureValue";s:5:"CDATA";s:32:"b0eeddba777d6af06e59f2cab23c9d4c";}}}i:6;a:2:{s:4:"NAME";s:22:"ResourceVersionFeature";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:26:"ResourceVersionFeatureType";s:5:"CDATA";s:2:"07";}i:1;a:2:{s:4:"NAME";s:12:"FeatureValue";s:5:"CDATA";s:6:"399248";}}}i:7;a:2:{s:4:"NAME";s:22:"ResourceVersionFeature";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:26:"ResourceVersionFeatureType";s:5:"CDATA";s:2:"08";}i:1;a:2:{s:4:"NAME";s:12:"FeatureValue";s:5:"CDATA";s:64:"e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855";}}}i:8;a:2:{s:4:"NAME";s:12:"ResourceLink";s:5:"CDATA";s:47:"https://api.vlb.de/api/v1/cover/9783540479185/m";}i:9;a:2:{s:4:"NAME";s:11:"ContentDate";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:15:"ContentDateRole";s:5:"CDATA";s:2:"17";}i:1;a:3:{s:4:"NAME";s:4:"Date";s:5:"ATTRS";a:1:{s:10:"dateformat";s:2:"00";}s:5:"CDATA";s:8:"20240111";}}}}}}}}}i:11;a:2:{s:4:"NAME";s:16:"PublishingDetail";s:5:"CHILD";a:8:{i:0;a:2:{s:4:"NAME";s:7:"Imprint";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:17:"ImprintIdentifier";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:13:"ImprintIDType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:7:"IDValue";s:5:"CDATA";s:3:"SPR";}}}i:1;a:2:{s:4:"NAME";s:11:"ImprintName";s:5:"CDATA";s:8:"Springer";}}}i:1;a:2:{s:4:"NAME";s:9:"Publisher";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:14:"PublishingRole";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:19:"PublisherIdentifier";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:15:"PublisherIDType";s:5:"CDATA";s:2:"05";}i:1;a:2:{s:4:"NAME";s:7:"IDValue";s:5:"CDATA";s:7:"5108985";}}}i:2;a:2:{s:4:"NAME";s:13:"PublisherName";s:5:"CDATA";s:15:"Springer Berlin";}}}i:2;a:2:{s:4:"NAME";s:17:"CityOfPublication";s:5:"CDATA";s:6:"Berlin";}i:3;a:2:{s:4:"NAME";s:17:"CityOfPublication";s:5:"CDATA";s:10:"Heidelberg";}i:4;a:2:{s:4:"NAME";s:20:"CountryOfPublication";s:5:"CDATA";s:2:"DE";}i:5;a:2:{s:4:"NAME";s:16:"PublishingStatus";s:5:"CDATA";s:2:"04";}i:6;a:2:{s:4:"NAME";s:14:"PublishingDate";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:18:"PublishingDateRole";s:5:"CDATA";s:2:"01";}i:1;a:3:{s:4:"NAME";s:4:"Date";s:5:"ATTRS";a:1:{s:10:"dateformat";s:2:"00";}s:5:"CDATA";s:8:"20050714";}}}i:7;a:2:{s:4:"NAME";s:11:"SalesRights";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:15:"SalesRightsType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:9:"Territory";s:5:"CHILD";a:1:{i:0;a:2:{s:4:"NAME";s:15:"RegionsIncluded";s:5:"CDATA";s:5:"WORLD";}}}}}}}i:12;a:2:{s:4:"NAME";s:15:"RelatedMaterial";s:5:"CHILD";a:1:{i:0;a:2:{s:4:"NAME";s:14:"RelatedProduct";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:19:"ProductRelationCode";s:5:"CDATA";s:2:"13";}i:1;a:2:{s:4:"NAME";s:17:"ProductIdentifier";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:13:"ProductIDType";s:5:"CDATA";s:2:"15";}i:1;a:2:{s:4:"NAME";s:7:"IDValue";s:5:"CDATA";s:13:"9783540571551";}}}i:2;a:2:{s:4:"NAME";s:11:"ProductForm";s:5:"CDATA";s:2:"BC";}}}}}i:13;a:2:{s:4:"NAME";s:13:"ProductSupply";s:5:"CHILD";a:1:{i:0;a:2:{s:4:"NAME";s:12:"SupplyDetail";s:5:"CHILD";a:13:{i:0;a:2:{s:4:"NAME";s:8:"Supplier";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:12:"SupplierRole";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:18:"SupplierIdentifier";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:14:"SupplierIDType";s:5:"CDATA";s:2:"05";}i:1;a:2:{s:4:"NAME";s:7:"IDValue";s:5:"CDATA";s:7:"5108985";}}}i:2;a:2:{s:4:"NAME";s:12:"SupplierName";s:5:"CDATA";s:15:"Springer Berlin";}}}i:1;a:2:{s:4:"NAME";s:19:"ProductAvailability";s:5:"CDATA";s:2:"20";}i:2;a:2:{s:4:"NAME";s:5:"Price";s:5:"CHILD";a:7:{i:0;a:2:{s:4:"NAME";s:9:"PriceType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:20:"PriceTypeDescription";s:5:"CDATA";s:24:"Recommended Retail Price";}i:2;a:2:{s:4:"NAME";s:11:"PriceStatus";s:5:"CDATA";s:2:"02";}i:3;a:2:{s:4:"NAME";s:11:"PriceAmount";s:5:"CDATA";s:5:"89.99";}i:4;a:2:{s:4:"NAME";s:12:"CurrencyCode";s:5:"CDATA";s:3:"EUR";}i:5;a:2:{s:4:"NAME";s:9:"Territory";s:5:"CHILD";a:1:{i:0;a:2:{s:4:"NAME";s:15:"RegionsIncluded";s:5:"CDATA";s:3:"ROW";}}}i:6;a:2:{s:4:"NAME";s:9:"PriceDate";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:13:"PriceDateRole";s:5:"CDATA";s:2:"14";}i:1;a:2:{s:4:"NAME";s:4:"Date";s:5:"CDATA";s:8:"20240101";}}}}}i:3;a:2:{s:4:"NAME";s:5:"Price";s:5:"CHILD";a:7:{i:0;a:2:{s:4:"NAME";s:9:"PriceType";s:5:"CDATA";s:2:"02";}i:1;a:2:{s:4:"NAME";s:20:"PriceTypeDescription";s:5:"CDATA";s:24:"Recommended Retail Price";}i:2;a:2:{s:4:"NAME";s:11:"PriceStatus";s:5:"CDATA";s:2:"02";}i:3;a:2:{s:4:"NAME";s:11:"PriceAmount";s:5:"CDATA";s:5:"99.00";}i:4;a:2:{s:4:"NAME";s:3:"Tax";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:7:"TaxType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:11:"TaxRateCode";s:5:"CDATA";s:1:"R";}i:2;a:2:{s:4:"NAME";s:14:"TaxRatePercent";s:5:"CDATA";s:2:"10";}}}i:5;a:2:{s:4:"NAME";s:12:"CurrencyCode";s:5:"CDATA";s:3:"EUR";}i:6;a:2:{s:4:"NAME";s:9:"Territory";s:5:"CHILD";a:1:{i:0;a:2:{s:4:"NAME";s:17:"CountriesIncluded";s:5:"CDATA";s:2:"AT";}}}}}i:4;a:2:{s:4:"NAME";s:5:"Price";s:5:"CHILD";a:7:{i:0;a:2:{s:4:"NAME";s:9:"PriceType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:20:"PriceTypeDescription";s:5:"CDATA";s:24:"Recommended Retail Price";}i:2;a:2:{s:4:"NAME";s:11:"PriceStatus";s:5:"CDATA";s:2:"02";}i:3;a:2:{s:4:"NAME";s:11:"PriceAmount";s:5:"CDATA";s:6:"144.55";}i:4;a:2:{s:4:"NAME";s:12:"CurrencyCode";s:5:"CDATA";s:3:"AUD";}i:5;a:2:{s:4:"NAME";s:9:"Territory";s:5:"CHILD";a:1:{i:0;a:2:{s:4:"NAME";s:17:"CountriesIncluded";s:5:"CDATA";s:2:"AU";}}}i:6;a:2:{s:4:"NAME";s:9:"PriceDate";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:13:"PriceDateRole";s:5:"CDATA";s:2:"14";}i:1;a:2:{s:4:"NAME";s:4:"Date";s:5:"CDATA";s:8:"20240101";}}}}}i:5;a:2:{s:4:"NAME";s:5:"Price";s:5:"CHILD";a:6:{i:0;a:2:{s:4:"NAME";s:9:"PriceType";s:5:"CDATA";s:2:"02";}i:1;a:2:{s:4:"NAME";s:20:"PriceTypeDescription";s:5:"CDATA";s:24:"Recommended Retail Price";}i:2;a:2:{s:4:"NAME";s:11:"PriceStatus";s:5:"CDATA";s:2:"02";}i:3;a:2:{s:4:"NAME";s:11:"PriceAmount";s:5:"CDATA";s:6:"159.00";}i:4;a:2:{s:4:"NAME";s:12:"CurrencyCode";s:5:"CDATA";s:3:"AUD";}i:5;a:2:{s:4:"NAME";s:9:"Territory";s:5:"CHILD";a:1:{i:0;a:2:{s:4:"NAME";s:17:"CountriesIncluded";s:5:"CDATA";s:2:"AU";}}}}}i:6;a:2:{s:4:"NAME";s:5:"Price";s:5:"CHILD";a:7:{i:0;a:2:{s:4:"NAME";s:9:"PriceType";s:5:"CDATA";s:2:"02";}i:1;a:2:{s:4:"NAME";s:20:"PriceTypeDescription";s:5:"CDATA";s:24:"Recommended Retail Price";}i:2;a:2:{s:4:"NAME";s:11:"PriceStatus";s:5:"CDATA";s:2:"02";}i:3;a:2:{s:4:"NAME";s:11:"PriceAmount";s:5:"CDATA";s:6:"118.00";}i:4;a:2:{s:4:"NAME";s:3:"Tax";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:7:"TaxType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:11:"TaxRateCode";s:5:"CDATA";s:1:"R";}i:2;a:2:{s:4:"NAME";s:14:"TaxRatePercent";s:5:"CDATA";s:3:"2.6";}}}i:5;a:2:{s:4:"NAME";s:12:"CurrencyCode";s:5:"CDATA";s:3:"CHF";}i:6;a:2:{s:4:"NAME";s:9:"Territory";s:5:"CHILD";a:1:{i:0;a:2:{s:4:"NAME";s:17:"CountriesIncluded";s:5:"CDATA";s:2:"CH";}}}}}i:7;a:2:{s:4:"NAME";s:5:"Price";s:5:"CHILD";a:7:{i:0;a:2:{s:4:"NAME";s:9:"PriceType";s:5:"CDATA";s:2:"02";}i:1;a:2:{s:4:"NAME";s:20:"PriceTypeDescription";s:5:"CDATA";s:24:"Recommended Retail Price";}i:2;a:2:{s:4:"NAME";s:11:"PriceStatus";s:5:"CDATA";s:2:"02";}i:3;a:2:{s:4:"NAME";s:11:"PriceAmount";s:5:"CDATA";s:5:"96.29";}i:4;a:2:{s:4:"NAME";s:3:"Tax";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:7:"TaxType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:11:"TaxRateCode";s:5:"CDATA";s:1:"R";}i:2;a:2:{s:4:"NAME";s:14:"TaxRatePercent";s:5:"CDATA";s:1:"7";}}}i:5;a:2:{s:4:"NAME";s:12:"CurrencyCode";s:5:"CDATA";s:3:"EUR";}i:6;a:2:{s:4:"NAME";s:9:"Territory";s:5:"CHILD";a:1:{i:0;a:2:{s:4:"NAME";s:17:"CountriesIncluded";s:5:"CDATA";s:2:"DE";}}}}}i:8;a:2:{s:4:"NAME";s:5:"Price";s:5:"CHILD";a:7:{i:0;a:2:{s:4:"NAME";s:9:"PriceType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:20:"PriceTypeDescription";s:5:"CDATA";s:24:"Recommended Retail Price";}i:2;a:2:{s:4:"NAME";s:11:"PriceStatus";s:5:"CDATA";s:2:"02";}i:3;a:2:{s:4:"NAME";s:11:"PriceAmount";s:5:"CDATA";s:5:"89.50";}i:4;a:2:{s:4:"NAME";s:12:"CurrencyCode";s:5:"CDATA";s:3:"GBP";}i:5;a:2:{s:4:"NAME";s:9:"Territory";s:5:"CHILD";a:1:{i:0;a:2:{s:4:"NAME";s:17:"CountriesIncluded";s:5:"CDATA";s:2:"GB";}}}i:6;a:2:{s:4:"NAME";s:9:"PriceDate";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:13:"PriceDateRole";s:5:"CDATA";s:2:"14";}i:1;a:2:{s:4:"NAME";s:4:"Date";s:5:"CDATA";s:8:"20240101";}}}}}i:9;a:2:{s:4:"NAME";s:5:"Price";s:5:"CHILD";a:6:{i:0;a:2:{s:4:"NAME";s:9:"PriceType";s:5:"CDATA";s:2:"02";}i:1;a:2:{s:4:"NAME";s:20:"PriceTypeDescription";s:5:"CDATA";s:24:"Recommended Retail Price";}i:2;a:2:{s:4:"NAME";s:11:"PriceStatus";s:5:"CDATA";s:2:"02";}i:3;a:2:{s:4:"NAME";s:11:"PriceAmount";s:5:"CDATA";s:5:"89.50";}i:4;a:2:{s:4:"NAME";s:12:"CurrencyCode";s:5:"CDATA";s:3:"GBP";}i:5;a:2:{s:4:"NAME";s:9:"Territory";s:5:"CHILD";a:1:{i:0;a:2:{s:4:"NAME";s:17:"CountriesIncluded";s:5:"CDATA";s:2:"GB";}}}}}i:10;a:2:{s:4:"NAME";s:5:"Price";s:5:"CHILD";a:7:{i:0;a:2:{s:4:"NAME";s:9:"PriceType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:20:"PriceTypeDescription";s:5:"CDATA";s:24:"Recommended Retail Price";}i:2;a:2:{s:4:"NAME";s:11:"PriceStatus";s:5:"CDATA";s:2:"02";}i:3;a:2:{s:4:"NAME";s:11:"PriceAmount";s:5:"CDATA";s:7:"7120.00";}i:4;a:2:{s:4:"NAME";s:12:"CurrencyCode";s:5:"CDATA";s:3:"INR";}i:5;a:2:{s:4:"NAME";s:9:"Territory";s:5:"CHILD";a:1:{i:0;a:2:{s:4:"NAME";s:17:"CountriesIncluded";s:5:"CDATA";s:2:"IN";}}}i:6;a:2:{s:4:"NAME";s:9:"PriceDate";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:13:"PriceDateRole";s:5:"CDATA";s:2:"14";}i:1;a:2:{s:4:"NAME";s:4:"Date";s:5:"CDATA";s:8:"20240101";}}}}}i:11;a:2:{s:4:"NAME";s:5:"Price";s:5:"CHILD";a:6:{i:0;a:2:{s:4:"NAME";s:9:"PriceType";s:5:"CDATA";s:2:"02";}i:1;a:2:{s:4:"NAME";s:20:"PriceTypeDescription";s:5:"CDATA";s:24:"Recommended Retail Price";}i:2;a:2:{s:4:"NAME";s:11:"PriceStatus";s:5:"CDATA";s:2:"02";}i:3;a:2:{s:4:"NAME";s:11:"PriceAmount";s:5:"CDATA";s:8:"14299.00";}i:4;a:2:{s:4:"NAME";s:12:"CurrencyCode";s:5:"CDATA";s:3:"JPY";}i:5;a:2:{s:4:"NAME";s:9:"Territory";s:5:"CHILD";a:1:{i:0;a:2:{s:4:"NAME";s:17:"CountriesIncluded";s:5:"CDATA";s:2:"JP";}}}}}i:12;a:2:{s:4:"NAME";s:5:"Price";s:5:"CHILD";a:6:{i:0;a:2:{s:4:"NAME";s:9:"PriceType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:20:"PriceTypeDescription";s:5:"CDATA";s:24:"Recommended Retail Price";}i:2;a:2:{s:4:"NAME";s:11:"PriceStatus";s:5:"CDATA";s:2:"02";}i:3;a:2:{s:4:"NAME";s:11:"PriceAmount";s:5:"CDATA";s:5:"99.00";}i:4;a:2:{s:4:"NAME";s:12:"CurrencyCode";s:5:"CDATA";s:3:"USD";}i:5;a:2:{s:4:"NAME";s:9:"Territory";s:5:"CHILD";a:1:{i:0;a:2:{s:4:"NAME";s:17:"CountriesIncluded";s:5:"CDATA";s:2:"US";}}}}}}}}}}} 9783641320782 Sabine Schmidt Das kleine Nähcafé am Fluss; Schmidt S.,Das kleine Nähcafé am Fluss; Schmidt S.,Das kleine Nähcafé am Fluss Roman - Trend-Thema Handarbeit trifft auf schöne Liebesgeschichten! Blanvalet Taschenbuch Verlag; Blanvalet 2024-10-23 München; DE EA; E101; Nonbooks, PBS / Belletristik/Gegenwartsliteratur (ab 1945); Liebesromane; Leichtlesen; frauenromane; romane für frauen; nähen; ebooks; neuerscheinung; liebesromane; 2024; liebe; sew simple; spiegelbestseller-autorin; topp; zweite chance; workaholic; susanne oswald; nähanleitungen; unerwartetes erbe; tante; ungleiche freundinnen; idylle; der kleine strickladen; nachbar; zusammenhalt; starke frau; powerfrau; café; garten; nähladen; stoffe; liebeskummer; erbe; sommerfest; happy end; rezepte; alleinerziehende mutter; kreativität; diy; do it yourself; Belletristik; Moderne und zeitgenössische Belletristik: allgemein und literarisch; Familienleben; Belletristik: Themen, Stoffe, Motive: Heranwachsen; Belletristik: Themen, Stoffe, Motive: Liebe und Beziehungen; Belletristik: Themen, Stoffe, Motive: Tod, Trauer, Verlust; Nähen; Mode- und Styleguides; Nordwestdeutschland; Schleswig-Holstein; ca. 2020 bis ca. 2029; BC ger 7.99 EUR a:3:{s:4:"NAME";s:7:"Product";s:5:"ATTRS";a:1:{s:9:"datestamp";s:8:"20250122";}s:5:"CHILD";a:11:{i:0;a:2:{s:4:"NAME";s:15:"RecordReference";s:5:"CDATA";s:32:"888a861784b34799ab1f00a5cf1e8b82";}i:1;a:2:{s:4:"NAME";s:16:"NotificationType";s:5:"CDATA";s:2:"03";}i:2;a:2:{s:4:"NAME";s:17:"ProductIdentifier";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:13:"ProductIDType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:10:"IDTypeName";s:5:"CDATA";s:19:"Publishers Order No";}i:2;a:2:{s:4:"NAME";s:7:"IDValue";s:5:"CDATA";s:9:"754/32078";}}}i:3;a:2:{s:4:"NAME";s:17:"ProductIdentifier";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:13:"ProductIDType";s:5:"CDATA";s:2:"02";}i:1;a:2:{s:4:"NAME";s:7:"IDValue";s:5:"CDATA";s:10:"364132078X";}}}i:4;a:2:{s:4:"NAME";s:17:"ProductIdentifier";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:13:"ProductIDType";s:5:"CDATA";s:2:"03";}i:1;a:2:{s:4:"NAME";s:7:"IDValue";s:5:"CDATA";s:13:"9783641320782";}}}i:5;a:2:{s:4:"NAME";s:17:"ProductIdentifier";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:13:"ProductIDType";s:5:"CDATA";s:2:"15";}i:1;a:2:{s:4:"NAME";s:7:"IDValue";s:5:"CDATA";s:13:"9783641320782";}}}i:6;a:2:{s:4:"NAME";s:17:"DescriptiveDetail";s:5:"CHILD";a:69:{i:0;a:2:{s:4:"NAME";s:18:"ProductComposition";s:5:"CDATA";s:2:"00";}i:1;a:2:{s:4:"NAME";s:11:"ProductForm";s:5:"CDATA";s:2:"EA";}i:2;a:2:{s:4:"NAME";s:17:"ProductFormDetail";s:5:"CDATA";s:4:"E101";}i:3;a:2:{s:4:"NAME";s:18:"ProductFormFeature";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:22:"ProductFormFeatureType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:23:"ProductFormFeatureValue";s:5:"CDATA";s:3:"BRN";}i:2;a:2:{s:4:"NAME";s:29:"ProductFormFeatureDescription";s:5:"CDATA";s:3:"13%";}}}i:4;a:2:{s:4:"NAME";s:18:"ProductFormFeature";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:22:"ProductFormFeatureType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:23:"ProductFormFeatureValue";s:5:"CDATA";s:3:"ORG";}i:2;a:2:{s:4:"NAME";s:29:"ProductFormFeatureDescription";s:5:"CDATA";s:2:"8%";}}}i:5;a:2:{s:4:"NAME";s:18:"ProductFormFeature";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:22:"ProductFormFeatureType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:23:"ProductFormFeatureValue";s:5:"CDATA";s:3:"SKY";}i:2;a:2:{s:4:"NAME";s:29:"ProductFormFeatureDescription";s:5:"CDATA";s:3:"11%";}}}i:6;a:2:{s:4:"NAME";s:18:"ProductFormFeature";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:22:"ProductFormFeatureType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:23:"ProductFormFeatureValue";s:5:"CDATA";s:3:"TEA";}i:2;a:2:{s:4:"NAME";s:29:"ProductFormFeatureDescription";s:5:"CDATA";s:3:"32%";}}}i:7;a:2:{s:4:"NAME";s:18:"ProductFormFeature";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:22:"ProductFormFeatureType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:23:"ProductFormFeatureValue";s:5:"CDATA";s:3:"WHI";}i:2;a:2:{s:4:"NAME";s:29:"ProductFormFeatureDescription";s:5:"CDATA";s:3:"11%";}}}i:8;a:2:{s:4:"NAME";s:18:"PrimaryContentType";s:5:"CDATA";s:2:"10";}i:9;a:2:{s:4:"NAME";s:23:"EpubTechnicalProtection";s:5:"CDATA";s:2:"02";}i:10;a:2:{s:4:"NAME";s:11:"TitleDetail";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:9:"TitleType";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:12:"TitleElement";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:17:"TitleElementLevel";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:9:"TitleText";s:5:"CDATA";s:29:"Das kleine Nähcafé am Fluss";}i:2;a:2:{s:4:"NAME";s:8:"Subtitle";s:5:"CDATA";s:68:"Roman - Trend-Thema Handarbeit trifft auf schöne Liebesgeschichten!";}}}}}i:11;a:2:{s:4:"NAME";s:11:"TitleDetail";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:9:"TitleType";s:5:"CDATA";s:2:"05";}i:1;a:2:{s:4:"NAME";s:12:"TitleElement";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:17:"TitleElementLevel";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:9:"TitleText";s:5:"CDATA";s:40:"Schmidt S.,Das kleine Nähcafé am Fluss";}}}}}i:12;a:2:{s:4:"NAME";s:11:"TitleDetail";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:9:"TitleType";s:5:"CDATA";s:2:"10";}i:1;a:2:{s:4:"NAME";s:12:"TitleElement";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:17:"TitleElementLevel";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:9:"TitleText";s:5:"CDATA";s:40:"Schmidt S.,Das kleine Nähcafé am Fluss";}}}}}i:13;a:2:{s:4:"NAME";s:11:"Contributor";s:5:"CHILD";a:7:{i:0;a:2:{s:4:"NAME";s:14:"SequenceNumber";s:5:"CDATA";s:1:"1";}i:1;a:2:{s:4:"NAME";s:15:"ContributorRole";s:5:"CDATA";s:3:"A01";}i:2;a:2:{s:4:"NAME";s:10:"PersonName";s:5:"CDATA";s:14:"Sabine Schmidt";}i:3;a:2:{s:4:"NAME";s:18:"PersonNameInverted";s:5:"CDATA";s:15:"Schmidt, Sabine";}i:4;a:2:{s:4:"NAME";s:14:"NamesBeforeKey";s:5:"CDATA";s:6:"Sabine";}i:5;a:2:{s:4:"NAME";s:8:"KeyNames";s:5:"CDATA";s:7:"Schmidt";}i:6;a:2:{s:4:"NAME";s:16:"BiographicalNote";s:5:"CDATA";s:520:"Sabine Schmidt ist Autorin, Bloggerin, Modemacherin und seit 2016 kreativer Kopf und Gründerin von sewsimple. Jeden Monat begeistern sich hunderttausende Näh-Fans für Sabines Anleitungen und Hacks rund um die Themen Nähen und DIY – oder durchstöbern die anfänger-tauglichen Schnittmuster auf ihrer hochfrequentierten Homepage. Nach »Das kleine Nähcafé am Fluss« ist »Neues Glück im kleinen Nähcafé am Fluss« ihr zweiter Roman, mit dem sie die Leser*innen gleichermaßen inspirieren wie unterhalten will.";}}}i:14;a:2:{s:4:"NAME";s:8:"Language";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:12:"LanguageRole";s:5:"CDATA";s:2:"01";}i:1;a:2:{s:4:"NAME";s:12:"LanguageCode";s:5:"CDATA";s:3:"ger";}}}i:15;a:2:{s:4:"NAME";s:6:"Extent";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:10:"ExtentType";s:5:"CDATA";s:2:"22";}i:1;a:2:{s:4:"NAME";s:11:"ExtentValue";s:5:"CDATA";s:4:"1472";}i:2;a:2:{s:4:"NAME";s:10:"ExtentUnit";s:5:"CDATA";s:2:"18";}}}i:16;a:2:{s:4:"NAME";s:6:"Extent";s:5:"CHILD";a:3:{i:0;a:2:{s:4:"NAME";s:10:"ExtentType";s:5:"CDATA";s:2:"08";}i:1;a:2:{s:4:"NAME";s:11:"ExtentValue";s:5:"CDATA";s:3:"336";}i:2;a:2:{s:4:"NAME";s:10:"ExtentUnit";s:5:"CDATA";s:2:"03";}}}i:17;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:5:{i:0;a:1:{s:4:"NAME";s:11:"MainSubject";}i:1;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"26";}i:2;a:2:{s:4:"NAME";s:20:"SubjectSchemeVersion";s:5:"CDATA";s:3:"2.0";}i:3;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:4:"9112";}i:4;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:58:"Nonbooks, PBS / Belletristik/Gegenwartsliteratur (ab 1945)";}}}i:18;a:3:{s:4:"NAME";s:7:"Subject";s:5:"ATTRS";a:1:{s:10:"sourcename";s:9:"Publisher";}s:5:"CHILD";a:5:{i:0;a:1:{s:4:"NAME";s:11:"MainSubject";}i:1;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"93";}i:2;a:2:{s:4:"NAME";s:20:"SubjectSchemeVersion";s:5:"CDATA";s:3:"1.6";}i:3;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:2:"FR";}i:4;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:12:"Liebesromane";}}}i:19;a:3:{s:4:"NAME";s:7:"Subject";s:5:"ATTRS";a:1:{s:10:"sourcename";s:3:"MVB";}s:5:"CHILD";a:4:{i:0;a:1:{s:4:"NAME";s:11:"MainSubject";}i:1;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"B8";}i:2;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:2:"06";}i:3;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:11:"Leichtlesen";}}}i:20;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"10";}i:1;a:2:{s:4:"NAME";s:11:"SubjectCode";s:5:"CDATA";s:9:"FIC044000";}}}i:21;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"20";}i:1;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:12:"frauenromane";}}}i:22;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"20";}i:1;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:18:"romane für frauen";}}}i:23;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"20";}i:1;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:6:"nähen";}}}i:24;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"20";}i:1;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:6:"ebooks";}}}i:25;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"20";}i:1;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:14:"neuerscheinung";}}}i:26;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"20";}i:1;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:12:"liebesromane";}}}i:27;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"20";}i:1;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:4:"2024";}}}i:28;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"SubjectSchemeIdentifier";s:5:"CDATA";s:2:"20";}i:1;a:2:{s:4:"NAME";s:18:"SubjectHeadingText";s:5:"CDATA";s:5:"liebe";}}}i:29;a:2:{s:4:"NAME";s:7:"Subject";s:5:"CHILD";a:2:{i:0;a:2:{s:4:"NAME";s:23:"S
Verlag: Wiley-VCH; Wiley-VCH
288 Seiten
Erscheinungsjahr: 2012-08-15
Gedruckt / Hergestellt in Deutschland.
Gewicht: 0,388 kg
Sprache: Deutsch
18,50 € (DE)
148mm x 210mm x 24mm

BC; Hardcover, Softcover / Sachbücher/Musik, Film, Theater; Kunst; Verstehen; Allg. populäre Kultur; Fan; Fernsehen; Lifestyle; Medizin; Allg. populäre Kultur; Allg. Medizin