We stand with Ukraine  

Pedro Maristany

Orcid: 0000-0002-4197-0893

Affiliations:
  • Zuse Institute Berlin, Berlin, Germany


According to our database1, Pedro Maristany authored at least 11 papers between 2017 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Targeted multiobjective Dijkstra algorithm.
[BibTeX]
[DOI]
Pedro Maristany de las Casas
,
Luitgard Kraus
,
Antonio Sedeño-Noda
,
Ralf Borndörfer
Networks, October, 2023

K-Shortest Simple Paths Using Biobjective Path Search.
[BibTeX]
[DOI]
Pedro Maristany de las Casas
,
Antonio Sedeño-Noda
,
Ralf Borndörfer
,
Max Huneshagen
CoRR, 2023

Labeling Methods for Partially Ordered Paths.
[BibTeX]
[DOI]
Ricardo Euler
,
Pedro Maristany de las Casas
CoRR, 2023

New Dynamic Programming Algorithm for the Multiobjective Minimum Spanning Tree Problem.
[BibTeX]
[DOI]
Pedro Maristany de las Casas
,
Antonio Sedeño-Noda
,
Ralf Borndörfer
CoRR, 2023

2022
An A* Algorithm for Flight Planning Based on Idealized Vertical Profiles.
[BibTeX]
[DOI]
Marco Blanco
,
Ralf Borndörfer
,
Pedro Maristany de las Casas
Proceedings of the 22nd Symposium on Algorithmic Approaches for Transportation Modelling, 2022

2021
Multiobjective Dijkstra A.
[BibTeX]
[DOI]
Pedro Maristany de las Casas
,
Luitgard Kraus
,
Antonio Sedeño-Noda
,
Ralf Borndörfer
CoRR, 2021

An Improved Multiobjective Shortest Path Algorithm.
[BibTeX]
[DOI]
Pedro Maristany de las Casas
,
Antonio Sedeño-Noda
,
Ralf Borndörfer
Comput. Oper. Res., 2021

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

Optimal Forks: Preprocessing Single-Source Shortest Path Instances with Interval Data.
[BibTeX]
[DOI]
Niels Lindner
,
Pedro Maristany de las Casas
,
Philine Schiewe
Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021

2019
A Priori Search Space Pruning in the Flight Planning Problem.
[BibTeX]
[DOI]
Adam Schienle
,
Pedro Maristany
,
Marco Blanco
Proceedings of the 19th Symposium on Algorithmic Approaches for Transportation Modelling, 2019

2017
Cost Projection Methods for the Shortest Path Problem with Crossing Costs.
[BibTeX]
[DOI]
Marco Blanco
,
Ralf Borndörfer
,
Nam-Dung Hoang
,
Anton Kaier
,
Pedro M. Casas
,
Thomas Schlechte
,
Swen Schlobach
Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, 2017


  Loading...