PUMA publications for /user/unibiblio/ubs_40106https://puma.ub.uni-stuttgart.de/user/unibiblio/ubs_40106PUMA RSS feed for /user/unibiblio/ubs_401062024-03-28T18:26:51+01:00- Forbidden Patterns for FO2 Alternation Over Finite and Infinite Wordshttps://puma.ub.uni-stuttgart.de/bibtex/2f7ed3002dcef7c93040cede516fe7e27/unibibliounibiblio2023-10-17T14:27:31+02:00ubs_10005 ubs_20008 ubs_30080 ubs_40106 unibibliografie wos <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Viktor Henriksson" itemprop="url" href="/person/1803b541bc3948fbc82585273044317b5/author/0"><span itemprop="name">V. Henriksson</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Manfred Kufleitner" itemprop="url" href="/person/1803b541bc3948fbc82585273044317b5/author/1"><span itemprop="name">M. Kufleitner</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="journal">International journal of foundations of computer science</span>, </em> </span>(<em><span>2023<meta content="2023" itemprop="datePublished"/></span></em>)</span>
- Sublinear search spaces for shortest path planning in grid and road networkshttps://puma.ub.uni-stuttgart.de/bibtex/271fcb496b1345b919e45b4ad459f153f/unibibliounibiblio2022-07-06T10:36:26+02:00ubs_10005 ubs_20008 ubs_30080 ubs_40106 unibibliografie wos <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Johannes Blum" itemprop="url" href="/person/1e65c80bca06d286ecba415c93411f6a7/author/0"><span itemprop="name">J. Blum</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stefan Funke" itemprop="url" href="/person/1e65c80bca06d286ecba415c93411f6a7/author/1"><span itemprop="name">S. Funke</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Sabine Storandt" itemprop="url" href="/person/1e65c80bca06d286ecba415c93411f6a7/author/2"><span itemprop="name">S. Storandt</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="journal">Journal of combinatorial optimization</span>, </em> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">42 </span></span>(<span itemprop="issueNumber">2</span>):
<span itemprop="pagination">231-257</span></em> </span>(<em><span>2021<meta content="2021" itemprop="datePublished"/></span></em>)</span>
- A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels and a Provably Optimal Instance-Based Schemahttps://puma.ub.uni-stuttgart.de/bibtex/2d6a006d09350ac787768463c0e6388ff/unibibliounibiblio2022-04-14T15:19:46+02:00oa ubs_10005 ubs_20008 ubs_30080 ubs_40106 unibibliografie wos <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Tobias Rupp" itemprop="url" href="/person/167fd72ee006086a6006f9cc2418b13de/author/0"><span itemprop="name">T. Rupp</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stefan Funke" itemprop="url" href="/person/167fd72ee006086a6006f9cc2418b13de/author/1"><span itemprop="name">S. Funke</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="journal">Algorithms</span>, </em> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">14 </span></span>(<span itemprop="issueNumber">6</span>):
<span itemprop="pagination">164</span></em> </span>(<em><span>2021<meta content="2021" itemprop="datePublished"/></span></em>)</span>
- CYCLOPS : CYCLe route Options Planning Servicehttps://puma.ub.uni-stuttgart.de/bibtex/2824e1d1e92c9d1e213e91f27628ebc04/unibibliounibiblio2020-11-16T10:28:52+01:00ubs_10005 ubs_20008 ubs_30080 ubs_40106 unibibliografie wos <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Florian Barth" itemprop="url" href="/person/102df37bc35dee04a42896563f10430f7/author/0"><span itemprop="name">F. Barth</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stefan Funke" itemprop="url" href="/person/102df37bc35dee04a42896563f10430f7/author/1"><span itemprop="name">S. Funke</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Sabine Storandt" itemprop="url" href="/person/102df37bc35dee04a42896563f10430f7/author/2"><span itemprop="name">S. Storandt</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems</span>, </em></span><em>page <span itemprop="pagination">576-579</span>. </em><em>New York, NY, </em><em><span itemprop="publisher">ACM</span>, </em>(<em><span>2018<meta content="2018" itemprop="datePublished"/></span></em>)</span>
- Algorithms for Average Regret Minimizationhttps://puma.ub.uni-stuttgart.de/bibtex/29287a63cbdf0997bc6a61b5fd886f187/unibibliounibiblio2020-11-03T12:45:37+01:00ubs_10005 ubs_20008 ubs_30080 ubs_40106 unibibliografie wos <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Sabine Storandt" itemprop="url" href="/person/173497b17afeac82ac0d8bc9ee4d447f4/author/0"><span itemprop="name">S. Storandt</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stefan Funke" itemprop="url" href="/person/173497b17afeac82ac0d8bc9ee4d447f4/author/1"><span itemprop="name">S. Funke</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">The Thirty-Third AAAI Conference on Artificial Intelligence, the Thirty-First Innovative Applications of Artificial Intelligence Conference, the Ninth AAAI Symposium on Educational Advances in Artificial Intelligence</span>, </em></span><em>page <span itemprop="pagination">1600-1607</span>. </em><em>Palo Alto, California, USA, </em><em><span itemprop="publisher">AAAI Press</span>, </em>(<em><span>2019<meta content="2019" itemprop="datePublished"/></span></em>)</span>
- Green's Relations in Deterministic Finite Automatahttps://puma.ub.uni-stuttgart.de/bibtex/29ce434491c896ea2335ded4d1048e86e/unibibliounibiblio2020-10-05T16:22:32+02:00ubs_10005 ubs_20008 ubs_30080 ubs_40106 unibibliografie wos <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Lukas Fleischer" itemprop="url" href="/person/19931b468d7b14cd15375865934fb0945/author/0"><span itemprop="name">L. Fleischer</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Manfred Kufleitner" itemprop="url" href="/person/19931b468d7b14cd15375865934fb0945/author/1"><span itemprop="name">M. Kufleitner</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">Computer Science Symposium in Russia</span>, </em></span><em> 63, 4, </em><em>page <span itemprop="pagination">666-687</span>. </em><em>New York, NY, </em><em><span itemprop="publisher">Springer</span>, </em>(<em><span>2019<meta content="2019" itemprop="datePublished"/></span></em>)</span>
- Sublinear Search Spaces for Shortest Path Planning in Grid and Road Networkshttps://puma.ub.uni-stuttgart.de/bibtex/24369b4d7d24a18c98de49f234744c826/unibibliounibiblio2020-09-10T16:18:20+02:00ubs_10005 ubs_20008 ubs_30080 ubs_40106 unibibliografie wos <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Johannes Blum" itemprop="url" href="/person/1f874a498530fde2519c10404bff28f30/author/0"><span itemprop="name">J. Blum</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stefan Funke" itemprop="url" href="/person/1f874a498530fde2519c10404bff28f30/author/1"><span itemprop="name">S. Funke</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Sabine Storandt" itemprop="url" href="/person/1f874a498530fde2519c10404bff28f30/author/2"><span itemprop="name">S. Storandt</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">32nd AAAI Conference on Artificial Intelligence / 30th Innovative Applications of Artificial Intelligence Conference / 8th AAAI Symposium on Educational Advances in Artificial Intelligence</span>, </em></span><em>page <span itemprop="pagination">6119-6126</span>. </em><em>Palo Alto, California, </em><em><span itemprop="publisher">AAAI Press</span>, </em>(<em><span>2018<meta content="2018" itemprop="datePublished"/></span></em>)</span>
- On k-Path Covers and their applicationshttps://puma.ub.uni-stuttgart.de/bibtex/2ef4315430a4e63f68a3c7f055fdd657e/unibibliounibiblio2020-08-11T15:42:23+02:00ubs_10005 ubs_20008 ubs_30080 ubs_40106 unibibliografie wos <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stefan Funke" itemprop="url" href="/person/1a3ddfd808651b65642d513052b2c248e/author/0"><span itemprop="name">S. Funke</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Andre Nusser" itemprop="url" href="/person/1a3ddfd808651b65642d513052b2c248e/author/1"><span itemprop="name">A. Nusser</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Sabine Storandt" itemprop="url" href="/person/1a3ddfd808651b65642d513052b2c248e/author/2"><span itemprop="name">S. Storandt</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">Special Issue: Best papers of VLDB 2014</span>, </em></span><em> 25, 1, </em><em>page <span itemprop="pagination">103-123</span>. </em><em><span itemprop="publisher">Springer</span>, </em>(<em><span>2016<meta content="2016" itemprop="datePublished"/></span></em>)</span>
- Regular languages are church-rosser congruentialhttps://puma.ub.uni-stuttgart.de/bibtex/2195e52e7b1bc93d7a8737dd94f32f5bd/unibibliounibiblio2020-08-11T12:09:32+02:00hp mult ubs_10005 ubs_20008 ubs_30080 ubs_40106 ubs_40107 unibibliografie <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Volker Diekert" itemprop="url" href="/person/190d3a2bfce06c066baf47123a39002fc/author/0"><span itemprop="name">V. Diekert</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Manfred Kufleitner" itemprop="url" href="/person/190d3a2bfce06c066baf47123a39002fc/author/1"><span itemprop="name">M. Kufleitner</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Klaus Reinhardt" itemprop="url" href="/person/190d3a2bfce06c066baf47123a39002fc/author/2"><span itemprop="name">K. Reinhardt</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Tobias Walter" itemprop="url" href="/person/190d3a2bfce06c066baf47123a39002fc/author/3"><span itemprop="name">T. Walter</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="journal">Journal of the ACM</span>, </em> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">62 </span></span>(<span itemprop="issueNumber">5</span>):
<span itemprop="pagination">39:1-39:20</span></em> </span>(<em><span>2015<meta content="2015" itemprop="datePublished"/></span></em>)</span>
- One quantifier alternation in first-order logic with modular predicateshttps://puma.ub.uni-stuttgart.de/bibtex/21e9a9ada44492af06c2d21e277e9e468/unibibliounibiblio2020-08-11T12:09:32+02:00hp mult ubs_10005 ubs_20008 ubs_30080 ubs_40106 ubs_40107 unibibliografie <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Manfred Kufleitner" itemprop="url" href="/person/195e911fa554b3c6c03ff62021a5be164/author/0"><span itemprop="name">M. Kufleitner</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Tobias Walter" itemprop="url" href="/person/195e911fa554b3c6c03ff62021a5be164/author/1"><span itemprop="name">T. Walter</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="journal">RAIRO. Theoretical informatics and applications</span>, </em> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">49 </span></span>(<span itemprop="issueNumber">1</span>):
<span itemprop="pagination">1-22</span></em> </span>(<em><span>2015<meta content="2015" itemprop="datePublished"/></span></em>)</span>
- Asymptotic approximation for the quotient complexities of atomshttps://puma.ub.uni-stuttgart.de/bibtex/2a5d34cc0bf236faa91ba7d12f0c7afe4/unibibliounibiblio2020-08-11T12:09:32+02:00hp mult ubs_10005 ubs_20008 ubs_30080 ubs_40106 ubs_40107 unibibliografie <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Volker Diekert" itemprop="url" href="/person/1234725483d433472dbcebb7173ab57a0/author/0"><span itemprop="name">V. Diekert</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Tobias Walter" itemprop="url" href="/person/1234725483d433472dbcebb7173ab57a0/author/1"><span itemprop="name">T. Walter</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="journal">Acta cybernetica</span>, </em> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">22 </span></span>(<span itemprop="issueNumber">2</span>):
<span itemprop="pagination">349-357</span></em> </span>(<em><span>2015<meta content="2015" itemprop="datePublished"/></span></em>)</span>
- Map Simplification with Topology Constraints : Exactly and in Practicehttps://puma.ub.uni-stuttgart.de/bibtex/2800c38cbba62d04dbdcba83e9f116c19/unibibliounibiblio2020-03-27T16:37:00+01:00liste mult ubs_10005 ubs_10008 ubs_20008 ubs_20013 ubs_30080 ubs_30123 ubs_40106 ubs_40191 unibibliografie <span data-person-type="author" class="authorEditorList "><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stefan Funke" itemprop="url" href="/person/163bda502f39bca425c58e3385c0195d2/author/0"><span itemprop="name">S. Funke</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Thomas Mendel" itemprop="url" href="/person/163bda502f39bca425c58e3385c0195d2/author/1"><span itemprop="name">T. Mendel</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Alexander Miller" itemprop="url" href="/person/163bda502f39bca425c58e3385c0195d2/author/2"><span itemprop="name">A. Miller</span></a></span>, </span><span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Sabine Storandt" itemprop="url" href="/person/163bda502f39bca425c58e3385c0195d2/author/3"><span itemprop="name">S. Storandt</span></a></span>, </span> and <span><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Maria Wiebe" itemprop="url" href="/person/163bda502f39bca425c58e3385c0195d2/author/4"><span itemprop="name">M. Wiebe</span></a></span></span>. </span><span class="additional-entrytype-information"><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, (ALENEX) 2017</span>, </em></span><em>page <span itemprop="pagination">185-196</span>. </em><em>Philadelphia, </em><em><span itemprop="publisher">SIAM</span>, </em>(<em><span>2017<meta content="2017" itemprop="datePublished"/></span></em>)</span>