<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/user/hoever/Informatik"><title>BibSonomy bookmarks for /user/hoever/Informatik</title><link>https://www.bibsonomy.org/user/hoever/Informatik</link><description>BibSonomy RSS Feed for /user/hoever/Informatik</description><items><rdf:Seq><rdf:li rdf:resource="http://www.zeit.de/zeit-wissen/2009/01/Titelstrecke-Frage9-Muellabfuhr"/></rdf:Seq></items></channel><item rdf:about="http://www.zeit.de/zeit-wissen/2009/01/Titelstrecke-Frage9-Muellabfuhr"><title>Die kürzeste Route für die Müllabfuhr?</title><description></description><link>http://www.zeit.de/zeit-wissen/2009/01/Titelstrecke-Frage9-Muellabfuhr</link><dc:creator>hoever</dc:creator><dc:date>2009-01-02T20:41:46+01:00</dc:date><dc:subject>Informatik </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2009-01-02T20:41:46+01:00&#034; href=&#034;http://www.zeit.de/zeit-wissen/2009/01/Titelstrecke-Frage9-Muellabfuhr&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.zeit.de/zeit-wissen/2009/01/Titelstrecke-Frage9-Muellabfuhr&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Informatik"/></rdf:Bag></taxo:topics></item></rdf:RDF>