Seguir
Sören Riechers
Sören Riechers
Heinz-Nixdorf-Institute, University of Paderborn
Dirección de correo verificada de uni-paderborn.de
Título
Citado por
Citado por
Año
Fully-dynamic bin packing with little repacking
B Feldkord, M Feldotto, A Gupta, G Guruganesh, A Kumar, S Riechers, ...
45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018
372018
Towards flexible demands in online leasing problems
S Li, A Mäcker, C Markarian, F Meyer auf der Heide, S Riechers
Computing and Combinatorics: 21st International Conference, COCOON 2015 …, 2015
172015
Towards flexible demands in online leasing problems
S Li, A Mäcker, C Markarian, F Meyer auf der Heide, S Riechers
Computing and Combinatorics: 21st International Conference, COCOON 2015 …, 2015
172015
Sharing is caring: Multiprocessor scheduling with a sharable resource
P Kling, A Mäcker, S Riechers, A Skopalik
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and …, 2017
152017
Non-preemptive scheduling on machines with setup times
A Mäcker, M Malatyali, F Meyer auf der Heide, S Riechers
Algorithms and Data Structures: 14th International Symposium, WADS 2015 …, 2015
142015
Scheduling shared continuous resources on many-cores
A Brinkmann, P Kling, F Meyer auf der Heide, L Nagel, S Riechers, T Süß
Proceedings of the 26th ACM symposium on Parallelism in algorithms and …, 2014
132014
Cost-efficient scheduling on machines from the cloud
A Mäcker, M Malatyali, F Meyer Auf Der Heide, S Riechers
Journal of Combinatorial Optimization 36, 1168-1194, 2018
122018
Scheduling shared continuous resources on many-cores
E Althaus, A Brinkmann, P Kling, FM auf der Heide, L Nagel, S Riechers, ...
Journal of Scheduling 21, 77-92, 2018
102018
Episodic clustering of data streams using a topology-learning neural network
M Tscherepanow, S Kühnel, S Riechers
Proceedings of the ECAI Workshop on Active and Incremental Learning (AIL), 2012
102012
A tight approximation for fully dynamic bin packing without bundling
B Feldkord, M Feldotto, S Riechers
arXiv preprint arXiv:1711.01231, 2017
72017
On existence and properties of approximate pure Nash equilibria in bandwidth allocation games
M Drees, M Feldotto, S Riechers, A Skopalik
International Symposium on Algorithmic Game Theory, 178-189, 2015
72015
Budget-restricted utility games with ordered strategic decisions
M Drees, S Riechers, A Skopalik
International Symposium on Algorithmic Game Theory, 110-121, 2014
72014
Pure Nash equilibria in restricted budget games
M Drees, M Feldotto, S Riechers, A Skopalik
Journal of Combinatorial Optimization 37, 620-638, 2019
52019
Monitoring of domain-related problems in distributed data streams
P Bemmann, F Biermeier, J Bürmann, A Kemper, T Knollmann, S Knorr, ...
International Colloquium on Structural Information and Communication …, 2017
52017
Continuous speed scaling with variability: A simple and direct approach
A Antoniadis, P Kling, S Ott, S Riechers
Theoretical Computer Science 678, 1-13, 2017
52017
An incremental on-line classifier for imbalanced, incomplete, and noisy data
M Tscherepanow, S Riechers
Proceedings of the ECAI workshop on active and incremental learning (AIL), 2012
52012
Non-clairvoyant scheduling to minimize max flow time on a machine with setup times
A Mäcker, M Malatyali, F Meyer auf der Heide, S Riechers
International Workshop on Approximation and Online Algorithms, 207-222, 2017
32017
Scheduling with interjob communication on parallel processors
J König, A Mäcker, F Meyer Auf Der Heide, S Riechers
Journal of Combinatorial Optimization 36, 1356-1379, 2018
22018
Scheduling with Scarce Resources
S Riechers
Paderborn, Universität Paderborn, 2017
2017
On Scheduling with a Sharable Resource
P Kling, A Mäcker, S Riechers, A Skopalik
13th Workshop on Models and Algorithms for Planning and Scheduling Problems, 6, 2017
2017
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20