Sebastian Stiller

According to our database1, Sebastian Stiller authored at least 30 papers between 2004 and 2021.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:



Dynamic Shortest Paths Methods for the Time-Dependent TSP.
Algorithms, 2021

A Generalized Parallel Task Model for Recurrent Real-Time Processes.
ACM Trans. Parallel Comput., 2019

Robust Strategic Route Planning in Logistics.
Transp. Sci., 2018

Fast Robust Shortest Path Computations.
Proceedings of the 18th Workshop on Algorithmic Approaches for Transportation Modelling, 2018

Packing a Knapsack of Unknown Capacity.
SIAM J. Discret. Math., 2017

Reference points and approximation algorithms in multicriteria discrete optimization.
Eur. J. Oper. Res., 2017

Bulk-Robust combinatorial optimization.
Math. Program., 2015

A Short Note on Long Waiting Lists.
Proceedings of the Gems of Combinatorial Optimization and Graph Algorithms, 2015

Delay-Robust Event Scheduling.
Oper. Res., 2014

The Role of Human Factors in Production Networks and Quality Management.
Proceedings of the HCI in Business - First International Conference, 2014

Robust Appointment Scheduling.
Proceedings of the Approximation, 2014

Robust and Adaptive Network Flows.
Oper. Res., 2013

Feasibility Analysis in the Sporadic DAG Task Model.
Proceedings of the 25th Euromicro Conference on Real-Time Systems, 2013

Feasibility Tests for Recurrent Real-Time Tasks in the Sporadic DAG Model
CoRR, 2012

The Power of Compromise
CoRR, 2012

A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling.
Algorithmica, 2012

Online railway delay management: Hardness, simulation and computation.
Simul., 2011

Line planning, path constrained network flow and inapproximability.
Networks, 2011

Optimization over Integers with Robustness in Cost and Few Constraints.
Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

Improved multiprocessor global schedulability analysis.
Real Time Syst., 2010

Computing delay resistant railway timetables.
Comput. Oper. Res., 2010

Increasing Speed Scheduling and Flow Scheduling.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Policies for Periodic Packet Routing.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Strong Formulations for the Multi-module PESP and a Quadratic Algorithm for Graphical Diophantine Equation Systems.
Proceedings of the Algorithms, 2010

The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications.
Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

Delay resistant timetabling.
Public Transp., 2009

Implementation of a Speedup-Optimal Global EDF Schedulability Test.
Proceedings of the 21st Euromicro Conference on Real-Time Systems, 2009

TOPSU - RDM a simulation platform for online railway delay management.
Proceedings of the 1st International Conference on Simulation Tools and Techniques for Communications, 2008

The Price of Anarchy of a Network Creation Game with Exponential Payoff.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

Network Models.
Proceedings of the Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 2004