Using Abstraction for Planning in Sokoban. - Adi Botea; Martin Müller 003; Jonathan Schaeffer 001 (Computers and Games, 2002)

Using Abstraction for Heuristic Search and Planning. - Adi Botea (SARA, 2002)

Using Component Abstraction for Automatic Generation of Macro-Actions. - Adi Botea; Martin Müller 003; Jonathan Schaeffer 001 (ICAPS, 2004)

Near Optimal Hierarchical Path-Finding. - Adi Botea; Martin Müller 003; Jonathan Schaeffer 001 (J. Game Dev., 2004)

Learning Partial-Order Macros from Solutions. - Adi Botea; Martin Müller 003; Jonathan Schaeffer 001 (ICAPS, 2005)

Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators. - Adi Botea; Markus Enzenberger; Martin Müller 003; Jonathan Schaeffer 001 (J. Artif. Intell. Res., 2005)

Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning. - Patrik Haslum; Adi Botea; Malte Helmert; Blai Bonet; Sven Koenig (AAAI, 2007)

Fast Planning with Iterative Macros. - Adi Botea; Martin Müller 003; Jonathan Schaeffer 001 (IJCAI, 2007)

Offline Planning with Hierarchical Task Networks in Video Games. - John Paul Kelly; Adi Botea; Sven Koenig (AIIDE, 2008)

Fast and Memory-Efficient Multi-Agent Pathfinding. - Ko-Hsin Cindy Wang; Adi Botea (ICAPS, 2008)

Hierarchical path planning for multi-size agents in heterogeneous environments. - Daniel Harabor; Adi Botea (CIG, 2008)

Crossword Puzzles as a Constraint Problem. - Anbulagan; Adi Botea (CP, 2008)

Learning in Planning with Temporally Extended Goals and Uncontrollable Events. - André A. Ciré; Adi Botea (ECAI, 2008)

Improving Planning Performance Using Low-Conflict Relaxed Plans. - Jorge A. Baier; Adi Botea (ICAPS, 2009)

Scalable, Parallel Best-First Search for Optimal Sequential Planning. - Akihiro Kishimoto; Alex S. Fukunaga; Adi Botea (ICAPS, 2009)

Incremental Heuristic Search for Planning with Temporally Extended Goals and Uncontrollable Events. - Adi Botea; André A. Ciré (IJCAI, 2009)

Tractable Multi-Agent Path Planning on Grid Maps. - Ko-Hsin Cindy Wang; Adi Botea (IJCAI, 2009)

Breaking Path Symmetries on 4-Connected Grid Maps. - Daniel Harabor; Adi Botea (AIIDE, 2010)

Scalable Multi-Agent Pathfinding on Grid Maps with Tractability and Completeness Guarantees. - Ko-Hsin Cindy Wang; Adi Botea (ECAI, 2010)

On the Scaling Behavior of HDA. - Akihiro Kishimoto; Alex Fukunaga; Adi Botea (SOCS, 2010)

Solution Quality Improvements for Massively Multi-Agent Pathfinding. - Ko-Hsin Cindy Wang; Adi Botea; Philip Kilby (AAAI, 2011)

Ultra-Fast Optimal Pathfinding without Runtime Search. - Adi Botea (AIIDE, 2011)

Path Symmetries in Undirected Uniform-Cost Grids. - Daniel Damir Harabor; Adi Botea; Philip Kilby (SARA, 2011)

On Improving the Quality of Solutions in Large-Scale Cooperative Multi-Agent Pathfinding. - Ko-Hsin Cindy Wang; Adi Botea; Philip Kilby (SOCS, 2011)

Symmetry-Based Search Space Reduction For Grid Maps - Daniel Harabor; Adi Botea; Philip Kilby (CoRR, 2011)

MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees. - Ko-Hsin Cindy Wang; Adi Botea (J. Artif. Intell. Res., 2011)

Iterative Resource Allocation for Memory Intensive Parallel Search Algorithms on Clouds, Grids, and Shared Clusters. - Alex Fukunaga; Akihiro Kishimoto; Adi Botea (AAAI, 2012)

Testing the prospective evaluation of a new healthcare system. - Birgit M. Planitz; Penelope Sanderson; Clinton Freeman; Tania Xiao; Adi Botea; Cristina Beltran Orihuela (AMIA, 2012)

