| Year | Rank | Type | Title / Venue / Authors |
|---|---|---|---|
| 2026 | J | jnl |
CoRR
|
| 2025 | J | jnl |
CoRR
|
| 2024 | J | jnl |
CoRR
|
| 2024 | B | conf |
SOCS
|
| 2023 | A* | conf |
Exact Anytime Multi-Agent Path Finding Using Branch-and-Cut-and-Price and Large Neighborhood Search.
ICAPS
|
| 2023 | J | jnl |
Constraints An Int. J.
|
| 2022 | J | jnl |
Comput. Oper. Res.
|
| 2022 | J | jnl |
Comput. Oper. Res.
|
| 2021 | A* | conf |
AAAI
|
| 2021 | J | jnl |
CoRR
|
| 2021 | A | conf |
ICSOC
|
| 2020 | J | jnl |
Comput. Oper. Res.
|
| 2020 | A | conf |
CP
|
| 2020 | J | jnl |
Transp. Sci.
|
| 2020 | A | conf |
CP
|
| 2020 | A* | conf |
ICAPS
|
| 2020 | J | jnl |
Oper. Res. Forum
|
| 2019 | A* | conf |
IJCAI
|
| 2017 | A | conf |
CP
|
| 2017 | — | — |
|
| 2016 | J | jnl |
Constraints An Int. J.
|
| 2015 | A | conf |
CP
|