European Symposium on Algorithms: Difference between revisions

Browse history interactively

← Previous edit

Content deleted Content added

VisualWikitext

Revision as of 09:57, 20 September 2023 edit Gonnym (talk \| contribs) Autopatrolled, Extended confirmed users, Template editors 258,968 edits remove bold from headers; clean up Tag: AWB ← Previous edit		Latest revision as of 22:23, 4 April 2025 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,660 edits →ESA Awards: Mechthild Stoer
(2 intermediate revisions by 2 users not shown)
Line 59: \|- \|2015 \|[[Mechthild Stoer]], Frank Wagner: A Simple Min Cut Algorithm. In ESA 1994 Sudipto Guha, Samir Khuller: Approximation Algorithms for Connected Dominating Sets. In ESA 1996 \|Jan van Leeuwen, Kurt Mehlhorn, Mike Paterson Line 121: Practical Access to Dynamic Programming on Tree Decompositions \|- \|2017<ref>{{Cite journal \|~~last~~last1=Pruhs \|~~first~~first1=Kirk \|last2=Sohler \|first2=Christian \|date=2017 \|editor-last=Pruhs \|editor-first=Kirk \|editor2-last=Sohler \|editor2-first=Christian \|title=Front Matter, Table of Contents, Preface, Programm ~~Commitees~~Committees, External Reviewers \|url=http://drops.dagstuhl.de/opus/volltexte/2017/7814 \|journal=25th Annual European Symposium on Algorithms (ESA 2017) \|series=Leibniz International Proceedings in Informatics (LIPIcs) \|___location=Dagstuhl, Germany \|publisher=Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik \|volume=87 \|pages=0:i–0:xx \|doi=10.4230/LIPIcs.ESA.2017.0 \|doi-access=free \|isbn=978-3-95977-049-1}}</ref> \|Marek Cygan, Lukasz Kowalik and Arkadiusz Socala: Improving TSP tours using dynamic programming over tree decompositions Line 130: \| \|- \|2016<ref>{{Cite journal \|~~last~~last1=Sankowski \|~~first~~first1=Piotr \|last2=Zaroliagis \|first2=Christos \|date=2016 \|editor-last=Sankowski \|editor-first=Piotr \|editor2-last=Zaroliagis \|editor2-first=Christos \|title=Front Matter, Table of Contents, Preface, Programm ~~Commitee~~Committee, External Reviewers \|url=http://drops.dagstuhl.de/opus/volltexte/2016/6342 \|journal=24th Annual European Symposium on Algorithms (ESA 2016) \|series=Leibniz International Proceedings in Informatics (LIPIcs) \|___location=Dagstuhl, Germany \|publisher=Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik \|volume=57 \|pages=0:i–0:xxiv \|doi=10.4230/LIPIcs.ESA.2016.0 \|doi-access=free \|isbn=978-3-95977-015-6}}</ref> \|Stefan Kratsch: A randomized polynomial kernelization for Vertex Cover with a smaller parameter