Fast, Optimal Pathfinding with Compressed Path Databases. - Adi Botea (SOCS, 2012)

Iterative Resource Allocation for Memory Intensive Parallel Search Algorithms (Extended Abstract). - Alex Fukunaga; Akihiro Kishimoto; Adi Botea (SOCS, 2012)

Optimal Reconfiguration for Supply Restoration With Informed A* Search. - Adi Botea; Jussi Rintanen; Debdeep Banerjee (IEEE Trans. Smart Grid, 2012)

Moving Target Search with Compressed Path Databases. - Adi Botea; Jorge A. Baier; Daniel Harabor; Carlos Hernández 003 (ICAPS, 2013)

Path Planning with Compressed All-Pairs Shortest Paths Data. - Adi Botea; Daniel Harabor (ICAPS, 2013)

Multi-Modal Journey Planning in the Presence of Uncertainty. - Adi Botea; Evdokia Nikolova; Michele Berlingerio (ICAPS, 2013)

Pathfinding in Games. - Adi Botea; Bruno Bouzy; Michael Buro; Christian Bauckhage; Dana S. Nau (Artificial and Computational Intelligence in Games, 2013)

Search in Real-Time Video Games. - Peter I. Cowling; Michael Buro; Michal Bída; Adi Botea; Bruno Bouzy; Martin V. Butz; Philip Hingston; Hector Muñoz-Avila; Dana S. Nau; Moshe Sipper (Artificial and Computational Intelligence in Games, 2013)

Uncertainty in urban mobility: Predicting waiting times for shared bicycles and parking lots. - Bei Chen; Fabio Pinelli; Mathieu Sinn; Adi Botea; Francesco Calabrese (ITSC, 2013)

Evaluation of a simple, scalable, parallel best-first search strategy. - Akihiro Kishimoto; Alex Fukunaga; Adi Botea (Artif. Intell., 2013)

Spatially Distributed Multiagent Path Planning. - Christopher Makoto Wilt; Adi Botea (ICAPS, 2014)

Multi-criteria journey aware housing recommender system. - Elizabeth M. Daly; Adi Botea; Akihiro Kishimoto; Radu Marinescu 002 (RecSys, 2014)

Fast First-Move Queries through Run-Length Encoding. - Ben Strasser; Daniel Harabor; Adi Botea (SOCS, 2014)

Stochastic Travel Planning for Unreliable Public Transportation Systems. - Tim Nonner; Adi Botea; Marco Laumanns (ERCIM News, 2014)

Multi-Agent Path Finding on Strongly Biconnected Digraphs. - Adi Botea; Pavel Surynek (AAAI, 2015)

Complexity Results for Compressing Optimal Paths. - Adi Botea; Ben Strasser; Daniel Harabor (AAAI, 2015)

Contingent versus Deterministic Plans in Multi-Modal Journey Planning. - Adi Botea; Stefano Braghin (ICAPS, 2015)

Managing travels with PETRA: The Rome use case. - Adi Botea; Stefano Braghin; Nuno Lopes 002; Riccardo Guidotti; Francesca Pratesi (ICDE Workshops, 2015)

Parallel Recursive Best-First AND/OR Search for Exact MAP Inference in Graphical Models. - Akihiro Kishimoto; Radu Marinescu 002; Adi Botea (NIPS, 2015)

Mobility Mining for Journey Planning in Rome. - Michele Berlingerio; Veli Bicer; Adi Botea; Stefano Braghin; Nuno Lopes 002; Riccardo Guidotti; Francesca Pratesi (ECML/PKDD (3), 2015)

The Grid-Based Path Planning Competition: 2014 Entries and Results. - Nathan R. Sturtevant; Jason M. Traish; James R. Tulip; Tansel Uras; Sven Koenig; Ben Strasser; Adi Botea; Daniel Harabor; Steve Rabin (SOCS, 2015)

Active Learning for Multi-relational Data Construction. - Hiroshi Kajino; Akihiro Kishimoto; Adi Botea; Elizabeth M. Daly; Spyros Kotoulas (WWW, 2015)

Reports from the 2015 AAAI Workshop Program. - Stefano V. Albrecht; J. Christopher Beck; David L. Buckeridge; Adi Botea; Cornelia Caragea; Chi-Hung Chi; Theodoros Damoulas; Bistra Dilkina; Eric Eaton; Pooyan Fazli; Sam Ganzfried; Marius Lindauer; et al. (AI Mag., 2015)

