default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilipp Warode
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Svenja M. Griesbach, Max Klimm, Philipp Warode
, Theresa Ziemke:
Optimizing Throughput and Makespan of Queuing Systems by Information Design. ESA 2024: 62:1-62:18- [c4]Sven Jäger, Philipp Warode:
Simple Approximation Algorithms for Minimizing the Total Weighted Completion Time of Precedence-Constrained Jobs. SOSA 2024: 82-96 - 2023
- [c3]Sven Jäger, Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt, Philipp Warode:
Competitive Kill-and-Restart and Preemptive Strategies for Non-clairvoyant Scheduling. IPCO 2023: 246-260 - [i6]Sven Jäger, Philipp Warode:
Simple Approximation Algorithms for Minimizing the Total Weighted Completion Time of Precedence-Constrained Jobs. CoRR abs/2309.12031 (2023) - [i5]Svenja M. Griesbach, Max Klimm, Philipp Warode, Theresa Ziemke:
Optimizing Throughput and Makespan of Queuing Systems by Information Design. CoRR abs/2310.07656 (2023) - 2022
- [b1]Philipp Warode:
Parametric computation of equilibria and flows (Parametrische Berechnung von Gleichgewichten und Flüssen). TU Berlin, Germany, 2022 - [j1]Max Klimm, Philipp Warode:
Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs. Math. Oper. Res. 47(1): 812-846 (2022) - [i4]Per Joachims, Max Klimm, Philipp Warode:
Approximate Parametric Computation of Minimum-Cost Flows with Convex Costs. CoRR abs/2203.13146 (2022) - [i3]Sven Jäger, Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt, Philipp Warode:
Competitive Kill-and-Restart and Preemptive Strategies for Non-Clairvoyant Scheduling. CoRR abs/2211.02044 (2022) - 2020
- [c2]Max Klimm, Philipp Warode:
Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians. SODA 2020: 2728-2747
2010 – 2019
- 2019
- [c1]Max Klimm, Philipp Warode:
Computing all Wardrop Equilibria parametrized by the Flow Demand. SODA 2019: 917-934 - 2018
- [i2]Max Klimm, Philipp Warode:
Computing all Wardrop Equilibria parametrized by the Flow Demand. CoRR abs/1805.12383 (2018) - [i1]Max Klimm, Philipp Warode:
Parametrized Nash Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians. CoRR abs/1811.08354 (2018)
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 22:14 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:
