<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="FeedCreator 1.8" -->
<?xml-stylesheet href="https://algo.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://algo.iti.kit.edu/feed.php">
        <title>Algorithmik - Karlsruher Institut für Technologie (KIT) - projects</title>
        <description></description>
        <link>https://algo.iti.kit.edu/</link>
        <image rdf:resource="https://algo.iti.kit.edu/_media/favicon.ico" />
       <dc:date>2026-04-06T10:36:47+00:00</dc:date>
        <items>
            <rdf:Seq>
                <rdf:li rdf:resource="https://algo.iti.kit.edu/projects/bl-userstudy"/>
                <rdf:li rdf:resource="https://algo.iti.kit.edu/projects/gdsat"/>
                <rdf:li rdf:resource="https://algo.iti.kit.edu/projects/geovis"/>
                <rdf:li rdf:resource="https://algo.iti.kit.edu/projects/index"/>
                <rdf:li rdf:resource="https://algo.iti.kit.edu/projects/routesketch"/>
            </rdf:Seq>
        </items>
    </channel>
    <image rdf:about="https://algo.iti.kit.edu/_media/favicon.ico">
        <title>Algorithmik - Karlsruher Institut für Technologie (KIT)</title>
        <link>https://algo.iti.kit.edu/</link>
        <url>https://algo.iti.kit.edu/_media/favicon.ico</url>
    </image>
    <item rdf:about="https://algo.iti.kit.edu/projects/bl-userstudy">
        <dc:format>text/html</dc:format>
        <dc:date>2015-08-27T07:06:53+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>On the Readability of Boundary Labeling</title>
        <link>https://algo.iti.kit.edu/projects/bl-userstudy</link>
        <description>On the Readability of Boundary Labeling

The raw data of the user study on boundary labeling can be downloaded at . Please refer to [1] to get a description of the study setup and a detailed discussion of the results.

The raw data is provided in CSV format. Every row in the dataset describes one solved task, i.e. one click made by a participant.</description>
    </item>
    <item rdf:about="https://algo.iti.kit.edu/projects/gdsat">
        <dc:format>text/html</dc:format>
        <dc:date>2015-08-27T06:59:17+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>Graph Drawing using SAT (GDSAT)</title>
        <link>https://algo.iti.kit.edu/projects/gdsat</link>
        <description>Graph Drawing using SAT (GDSAT)

In a grid-based representation of a graph, vertices
and edges correspond to axis-parallel boxes on an underlying integer
grid. Boxes can be further constrained in their shapes and
interactions by additional problem-specific constraints.
Our framework GDSAT defines a generic SAT model that is flexible enough
to capture a large variety of different grid-based graph layout
problems, both polynomially-solvable and NP-complete. The dimension of the grid is not restric…</description>
    </item>
    <item rdf:about="https://algo.iti.kit.edu/projects/geovis">
        <dc:format>text/html</dc:format>
        <dc:date>2011-02-10T12:37:44+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>Algorithmen zur Geovisualisierung</title>
        <link>https://algo.iti.kit.edu/projects/geovis</link>
        <description>Algorithmen zur Geovisualisierung



Die Young Investigator Group (YIG) Algorithmen zur Geovisualisierung ist eine 2009 vom KIT im Rahmen der Exzellenzinitiative eingerichtete Nachwuchsgruppe, die von Dr. Martin Nöllenburg geleitet wird. Sie ist Mitglied im Young Investigator Network des KIT und angegliedert an den</description>
    </item>
    <item rdf:about="https://algo.iti.kit.edu/projects/index">
        <dc:format>text/html</dc:format>
        <dc:date>2024-02-29T15:37:06+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>Projekte</title>
        <link>https://algo.iti.kit.edu/projects/index</link>
        <description>Projekte

Abgeschlossene Projekte

	*  Energie System Integration (ESI)
	*  Integrierte Planung im öffentlichen Verkehr – DFG-Forschergruppe FOR 2083
	*   SCI - Helmholtz Programm Speicher und Vernetzte Infrastrukturen (RU 1)
	*  Routenplanung in Transportnetzwerken
	*  Algorithms for Interaction in Graph Drawing
	*  Skeleton-based Clustering in Big and Streaming Social Networks
	*  Graduiertenkolleg &quot;Energy Status Data - Informatics Methods for its Collection, Analysis and Exploitation&quot;
	*  Gra…</description>
    </item>
    <item rdf:about="https://algo.iti.kit.edu/projects/routesketch">
        <dc:format>text/html</dc:format>
        <dc:date>2013-10-30T10:42:10+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>RouteSketch</title>
        <link>https://algo.iti.kit.edu/projects/routesketch</link>
        <description>RouteSketch

On this page you find the proof of concept source code accompaning the Journal Paper
„On d-regular Schematization of Embedded Paths“ by Daniel Delling,
Andreas Gemsa, Martin Nölenburg, Thomas Pajor and Ignaz Rutter. 

@article{dgnpr-dsep-13,</description>
    </item>
</rdf:RDF>
