Items where authors include "Köhler, N."

Article

Bulteau, L., Dabrowski, K.K., Köhler, N. et al. (2 more authors) (2024) An Algorithmic Framework for Locally Contrainted Homomorphisms. SIAM Journal on Discrete Mathematics, 38 (2). pp. 1315-1350. ISSN 0895-4801

Bulteau, L., Dabrowski, K.K., Köhler, N. orcid.org/0000-0002-1023-6530 et al. (2 more authors) (2024) An Algorithmic Framework for Locally Constrained Homomorphisms. SIAM Journal on Discrete Mathematics, 38 (2). pp. 1315-1350. ISSN 0895-4801

Proceedings Paper

Hanaka, T., Köhler, N. orcid.org/0000-0002-1023-6530 and Lampis, M. (2024) Core Stability in Additively Separable Hedonic Games of Low Treewidth. In: 35th International Symposium on Algorithms and Computation (ISAAC 2024). 35th International Symposium on Algorithms and Computation (ISAAC 2024), 08-11 Dec 2024, Sydney, Australia. Leibniz International Proceedings in Informatics (LIPIcs), 322 . Schloss Dagstuhl – Leibniz-Zentrum für Informatik , Wadern, Germany , 39:1-39:17. ISBN 978-3-95977-354-6

Bonnet, É, Chakraborty, D. orcid.org/0000-0003-0534-6417, Kim, E.J. et al. (3 more authors) (2022) Twin-Width VIII: Delineation and Win-Wins. In: Leibniz International Proceedings in Informatics (LIPIcs). 17th International Symposium on Parameterized and Exact Computation, 07-09 Sep 2022, Potsdam, Germany. , Wadern, Germany . ISBN 9783959772600

Adler, I., Köhler, N. and Peng, P. orcid.org/0000-0003-2700-5699 (2021) GSF-locality is not sufficient for proximity-oblivious testing. In: Kabanets, V., (ed.) 36th Computational Complexity Conference (CCC 2021). Computational Complexity Conference (CCC), 20-22 Jul 2021, Virtual conference (Toronto, Ontario, Cananda). Leibniz International Proceedings in Informatics (LIPIcs), 200 . Schloss Dagstuhl - Leibniz-Zentrum für Informatik , 34:1-34:27. ISBN 9783959771931

Adler, I., Köhler, N. and Peng, P. orcid.org/0000-0003-2700-5699 (2021) On testability of first-order properties in bounded-degree graphs. In: SODA '21: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '21: ACM-SIAM Symposium on Discrete Algorithms, 10-13 Jan 2021, Virginia, Virtual Event. Association for Computing Machinery (ACM) , pp. 1578-1597. ISBN 9781611976465