default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTill Heller
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Holger Berthold, Till Heller, Tobias Seidel
:
A unified approach to inverse robust optimization problems. Math. Methods Oper. Res. 99(1): 115-139 (2024)- [j1]Rebekka Haese, Till Heller, Sven O. Krumke:
Algorithms and complexity for the almost equal maximum flow problem. Networks 83(4): 642-652 (2024) - 2023
- [i6]Lena Leiß, Till Heller, Luca E. Schäfer, Manuel Streicher, Stefan Ruzika:
p-median location interdiction on trees. CoRR abs/2301.13723 (2023) - 2022
- [c6]Elisabeth Finhold, Till Heller, Sven O. Krumke, Neele Leithäuser:
A Bicriteria Almost Equal Minimum Cost Flow Model for Day-Ahead Trading. OR 2022: 181-187 - [c5]Till Heller, Sebastian Velten:
Considering Short and Long Term Fairness in Recurrent Auctions with an Application to Collaborative Rostering. OR 2022: 349-355 - [c4]Dominik Leib, Elisabeth Finhold, Till Heller:
A Heuristic Bicriteria Scheduling Approach for a Flooring Production Planning Problem. OR 2022: 567-572 - [i5]Niklas Gräf, Till Heller, Sven O. Krumke:
On Reward-Penalty-Selection Games. CoRR abs/2201.05515 (2022) - 2021
- [b1]Till Heller:
Virtual Prosumer Consortia - A Game Theoretical Optimization Approach. Kaiserslautern University of Technology, Germany, Fraunhofer Verlag 2021, ISBN 978-3-8396-1717-5, pp. 1-180 - [c3]Neele Leithäuser, Till Heller, Elisabeth Finhold, Florian Schirra:
Optimal Trading of Flexible Power Consumption on the Day-Ahead Market. OR 2021: 175-181 - [i4]Rebekka Haese, Till Heller, Sven O. Krumke:
Algorithms and Complexity for the Almost Equal Maximum Flow Problem. CoRR abs/2104.05288 (2021) - [i3]Niklas Gräf, Till Heller, Sven O. Krumke:
On the Connection between Individual Scaled Vickrey Payments and the Egalitarian Allocation. CoRR abs/2106.14442 (2021) - [i2]Till Heller, Sven O. Krumke, Karl-Heinz Küfer:
The Reward-Penalty-Selection Problem. CoRR abs/2106.14601 (2021) - [i1]Till Heller, Sven Oliver Krumke:
Computing the egalitarian allocation with network flows. CoRR abs/2106.15389 (2021) - 2020
- [c2]Irene Heinrich, Till Heller, Eva Schmidt, Manuel Streicher:
2.5-Connectivity: Unique Components, Critical Graphs, and Applications. WG 2020: 352-363
2010 – 2019
- 2019
- [c1]Rebekka Haese, Till Heller, Sven O. Krumke:
Algorithms and Complexity for the Almost Equal Maximum Flow Problem. OR 2019: 323-329
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-09-13 00:44 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:
