Julie Meißner

According to our database1, Julie Meißner authored at least 8 papers between 2015 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
An Adversarial Model for Scheduling with Testing.
Algorithmica, 2020

2018
Uncertainty exploration (algorithms, competitive analysis, and computational experiments) (Explorierbare Unsicherheit) (Algorithmen, kompetitive Analyse und Computerexperimente)
PhD thesis, 2018

Scheduling with Explorable Uncertainty.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017
Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Tight Bounds for Online TSP on the Line.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

A QPTAS for the General Scheduling Problem with Identical Release Dates.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Scheduling Maintenance Jobs in Networks.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2015
Randomization Helps Computing a Minimum Spanning Tree under Uncertainty.
Proceedings of the Algorithms - ESA 2015, 2015


  Loading...