default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Gnad 0001
Person information
- affiliation: Linköping University, Sweden
Other persons with the same name
- Daniel Gnad 0002 — Johannes Kepler Universität Linz, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c26]Mika Skjelnes, Daniel Gnad, Jendrik Seipp:
Cost Partitioning for Multiple Sequence Alignment. ECAI 2024: 4224-4231- [c25]David Speck, Daniel Gnad:
Decoupled Search for the Masses: A Novel Task Transformation for Classical Planning. ICAPS 2024: 546-554 - 2023
- [c24]Alexander Shleyfman, Daniel Gnad, Peter Jonsson:
Structurally Restricted Fragments of Numeric Planning - a Complexity Analysis. AAAI 2023: 12112-12119 - [c23]Daniel Gnad, Silvan Sievers, Álvaro Torralba
:
Efficient Evaluation of Large Abstractions for Decoupled Search: Merge-and-Shrink and Symbolic Pattern Databases. ICAPS 2023: 138-147 - [c22]Daniel Gnad, Malte Helmert, Peter Jonsson, Alexander Shleyfman:
Planning over Integers: Compilations and Undecidability. ICAPS 2023: 148-152 - [c21]David Speck, Paul Höft, Daniel Gnad, Jendrik Seipp:
Finding Matrix Multiplication Algorithms with Classical Planning. ICAPS 2023: 411-416 - 2022
- [c20]Daniel Gnad, Álvaro Torralba, Daniel Fiser:
Beyond Stars - Generalized Topologies for Decoupled Search. ICAPS 2022: 110-118 - [c19]Silvan Sievers, Daniel Gnad, Álvaro Torralba:
Additive Pattern Databases for Decoupled Search. SOCS 2022: 180-189 - 2021
- [b1]Daniel Gnad:
Star-topology decoupled state-space search in AI planning and model checking. Saarland University, Saarbrücken, Germany, 2021 - [c18]Daniel Gnad:
Revisiting Dominance Pruning in Decoupled Search. AAAI 2021: 11809-11817 - [c17]Daniel Gnad, Jan Eisenhut, Alberto Lluch-Lafuente, Jörg Hoffmann:
Model Checking ømega-Regular Properties with Decoupled Search. CAV (2) 2021: 411-434 - [c16]Daniel Fiser, Daniel Gnad, Michael Katz, Jörg Hoffmann:
Custom-Design of FDR Encodings: The Case of Red-Black Planning. IJCAI 2021: 4054-4061 - [p2]Daniel Gnad:
Stern-Topologie Entkoppelte Zustandsraumsuche. Ausgezeichnete Informatikdissertationen 2021: 51-60 - 2020
- [p1]Jörg Hoffmann, Malte Helmert, Daniel Gnad, Florian Pommerening:
Planen. Handbuch der Künstlichen Intelligenz 2020: 395-428
2010 – 2019
- 2019
- [j2]Daniel Gnad, Jörg Hoffmann, Martin Wehrle:
Strong Stubborn Set Pruning for Star-Topology Decoupled State Space Search. J. Artif. Intell. Res. 65: 343-392 (2019) - [c15]Daniel Gnad, Álvaro Torralba, Martín Ariel Domínguez, Carlos Areces, Facundo Bustos:
Learning How to Ground a Plan - Partial Grounding in Classical Planning. AAAI 2019: 7602-7609 - [c14]Daniel Gnad, Jörg Hoffmann:
On the Relation between Star-Topology Decoupling and Petri Net Unfolding. ICAPS 2019: 172-180 - [c13]Frederik Schmitt, Daniel Gnad, Jörg Hoffmann:
Advanced Factoring Strategies for Decoupled Search Using Linear Programming. ICAPS 2019: 377-381 - 2018
- [j1]Daniel Gnad, Jörg Hoffmann:
Star-topology decoupled state space search. Artif. Intell. 257: 24-60 (2018) - [c12]Maximilian Fickert, Daniel Gnad, Jörg Hoffmann:
Unchaining the Power of Partial Delete Relaxation, Part II: Finding Plans with Red-Black State Space Search. IJCAI 2018: 4750-4756 - [c11]Daniel Gnad, Patrick Dubbert, Alberto Lluch-Lafuente, Jörg Hoffmann:
Star-Topology Decoupling in SPIN. SPIN 2018: 103-114 - 2017
- [c10]Daniel Gnad, Álvaro Torralba, Alexander Shleyfman, Jörg Hoffmann:
Symmetry Breaking in Star-Topology Decoupled Search. ICAPS 2017: 125-134 - [c9]Patrick Speicher, Marcel Steinmetz, Daniel Gnad, Jörg Hoffmann, Alfonso Gerevini:
Beyond Red-Black Planning: Limited-Memory State Variables. ICAPS 2017: 269-273 - [c8]Daniel Gnad, Valerie Poser, Jörg Hoffmann:
Beyond Forks: Finding and Ranking Star Factorings for Decoupled Search. IJCAI 2017: 4310-4316 - [c7]Daniel Gnad, Álvaro Torralba, Jörg Hoffmann:
Symbolic Leaf Representation in Decoupled Search. SOCS 2017: 124-128 - 2016
- [c6]Daniel Gnad, Martin Wehrle, Jörg Hoffmann:
Decoupled Strong Stubborn Sets. IJCAI 2016: 3110-3116 - [c5]Álvaro Torralba, Daniel Gnad, Patrick Dubbert, Jörg Hoffmann:
On State-Dominance Criteria in Fork-Decoupled Search. IJCAI 2016: 3265-3271 - [c4]Daniel Gnad, Marcel Steinmetz, Mathäus Jany, Jörg Hoffmann, Ivan Serina, Alfonso Gerevini:
Partial Delete Relaxation, Unchained: On Intractable Red-Black Planning and Its Applications. SOCS 2016: 45-53 - 2015
- [c3]Daniel Gnad, Jörg Hoffmann:
Beating LM-Cut with hmax (Sometimes): Fork-Decoupled State Space Search. ICAPS 2015: 88-96 - [c2]Daniel Gnad, Jörg Hoffmann:
Red-Black Planning: A New Tractability Analysis and Heuristic Function. SOCS 2015: 44-52 - [c1]Daniel Gnad, Jörg Hoffmann, Carmel Domshlak:
From Fork Decoupling to Star-Topology Decoupling. SOCS 2015: 53-61
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-28 21:14 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:
