<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="FeedCreator 1.8" -->
<?xml-stylesheet href="https://scale.iti.kit.edu/lib/exe/css.php?s=feed" type="text/css"?>
<rdf:RDF
    xmlns="http://purl.org/rss/1.0/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
    xmlns:dc="http://purl.org/dc/elements/1.1/">
    <channel rdf:about="https://scale.iti.kit.edu/feed.php">
        <title>scale</title>
        <description></description>
        <link>https://scale.iti.kit.edu/</link>
        <image rdf:resource="https://scale.iti.kit.edu/_media/favicon.ico" />
       <dc:date>2026-04-18T09:09:50+00:00</dc:date>
        <items>
            <rdf:Seq>
                <rdf:li rdf:resource="https://scale.iti.kit.edu/advent22?rev=1670240817&amp;do=diff"/>
                <rdf:li rdf:resource="https://scale.iti.kit.edu/algo1werbung?rev=1639737768&amp;do=diff"/>
                <rdf:li rdf:resource="https://scale.iti.kit.edu/navigationmenu?rev=1775731694&amp;do=diff"/>
                <rdf:li rdf:resource="https://scale.iti.kit.edu/start?rev=1715954755&amp;do=diff"/>
            </rdf:Seq>
        </items>
    </channel>
    <image rdf:about="https://scale.iti.kit.edu/_media/favicon.ico">
        <title>scale</title>
        <link>https://scale.iti.kit.edu/</link>
        <url>https://scale.iti.kit.edu/_media/favicon.ico</url>
    </image>
    <item rdf:about="https://scale.iti.kit.edu/advent22?rev=1670240817&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2022-12-05T11:46:57+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>Hyperbolische Weihnachten!</title>
        <link>https://scale.iti.kit.edu/advent22?rev=1670240817&amp;do=diff</link>
        <description>Hyperbolische Weihnachten!

Du wirst in ein paar Sekunden zur interaktiven Visualisierung von hyperbolischen Unit-Disk Graphen umgeleitet.

(alternativ kannst du einfach den Link klicken)</description>
    </item>
    <item rdf:about="https://scale.iti.kit.edu/algo1werbung?rev=1639737768&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2021-12-17T10:42:48+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>Tutoren für Algorithmen 1 gesucht</title>
        <link>https://scale.iti.kit.edu/algo1werbung?rev=1639737768&amp;do=diff</link>
        <description>Tutoren für Algorithmen 1 gesucht

Aufgaben:

	*  halten eines Tutoriums pro Woche (auf Wunsch auch zwei)
	*  Korrektur von Übungsblättern

Super attraktive Tätigkeit, weil:

	*  du viel Übung für Vorträge und sonstiges Auftreten vor Publikum sammelst.</description>
    </item>
    <item rdf:about="https://scale.iti.kit.edu/navigationmenu?rev=1775731694&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2026-04-09T10:48:14+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title></title>
        <link>https://scale.iti.kit.edu/navigationmenu?rev=1775731694&amp;do=diff</link>
        <description>* People 
		*  Thomas Bläsius
		*  Adrian Feilhauer
		*  Max Göttlicher
		*  Jean-Pierre von der Heydt
		*  Martin Schirneck
		*  Elly Schmidt
		*  Marcus Wilhelm
		*  Wendy Yi
		*  Michael Zündorf
		*  Alumni
			*  Maximilian Katzmann
			*  Christopher Weyand


	*  Teaching
		*  Sommersemester 26
			*  Parameterized Algorithms
			*   Basispraktikum zum ICPC Programmierwettbewerb

		*  Wintersemester 25/26
			*  Beating the Worst-Case
			*  Practical Course: Route Planning
			*    Fortgeschritte…</description>
    </item>
    <item rdf:about="https://scale.iti.kit.edu/start?rev=1715954755&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2024-05-17T14:05:55+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>Welcome to the Scalable Algorithms Group</title>
        <link>https://scale.iti.kit.edu/start?rev=1715954755&amp;do=diff</link>
        <description>Welcome to the Scalable Algorithms Group

Welcome to the Scalable Algorithms group lead by T.T.-Prof. Dr. Thomas Bläsius. Our group belongs to the Institute of Theoretical Informatics. You can find us on the third floor of the computer science building (50.34).</description>
    </item>
</rdf:RDF>
