default search action
Noleen Köhler
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Isolde Adler, Noleen Köhler
, Pan Peng:
On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing. SIAM J. Comput. 53(4): 825-883 (2024) - [j2]Laurent Bulteau
An Algorithmic Framework for Locally Constrained Homomorphisms. SIAM J. Discret. Math. 38(2): 1315-1350 (2024) - [c7]Tesshu Hanaka, Noleen Köhler, Michael Lampis:
Core Stability in Additively Separable Hedonic Games of Low Treewidth. ISAAC 2024: 39:1-39:17 - [i9]Tesshu Hanaka, Noleen Köhler, Michael Lampis:
Core Stability in Additively Separable Hedonic Games of Low Treewidth. CoRR abs/2402.10815 (2024) - 2023
- [c6]Tatsuya Gima
Bandwidth Parameterized by Cluster Vertex Deletion Number. IPEC 2023: 21:1-21:15 - [c5]Rémy Belmonte
Odd Chromatic Number of Graph Classes. WG 2023: 44-58 - [i8]Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos:
Odd Chromatic Number of Graph Classes. CoRR abs/2303.03225 (2023) - [i7]Isolde Adler, Noleen Köhler, Pan Peng:
On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing. CoRR abs/2304.03810 (2023) - [i6]Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos, Manolis Vasilakis:
Bandwidth Parameterized by Cluster Vertex Deletion Number. CoRR abs/2309.17204 (2023) - 2022
- [j1]Isolde Adler, Noleen Köhler
An explicit construction of graphs of bounded degree that are far from being Hamiltonian. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - [c4]Édouard Bonnet, Dibyayan Chakraborty
Twin-Width VIII: Delineation and Win-Wins. IPEC 2022: 9:1-9:18 - [c3]Laurent Bulteau
An Algorithmic Framework for Locally Constrained Homomorphisms. WG 2022: 114-128 - [i5]Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma:
An Algorithmic Framework for Locally Constrained Homomorphisms. CoRR abs/2201.11731 (2022) - [i4]Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé:
Twin-width VIII: delineation and win-wins. CoRR abs/2204.00722 (2022) - 2021
- [b1]Noleen Köhler:
Logical methods for property testing in the bounded degree model. University of Leeds, UK, 2021 - [c2]Isolde Adler, Noleen Köhler
GSF-Locality Is Not Sufficient For Proximity-Oblivious Testing. CCC 2021: 34:1-34:27 - [c1]Isolde Adler, Noleen Köhler
On Testability of First-Order Properties in Bounded-Degree Graphs. SODA 2021: 1578-1597 - [i3]Isolde Adler, Noleen Köhler, Pan Peng:
GSF-locality is not sufficient for proximity-oblivious testing. CoRR abs/2105.08490 (2021) - 2020
- [i2]Isolde Adler, Noleen Köhler, Pan Peng:
On Testability of First-Order Properties in Bounded-Degree Graphs. CoRR abs/2008.05800 (2020) - [i1]Isolde Adler, Noleen Köhler:
On graphs of bounded degree that are far from being Hamiltonian. CoRR abs/2008.05801 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-05 20:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: