default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSören Riechers
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j5]Maximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik:
Pure Nash equilibria in restricted budget games. J. Comb. Optim. 37(2): 620-638 (2019)- 2018
- [j4]Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers:
Cost-efficient scheduling on machines from the cloud. J. Comb. Optim. 36(4): 1168-1194 (2018) - [j3]Jürgen König, Alexander Mäcker, Friedhelm Meyer auf der Heide, Sören Riechers:
Scheduling with interjob communication on parallel processors. J. Comb. Optim. 36(4): 1356-1379 (2018) - [j2]Ernst Althaus, André Brinkmann, Peter Kling
, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, Jirí Sgall, Tim Süß:
Scheduling shared continuous resources on many-cores. J. Sched. 21(1): 77-92 (2018) - [c12]Björn Feldkord, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, Sören Riechers, David Wajc:
Fully-Dynamic Bin Packing with Little Repacking. ICALP 2018: 51:1-51:24 - 2017
- [b1]Sören Riechers:
Scheduling with scarce resources (Scheduling mit knappen Ressourcen). Paderborn University, Germany, 2017 - [j1]Antonios Antoniadis, Peter Kling, Sebastian Ott, Sören Riechers:
Continuous speed scaling with variability: A simple and direct approach. Theor. Comput. Sci. 678: 1-13 (2017) - [c11]Maximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik:
Pure Nash Equilibria in Restricted Budget Games. COCOON 2017: 175-187 - [c10]Pascal Bemmann, Felix Biermeier, Jan Bürmann, Arne Kemper, Till Knollmann, Steffen Knorr, Nils Kothe, Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers, Johannes Schaefer, Jannik Sundermeier:
Monitoring of Domain-Related Problems in Distributed Data Streams. SIROCCO 2017: 212-226 - [c9]Peter Kling, Alexander Mäcker, Sören Riechers, Alexander Skopalik:
Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource. SPAA 2017: 123-132 - [c8]Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers:
Non-clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times. WAOA 2017: 207-222 - [i7]Pascal Bemmann, Felix Biermeier, Jan Bürmann, Arne Kemper, Till Knollmann, Steffen Knorr, Nils Kothe, Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers, Johannes Schaefer, Jannik Sundermeier:
Monitoring of Domain-Related Problems in Distributed Data Streams. CoRR abs/1706.03568 (2017) - [i6]Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers:
Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times. CoRR abs/1709.05896 (2017) - [i5]Björn Feldkord, Matthias Feldotto, Sören Riechers:
A Tight Approximation for Fully Dynamic Bin Packing without Bundling. CoRR abs/1711.01231 (2017) - 2016
- [c7]Jürgen König, Alexander Mäcker, Friedhelm Meyer auf der Heide, Sören Riechers:
Scheduling with Interjob Communication on Parallel Processors. COCOA 2016: 563-577 - [c6]Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers:
Cost-Efficient Scheduling on Machines from the Cloud. COCOA 2016: 578-592 - [i4]Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers:
Cost-efficient Scheduling on Machines from the Cloud. CoRR abs/1609.01184 (2016) - 2015
- [c5]Shouwei Li, Alexander Mäcker, Christine Markarian, Friedhelm Meyer auf der Heide, Sören Riechers:
Towards Flexible Demands in Online Leasing Problems. COCOON 2015: 277-288 - [c4]Maximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik:
On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games. SAGT 2015: 178-189 - [c3]Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers:
Non-preemptive Scheduling on Machines with Setup Times. WADS 2015: 542-553 - [i3]Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers:
Non-Preemptive Scheduling on Machines with Setup Times. CoRR abs/1504.07066 (2015) - [i2]Maximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik:
On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games. CoRR abs/1507.02908 (2015) - 2014
- [c2]Maximilian Drees, Sören Riechers, Alexander Skopalik:
Budget-Restricted Utility Games with Ordered Strategic Decisions. SAGT 2014: 110-121 - [c1]André Brinkmann, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, Tim Süß:
Scheduling shared continuous resources on many-cores. SPAA 2014: 128-137 - [i1]Maximilian Drees, Sören Riechers, Alexander Skopalik:
Budget-restricted utility games with ordered strategic decisions. CoRR abs/1407.3123 (2014)
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-05-08 21:49 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:
