![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Julie Meißner
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j5]Antje Bjelde, Jan Hackfeld, Yann Disser, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Miriam Schlöter, Kevin Schewior
, Leen Stougie:
Tight Bounds for Online TSP on the Line. ACM Trans. Algorithms 17(1): 3:1-3:58 (2021) - 2020
- [j4]Christoph Dürr
, Thomas Erlebach
, Nicole Megow
, Julie Meißner:
An Adversarial Model for Scheduling with Testing. Algorithmica 82(12): 3630-3675 (2020) - [j3]Jacob Focke, Nicole Megow, Julie Meißner:
Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments. ACM J. Exp. Algorithmics 25: 1-20 (2020)
2010 – 2019
- 2019
- [j2]Fidaa Abed
, Lin Chen
, Yann Disser, Martin Groß
, Nicole Megow
, Julie Meißner, Alexander T. Richter, Roman Rischke:
Scheduling maintenance jobs in networks. Theor. Comput. Sci. 754: 107-121 (2019) - 2018
- [b1]Julie Meißner:
Uncertainty exploration (algorithms, competitive analysis, and computational experiments) (Explorierbare Unsicherheit) (Algorithmen, kompetitive Analyse und Computerexperimente). TU Berlin, Germany, 2018 - [c6]Christoph Dürr, Thomas Erlebach, Nicole Megow
, Julie Meißner:
Scheduling with Explorable Uncertainty. ITCS 2018: 30:1-30:14 - 2017
- [j1]Nicole Megow
, Julie Meißner, Martin Skutella:
Randomization Helps Computing a Minimum Spanning Tree under Uncertainty. SIAM J. Comput. 46(4): 1217-1240 (2017) - [c5]Fidaa Abed
, Lin Chen
, Yann Disser, Martin Groß, Nicole Megow
, Julie Meißner, Alexander T. Richter, Roman Rischke:
Scheduling Maintenance Jobs in Networks. CIAC 2017: 19-30 - [c4]Antonios Antoniadis, Ruben Hoeksma
, Julie Meißner, José Verschae, Andreas Wiese
:
A QPTAS for the General Scheduling Problem with Identical Release Dates. ICALP 2017: 31:1-31:14 - [c3]Antje Bjelde, Yann Disser, Jan Hackfeld, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Kevin Schewior
, Miriam Schlöter, Leen Stougie:
Tight Bounds for Online TSP on the Line. SODA 2017: 994-1005 - [c2]Jacob Focke, Nicole Megow
, Julie Meißner:
Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments. SEA 2017: 22:1-22:14 - [i2]Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke:
Scheduling Maintenance Jobs in Networks. CoRR abs/1701.08809 (2017) - [i1]Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner:
Scheduling with Explorable Uncertainty. CoRR abs/1709.02592 (2017) - 2015
- [c1]Nicole Megow
, Julie Meißner, Martin Skutella:
Randomization Helps Computing a Minimum Spanning Tree under Uncertainty. ESA 2015: 878-890
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint