Cost Projection Methods for the Shortest Path Problem with Crossing Costs. - Marco Blanco; Ralf Borndörfer; Nam-Dung Hoang; Anton Kaier; Pedro M. Casas; Thomas Schlechte; Swen Schlobach (ATMOS, 2017)

A Priori Search Space Pruning in the Flight Planning Problem. - Adam Schienle; Pedro Maristany; Marco Blanco (ATMOS, 2019)

Optimal Forks: Preprocessing Single-Source Shortest Path Instances with Interval Data. - Niels Lindner; Pedro Maristany de las Casas; Philine Schiewe (ATMOS, 2021)

An FPTAS for Dynamic Multiobjective Shortest Path Problems. - Pedro Maristany de las Casas; Ralf Borndörfer; Luitgard Kraus; Antonio Sedeño-Noda (Algorithms, 2021)

An Improved Multiobjective Shortest Path Algorithm. - Pedro Maristany de las Casas; Antonio Sedeño-Noda; Ralf Borndörfer (Comput. Oper. Res., 2021)

Multiobjective Dijkstra A. - Pedro Maristany de las Casas; Luitgard Kraus; Antonio Sedeño-Noda; Ralf Borndörfer (CoRR, 2021)

An A* Algorithm for Flight Planning Based on Idealized Vertical Profiles. - Marco Blanco; Ralf Borndörfer; Pedro Maristany de las Casas (ATMOS, 2022)

New Multiobjective Shortest Path Algorithms. - Pedro Maristany (2023)

Targeted multiobjective Dijkstra algorithm. - Pedro Maristany de las Casas; Luitgard Kraus; Antonio Sedeño-Noda; Ralf Borndörfer (Networks, 2023)

Logic-Constrained Shortest Paths for Flight Planning. - Ricardo Euler; Pedro Maristany de las Casas; Ralf Borndörfer (CoRR, 2024)

Labeling methods for partially ordered paths. - Ricardo Euler; Pedro Maristany de las Casas (Eur. J. Oper. Res., 2024)

Corrigendum to "Labeling methods for partially ordered paths" [European Journal of Operational Research 318 (2024) 19-30]. - Ricardo Euler; Pedro Maristany de las Casas (Eur. J. Oper. Res., 2024)

New Dynamic Programming algorithm for the Multiobjective Minimum Spanning Tree problem. - Pedro Maristany de las Casas; Antonio Sedeño-Noda; Ralf Borndörfer (Comput. Oper. Res., 2025)

K-shortest simple paths using biobjective path search. - Pedro Maristany de las Casas; Antonio Sedeño-Noda; Ralf Borndörfer; Max Huneshagen (Math. Program. Comput., 2025)