default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDuncan Adamson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j2]Vladimir V. Gusev
, Duncan Adamson, Argyrios Deligkas, Dmytro Antypov, Christopher M. Collins, Piotr Krysta, Igor Potapov, George R. Darling, Matthew S. Dyer, Paul G. Spirakis, Matthew J. Rosseinsky:
Optimality guarantees for crystal structure prediction. Nat. 619(7968): 68-72 (2023)- 2021
- [j1]Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
On the Hardness of Energy Minimisation for Crystal Structure Prediction. Fundam. Informaticae 184(3): 181-203 (2021)
Conference and Workshop Papers
- 2024
- [c15]Duncan Adamson, Pawel Gawrychowski, Florin Manea:
Enumerating m-Length Walks in Directed Graphs with Constant Delay. LATIN (1) 2024: 35-50 - [c14]Duncan Adamson, Nathan Flaherty, Igor Potapov, Paul G. Spirakis:
Structural and Combinatorial Properties of 2-Swap Word Permutation Graphs. LATIN (2) 2024: 61-76 - [c13]Duncan Adamson, Pamela Fleischmann, Annika Huch:
Rollercoasters with Plateaus. RP 2024: 73-87 - [c12]Duncan Adamson:
Harmonious Colourings of Temporal Matchings. SAND 2024: 4:1-4:11 - [c11]Duncan Adamson, Nathan Flaherty, Igor Potapov, Paul G. Spirakis:
Brief Announcement: Collision-Free Robot Scheduling. SAND 2024: 22:1-22:5 - 2023
- [c10]Duncan Adamson:
Ranking and Unranking k-Subsequence Universal Words. WORDS 2023: 47-59 - [c9]Duncan Adamson, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer:
Longest Common Subsequence with Gap Constraints. WORDS 2023: 60-76 - [c8]Duncan Adamson, Pamela Fleischmann, Annika Huch, Tore Koß, Florin Manea, Dirk Nowotka:
k-Universality of Regular Languages. ISAAC 2023: 4:1-4:21 - [c7]Duncan Adamson, Magnús M. Halldórsson, Alexandre Nolin:
Distributed Coloring of Hypergraphs. SIROCCO 2023: 89-111 - [c6]Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
The k-Centre Problem for Classes of Cyclic Words. SOFSEM 2023: 385-400 - 2022
- [c5]Duncan Adamson:
Ranking Binary Unlabelled Necklaces in Polynomial Time. DCFS 2022: 15-29 - [c4]Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
The Complexity of Periodic Energy Minimisation. MFCS 2022: 8:1-8:15 - [c3]Duncan Adamson, Vladimir V. Gusev, Dmitriy S. Malyshev, Viktor Zamaraev:
Faster Exploration of Some Temporal Graphs. SAND 2022: 5:1-5:10 - 2021
- [c2]Duncan Adamson, Vladimir V. Gusev, Igor Potapov, Argyrios Deligkas:
Ranking Bracelets in Polynomial Time. CPM 2021: 4:1-4:17 - 2020
- [c1]Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
On the Hardness of Energy Minimisation for Crystal Structure Prediction. SOFSEM 2020: 587-596
Informal and Other Publications
- 2024
- [i13]Duncan Adamson, Pawel Gawrychowski, Florin Manea:
Enumerating m-Length Walks in Directed Graphs with Constant Delay. CoRR abs/2401.02163 (2024) - [i12]Duncan Adamson, Nathan Flaherty, Igor Potapov, Paul G. Spirakis:
Collision-Free Robot Scheduling. CoRR abs/2402.12019 (2024) - [i11]Duncan Adamson, Pamela Fleischmann, Annika Huch, Max Wiedenhöft:
Tight Bounds for the Number of Absent Scattered Factors. CoRR abs/2407.18599 (2024) - [i10]Duncan Adamson, Pamela Fleischmann, Annika Huch:
Rollercoasters with Plateaus. CoRR abs/2407.18620 (2024) - 2023
- [i9]Duncan Adamson:
Ranking and Unranking k-subsequence universal words. CoRR abs/2304.04583 (2023) - [i8]Duncan Adamson, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer:
Longest Common Subsequence with Gap Constraints. CoRR abs/2304.05270 (2023) - [i7]Duncan Adamson, Nathan Flaherty, Igor Potapov, Paul G. Spirakis:
On the structural and combinatorial properties in 2-swap word permutation graphs. CoRR abs/2307.01648 (2023) - [i6]Duncan Adamson, Pamela Fleischmann, Annika Huch, Tore Koß, Florin Manea, Dirk Nowotka:
k-Universality of Regular Languages. CoRR abs/2311.10658 (2023) - 2022
- [i5]Duncan Adamson:
Ranking Binary Unlabelled Necklaces in Polynomial Time. CoRR abs/2205.13916 (2022) - 2021
- [i4]Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
Ranking Bracelets in Polynomial Time. CoRR abs/2104.04324 (2021) - [i3]Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
The k-Centre Selection Problem for Multidimensional Necklaces. CoRR abs/2108.01990 (2021) - 2020
- [i2]Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
The K-Centre Problem for Necklaces. CoRR abs/2005.10095 (2020) - 2019
- [i1]Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov:
On the Hardness of Energy Minimisation for Crystal Structure Prediction. CoRR abs/1910.12026 (2019)
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-10-07 21:16 CEST 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:
