Julie Meißner

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments ACM Journal of Experimental Algorithmics	2023-05-23	Paper
Tight Bounds for Online TSP on the Line ACM Transactions on Algorithms	2022-02-08	Paper
Scheduling with explorable uncertainty	2021-06-15	Paper
An adversarial model for scheduling with testing Algorithmica	2020-11-11	Paper
scientific article; zbMATH DE number 7204483 (Why is no real title available?)	2020-05-27	Paper
Scheduling maintenance jobs in networks Theoretical Computer Science	2018-12-04	Paper
Minimum spanning tree under explorable uncertainty in theory and experiments	2018-08-13	Paper
Tight bounds for online TSP on the line Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms	2018-07-16	Paper
Randomization Helps Computing a Minimum Spanning Tree under Uncertainty SIAM Journal on Computing	2017-07-21	Paper
Scheduling maintenance jobs in networks Lecture Notes in Computer Science	2017-07-21	Paper
Randomization helps computing a minimum spanning tree under uncertainty Algorithms - ESA 2015	2015-11-19	Paper

Research outcomes over time

This page was built for person: Julie Meißner