Published in: LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Marvin Künnemann, Ramamohan Paturi, and Stefan Schneider. On the Fine-Grained Complexity of One-Dimensional Dynamic Programming. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 21:1-21:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{kunnemann_et_al:LIPIcs.ICALP.2017.21, author = {K\"{u}nnemann, Marvin and Paturi, Ramamohan and Schneider, Stefan}, title = {{On the Fine-Grained Complexity of One-Dimensional Dynamic Programming}}, booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, pages = {21:1--21:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-041-5}, ISSN = {1868-8969}, year = {2017}, volume = {80}, editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.21}, URN = {urn:nbn:de:0030-drops-74688}, doi = {10.4230/LIPIcs.ICALP.2017.21}, annote = {Keywords: Least-Weight Subsequence, SETH, Fine-Grained Complexity, Knapsack, Subquadratic Algorithms} }
Published in: Dagstuhl Reports, Volume 3, Issue 8 (2013)
Thore Husfeldt, Ramamohan Paturi, Gregory B. Sorkin, and Ryan Williams. Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331). In Dagstuhl Reports, Volume 3, Issue 8, pp. 40-72, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@Article{husfeldt_et_al:DagRep.3.8.40, author = {Husfeldt, Thore and Paturi, Ramamohan and Sorkin, Gregory B. and Williams, Ryan}, title = {{Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331)}}, pages = {40--72}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2013}, volume = {3}, number = {8}, editor = {Husfeldt, Thore and Paturi, Ramamohan and Sorkin, Gregory B. and Williams, Ryan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.3.8.40}, URN = {urn:nbn:de:0030-drops-43422}, doi = {10.4230/DagRep.3.8.40}, annote = {Keywords: Algorithms, exponential time algorithms, exact algorithms, computational complexity, satisfiability} }
Published in: Dagstuhl Seminar Proceedings, Volume 10441, Exact Complexity of NP-hard Problems (2011)
Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, and Gregory B. Sorkin. 10441 Abstracts Collection – Exact Complexity of NP-hard Problems. In Exact Complexity of NP-hard Problems. Dagstuhl Seminar Proceedings, Volume 10441, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{husfeldt_et_al:DagSemProc.10441.1, author = {Husfeldt, Thore and Kratsch, Dieter and Paturi, Ramamohan and Sorkin, Gregory B.}, title = {{10441 Abstracts Collection – Exact Complexity of NP-hard Problems}}, booktitle = {Exact Complexity of NP-hard Problems}, pages = {1--22}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2011}, volume = {10441}, editor = {Thore Husfeldt and Dieter Kratsch and Ramamohan Paturi and Gregory B. Sorkin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10441.1}, URN = {urn:nbn:de:0030-drops-29363}, doi = {10.4230/DagSemProc.10441.1}, annote = {Keywords: Complexity, Algorithms, NP-hard Problems, Exponential Time, SAT, Graphs} }
Published in: Dagstuhl Seminar Proceedings, Volume 10441, Exact Complexity of NP-hard Problems (2011)
David Eppstein, Maarten Löffler, and Darren Strash. Listing all maximal cliques in sparse graphs in near-optimal time. In Exact Complexity of NP-hard Problems. Dagstuhl Seminar Proceedings, Volume 10441, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{eppstein_et_al:DagSemProc.10441.2, author = {Eppstein, David and L\"{o}ffler, Maarten and Strash, Darren}, title = {{Listing all maximal cliques in sparse graphs in near-optimal time}}, booktitle = {Exact Complexity of NP-hard Problems}, pages = {1--14}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2011}, volume = {10441}, editor = {Thore Husfeldt and Dieter Kratsch and Ramamohan Paturi and Gregory B. Sorkin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10441.2}, URN = {urn:nbn:de:0030-drops-29356}, doi = {10.4230/DagSemProc.10441.2}, annote = {Keywords: Clique, backtracking, degeneracy, worst-case optimality} }
Feedback for Dagstuhl Publishing