Items where authors include "Köhler, N"

Export as [feed] Atom [feed] RSS
Number of items: 4.

Article

Adler, I orcid.org/0000-0002-9667-9841 and Köhler, N (2022) An explicit construction of graphs of bounded degree that are far from being Hamiltonian. Discrete Mathematics and Theoretical Computer Science, 24 (1). 3. ISSN 1462-7264

Proceedings Paper

Bulteau, L, Dabrowski, KK orcid.org/0000-0001-9515-6945, Köhler, N et al. (2 more authors) (2022) An Algorithmic Framework for Locally Constrained Homomorphisms. In: Lecture Notes in Computer Science. 48th International Workshop on Graph-Theoretic Concepts in Computer Science (WG2022), 22-24 Jun 2022, Tuebingen, Germany. Springer Nature , pp. 114-128.

Adler, I orcid.org/0000-0002-9667-9841, Köhler, N and Peng, P (2021) GSF-Locality Is Not Sufficient For Proximity-Oblivious Testing. In: Kabanets, V, (ed.) Proceedings of 36th Computational Complexity Conference (CCC 2021). 36th Computational Complexity Conference (CCC 2021), 20-23 Jul 2021, Toronto, Canada. Leibniz International Proceedings in Informatics (LIPIcs), 200 . Schloss Dagstuhl - Leibniz-Zentrum für Informatik , 34:1-34:27. ISBN 978-3-95977-193-1

Adler, I orcid.org/0000-0002-9667-9841, Köhler, N and Peng, P (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, Online. ACM , pp. 1578-1597. ISBN 9781611976465

This list was generated on Sun Mar 24 03:41:12 2024 GMT.