Revision as of 06:13, 10 May 2024 edit Federhalter (talk \| contribs) Extended confirmed users 3,176 edits m MOS:TYPOFIX ← Previous edit		Revision as of 23:43, 28 July 2024 edit undo Citation bot (talk \| contribs) Bots 5,866,775 edits Add: doi-access, authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. \| Use this bot. Report bugs. \| Suggested by Headbomb \| Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox2 \| #UCB_webform_linked 460/1051 Next edit →
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 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 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

European Symposium on Algorithms: Difference between revisions