ResearchTrend.AI
The Complexity of Planning Revisited - A Parameterized Analysis

The Complexity of Planning Revisited - A Parameterized Analysis

Christer Bäckström
Yue Chen
Peter Jonsson
S. Ordyniak
Stefan Szeider
ArXiv (abs)PDFHTML

Papers citing "The Complexity of Planning Revisited - A Parameterized Analysis"

3 / 3 papers shown
Title
Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size
Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size
Foivos Fioravantes
Harmender Gahlawat
N. Melissinos
19
0
0
28 May 2025
Learning Small Decision Trees with Few Outliers: A Parameterized Perspective
Learning Small Decision Trees with Few Outliers: A Parameterized Perspective
Harmender Gahlawat
Meirav Zehavi
112
4
0
21 May 2025
Parameterized Complexity and Kernel Bounds for Hard Planning Problems
Parameterized Complexity and Kernel Bounds for Hard Planning Problems
Christer Bäckström
Peter Jonsson
S. Ordyniak
Stefan Szeider
63
7
0
02 Nov 2012