default search action
Sebastian Stiller
Person information
- affiliation: Technische Universität Braunschweig, Braunschweig, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Lukas Metz, Petra Mutzel, Tim Niemann
, Lukas Schürmann
Delay-resistant robust vehicle routing with heterogeneous time windows. Comput. Oper. Res. 164: 106553 (2024) - [j16]Sabrina C. L. Ammann, Sebastian Stiller:
Near-Optimal Auctions on Independence Systems. Theory Comput. Syst. 68(5): 1160-1179 (2024) - [i5]Sabrina C. L. Ammann, Birte Ostermann, Sebastian Stiller, Timo de Wolff:
A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion. CoRR abs/2401.16149 (2024) - 2023
- [j15]Christoph Hansknecht
Feeder routing for air-to-air refueling operations. Eur. J. Oper. Res. 304(2): 779-796 (2023) - [i4]Sabrina Ammann, Maximilian Hess, Debora Ramacciotti, Sándor P. Fekete, Paulina L. A. Goedicke, David Gross, Andreea Lefterovici, Tobias J. Osborne, Michael Perk, Antonio Rotundo, S. E. Skelton, Sebastian Stiller, Timo de Wolff:
Realistic Runtime Analysis for Quantum Simplex Computation. CoRR abs/2311.09995 (2023) - 2022
- [c16]Petra Mutzel
Vehicle Routing with Heterogeneous Time Windows. OR 2022: 171-177 - 2021
- [j14]Christoph Hansknecht
Dynamic Shortest Paths Methods for the Time-Dependent TSP. Algorithms 14(1): 21 (2021) - [c15]Marc Kassubeck, Florian Bürgel
Shape from Caustics: Reconstruction of 3D-Printed Glass from Simulated Caustic Images. WACV 2021: 2876-2885
2010 – 2019
- 2019
- [j13]Vincenzo Bonifaci
A Generalized Parallel Task Model for Recurrent Real-Time Processes. ACM Trans. Parallel Comput. 6(1): 3:1-3:40 (2019) - 2018
- [j12]Alexander T. Richter, Sebastian Stiller:
Robust Strategic Route Planning in Logistics. Transp. Sci. 52(1): 38-58 (2018) - [c14]Christoph Hansknecht
Fast Robust Shortest Path Computations. ATMOS 2018: 5:1-5:21 - 2017
- [j11]Christina Büsing, Kai-Simon Goetzmann, Jannik Matuschke
Reference points and approximation algorithms in multicriteria discrete optimization. Eur. J. Oper. Res. 260(3): 829-840 (2017) - [j10]Yann Disser, Max Klimm, Nicole Megow
Packing a Knapsack of Unknown Capacity. SIAM J. Discret. Math. 31(3): 1477-1497 (2017) - 2015
- [j9]David Adjiashvili, Sebastian Stiller, Rico Zenklusen:
Bulk-Robust combinatorial optimization. Math. Program. 149(1-2): 361-390 (2015) - [p2]Sebastian Stiller:
A Short Note on Long Waiting Lists. Gems of Combinatorial Optimization and Graph Algorithms 2015: 143-150 - [e2]Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner:
Gems of Combinatorial Optimization and Graph Algorithms. Springer 2015, ISBN 978-3-319-24970-4 [contents] - 2014
- [j8]Alberto Caprara, Laura Galli, Sebastian Stiller, Paolo Toth:
Delay-Robust Event Scheduling. Oper. Res. 62(2): 274-283 (2014) - [c13]Shashi Mittal, Andreas S. Schulz, Sebastian Stiller:
Robust Appointment Scheduling. APPROX-RANDOM 2014: 356-370 - [c12]Ralf Philipsen
The Role of Human Factors in Production Networks and Quality Management. HCI (18) 2014: 80-91 - [c11]Yann Disser, Max Klimm, Nicole Megow
Packing a Knapsack of Unknown Capacity. STACS 2014: 276-287 - 2013
- [j7]Dimitris Bertsimas, Ebrahim Nasrabadi, Sebastian Stiller:
Robust and Adaptive Network Flows. Oper. Res. 61(5): 1218-1242 (2013) - [c10]Vincenzo Bonifaci
Feasibility Analysis in the Sporadic DAG Task Model. ECRTS 2013: 225-233 - [e1]Daniele Frigioni, Sebastian Stiller:
13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2013, September 5, 2013, Sophia Antipolis, France. OASIcs 33, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2013, ISBN 978-3-939897-58-3 [contents] - [i3]Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller:
Packing a Knapsack of Unknown Capacity. CoRR abs/1307.2806 (2013) - 2012
- [j6]Vincenzo Bonifaci
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling. Algorithmica 62(3-4): 1034-1049 (2012) - [i2]Christina Büsing, Kai-Simon Goetzmann, Jannik Matuschke, Sebastian Stiller:
The Power of Compromise. CoRR abs/1207.3165 (2012) - [i1]Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Sebastian Stiller, Andreas Wiese:
Feasibility Tests for Recurrent Real-Time Tasks in the Sporadic DAG Model. CoRR abs/1212.2778 (2012) - 2011
- [j5]Christina Büsing, Sebastian Stiller:
Line planning, path constrained network flow and inapproximability. Networks 57(1): 106-113 (2011) - [j4]André Berger, Ralf Hoffmann, Ulf Lorenz, Sebastian Stiller:
Online railway delay management: Hardness, simulation and computation. Simul. 87(7): 616-629 (2011) - [c9]Kai-Simon Goetzmann, Sebastian Stiller, Claudio Telha:
Optimization over Integers with Robustness in Cost and Few Constraints. WAOA 2011: 89-101 - 2010
- [j3]Christian Liebchen, Michael Schachtebeck, Anita Schöbel, Sebastian Stiller, André Prigge:
Computing delay resistant railway timetables. Comput. Oper. Res. 37(5): 857-868 (2010) - [j2]Sanjoy K. Baruah, Vincenzo Bonifaci
Improved multiprocessor global schedulability analysis. Real Time Syst. 46(1): 3-24 (2010) - [c8]Laura Galli, Sebastian Stiller:
Strong Formulations for the Multi-module PESP and a Quadratic Algorithm for Graphical Diophantine Equation Systems. ESA (1) 2010: 338-349 - [c7]Britta Peis, Sebastian Stiller, Andreas Wiese:
Policies for Periodic Packet Routing. ISAAC (2) 2010: 266-278 - [c6]Sebastian Stiller, Andreas Wiese:
Increasing Speed Scheduling and Flow Scheduling. ISAAC (2) 2010: 279-290
2000 – 2009
- 2009
- [j1]Christian Liebchen, Sebastian Stiller:
Delay resistant timetabling. Public Transp. 1(1): 55-72 (2009) - [c5]Sanjoy K. Baruah, Vincenzo Bonifaci
Implementation of a Speedup-Optimal Global EDF Schedulability Test. ECRTS 2009: 259-268 - [p1]Christian Liebchen, Marco E. Lübbecke
The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications. Robust and Online Large-Scale Optimization 2009: 1-27 - 2008
- [c4]Vincenzo Bonifaci, Alberto Marchetti-Spaccamela
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling. ESA 2008: 210-221 - [c3]Nadine Baumann, Sebastian Stiller:
The Price of Anarchy of a Network Creation Game with Exponential Payoff. SAGT 2008: 218-229 - [c2]André Berger, Ralf Hoffmann, Ulf Lorenz, Sebastian Stiller:
TOPSU - RDM a simulation platform for online railway delay management. SimuTools 2008: 20 - 2004
- [c1]Nadine Baumann, Sebastian Stiller:
Network Models. Network Analysis 2004: 341-372
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-11-11 22:26 CET 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: