HTML Export for Dagstuhl Seminar Proceedings, Volume 7212

Copy to Clipboard Download

<h2>Dagstuhl Seminar Proceedings, Volume 7212, </h2>
<ul>
<li>
    <span class="authors">Bernd Bank, Max J. Egenhofer, and Bart Kuijpers</span>
    <span class="title">07212 Abstracts Collection – Constraint Databases, Geometric Elimination ang Geographic Information Systems</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07212.1">10.4230/DagSemProc.07212.1</a>
</li>
<li>
    <span class="authors">Bernd Bank, Max J. Egenhofer, Joos Heintz, Bart Kuijpers, and Peter Revesz</span>
    <span class="title">07212 Manifesto – Constraint Databases, Geometric Elimination ang Geographic Information Systems</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07212.2">10.4230/DagSemProc.07212.2</a>
</li>
<li>
    <span class="authors">Rafael Grimson</span>
    <span class="title">A lower bound for the complexity of linear optimization from a quantifier-elimination point of view</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07212.3">10.4230/DagSemProc.07212.3</a>
</li>
<li>
    <span class="authors">Bart Kuijpers and Walied Othman</span>
    <span class="title">An analytic solution to the alibi query in the bead model for moving object data</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07212.4">10.4230/DagSemProc.07212.4</a>
</li>
<li>
    <span class="authors">Stephan Mäs</span>
    <span class="title">Checking the Integrity of Spatial Integrity Constraints</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07212.5">10.4230/DagSemProc.07212.5</a>
</li>
<li>
    <span class="authors">Peter Revesz</span>
    <span class="title">Constraint Databases and Geographic Information Systems</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.07212.6">10.4230/DagSemProc.07212.6</a>
</li>
</ul>

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode