Published in: LIPIcs, Volume 126, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Parinya Chalermsook, Andreas Schmid, and Sumedha Uniyal. A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 126, pp. 19:1-19:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{chalermsook_et_al:LIPIcs.STACS.2019.19, author = {Chalermsook, Parinya and Schmid, Andreas and Uniyal, Sumedha}, title = {{A Tight Extremal Bound on the Lov\'{a}sz Cactus Number in Planar Graphs}}, booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)}, pages = {19:1--19:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-100-9}, ISSN = {1868-8969}, year = {2019}, volume = {126}, editor = {Niedermeier, Rolf and Paul, Christophe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.19}, URN = {urn:nbn:de:0030-drops-102583}, doi = {10.4230/LIPIcs.STACS.2019.19}, annote = {Keywords: Graph Drawing, Matroid Matching, Maximum Planar Subgraph, Local Search Algorithms} }
Published in: LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Andreas Schmid and Jens M. Schmidt. Computing Tutte Paths. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 98:1-98:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{schmid_et_al:LIPIcs.ICALP.2018.98, author = {Schmid, Andreas and Schmidt, Jens M.}, title = {{Computing Tutte Paths}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {98:1--98:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.98}, URN = {urn:nbn:de:0030-drops-91029}, doi = {10.4230/LIPIcs.ICALP.2018.98}, annote = {Keywords: Tutte Path, Tutte Cycle, 2-Connected Planar Graph, Hamiltonian Cycle} }
Published in: LIPIcs, Volume 30, 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)
Andreas Schmid and Jens M. Schmidt. Computing 2-Walks in Polynomial Time. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 676-688, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{schmid_et_al:LIPIcs.STACS.2015.676, author = {Schmid, Andreas and Schmidt, Jens M.}, title = {{Computing 2-Walks in Polynomial Time}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {676--688}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.676}, URN = {urn:nbn:de:0030-drops-49502}, doi = {10.4230/LIPIcs.STACS.2015.676}, annote = {Keywords: algorithms and data structures, 2-walks, 3-connected planar graphs, Tutte paths, 3-trees} }
Published in: Dagstuhl Reports, Volume 3, Issue 4 (2013)
Luciano Baresi, Andreas Rummler, and Klaus Schmid. Customizing Service Platforms (Dagstuhl Seminar 13171). In Dagstuhl Reports, Volume 3, Issue 4, pp. 114-150, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@Article{baresi_et_al:DagRep.3.4.114, author = {Baresi, Luciano and Rummler, Andreas and Schmid, Klaus}, title = {{Customizing Service Platforms (Dagstuhl Seminar 13171)}}, pages = {114--150}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2013}, volume = {3}, number = {4}, editor = {Baresi, Luciano and Rummler, Andreas and Schmid, Klaus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.3.4.114}, URN = {urn:nbn:de:0030-drops-41736}, doi = {10.4230/DagRep.3.4.114}, annote = {Keywords: Service-Oriented Architectures, Service Platforms / Cloud Computing, Product Line Engineering, Variability Management} }
Published in: Dagstuhl Seminar Proceedings, Volume 8371, Fault-Tolerant Distributed Algorithms on VLSI Chips (2009)
Andreas Steininger. Error Containment in the Presence of Metastability. In Fault-Tolerant Distributed Algorithms on VLSI Chips. Dagstuhl Seminar Proceedings, Volume 8371, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{steininger:DagSemProc.08371.3, author = {Steininger, Andreas}, title = {{Error Containment in the Presence of Metastability}}, booktitle = {Fault-Tolerant Distributed Algorithms on VLSI Chips}, pages = {1--5}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {8371}, editor = {Bernadette Charron-Bost and Shlomi Dolev and Jo Ebergen and Ulrich Schmid}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08371.3}, URN = {urn:nbn:de:0030-drops-19235}, doi = {10.4230/DagSemProc.08371.3}, annote = {Keywords: Metastability, fault tolerance, clock generation} }
Feedback for Dagstuhl Publishing