Published in: LIPIcs, Volume 173, 28th Annual European Symposium on Algorithms (ESA 2020)
Łukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, and Magnus Wahlström. Many Visits TSP Revisited. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 66:1-66:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kowalik_et_al:LIPIcs.ESA.2020.66, author = {Kowalik, {\L}ukasz and Li, Shaohua and Nadara, Wojciech and Smulewicz, Marcin and Wahlstr\"{o}m, Magnus}, title = {{Many Visits TSP Revisited}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {66:1--66:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.66}, URN = {urn:nbn:de:0030-drops-129329}, doi = {10.4230/LIPIcs.ESA.2020.66}, annote = {Keywords: many visits traveling salesman problem, exponential algorithm} }
Published in: LIPIcs, Volume 130, 24th International Conference on Types for Proofs and Programs (TYPES 2018)
Ulrich Berger, Ralph Matthes, and Anton Setzer. Martin Hofmann’s Case for Non-Strictly Positive Data Types. In 24th International Conference on Types for Proofs and Programs (TYPES 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 130, pp. 1:1-1:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{berger_et_al:LIPIcs.TYPES.2018.1, author = {Berger, Ulrich and Matthes, Ralph and Setzer, Anton}, title = {{Martin Hofmann’s Case for Non-Strictly Positive Data Types}}, booktitle = {24th International Conference on Types for Proofs and Programs (TYPES 2018)}, pages = {1:1--1:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-106-1}, ISSN = {1868-8969}, year = {2019}, volume = {130}, editor = {Dybjer, Peter and Esp{\'\i}rito Santo, Jos\'{e} and Pinto, Lu{\'\i}s}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TYPES.2018.1}, URN = {urn:nbn:de:0030-drops-114052}, doi = {10.4230/LIPIcs.TYPES.2018.1}, annote = {Keywords: non strictly-positive data types, breadth-first traversal, program verification, Mendler-style recursion, System F, theorem proving, Coq, Agda, Haskell} }
Published in: LIPIcs, Volume 74, 31st European Conference on Object-Oriented Programming (ECOOP 2017)
Martin Berger, Laurence Tratt, and Christian Urban. Modelling Homogeneous Generative Meta-Programming. In 31st European Conference on Object-Oriented Programming (ECOOP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 74, pp. 5:1-5:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{berger_et_al:LIPIcs.ECOOP.2017.5, author = {Berger, Martin and Tratt, Laurence and Urban, Christian}, title = {{Modelling Homogeneous Generative Meta-Programming}}, booktitle = {31st European Conference on Object-Oriented Programming (ECOOP 2017)}, pages = {5:1--5:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-035-4}, ISSN = {1868-8969}, year = {2017}, volume = {74}, editor = {M\"{u}ller, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2017.5}, URN = {urn:nbn:de:0030-drops-72775}, doi = {10.4230/LIPIcs.ECOOP.2017.5}, annote = {Keywords: Formal Methods, Meta-Programming, Operational Semantics, Types, Quasi-Quotes, Abstract Syntax Trees} }
Published in: OASIcs, Volume 11, 6th International Conference on Computability and Complexity in Analysis (CCA'09) (2009)
Ulrich Berger. Realisability and Adequacy for (Co)induction. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 49-60, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{berger:OASIcs.CCA.2009.2258, author = {Berger, Ulrich}, title = {{Realisability and Adequacy for (Co)induction}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {49--60}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2258}, URN = {urn:nbn:de:0030-drops-22581}, doi = {10.4230/OASIcs.CCA.2009.2258}, annote = {Keywords: Constructive Analysis, realisability, program extraction, semantics} }
Published in: OASIcs, Volume 11, 6th International Conference on Computability and Complexity in Analysis (CCA'09) (2009)
Josef Berger and Douglas Bridges. A Constructive Study of Landau's Summability Theorem. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 61-70, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{berger_et_al:OASIcs.CCA.2009.2259, author = {Berger, Josef and Bridges, Douglas}, title = {{A Constructive Study of Landau's Summability Theorem}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {61--70}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2259}, URN = {urn:nbn:de:0030-drops-22595}, doi = {10.4230/OASIcs.CCA.2009.2259}, annote = {Keywords: Constructive analysis, Landau's theorem, uniform boundedness theorem Constructive analysis, Landau's theorem, uniform boundedness theorem} }
Published in: Dagstuhl Seminar Proceedings, Volume 5471, Computational Proteomics (2006)
Hansjörg Toll, Peter Berger, Andreas Hofmann, Andreas Hildebrandt, Herbert Oberacher, Hans Peter Lenhof, and Christian G. Huber. Glycosylation Patterns of Proteins Studied by Liquid Chromatography-Mass Spectrometry and Bioinformatic Tools. In Computational Proteomics. Dagstuhl Seminar Proceedings, Volume 5471, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{toll_et_al:DagSemProc.05471.8, author = {Toll, Hansj\"{o}rg and Berger, Peter and Hofmann, Andreas and Hildebrandt, Andreas and Oberacher, Herbert and Lenhof, Hans Peter and Huber, Christian G.}, title = {{Glycosylation Patterns of Proteins Studied by Liquid Chromatography-Mass Spectrometry and Bioinformatic Tools}}, booktitle = {Computational Proteomics}, pages = {1--6}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5471}, editor = {Christian G. Huber and Oliver Kohlbacher and Knut Reinert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05471.8}, URN = {urn:nbn:de:0030-drops-5431}, doi = {10.4230/DagSemProc.05471.8}, annote = {Keywords: Liquid chromatography, mass spectrometry, glycoproteins, glycosylation, peak annotation} }
Feedback for Dagstuhl Publishing