Adi Botea

University of Bucharest — Romania

Computer Science · Physical Sciences

22h-index2.2kcitations121works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Robotic Path Planning Algorithms(31), AI-based Problem Solving and Planning(27), Artificial Intelligence in Games(25), Data Management and Algorithms(22), Constraint Satisfaction and Optimization(20)

Publications121 total

Synthesizing Fault Localization Datasets
Lecture notes in computer science·2025Open Access
Automated Landslide Inventory Mapping Using SAMLoRA and Hillshade Datasets: A Deep Learning Approach
2025Open Access
Extended Seeds in Optimization Crosswords
2024
Generating and Solving Champion-Level Romanian Crosswords Puzzles
2023· 2 cited
Core Expansion in Optimization Crosswords
Proceedings of the International Symposium on Combinatorial Search·2023· 2 citedOpen Access
Tiered State Expansion in Optimization Crosswords
Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment·2022· 3 citedOpen Access
Bandit Limited Discrepancy Search and Application to Machine Learning Pipeline Optimization
Proceedings of the AAAI Conference on Artificial Intelligence·2022· 5 citedOpen Access
Iterative Resource Allocation for Memory Intensive Parallel Search Algorithms on Clouds, Grids, and Shared Clusters
Proceedings of the AAAI Conference on Artificial Intelligence·2021· 4 citedOpen Access
The Grid-Based Path Planning Competition: 2014 Entries and Results
Proceedings of the International Symposium on Combinatorial Search·2021· 39 citedOpen Access
Repairing Compressed Path Databases on Maps with Dynamic Changes
Proceedings of the International Symposium on Combinatorial Search·2021· 1 citedOpen Access
On the Complexity of Quantum Circuit Compilation
Proceedings of the International Symposium on Combinatorial Search·2021· 83 citedOpen Access
Abstracts of Papers Presented at SoCS 2016 in the Previously Published Paper Track
Proceedings of the International Symposium on Combinatorial Search·2021Open Access
Fast First-Move Queries through Run-Length Encoding
Proceedings of the International Symposium on Combinatorial Search·2021· 22 citedOpen Access
Iterative Resource Allocation for Memory Intensive Parallel Search Algorithms (Extended Abstract)
Proceedings of the International Symposium on Combinatorial Search·2021Open Access
Fast, Optimal Pathfinding with Compressed Path Databases
Proceedings of the International Symposium on Combinatorial Search·2021· 13 citedOpen Access
On Improving the Quality of Solutions in Large-Scale Cooperative Multi-Agent Pathfinding
Proceedings of the International Symposium on Combinatorial Search·2021Open Access
Evolving Romanian Crossword Puzzles with Deep Learning and Heuristic Search
2021 IEEE Conference on Games (CoG)·2021· 12 cited
Scaling Up Search with Partial Initial States in Optimization Crosswords
Proceedings of the International Symposium on Combinatorial Search·2021· 5 citedOpen Access
Counting Vertex-Disjoint Shortest Paths in Graphs
Proceedings of the International Symposium on Combinatorial Search·2021· 3 citedOpen Access
Cutting the Size of Compressed Path Databases with Wildcards and Redundant Symbols
Proceedings of the International Conference on Automated Planning and Scheduling·2021· 5 citedOpen Access
page 1 of 7Next →

Frequent Co-authors

Daniel Harabor(10), Akihiro Kishimoto(8), Jonathan Schaeffer(7), Martin Müller(6), Sven Koenig(4), Ko-Hsin Cindy Wang(4), Radu Marinescu(4), Ben Strasser(3), Jorge A. Baier(3), Elizabeth Daly(3), Patrik Haslum(2), Jussi Rintanen(2), Alex Fukunaga(2), John-Paul Kelly(2), Michele Berlingerio(2), Francesco Calabrese(2), Pavel Surynek(2), Bruno Bouzy(2), Michael Buro(2), Dana Nau(2)