Published in: OASIcs, Volume 78, Joint Post-proceedings of the First and Second International Conference on Microservices (Microservices 2017/2019)
Justus Bogner, Adrian Weller, Stefan Wagner, and Alfred Zimmermann. Exploring Maintainability Assurance Research for Service- and Microservice-Based Systems: Directions and Differences. In Joint Post-proceedings of the First and Second International Conference on Microservices (Microservices 2017/2019). Open Access Series in Informatics (OASIcs), Volume 78, pp. 3:1-3:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{bogner_et_al:OASIcs.Microservices.2017-2019.3, author = {Bogner, Justus and Weller, Adrian and Wagner, Stefan and Zimmermann, Alfred}, title = {{Exploring Maintainability Assurance Research for Service- and Microservice-Based Systems: Directions and Differences}}, booktitle = {Joint Post-proceedings of the First and Second International Conference on Microservices (Microservices 2017/2019)}, pages = {3:1--3:22}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-137-5}, ISSN = {2190-6807}, year = {2020}, volume = {78}, editor = {Cruz-Filipe, Lu{\'\i}s and Giallorenzo, Saverio and Montesi, Fabrizio and Peressotti, Marco and Rademacher, Florian and Sachweh, Sabine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.Microservices.2017-2019.3}, URN = {urn:nbn:de:0030-drops-118255}, doi = {10.4230/OASIcs.Microservices.2017-2019.3}, annote = {Keywords: Maintainability, Software Evolution, Quality Assurance, Service-Based Systems, SOA, Microservices, Systematic Literature Review} }
Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)
Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, and Uli Wagner. The Crossing Tverberg Theorem. In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 38:1-38:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{fulek_et_al:LIPIcs.SoCG.2019.38, author = {Fulek, Radoslav and G\"{a}rtner, Bernd and Kupavskii, Andrey and Valtr, Pavel and Wagner, Uli}, title = {{The Crossing Tverberg Theorem}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {38:1--38:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-104-7}, ISSN = {1868-8969}, year = {2019}, volume = {129}, editor = {Barequet, Gill and Wang, Yusu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.38}, URN = {urn:nbn:de:0030-drops-104423}, doi = {10.4230/LIPIcs.SoCG.2019.38}, annote = {Keywords: Discrete geometry, Tverberg theorem, Crossing Tverberg theorem} }
Published in: LIPIcs, Volume 59, 27th International Conference on Concurrency Theory (CONCUR 2016)
Christina Rickmann, Christoph Wagner, Uwe Nestmann, and Stefan Schmid. Topological Self-Stabilization with Name-Passing Process Calculi. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 19:1-19:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{rickmann_et_al:LIPIcs.CONCUR.2016.19, author = {Rickmann, Christina and Wagner, Christoph and Nestmann, Uwe and Schmid, Stefan}, title = {{Topological Self-Stabilization with Name-Passing Process Calculi}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {19:1--19:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.19}, URN = {urn:nbn:de:0030-drops-61761}, doi = {10.4230/LIPIcs.CONCUR.2016.19}, annote = {Keywords: Distributed Algorithms, Fault Tolerance, Topological Self-Stabilization, Linearization, Process Calculi} }
Published in: OASIcs, Volume 42, 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2014)
Julian Dibbelt, Ben Strasser, and Dorothea Wagner. Delay-Robust Journeys in Timetable Networks with Minimum Expected Arrival Time. In 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 42, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{dibbelt_et_al:OASIcs.ATMOS.2014.1, author = {Dibbelt, Julian and Strasser, Ben and Wagner, Dorothea}, title = {{Delay-Robust Journeys in Timetable Networks with Minimum Expected Arrival Time}}, booktitle = {14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, pages = {1--14}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-75-0}, ISSN = {2190-6807}, year = {2014}, volume = {42}, editor = {Funke, Stefan and Mihal\'{a}k, Mat\'{u}s}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2014.1}, URN = {urn:nbn:de:0030-drops-47488}, doi = {10.4230/OASIcs.ATMOS.2014.1}, annote = {Keywords: Algorithms, Optimization, Delay-robustness, Route planning, Public transportation} }
Published in: OASIcs, Volume 42, 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2014)
Moritz Baum, Julian Dibbelt, Lorenz Hübschle-Schneider, Thomas Pajor, and Dorothea Wagner. Speed-Consumption Tradeoff for Electric Vehicle Route Planning. In 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 42, pp. 138-151, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{baum_et_al:OASIcs.ATMOS.2014.138, author = {Baum, Moritz and Dibbelt, Julian and H\"{u}bschle-Schneider, Lorenz and Pajor, Thomas and Wagner, Dorothea}, title = {{Speed-Consumption Tradeoff for Electric Vehicle Route Planning}}, booktitle = {14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, pages = {138--151}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-75-0}, ISSN = {2190-6807}, year = {2014}, volume = {42}, editor = {Funke, Stefan and Mihal\'{a}k, Mat\'{u}s}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2014.138}, URN = {urn:nbn:de:0030-drops-47583}, doi = {10.4230/OASIcs.ATMOS.2014.138}, annote = {Keywords: electric vehicles, shortest paths, route planning, bicriteria optimization, algorithm engineering} }
Published in: OASIcs, Volume 28, 2012 Imperial College Computing Student Workshop
Jan-Peter Ostberg and Stefan Wagner. Get started imminently: Using tutorials to accelerate learning in automated static analysis. In 2012 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 28, pp. 109-115, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{ostberg_et_al:OASIcs.ICCSW.2012.109, author = {Ostberg, Jan-Peter and Wagner, Stefan}, title = {{Get started imminently: Using tutorials to accelerate learning in automated static analysis}}, booktitle = {2012 Imperial College Computing Student Workshop}, pages = {109--115}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-48-4}, ISSN = {2190-6807}, year = {2012}, volume = {28}, editor = {Jones, Andrew V.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2012.109}, URN = {urn:nbn:de:0030-drops-37739}, doi = {10.4230/OASIcs.ICCSW.2012.109}, annote = {Keywords: static analysis, motivation, usability, empirical research, gamification} }
Published in: Dagstuhl Seminar Proceedings, Volume 5361, Algorithmic Aspects of Large and Complex Networks (2006)
Sándor Fekete, Alexander Kröller, Dennis Pfisterer, and Stefan Fischer. Deterministic boundary recongnition and topology extraction for large sensor networks. In Algorithmic Aspects of Large and Complex Networks. Dagstuhl Seminar Proceedings, Volume 5361, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{fekete_et_al:DagSemProc.05361.6, author = {Fekete, S\'{a}ndor and Kr\"{o}ller, Alexander and Pfisterer, Dennis and Fischer, Stefan}, title = {{Deterministic boundary recongnition and topology extraction for large sensor networks}}, booktitle = {Algorithmic Aspects of Large and Complex Networks}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5361}, editor = {Stefano Leonardi and Friedhelm Meyer auf der Heide and Dorothea Wagner}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05361.6}, URN = {urn:nbn:de:0030-drops-5632}, doi = {10.4230/DagSemProc.05361.6}, annote = {Keywords: Distributed algorithms, sensor networks, boundary recognition, topology extraction} }
Feedback for Dagstuhl Publishing