Compressing Optimal Paths with Run Length Encoding. - Ben Strasser; Adi Botea; Daniel Harabor (J. Artif. Intell. Res., 2015)

Fast Algorithm for Catching a Prey Quickly in Known and Partially Known Game Maps. - Jorge A. Baier; Adi Botea; Daniel Harabor; Carlos Hernández 003 (IEEE Trans. Comput. Intell. AI Games, 2015)

Scalable Exact MAP Inference in Graphical Models. - Radu Marinescu 002; Akihiro Kishimoto; Adi Botea (ECAI, 2016)

Combining Deterministic and Nondeterministic Search for Optimal Journey Planning Under Uncertainty. - Akihiro Kishimoto; Adi Botea; Elizabeth Daly (ECAI, 2016)

Service Bundle Recommendation for Person-Centered Care Planning in Cities. - Spyros Kotoulas; Elizabeth Daly; Pierpaolo Tommasi; Akihiro Kishimoto; Vanessa López; Martin Stephenson; Adi Botea; Marco Luca Sbodio; Radu Marinescu 002; Ronan Rooney (MIE, 2016)

Hedging the Risk of Delays in Multimodal Journey Planning. - Adi Botea (AI Mag., 2016)

Compressed Path Databases with Ordered Wildcard Substitutions. - Matteo Salvetti; Adi Botea; Alessandro Saetti; Alfonso Emilio Gerevini (ICAPS, 2017)

Efficient Optimal Search under Expensive Edge Cost Computation. - Masataro Asai; Akihiro Kishimoto; Adi Botea; Radu Marinescu 002; Elizabeth M. Daly; Spyros Kotoulas (IJCAI, 2017)

Online Bridged Pruning for Real-Time Search with Arbitrary Lookaheads. - Carlos Hernández 003; Adi Botea; Jorge A. Baier; Vadim Bulitko (IJCAI, 2017)

A Scalable Approach to Chasing Multiple Moving Targets with Multiple Agents. - Fan Xie 001; Adi Botea; Akihiro Kishimoto (IJCAI, 2017)

A Survey of Parallel A. - Alex Fukunaga; Adi Botea; Yuu Jinnai; Akihiro Kishimoto (CoRR, 2017)

Parallel A* for State-Space Search. - Alex Fukunaga; Adi Botea; Yuu Jinnai; Akihiro Kishimoto (Handbook of Parallel Constraint Reasoning, 2018)

AI Meets Chemistry. - Akihiro Kishimoto; Beat Buesser; Adi Botea (AAAI, 2018)

Two-Oracle Optimal Path Planning on Grid Maps. - Matteo Salvetti; Adi Botea; Alfonso Emilio Gerevini; Daniel Harabor; Alessandro Saetti (ICAPS, 2018)

Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs (Extended Abstract). - Adi Botea; Davide Bonusi; Pavel Surynek (IJCAI, 2018)

On the Complexity of Quantum Circuit Compilation. - Adi Botea; Akihiro Kishimoto; Radu Marinescu 002 (SOCS, 2018)

Solving Multi-agent Path Finding on Strongly Biconnected Digraphs. - Adi Botea; Davide Bonusi; Pavel Surynek (J. Artif. Intell. Res., 2018)

Anytime Recursive Best-First Search for Bounding Marginal MAP. - Radu Marinescu 002; Akihiro Kishimoto; Adi Botea; Rina Dechter; Alexander Ihler (AAAI, 2019)

Cutting the Size of Compressed Path Databases with Wildcards and Redundant Symbols. - Mattia Chiari; Shizhe Zhao; Adi Botea; Alfonso Emilio Gerevini; Daniel Harabor; Alessandro Saetti; Matteo Salvetti; Peter J. Stuckey (ICAPS, 2019)

Depth-First Memory-Limited AND/OR Search and Unsolvability in Cyclic Search Spaces. - Akihiro Kishimoto; Adi Botea; Radu Marinescu 002 (IJCAI, 2019)

Where can my career take me?: harnessing dialogue for interactive career goal recommendations. - Oznur Alkan; Elizabeth M. Daly; Adi Botea; Abel N. Valente; Pablo Pedemonte (IUI, 2019)

Depth-First Proof-Number Search with Heuristic Edge Cost and Application to Chemical Synthesis Planning. - Akihiro Kishimoto; Beat Buesser; Bei Chen; Adi Botea (NeurIPS, 2019)

