European Symposium on Algorithms: Difference between revisions

Revision as of 09:57, 20 September 2023

Revision as of 06:13, 10 May 2024

Line 121:

Practical Access to Dynamic Programming on Tree Decompositions

|-

|2017<ref>{{Cite journal |last=Pruhs |first=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 CommiteesCommittees, 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 |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=Sankowski |first=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 CommiteeCommittee, 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 |isbn=978-3-95977-015-6}}</ref>

|Stefan Kratsch:

A randomized polynomial kernelization for Vertex Cover with a smaller parameter