Dagstuhl Follow-Ups, Volume 6
Editors: Simon M. Lucas, Michael Mateas, Mike Preuss, Pieter Spronck, and Julian Togelius
Published in: LIPIcs, Volume 289, 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)
Julian D'Costa, Joël Ouaknine, and James Worrell. Nonnegativity Problems for Matrix Semigroups. In 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 289, pp. 27:1-27:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{dcosta_et_al:LIPIcs.STACS.2024.27, author = {D'Costa, Julian and Ouaknine, Jo\"{e}l and Worrell, James}, title = {{Nonnegativity Problems for Matrix Semigroups}}, booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)}, pages = {27:1--27:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-311-9}, ISSN = {1868-8969}, year = {2024}, volume = {289}, editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.27}, URN = {urn:nbn:de:0030-drops-197371}, doi = {10.4230/LIPIcs.STACS.2024.27}, annote = {Keywords: Decidability, Linear Recurrence Sequences, Schanuel’s Conjecture} }
Published in: OASIcs, Volume 106, 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)
Julian Patzner, Ralf Rückert, and Matthias Müller-Hannemann. Passenger-Aware Real-Time Planning of Short Turns to Reduce Delays in Public Transport. In 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022). Open Access Series in Informatics (OASIcs), Volume 106, pp. 13:1-13:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{patzner_et_al:OASIcs.ATMOS.2022.13, author = {Patzner, Julian and R\"{u}ckert, Ralf and M\"{u}ller-Hannemann, Matthias}, title = {{Passenger-Aware Real-Time Planning of Short Turns to Reduce Delays in Public Transport}}, booktitle = {22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)}, pages = {13:1--13:18}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-259-4}, ISSN = {2190-6807}, year = {2022}, volume = {106}, editor = {D'Emidio, Mattia and Lindner, Niels}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2022.13}, URN = {urn:nbn:de:0030-drops-171171}, doi = {10.4230/OASIcs.ATMOS.2022.13}, annote = {Keywords: Public Transportation, Delays, Real-time Dispatching, Passenger Flows} }
Published in: LIPIcs, Volume 207, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)
Anna Arutyunova, Anna Großwendt, Heiko Röglin, Melanie Schmidt, and Julian Wargalla. Upper and Lower Bounds for Complete Linkage in General Metric Spaces. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 207, pp. 18:1-18:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{arutyunova_et_al:LIPIcs.APPROX/RANDOM.2021.18, author = {Arutyunova, Anna and Gro{\ss}wendt, Anna and R\"{o}glin, Heiko and Schmidt, Melanie and Wargalla, Julian}, title = {{Upper and Lower Bounds for Complete Linkage in General Metric Spaces}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)}, pages = {18:1--18:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-207-5}, ISSN = {1868-8969}, year = {2021}, volume = {207}, editor = {Wootters, Mary and Sanit\`{a}, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.18}, URN = {urn:nbn:de:0030-drops-147115}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.18}, annote = {Keywords: Hierarchical Clustering, Complete Linkage, agglomerative Clustering, k-Center} }
Published in: LIPIcs, Volume 189, 37th International Symposium on Computational Geometry (SoCG 2021)
Yiqiu Wang, Shangdi Yu, Yan Gu, and Julian Shun. A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 60:1-60:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{wang_et_al:LIPIcs.SoCG.2021.60, author = {Wang, Yiqiu and Yu, Shangdi and Gu, Yan and Shun, Julian}, title = {{A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {60:1--60:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.60}, URN = {urn:nbn:de:0030-drops-138594}, doi = {10.4230/LIPIcs.SoCG.2021.60}, annote = {Keywords: Closest Pair, Parallel Algorithms, Dynamic Algorithms, Experimental Algorithms} }
Published in: OASIcs, Volume 79, 2nd International Workshop on Autonomous Systems Design (ASD 2020)
Tobias Kain, Philipp Mundhenk, Julian-Steffen Müller, Hans Tompits, Maximilian Wesche, and Hendrik Decke. Towards a Reliable and Context-Based System Architecture for Autonomous Vehicles. In 2nd International Workshop on Autonomous Systems Design (ASD 2020). Open Access Series in Informatics (OASIcs), Volume 79, pp. 1:1-1:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kain_et_al:OASIcs.ASD.2020.1, author = {Kain, Tobias and Mundhenk, Philipp and M\"{u}ller, Julian-Steffen and Tompits, Hans and Wesche, Maximilian and Decke, Hendrik}, title = {{Towards a Reliable and Context-Based System Architecture for Autonomous Vehicles}}, booktitle = {2nd International Workshop on Autonomous Systems Design (ASD 2020)}, pages = {1:1--1:7}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-141-2}, ISSN = {2190-6807}, year = {2020}, volume = {79}, editor = {Steinhorst, Sebastian and Deshmukh, Jyotirmoy V.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ASD.2020.1}, URN = {urn:nbn:de:0030-drops-125956}, doi = {10.4230/OASIcs.ASD.2020.1}, annote = {Keywords: autonomous driving, fail-operational systems, context-based architecture, application placement, optimization, monitoring} }
Published in: LIPIcs, Volume 167, 5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020)
Cynthia Kop. WANDA - a Higher Order Termination Tool (System Description). In 5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 167, pp. 36:1-36:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kop:LIPIcs.FSCD.2020.36, author = {Kop, Cynthia}, title = {{WANDA - a Higher Order Termination Tool}}, booktitle = {5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020)}, pages = {36:1--36:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-155-9}, ISSN = {1868-8969}, year = {2020}, volume = {167}, editor = {Ariola, Zena M.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2020.36}, URN = {urn:nbn:de:0030-drops-123587}, doi = {10.4230/LIPIcs.FSCD.2020.36}, annote = {Keywords: higher-order term rewriting, termination, automatic analysis, dependency pair framework, higher-order recursive path ordering} }
Published in: LIPIcs, Volume 134, 33rd European Conference on Object-Oriented Programming (ECOOP 2019)
Linghui Luo, Julian Dolby, and Eric Bodden. MagpieBridge: A General Approach to Integrating Static Analyses into IDEs and Editors (Tool Insights Paper). In 33rd European Conference on Object-Oriented Programming (ECOOP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 134, pp. 21:1-21:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{luo_et_al:LIPIcs.ECOOP.2019.21, author = {Luo, Linghui and Dolby, Julian and Bodden, Eric}, title = {{MagpieBridge: A General Approach to Integrating Static Analyses into IDEs and Editors}}, booktitle = {33rd European Conference on Object-Oriented Programming (ECOOP 2019)}, pages = {21:1--21:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-111-5}, ISSN = {1868-8969}, year = {2019}, volume = {134}, editor = {Donaldson, Alastair F.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2019.21}, URN = {urn:nbn:de:0030-drops-108139}, doi = {10.4230/LIPIcs.ECOOP.2019.21}, annote = {Keywords: IDE, Tool Support, Static Analysis, Language Server Protocol} }
Published in: LIPIcs, Volume 92, 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Jessica McClintock, Julián Mestre, and Anthony Wirth. Precedence-Constrained Min Sum Set Cover. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 55:1-55:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{mcclintock_et_al:LIPIcs.ISAAC.2017.55, author = {McClintock, Jessica and Mestre, Juli\'{a}n and Wirth, Anthony}, title = {{Precedence-Constrained Min Sum Set Cover}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {55:1--55:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.55}, URN = {urn:nbn:de:0030-drops-82648}, doi = {10.4230/LIPIcs.ISAAC.2017.55}, annote = {Keywords: planted dense subgraph, min sum set cover, precedence constrained} }
Published in: LIPIcs, Volume 88, 17th International Workshop on Algorithms in Bioinformatics (WABI 2017)
Mohamed K. Gunady, Steffen Cornwell, Stephen M. Mount, and Héctor Corrada Bravo. Yanagi: Transcript Segment Library Construction for RNA-Seq Quantification. In 17th International Workshop on Algorithms in Bioinformatics (WABI 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 88, pp. 10:1-10:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{gunady_et_al:LIPIcs.WABI.2017.10, author = {Gunady, Mohamed K. and Cornwell, Steffen and Mount, Stephen M. and Bravo, H\'{e}ctor Corrada}, title = {{Yanagi: Transcript Segment Library Construction for RNA-Seq Quantification}}, booktitle = {17th International Workshop on Algorithms in Bioinformatics (WABI 2017)}, pages = {10:1--10:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-050-7}, ISSN = {1868-8969}, year = {2017}, volume = {88}, editor = {Schwartz, Russell and Reinert, Knut}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2017.10}, URN = {urn:nbn:de:0030-drops-76487}, doi = {10.4230/LIPIcs.WABI.2017.10}, annote = {Keywords: RNA-Seq, Genome Sequencing, Kmer-based alignment, Transcriptome Quantification, Differential Alternative Splicing} }
Published in: LIPIcs, Volume 75, 16th International Symposium on Experimental Algorithms (SEA 2017)
Niklas Baumstark, Simon Gog, Tobias Heuer, and Julian Labeit. The Quantile Index - Succinct Self-Index for Top-k Document Retrieval. In 16th International Symposium on Experimental Algorithms (SEA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 75, pp. 15:1-15:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{baumstark_et_al:LIPIcs.SEA.2017.15, author = {Baumstark, Niklas and Gog, Simon and Heuer, Tobias and Labeit, Julian}, title = {{The Quantile Index - Succinct Self-Index for Top-k Document Retrieval}}, booktitle = {16th International Symposium on Experimental Algorithms (SEA 2017)}, pages = {15:1--15:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-036-1}, ISSN = {1868-8969}, year = {2017}, volume = {75}, editor = {Iliopoulos, Costas S. and Pissis, Solon P. and Puglisi, Simon J. and Raman, Rajeev}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2017.15}, URN = {urn:nbn:de:0030-drops-76183}, doi = {10.4230/LIPIcs.SEA.2017.15}, annote = {Keywords: Text Indexing, Succinct Data Structures, Top-k Document Retrieval} }
Published in: Dagstuhl Reports, Volume 6, Issue 5 (2016)
Julian Dolby, Orna Grumberg, Peter Müller, and Omer Tripp. Synergies among Testing, Verification, and Repair for Concurrent Programs (Dagstuhl Seminar 16201). In Dagstuhl Reports, Volume 6, Issue 5, pp. 56-71, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@Article{dolby_et_al:DagRep.6.5.56, author = {Dolby, Julian and Grumberg, Orna and M\"{u}ller, Peter and Tripp, Omer}, title = {{Synergies among Testing, Verification, and Repair for Concurrent Programs (Dagstuhl Seminar 16201)}}, pages = {56--71}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2016}, volume = {6}, number = {5}, editor = {Dolby, Julian and Grumberg, Orna and M\"{u}ller, Peter and Tripp, Omer}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.6.5.56}, URN = {urn:nbn:de:0030-drops-67203}, doi = {10.4230/DagRep.6.5.56}, annote = {Keywords: (automatic) bug repair, concurrency bugs, concurrent programming, deductive verification, interactive verification, linearizability, synchronization testing} }
Published in: LIPIcs, Volume 57, 24th Annual European Symposium on Algorithms (ESA 2016)
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, and Julian Shun. Efficient Algorithms with Asymmetric Read and Write Costs. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 14:1-14:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{blelloch_et_al:LIPIcs.ESA.2016.14, author = {Blelloch, Guy E. and Fineman, Jeremy T. and Gibbons, Phillip B. and Gu, Yan and Shun, Julian}, title = {{Efficient Algorithms with Asymmetric Read and Write Costs}}, booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)}, pages = {14:1--14:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-015-6}, ISSN = {1868-8969}, year = {2016}, volume = {57}, editor = {Sankowski, Piotr and Zaroliagis, Christos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.14}, URN = {urn:nbn:de:0030-drops-63656}, doi = {10.4230/LIPIcs.ESA.2016.14}, annote = {Keywords: Computational Model, Lower Bounds, Shortest-paths, Non-Volatile Memory, Sorting Networks, Fast Fourier Transform, Diamond DAG, Minimum Spanning Tree} }
Published in: LIPIcs, Volume 41, 24th EACSL Annual Conference on Computer Science Logic (CSL 2015)
Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, and Heribert Vollmer. A Van Benthem Theorem for Modal Team Semantics. In 24th EACSL Annual Conference on Computer Science Logic (CSL 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 41, pp. 277-291, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{kontinen_et_al:LIPIcs.CSL.2015.277, author = {Kontinen, Juha and M\"{u}ller, Julian-Steffen and Schnoor, Henning and Vollmer, Heribert}, title = {{A Van Benthem Theorem for Modal Team Semantics}}, booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)}, pages = {277--291}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-90-3}, ISSN = {1868-8969}, year = {2015}, volume = {41}, editor = {Kreutzer, Stephan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.277}, URN = {urn:nbn:de:0030-drops-54206}, doi = {10.4230/LIPIcs.CSL.2015.277}, annote = {Keywords: modal logic, dependence logic, team semantics, expressivity, bisimulation, independence, inclusion, generalized dependence atom} }
Published in: Dagstuhl Reports, Volume 5, Issue 1 (2015)
Simon M. Lucas, Michael Mateas, Mike Preuss, Pieter Spronck, and Julian Togelius. Artificial and Computational Intelligence in Games: Integration (Dagstuhl Seminar 15051). In Dagstuhl Reports, Volume 5, Issue 1, pp. 207-242, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@Article{lucas_et_al:DagRep.5.1.207, author = {Lucas, Simon M. and Mateas, Michael and Preuss, Mike and Spronck, Pieter and Togelius, Julian}, title = {{Artificial and Computational Intelligence in Games: Integration (Dagstuhl Seminar 15051)}}, pages = {207--242}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2015}, volume = {5}, number = {1}, editor = {Lucas, Simon M. and Mateas, Michael and Preuss, Mike and Spronck, Pieter and Togelius, Julian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.5.1.207}, URN = {urn:nbn:de:0030-drops-50404}, doi = {10.4230/DagRep.5.1.207}, annote = {Keywords: Multi-agent systems, Dynamical systems, Entertainment modeling, Player satisfaction, Game design, Serious games, Game theory} }
Feedback for Dagstuhl Publishing