Christer Bäckström

Available identifiers

zbMath Open backstrom.christerMaRDI QIDQ234896

List of research outcomes

Publication	Date of Publication	Type
A framework for analysing state-abstraction methods	2021-12-13	Paper
Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics	2021-01-22	Paper
Analysing Approximability and Heuristics in Planning Using the Exponential-Time Hypothesis	2018-07-12	Paper
Upper and Lower Time and Space Bounds for Planning	2018-07-12	Paper
Time and Space Bounds for Planning	2017-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q5282951	2017-07-18	Paper
Refining complexity analyses in planning by exploiting the exponential time hypothesis	2017-01-25	Paper
https://portal.mardi4nfdi.de/entity/Q3457201	2015-12-11	Paper
https://portal.mardi4nfdi.de/entity/Q3457202	2015-12-11	Paper
A complete parameterized complexity analysis of bounded planning	2015-07-13	Paper
Automaton plans	2014-10-10	Paper
A refined view of causal graphs and component sizes: SP-closed graph classes and beyond	2013-08-13	Paper
Parameterized Complexity and Kernel Bounds for Hard Planning Problems	2013-06-07	Paper
Algorithms and limits for compact plan representations	2012-08-27	Paper
Electronic editor: Automatic content-based sequential compilation of newspaper articles	2002-06-02	Paper
Towards efficient universal planning: A randomized approach	2000-06-04	Paper
Computational complexity of relating time points with intervals	1999-06-21	Paper
A unifying approach to temporal constraint reasoning	1999-01-12	Paper
https://portal.mardi4nfdi.de/entity/Q4215782	1998-10-28	Paper
Tractable plan existence does not imply tractable plan generation	1998-10-13	Paper
State-variable planning under structural restrictions: algorithms and complexity	1998-08-13	Paper
On the computational complexity of temporal projection, planning, and plan validation	1995-01-02	Paper
https://portal.mardi4nfdi.de/entity/Q4012203	1992-09-27	Paper

Research outcomes over time

This page was built for person: Christer Bäckström