Julie Meißner

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

An Adversarial Model for Scheduling with Testing.

Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner

Algorithmica, 2020

2018

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

Julie Meißner

PhD thesis, 2018

Scheduling with Explorable Uncertainty.

Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017

Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments.

Jacob Focke, Nicole Megow, Julie Meißner

Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Tight Bounds for Online TSP on the Line.

Antje Bjelde, Yann Disser, Jan Hackfeld, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Kevin Schewior, Miriam Schlöter, Leen Stougie

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

A QPTAS for the General Scheduling Problem with Identical Release Dates.

Antonios Antoniadis, Ruben Hoeksma, Julie Meißner, José Verschae, Andreas Wiese

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Scheduling Maintenance Jobs in Networks.

Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2015

Randomization Helps Computing a Minimum Spanning Tree under Uncertainty.

Nicole Megow, Julie Meißner, Martin Skutella

Proceedings of the Algorithms - ESA 2015, 2015