Thekla Hamm

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Karolina Okrasa

> Home > Persons > Thekla Hamm

Publications

2024
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/talg/GanianHKOS24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/GanianHKOS24
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov:
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. ACM Trans. Algorithms 20(3): 19 (2024)
2022
[c16]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - conf/icalp/GanianHKOS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/GanianHKOS22
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov:
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. ICALP 2022: 66:1-66:20
[c15]
- view
  - electronic edition @ mlr.press (open access)
  - details & citations
- export record
  dblp key:
  - conf/icml/GanianHKOS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icml/GanianHKOS22
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov:
The Complexity of k-Means Clustering when Little is Known. ICML 2022: 6960-6987
[i7]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2210-06845
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2210-06845
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov:
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. CoRR abs/2210.06845 (2022)

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.