default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPedro Maristany
Person information
- affiliation: Zuse Institute Berlin, Berlin, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j6]Pedro Maristany de las Casas
, Antonio Sedeño-Noda, Ralf Borndörfer:
New Dynamic Programming algorithm for the Multiobjective Minimum Spanning Tree problem. Comput. Oper. Res. 173: 106852 (2025)- 2024
- [j5]Ricardo Euler, Pedro Maristany de las Casas:
Labeling methods for partially ordered paths. Eur. J. Oper. Res. 318(1): 19-30 (2024) - [j4]Ricardo Euler, Pedro Maristany de las Casas:
Corrigendum to "Labeling methods for partially ordered paths" [European Journal of Operational Research 318 (2024) 19-30]. Eur. J. Oper. Res. 319(3): 1020 (2024) - 2023
- [b1]Pedro Maristany:
New Multiobjective Shortest Path Algorithms. Free University of Berlin, Germany, 2023 - [j3]Pedro Maristany de las Casas, Luitgard Kraus, Antonio Sedeño-Noda, Ralf Borndörfer:
Targeted multiobjective Dijkstra algorithm. Networks 82(3): 277-298 (2023) - [i4]Pedro Maristany de las Casas, Antonio Sedeño-Noda, Ralf Borndörfer:
New Dynamic Programming Algorithm for the Multiobjective Minimum Spanning Tree Problem. CoRR abs/2306.16203 (2023) - [i3]Ricardo Euler, Pedro Maristany de las Casas:
Labeling Methods for Partially Ordered Paths. CoRR abs/2307.10332 (2023) - [i2]Pedro Maristany de las Casas, Antonio Sedeño-Noda, Ralf Borndörfer, Max Huneshagen:
K-Shortest Simple Paths Using Biobjective Path Search. CoRR abs/2309.10377 (2023) - 2022
- [c4]Marco Blanco, Ralf Borndörfer, Pedro Maristany de las Casas:
An A* Algorithm for Flight Planning Based on Idealized Vertical Profiles. ATMOS 2022: 1:1-1:15 - 2021
- [j2]Pedro Maristany de las Casas, Ralf Borndörfer, Luitgard Kraus, Antonio Sedeño-Noda:
An FPTAS for Dynamic Multiobjective Shortest Path Problems. Algorithms 14(2): 43 (2021) - [j1]Pedro Maristany de las Casas, Antonio Sedeño-Noda, Ralf Borndörfer:
An Improved Multiobjective Shortest Path Algorithm. Comput. Oper. Res. 135: 105424 (2021) - [c3]Niels Lindner, Pedro Maristany de las Casas, Philine Schiewe:
Optimal Forks: Preprocessing Single-Source Shortest Path Instances with Interval Data. ATMOS 2021: 7:1-7:15 - [i1]Pedro Maristany de las Casas, Luitgard Kraus, Antonio Sedeño-Noda, Ralf Borndörfer:
Multiobjective Dijkstra A. CoRR abs/2110.10978 (2021)
2010 – 2019
- 2019
- [c2]Adam Schienle, Pedro Maristany, Marco Blanco:
A Priori Search Space Pruning in the Flight Planning Problem. ATMOS 2019: 8:1-8:14 - 2017
- [c1]Marco Blanco, Ralf Borndörfer, Nam-Dung Hoang, Anton Kaier, Pedro M. Casas, Thomas Schlechte, Swen Schlobach:
Cost Projection Methods for the Shortest Path Problem with Crossing Costs. ATMOS 2017: 15:1-15:14
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