IRF: interactive recommendation through dialogue. - Oznur Alkan; Massimiliano Mattetti; Elizabeth M. Daly; Adi Botea; Inge Vejsbjerg (RecSys, 2019)

Repairing Compressed Path Databases on Maps with Dynamic Changes. - Marco Verzeletti; Adi Botea; Marina Zanella (SOCS, 2019)

An Evaluation Framework for Interactive Recommender Systems. - Oznur Alkan; Elizabeth M. Daly; Adi Botea (UMAP (Adjunct Publication), 2019)

Crosswords. - Adi Botea (AI Matters, 2019)

AI fun matters. - Adi Botea (AI Matters, 2019)

Generating Dialogue Agents via Automated Planning. - Adi Botea; Christian Muise; Shubham Agarwal 002; Oznur Alkan; Ondrej Bajgar; Elizabeth Daly; Akihiro Kishimoto; Luis A. Lastras; Radu Marinescu 002; Josef Ondrej; Pablo Pedemonte; Miroslav Vodolán (CoRR, 2019)

An Evaluation Framework for Interactive Recommender System. - Oznur Alkan; Elizabeth M. Daly; Adi Botea (CoRR, 2019)

Computing Multi-Modal Journey Plans under Uncertainty. - Adi Botea; Akihiro Kishimoto; Evdokia Nikolova; Stefano Braghin; Michele Berlingerio; Elizabeth Daly (J. Artif. Intell. Res., 2019)

Parallel AND/OR Search for Marginal MAP. - Radu Marinescu 002; Akihiro Kishimoto; Adi Botea (AAAI, 2020)

Bounded Suboptimal Path Planning with Compressed Path Databases. - Shizhe Zhao; Mattia Chiari; Adi Botea; Alfonso Emilio Gerevini; Daniel Harabor; Alessandro Saetti; Peter J. Stuckey (ICAPS, 2020)

The Challenge of Optimal Paths in Graphs with Item Sets. - Adi Botea; Akihiro Kishimoto; Radu Marinescu 002; Elizabeth M. Daly; Oznur Alkan (ECAI, 2020)

Client Network: An Interactive Model for Predicting New Clients. - Massimiliano Mattetti; Akihiro Kishimoto; Adi Botea; Elizabeth Daly; Inge Vejsbjerg; Bei Chen; Öznur Alkan (CoRR, 2020)

Searching for Machine Learning Pipelines Using a Context-Free Grammar. - Radu Marinescu 002; Akihiro Kishimoto; Parikshit Ram; Ambrish Rawat; Martin Wistuba; Paulito P. Palmes; Adi Botea (AAAI, 2021)

Evolving Romanian Crossword Puzzles with Deep Learning and Heuristic Search. - Vadim Bulitko; Adi Botea (CoG, 2021)

Scaling Up Search with Partial Initial States in Optimization Crosswords. - Adi Botea; Vadim Bulitko (SOCS, 2021)

Counting Vertex-Disjoint Shortest Paths in Graphs. - Adi Botea; Massimiliano Mattetti; Akihiro Kishimoto; Radu Marinescu 002; Elizabeth Daly (SOCS, 2021)

IRF: A Framework for Enabling Users to Interact with Recommenders through Dialogue. - Öznur Alkan; Massimiliano Mattetti; Elizabeth M. Daly; Adi Botea; Inge Vejsbjerg; Bart P. Knijnenburg (Proc. ACM Hum. Comput. Interact., 2021)

Bandit Limited Discrepancy Search and Application to Machine Learning Pipeline Optimization. - Akihiro Kishimoto; Djallel Bouneffouf 001; Radu Marinescu 002; Parikshit Ram; Ambrish Rawat; Martin Wistuba; Paulito P. Palmes; Adi Botea (AAAI, 2022)

Tiered State Expansion in Optimization Crosswords. - Adi Botea; Vadim Bulitko (AIIDE, 2022)

Generating and Solving Champion-Level Romanian Crosswords Puzzles. - Adi Botea; Vadim Bulitko (CoG, 2023)

Core Expansion in Optimization Crosswords. - Adi Botea; Vadim Bulitko (SOCS, 2023)

Extended Seeds in Optimization Crosswords. - Adi Botea; Vadim Bulitko (CoG, 2024)