Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Michael Lampis and Manolis Vasilakis. Structural Parameterizations for Two Bounded Degree Problems Revisited. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 77:1-77:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{lampis_et_al:LIPIcs.ESA.2023.77, author = {Lampis, Michael and Vasilakis, Manolis}, title = {{Structural Parameterizations for Two Bounded Degree Problems Revisited}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {77:1--77:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-295-2}, ISSN = {1868-8969}, year = {2023}, volume = {274}, editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.77}, URN = {urn:nbn:de:0030-drops-187302}, doi = {10.4230/LIPIcs.ESA.2023.77}, annote = {Keywords: ETH, Parameterized Complexity, SETH} }
Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, and Hao-Tsung Yang. On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 2:1-2:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{afshani_et_al:LIPIcs.SoCG.2022.2, author = {Afshani, Peyman and de Berg, Mark and Buchin, Kevin and Gao, Jie and L\"{o}ffler, Maarten and Nayyeri, Amir and Raichel, Benjamin and Sarkar, Rik and Wang, Haotian and Yang, Hao-Tsung}, title = {{On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {2:1--2:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.2}, URN = {urn:nbn:de:0030-drops-160109}, doi = {10.4230/LIPIcs.SoCG.2022.2}, annote = {Keywords: Approximation, Motion Planning, Scheduling} }
Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
Karl Bringmann, Sándor Kisfaludi‑Bak, Marvin Künnemann, André Nusser, and Zahra Parsaeian. Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 21:1-21:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bringmann_et_al:LIPIcs.SoCG.2022.21, author = {Bringmann, Karl and Kisfaludi‑Bak, S\'{a}ndor and K\"{u}nnemann, Marvin and Nusser, Andr\'{e} and Parsaeian, Zahra}, title = {{Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {21:1--21:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.21}, URN = {urn:nbn:de:0030-drops-160294}, doi = {10.4230/LIPIcs.SoCG.2022.21}, annote = {Keywords: Hardness in P, Geometric Intersection Graph, Graph Diameter, Orthogonal Vectors, Hyperclique Detection} }
Published in: LIPIcs, Volume 151, 11th Innovations in Theoretical Computer Science Conference (ITCS 2020)
Shweta Agrawal, Michael Clear, Ophir Frieder, Sanjam Garg, Adam O'Neill, and Justin Thaler. Ad Hoc Multi-Input Functional Encryption. In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 151, pp. 40:1-40:41, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{agrawal_et_al:LIPIcs.ITCS.2020.40, author = {Agrawal, Shweta and Clear, Michael and Frieder, Ophir and Garg, Sanjam and O'Neill, Adam and Thaler, Justin}, title = {{Ad Hoc Multi-Input Functional Encryption}}, booktitle = {11th Innovations in Theoretical Computer Science Conference (ITCS 2020)}, pages = {40:1--40:41}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-134-4}, ISSN = {1868-8969}, year = {2020}, volume = {151}, editor = {Vidick, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.40}, URN = {urn:nbn:de:0030-drops-117258}, doi = {10.4230/LIPIcs.ITCS.2020.40}, annote = {Keywords: Multi-Input Functional Encryption} }
Published in: LIPIcs, Volume 55, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
Avishay Tal. On the Sensitivity Conjecture. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 38:1-38:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{tal:LIPIcs.ICALP.2016.38, author = {Tal, Avishay}, title = {{On the Sensitivity Conjecture}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {38:1--38:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.38}, URN = {urn:nbn:de:0030-drops-63184}, doi = {10.4230/LIPIcs.ICALP.2016.38}, annote = {Keywords: sensitivity conjecture, decision tree, block sensitivity} }
Published in: LIPIcs, Volume 55, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
Zeyuan Allen-Zhu, Zhenyu Liao, and Yang Yuan. Optimization Algorithms for Faster Computational Geometry. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 53:1-53:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{allenzhu_et_al:LIPIcs.ICALP.2016.53, author = {Allen-Zhu, Zeyuan and Liao, Zhenyu and Yuan, Yang}, title = {{Optimization Algorithms for Faster Computational Geometry}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {53:1--53:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.53}, URN = {urn:nbn:de:0030-drops-63325}, doi = {10.4230/LIPIcs.ICALP.2016.53}, annote = {Keywords: maximum inscribed balls, minimum enclosing balls, approximation algorithms} }
Published in: LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016)
Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, and Csaba Tóth. The Planar Tree Packing Theorem. In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, pp. 41:1-41:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{geyer_et_al:LIPIcs.SoCG.2016.41, author = {Geyer, Markus and Hoffmann, Michael and Kaufmann, Michael and Kusters, Vincent and T\'{o}th, Csaba}, title = {{The Planar Tree Packing Theorem}}, booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)}, pages = {41:1--41:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-009-5}, ISSN = {1868-8969}, year = {2016}, volume = {51}, editor = {Fekete, S\'{a}ndor and Lubiw, Anna}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.41}, URN = {urn:nbn:de:0030-drops-59337}, doi = {10.4230/LIPIcs.SoCG.2016.41}, annote = {Keywords: graph drawing, simultaneous embedding, planar graph, graph packin} }
Published in: Dagstuhl Reports, Volume 5, Issue 1 (2015)
Simon M. Lucas, Michael Mateas, Mike Preuss, Pieter Spronck, and Julian Togelius. Artificial and Computational Intelligence in Games: Integration (Dagstuhl Seminar 15051). In Dagstuhl Reports, Volume 5, Issue 1, pp. 207-242, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@Article{lucas_et_al:DagRep.5.1.207, author = {Lucas, Simon M. and Mateas, Michael and Preuss, Mike and Spronck, Pieter and Togelius, Julian}, title = {{Artificial and Computational Intelligence in Games: Integration (Dagstuhl Seminar 15051)}}, pages = {207--242}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2015}, volume = {5}, number = {1}, editor = {Lucas, Simon M. and Mateas, Michael and Preuss, Mike and Spronck, Pieter and Togelius, Julian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.5.1.207}, URN = {urn:nbn:de:0030-drops-50404}, doi = {10.4230/DagRep.5.1.207}, annote = {Keywords: Multi-agent systems, Dynamical systems, Entertainment modeling, Player satisfaction, Game design, Serious games, Game theory} }
Published in: Dagstuhl Seminar Proceedings, Volume 9081, Similarity-based learning on structures (2009)
Gert-Jan de Vries and Michael Biehl. Analysis of Robust Soft Learning Vector Quantization and an application to Facial Expression Recognition. In Similarity-based learning on structures. Dagstuhl Seminar Proceedings, Volume 9081, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{devries_et_al:DagSemProc.09081.4, author = {de Vries, Gert-Jan and Biehl, Michael}, title = {{Analysis of Robust Soft Learning Vector Quantization and an application to Facial Expression Recognition}}, booktitle = {Similarity-based learning on structures}, pages = {1--5}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9081}, editor = {Michael Biehl and Barbara Hammer and Sepp Hochreiter and Stefan C. Kremer and Thomas Villmann}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09081.4}, URN = {urn:nbn:de:0030-drops-20356}, doi = {10.4230/DagSemProc.09081.4}, annote = {Keywords: Learning Vector Quantization, Analysis, Facial Expression Recognition} }
Published in: Dagstuhl Seminar Proceedings, Volume 8492, Structured Decompositions and Efficient Algorithms (2009)
Michael Elad and Irad Yavneh. A Weighted Average of Sparse Representations is Better than the Sparsest One Alone. In Structured Decompositions and Efficient Algorithms. Dagstuhl Seminar Proceedings, Volume 8492, pp. 1-35, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{elad_et_al:DagSemProc.08492.3, author = {Elad, Michael and Yavneh, Irad}, title = {{A Weighted Average of Sparse Representations is Better than the Sparsest One Alone}}, booktitle = {Structured Decompositions and Efficient Algorithms}, pages = {1--35}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {8492}, editor = {Stephan Dahlke and Ingrid Daubechies and Michal Elad and Gitta Kutyniok and Gerd Teschke}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08492.3}, URN = {urn:nbn:de:0030-drops-18828}, doi = {10.4230/DagSemProc.08492.3}, annote = {Keywords: Sparse representations, MMSE, MAP, mathcing pursuit} }
Feedback for Dagstuhl Publishing