Michal Opler
4 papers · 2024–2026 · 1 venue · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓
🌉
Interdisciplinary Bridge · Silver
🐣
Hot Topic Early Bird
Venues
Top co-authors
Research topics
Keywords
graph algorithm
(3)
parameterized complexity
(3)
multi-agent path finding
(3)
fixed-parameter tractability
(2)
exact algorithm
(2)
path planning
(2)
communication constraint
(1)
tree-like structure
(1)
vertex cover
(1)
collision avoidance
(1)
parameterized algorithm
(1)
network routing
(1)
network topology
(1)
Papers
Exact Algorithms for Distance to Unique Vertex Cover
AAAI 2026
Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures
AAAI 2025
Solving Multiagent Path Finding on Highly Centralized Networks
AAAI 2025
Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology
AAAI 2024