Julie Meißner

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

Collaborative distances:

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

2021

Tight Bounds for Online TSP on the Line.

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

ACM Trans. Algorithms, 2021

2020

Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments.

Jacob Focke, Nicole Megow, Julie Meißner

ACM J. Exp. Algorithmics, 2020

An Adversarial Model for Scheduling with Testing.

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

Algorithmica, 2020

2019

Scheduling maintenance jobs in networks.

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

Theor. Comput. Sci., 2019

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

Randomization Helps Computing a Minimum Spanning Tree under Uncertainty.

Nicole Megow, Julie Meißner, Martin Skutella

SIAM J. Comput., 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