Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Nicole Megow
@inproceedings{DBLP:conf/soda/BamasLMRS24,
author = {{\'{E}}tienne Bamas and
Alexander Lindermayr and
Nicole Megow and
Lars Rohwedder and
Jens Schl{\"{o}}ter},
editor = {David P. Woodruff},
title = {Santa Claus meets Makespan and Matroids: Algorithms and Reductions},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {2829--2860},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.100},
doi = {10.1137/1.9781611977912.100},
timestamp = {Thu, 04 Apr 2024 19:38:10 +0200},
biburl = {https://dblp.org/rec/conf/soda/BamasLMRS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-02774,
author = {Franziska Eberle and
Felix Hommelsheim and
Alexander Lindermayr and
Zhenwei Liu and
Nicole Megow and
Jens Schl{\"{o}}ter},
title = {Accelerating Matroid Optimization through Fast Imprecise Oracles},
journal = {CoRR},
volume = {abs/2402.02774},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.02774},
doi = {10.48550/ARXIV.2402.02774},
eprinttype = {arXiv},
eprint = {2402.02774},
timestamp = {Mon, 12 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-02774.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/EberleHMNSS23,
author = {Franziska Eberle and
Ruben Hoeksma and
Nicole Megow and
Lukas N{\"{o}}lke and
Kevin Schewior and
Bertrand Simon},
title = {Speed-robust scheduling: sand, bricks, and rocks},
journal = {Math. Program.},
volume = {197},
number = {2},
pages = {1009--1048},
year = {2023},
url = {https://doi.org/10.1007/s10107-022-01829-0},
doi = {10.1007/S10107-022-01829-0},
timestamp = {Fri, 12 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/EberleHMNSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EberleMS23,
author = {Franziska Eberle and
Nicole Megow and
Kevin Schewior},
title = {Online Throughput Maximization on Unrelated Machines: Commitment is
No Burden},
journal = {{ACM} Trans. Algorithms},
volume = {19},
number = {1},
pages = {10:1--10:25},
year = {2023},
url = {https://doi.org/10.1145/3569582},
doi = {10.1145/3569582},
timestamp = {Sat, 29 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/EberleMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/FellowsGMMRRSS23,
author = {Michael R. Fellows and
Mario Grobler and
Nicole Megow and
Amer E. Mouawad and
Vijayaragunathan Ramamoorthi and
Frances A. Rosamond and
Daniel Schmand and
Sebastian Siebertz},
editor = {Kobi Gal and
Ann Now{\'{e}} and
Grzegorz J. Nalepa and
Roy Fairstein and
Roxana Radulescu},
title = {On Solution Discovery via Reconfiguration},
booktitle = {{ECAI} 2023 - 26th European Conference on Artificial Intelligence,
September 30 - October 4, 2023, Krak{\'{o}}w, Poland - Including
12th Conference on Prestigious Applications of Intelligent Systems
{(PAIS} 2023)},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {372},
pages = {700--707},
publisher = {{IOS} Press},
year = {2023},
url = {https://doi.org/10.3233/FAIA230334},
doi = {10.3233/FAIA230334},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ecai/FellowsGMMRRSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/0003HM23,
author = {Mohit Garg and
Felix Hommelsheim and
Nicole Megow},
editor = {Kousha Etessami and
Uriel Feige and
Gabriele Puppis},
title = {Matching Augmentation via Simultaneous Contractions},
booktitle = {50th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
series = {LIPIcs},
volume = {261},
pages = {65:1--65:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.65},
doi = {10.4230/LIPICS.ICALP.2023.65},
timestamp = {Wed, 05 Jul 2023 16:19:52 +0200},
biburl = {https://dblp.org/rec/conf/icalp/0003HM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/LassotaLMS23,
author = {Alexandra Anna Lassota and
Alexander Lindermayr and
Nicole Megow and
Jens Schl{\"{o}}ter},
editor = {Andreas Krause and
Emma Brunskill and
Kyunghyun Cho and
Barbara Engelhardt and
Sivan Sabato and
Jonathan Scarlett},
title = {Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints},
booktitle = {International Conference on Machine Learning, {ICML} 2023, 23-29 July
2023, Honolulu, Hawaii, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {202},
pages = {18563--18583},
publisher = {{PMLR}},
year = {2023},
url = {https://proceedings.mlr.press/v202/lassota23a.html},
timestamp = {Mon, 28 Aug 2023 17:23:08 +0200},
biburl = {https://dblp.org/rec/conf/icml/LassotaLMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/LindermayrMR23,
author = {Alexander Lindermayr and
Nicole Megow and
Martin Rapp},
editor = {Andreas Krause and
Emma Brunskill and
Kyunghyun Cho and
Barbara Engelhardt and
Sivan Sabato and
Jonathan Scarlett},
title = {Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not
Necessary},
booktitle = {International Conference on Machine Learning, {ICML} 2023, 23-29 July
2023, Honolulu, Hawaii, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {202},
pages = {21312--21334},
publisher = {{PMLR}},
year = {2023},
url = {https://proceedings.mlr.press/v202/lindermayr23a.html},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/LindermayrMR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/ErlebachLMS23,
author = {Thomas Erlebach and
Murilo S. de Lima and
Nicole Megow and
Jens Schl{\"{o}}ter},
title = {Sorting and Hypergraph Orientation under Uncertainty with Predictions},
booktitle = {Proceedings of the Thirty-Second International Joint Conference on
Artificial Intelligence, {IJCAI} 2023, 19th-25th August 2023, Macao,
SAR, China},
pages = {5577--5585},
publisher = {ijcai.org},
year = {2023},
url = {https://doi.org/10.24963/ijcai.2023/619},
doi = {10.24963/IJCAI.2023/619},
timestamp = {Mon, 28 Aug 2023 17:23:07 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/ErlebachLMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/EberleGMMZ23,
author = {Franziska Eberle and
Anupam Gupta and
Nicole Megow and
Benjamin Moseley and
Rudy Zhou},
editor = {Alberto Del Pia and
Volker Kaibel},
title = {Configuration Balancing for Stochastic Requests},
booktitle = {Integer Programming and Combinatorial Optimization - 24th International
Conference, {IPCO} 2023, Madison, WI, USA, June 21-23, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13904},
pages = {127--141},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-32726-1\_10},
doi = {10.1007/978-3-031-32726-1\_10},
timestamp = {Fri, 26 May 2023 10:40:47 +0200},
biburl = {https://dblp.org/rec/conf/ipco/EberleGMMZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/MegowS23,
author = {Nicole Megow and
Jens Schl{\"{o}}ter},
editor = {Alberto Del Pia and
Volker Kaibel},
title = {Set Selection Under Explorable Stochastic Uncertainty via Covering
Techniques},
booktitle = {Integer Programming and Combinatorial Optimization - 24th International
Conference, {IPCO} 2023, Madison, WI, USA, June 21-23, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13904},
pages = {319--333},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-32726-1\_23},
doi = {10.1007/978-3-031-32726-1\_23},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/MegowS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2023,
editor = {Nicole Megow and
Adam D. Smith},
title = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
Georgia, {USA}},
series = {LIPIcs},
volume = {275},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-296-9},
isbn = {978-3-95977-296-9},
timestamp = {Sat, 09 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-12863,
author = {Alexandra Lassota and
Alexander Lindermayr and
Nicole Megow and
Jens Schl{\"{o}}ter},
title = {Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints},
journal = {CoRR},
volume = {abs/2301.12863},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.12863},
doi = {10.48550/ARXIV.2301.12863},
eprinttype = {arXiv},
eprint = {2301.12863},
timestamp = {Wed, 01 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-12863.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-00985,
author = {Alexander Lindermayr and
Nicole Megow and
Martin Rapp},
title = {Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not
Necessary},
journal = {CoRR},
volume = {abs/2302.00985},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.00985},
doi = {10.48550/ARXIV.2302.00985},
eprinttype = {arXiv},
eprint = {2302.00985},
timestamp = {Thu, 09 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-00985.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-14295,
author = {Michael R. Fellows and
Mario Grobler and
Nicole Megow and
Amer E. Mouawad and
Vijayaragunathan Ramamoorthi and
Frances A. Rosamond and
Daniel Schmand and
Sebastian Siebertz},
title = {On Solution Discovery via Reconfiguration},
journal = {CoRR},
volume = {abs/2304.14295},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.14295},
doi = {10.48550/ARXIV.2304.14295},
eprinttype = {arXiv},
eprint = {2304.14295},
timestamp = {Thu, 04 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-14295.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-09245,
author = {Thomas Erlebach and
Murilo Santos de Lima and
Nicole Megow and
Jens Schl{\"{o}}ter},
title = {Sorting and Hypergraph Orientation under Uncertainty with Predictions},
journal = {CoRR},
volume = {abs/2305.09245},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.09245},
doi = {10.48550/ARXIV.2305.09245},
eprinttype = {arXiv},
eprint = {2305.09245},
timestamp = {Wed, 24 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-09245.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-08546,
author = {Felix Hommelsheim and
Nicole Megow and
Komal Muluk and
Britta Peis},
title = {Recoverable Robust Optimization with Commitment},
journal = {CoRR},
volume = {abs/2306.08546},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.08546},
doi = {10.48550/ARXIV.2306.08546},
eprinttype = {arXiv},
eprint = {2306.08546},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-08546.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-08453,
author = {{\'{E}}tienne Bamas and
Alexander Lindermayr and
Nicole Megow and
Lars Rohwedder and
Jens Schl{\"{o}}ter},
title = {Santa Claus meets Makespan and Matroids: Algorithms and Reductions},
journal = {CoRR},
volume = {abs/2307.08453},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.08453},
doi = {10.48550/ARXIV.2307.08453},
eprinttype = {arXiv},
eprint = {2307.08453},
timestamp = {Tue, 25 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-08453.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-05094,
author = {Madison Van Dyk and
Kim Klause and
Jochen K{\"{o}}nemann and
Nicole Megow},
title = {Fast Combinatorial Algorithms for Efficient Sortation},
journal = {CoRR},
volume = {abs/2311.05094},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.05094},
doi = {10.48550/ARXIV.2311.05094},
eprinttype = {arXiv},
eprint = {2311.05094},
timestamp = {Tue, 14 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-05094.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-13478,
author = {Mario Grobler and
Stephanie Maaz and
Nicole Megow and
Amer E. Mouawad and
Vijayaragunathan Ramamoorthi and
Daniel Schmand and
Sebastian Siebertz},
title = {Solution discovery via reconfiguration for problems in {P}},
journal = {CoRR},
volume = {abs/2311.13478},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.13478},
doi = {10.48550/ARXIV.2311.13478},
eprinttype = {arXiv},
eprint = {2311.13478},
timestamp = {Thu, 30 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-13478.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/MegowMSSVS23,
author = {Nicole Megow and
Benjamin Moseley and
David B. Shmoys and
Ola Svensson and
Sergei Vassilvitskii and
Jens Schl{\"{o}}ter},
title = {Scheduling (Dagstuhl Seminar 23061)},
journal = {Dagstuhl Reports},
volume = {13},
number = {2},
pages = {1--19},
year = {2023},
url = {https://doi.org/10.4230/DagRep.13.2.1},
doi = {10.4230/DAGREP.13.2.1},
timestamp = {Mon, 16 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/MegowMSSVS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BerndtEM22,
author = {Sebastian Berndt and
Franziska Eberle and
Nicole Megow},
title = {Online load balancing with general reassignment cost},
journal = {Oper. Res. Lett.},
volume = {50},
number = {3},
pages = {322--328},
year = {2022},
url = {https://doi.org/10.1016/j.orl.2022.03.007},
doi = {10.1016/J.ORL.2022.03.007},
timestamp = {Wed, 28 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BerndtEM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BohmMS22,
author = {Martin B{\"{o}}hm and
Nicole Megow and
Jens Schl{\"{o}}ter},
title = {Throughput scheduling with equal additive laxity},
journal = {Oper. Res. Lett.},
volume = {50},
number = {5},
pages = {463--469},
year = {2022},
url = {https://doi.org/10.1016/j.orl.2022.06.007},
doi = {10.1016/J.ORL.2022.06.007},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/BohmMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BohmHMNS22,
author = {Martin B{\"{o}}hm and
Ruben Hoeksma and
Nicole Megow and
Lukas N{\"{o}}lke and
Bertrand Simon},
title = {On Hop-Constrained Steiner Trees in Tree-Like Metrics},
journal = {{SIAM} J. Discret. Math.},
volume = {36},
number = {2},
pages = {1249--1273},
year = {2022},
url = {https://doi.org/10.1137/21m1425487},
doi = {10.1137/21M1425487},
timestamp = {Fri, 12 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BohmHMNS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/EberleLMNS22,
author = {Franziska Eberle and
Alexander Lindermayr and
Nicole Megow and
Lukas N{\"{o}}lke and
Jens Schl{\"{o}}ter},
title = {Robustification of Online Graph Exploration Methods},
booktitle = {Thirty-Sixth {AAAI} Conference on Artificial Intelligence, {AAAI}
2022, Thirty-Fourth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2022, The Twelveth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2022 Virtual Event, February 22
- March 1, 2022},
pages = {9732--9740},
publisher = {{AAAI} Press},
year = {2022},
url = {https://doi.org/10.1609/aaai.v36i9.21208},
doi = {10.1609/AAAI.V36I9.21208},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/EberleLMNS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ErlebachLMS22,
author = {Thomas Erlebach and
Murilo Santos de Lima and
Nicole Megow and
Jens Schl{\"{o}}ter},
editor = {Shiri Chechik and
Gonzalo Navarro and
Eva Rotenberg and
Grzegorz Herman},
title = {Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty},
booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September
5-9, 2022, Berlin/Potsdam, Germany},
series = {LIPIcs},
volume = {244},
pages = {49:1--49:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ESA.2022.49},
doi = {10.4230/LIPICS.ESA.2022.49},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/esa/ErlebachLMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/LindermayrMS22,
author = {Alexander Lindermayr and
Nicole Megow and
Bertrand Simon},
editor = {Mark Braverman},
title = {Double Coverage with Machine-Learned Advice},
booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS}
2022, January 31 - February 3, 2022, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {215},
pages = {99:1--99:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.99},
doi = {10.4230/LIPICS.ITCS.2022.99},
timestamp = {Fri, 12 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/LindermayrMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/0001LMMSS22,
author = {Giulia Bernardini and
Alexander Lindermayr and
Alberto Marchetti{-}Spaccamela and
Nicole Megow and
Leen Stougie and
Michelle Sweering},
editor = {Sanmi Koyejo and
S. Mohamed and
A. Agarwal and
Danielle Belgrave and
K. Cho and
A. Oh},
title = {A Universal Error Measure for Input Predictions Applied to Online
Graph Problems},
booktitle = {Advances in Neural Information Processing Systems 35: Annual Conference
on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans,
LA, USA, November 28 - December 9, 2022},
year = {2022},
url = {http://papers.nips.cc/paper\_files/paper/2022/hash/15212bd2265c4a3ab0dbc1b1982c1b69-Abstract-Conference.html},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/0001LMMSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/LindermayrM22,
author = {Alexander Lindermayr and
Nicole Megow},
editor = {Kunal Agrawal and
I{-}Ting Angelina Lee},
title = {Permutation Predictions for Non-Clairvoyant Scheduling},
booktitle = {{SPAA} '22: 34th {ACM} Symposium on Parallelism in Algorithms and
Architectures, Philadelphia, PA, USA, July 11 - 14, 2022},
pages = {357--368},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3490148.3538579},
doi = {10.1145/3490148.3538579},
timestamp = {Tue, 12 Jul 2022 14:22:25 +0200},
biburl = {https://dblp.org/rec/conf/spaa/LindermayrM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-10199,
author = {Alexander Lindermayr and
Nicole Megow},
title = {Non-Clairvoyant Scheduling with Predictions Revisited},
journal = {CoRR},
volume = {abs/2202.10199},
year = {2022},
url = {https://arxiv.org/abs/2202.10199},
eprinttype = {arXiv},
eprint = {2202.10199},
timestamp = {Tue, 01 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-10199.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-12850,
author = {Giulia Bernardini and
Alexander Lindermayr and
Alberto Marchetti{-}Spaccamela and
Nicole Megow and
Leen Stougie and
Michelle Sweering},
title = {A Universal Error Measure for Input Predictions Applied to Online
Graph Problems},
journal = {CoRR},
volume = {abs/2205.12850},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.12850},
doi = {10.48550/ARXIV.2205.12850},
eprinttype = {arXiv},
eprint = {2205.12850},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-12850.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-15201,
author = {Thomas Erlebach and
Murilo Santos de Lima and
Nicole Megow and
Jens Schl{\"{o}}ter},
title = {Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty},
journal = {CoRR},
volume = {abs/2206.15201},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.15201},
doi = {10.48550/ARXIV.2206.15201},
eprinttype = {arXiv},
eprint = {2206.15201},
timestamp = {Mon, 04 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-15201.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-13702,
author = {Franziska Eberle and
Anupam Gupta and
Nicole Megow and
Benjamin Moseley and
Rudy Zhou},
title = {Configuration Balancing for Stochastic Requests},
journal = {CoRR},
volume = {abs/2208.13702},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.13702},
doi = {10.48550/ARXIV.2208.13702},
eprinttype = {arXiv},
eprint = {2208.13702},
timestamp = {Thu, 01 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-13702.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-01097,
author = {Nicole Megow and
Jens Schl{\"{o}}ter},
title = {Set Selection under Explorable Stochastic Uncertainty via Covering
Techniques},
journal = {CoRR},
volume = {abs/2211.01097},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.01097},
doi = {10.48550/ARXIV.2211.01097},
eprinttype = {arXiv},
eprint = {2211.01097},
timestamp = {Fri, 04 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-01097.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-01912,
author = {Mohit Garg and
Felix Hommelsheim and
Nicole Megow},
title = {Matching Augmentation via Simultaneous Contractions},
journal = {CoRR},
volume = {abs/2211.01912},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.01912},
doi = {10.48550/ARXIV.2211.01912},
eprinttype = {arXiv},
eprint = {2211.01912},
timestamp = {Tue, 08 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-01912.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/ChenMRSV21,
author = {Lin Chen and
Nicole Megow and
Roman Rischke and
Leen Stougie and
Jos{\'{e}} Verschae},
title = {Optimal algorithms for scheduling under time-of-use tariffs},
journal = {Ann. Oper. Res.},
volume = {304},
number = {1},
pages = {85--107},
year = {2021},
url = {https://doi.org/10.1007/s10479-021-04059-3},
doi = {10.1007/S10479-021-04059-3},
timestamp = {Wed, 01 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/ChenMRSV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BampisM21,
author = {Evripidis Bampis and
Nicole Megow},
title = {Preface},
journal = {Theory Comput. Syst.},
volume = {65},
number = {6},
pages = {901--902},
year = {2021},
url = {https://doi.org/10.1007/s00224-021-10052-x},
doi = {10.1007/S00224-021-10052-X},
timestamp = {Wed, 11 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BampisM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/0001MS21,
author = {Martin B{\"{o}}hm and
Nicole Megow and
Jens Schl{\"{o}}ter},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Throughput Scheduling with Equal Additive Laxity},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {130--143},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_9},
doi = {10.1007/978-3-030-75242-2\_9},
timestamp = {Sun, 16 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/0001MS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BampisDELMS21,
author = {Evripidis Bampis and
Christoph D{\"{u}}rr and
Thomas Erlebach and
Murilo Santos de Lima and
Nicole Megow and
Jens Schl{\"{o}}ter},
editor = {Petra Mutzel and
Rasmus Pagh and
Grzegorz Herman},
title = {Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty},
booktitle = {29th Annual European Symposium on Algorithms, {ESA} 2021, September
6-8, 2021, Lisbon, Portugal (Virtual Conference)},
series = {LIPIcs},
volume = {204},
pages = {10:1--10:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ESA.2021.10},
doi = {10.4230/LIPICS.ESA.2021.10},
timestamp = {Tue, 31 Aug 2021 14:18:27 +0200},
biburl = {https://dblp.org/rec/conf/esa/BampisDELMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/EberleMNSW21,
author = {Franziska Eberle and
Nicole Megow and
Lukas N{\"{o}}lke and
Bertrand Simon and
Andreas Wiese},
editor = {Mikolaj Bojanczyk and
Chandra Chekuri},
title = {Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic
Update Time},
booktitle = {41st {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2021, December 15-17, 2021,
Virtual Conference},
series = {LIPIcs},
volume = {213},
pages = {18:1--18:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2021.18},
doi = {10.4230/LIPICS.FSTTCS.2021.18},
timestamp = {Fri, 12 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/EberleMNSW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/EberleHMNSS21,
author = {Franziska Eberle and
Ruben Hoeksma and
Nicole Megow and
Lukas N{\"{o}}lke and
Kevin Schewior and
Bertrand Simon},
editor = {Mohit Singh and
David P. Williamson},
title = {Speed-Robust Scheduling - Sand, Bricks, and Rocks},
booktitle = {Integer Programming and Combinatorial Optimization - 22nd International
Conference, {IPCO} 2021, Atlanta, GA, USA, May 19-21, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12707},
pages = {283--296},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-73879-2\_20},
doi = {10.1007/978-3-030-73879-2\_20},
timestamp = {Fri, 12 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipco/EberleHMNSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-01640,
author = {Alexander Lindermayr and
Nicole Megow and
Bertrand Simon},
title = {Double Coverage with Machine-Learned Advice},
journal = {CoRR},
volume = {abs/2103.01640},
year = {2021},
url = {https://arxiv.org/abs/2103.01640},
eprinttype = {arXiv},
eprint = {2103.01640},
timestamp = {Fri, 12 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-01640.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-00572,
author = {Evripidis Bampis and
Christoph D{\"{u}}rr and
Thomas Erlebach and
Murilo S. de Lima and
Nicole Megow and
Jens Schl{\"{o}}ter},
title = {Orienting (hyper)graphs under explorable stochastic uncertainty},
journal = {CoRR},
volume = {abs/2107.00572},
year = {2021},
url = {https://arxiv.org/abs/2107.00572},
eprinttype = {arXiv},
eprint = {2107.00572},
timestamp = {Wed, 07 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-00572.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-05422,
author = {Franziska Eberle and
Alexander Lindermayr and
Nicole Megow and
Lukas N{\"{o}}lke and
Jens Schl{\"{o}}ter},
title = {Robustification of Online Graph Exploration Methods},
journal = {CoRR},
volume = {abs/2112.05422},
year = {2021},
url = {https://arxiv.org/abs/2112.05422},
eprinttype = {arXiv},
eprint = {2112.05422},
timestamp = {Tue, 14 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-05422.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DurrEMM20,
author = {Christoph D{\"{u}}rr and
Thomas Erlebach and
Nicole Megow and
Julie Mei{\ss}ner},
title = {An Adversarial Model for Scheduling with Testing},
journal = {Algorithmica},
volume = {82},
number = {12},
pages = {3630--3675},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00742-2},
doi = {10.1007/S00453-020-00742-2},
timestamp = {Sat, 07 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DurrEMM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/FockeMM20,
author = {Jacob Focke and
Nicole Megow and
Julie Mei{\ss}ner},
title = {Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments},
journal = {{ACM} J. Exp. Algorithmics},
volume = {25},
pages = {1--20},
year = {2020},
url = {https://doi.org/10.1145/3422371},
doi = {10.1145/3422371},
timestamp = {Thu, 18 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/FockeMM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/ChenEMSS20,
author = {Lin Chen and
Franziska Eberle and
Nicole Megow and
Kevin Schewior and
Clifford Stein},
title = {A general framework for handling commitment in online throughput maximization},
journal = {Math. Program.},
volume = {183},
number = {1},
pages = {215--247},
year = {2020},
url = {https://doi.org/10.1007/s10107-020-01469-2},
doi = {10.1007/S10107-020-01469-2},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/ChenEMSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/MegowN20,
author = {Nicole Megow and
Lukas N{\"{o}}lke},
editor = {Jaroslaw Byrka and
Raghu Meka},
title = {Online Minimum Cost Matching with Recourse on the Line},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2020, August 17-19, 2020, Virtual
Conference},
series = {LIPIcs},
volume = {176},
pages = {37:1--37:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.37},
doi = {10.4230/LIPICS.APPROX/RANDOM.2020.37},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/MegowN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/EberleMS20,
author = {Franziska Eberle and
Nicole Megow and
Kevin Schewior},
editor = {Fabrizio Grandoni and
Grzegorz Herman and
Peter Sanders},
title = {Optimally Handling Commitment Issues in Online Throughput Maximization},
booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September
7-9, 2020, Pisa, Italy (Virtual Conference)},
series = {LIPIcs},
volume = {173},
pages = {41:1--41:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ESA.2020.41},
doi = {10.4230/LIPICS.ESA.2020.41},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/EberleMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hipeac/SimonFMT20,
author = {Bertrand Simon and
Joachim Falk and
Nicole Megow and
J{\"{u}}rgen Teich},
editor = {Marko Bertogna and
Federico Terraneo},
title = {Energy Minimization in {DAG} Scheduling on MPSoCs at Run-Time: Theory
and Practice},
booktitle = {Workshop on Next Generation Real-Time Embedded Systems, NG-RES@HiPEAC
2020, January 21, 2020, Bologna, Italy},
series = {OASIcs},
volume = {77},
pages = {2:1--2:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/OASIcs.NG-RES.2020.2},
doi = {10.4230/OASICS.NG-RES.2020.2},
timestamp = {Fri, 12 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/hipeac/SimonFMT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/Marchetti-Spaccamela20,
author = {Alberto Marchetti{-}Spaccamela and
Nicole Megow and
Jens Schl{\"{o}}ter and
Martin Skutella and
Leen Stougie},
title = {On the Complexity of Conditional {DAG} Scheduling in Multiprocessor
Systems},
booktitle = {2020 {IEEE} International Parallel and Distributed Processing Symposium
(IPDPS), New Orleans, LA, USA, May 18-22, 2020},
pages = {1061--1070},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/IPDPS47924.2020.00112},
doi = {10.1109/IPDPS47924.2020.00112},
timestamp = {Wed, 22 Jul 2020 15:53:25 +0200},
biburl = {https://dblp.org/rec/conf/ipps/Marchetti-Spaccamela20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BohmHMNS20,
author = {Martin B{\"{o}}hm and
Ruben Hoeksma and
Nicole Megow and
Lukas N{\"{o}}lke and
Bertrand Simon},
editor = {Javier Esparza and
Daniel Kr{\'{a}}l'},
title = {Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics},
booktitle = {45th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2020, August 24-28, 2020, Prague, Czech Republic},
series = {LIPIcs},
volume = {170},
pages = {18:1--18:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2020.18},
doi = {10.4230/LIPICS.MFCS.2020.18},
timestamp = {Fri, 12 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/BohmHMNS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/waoa/2019,
editor = {Evripidis Bampis and
Nicole Megow},
title = {Approximation and Online Algorithms - 17th International Workshop,
{WAOA} 2019, Munich, Germany, September 12-13, 2019, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11926},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-39479-0},
doi = {10.1007/978-3-030-39479-0},
isbn = {978-3-030-39478-3},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/2019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-03107,
author = {Nicole Megow and
Lukas N{\"{o}}lke},
title = {Online Minimum Cost Matching on the Line with Recourse},
journal = {CoRR},
volume = {abs/2001.03107},
year = {2020},
url = {http://arxiv.org/abs/2001.03107},
eprinttype = {arXiv},
eprint = {2001.03107},
timestamp = {Mon, 13 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-03107.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-05699,
author = {Martin B{\"{o}}hm and
Ruben Hoeksma and
Nicole Megow and
Lukas N{\"{o}}lke and
Bertrand Simon},
title = {Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics},
journal = {CoRR},
volume = {abs/2003.05699},
year = {2020},
url = {https://arxiv.org/abs/2003.05699},
eprinttype = {arXiv},
eprint = {2003.05699},
timestamp = {Fri, 12 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-05699.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-08415,
author = {Martin B{\"{o}}hm and
Franziska Eberle and
Nicole Megow and
Lukas N{\"{o}}lke and
Jens Schl{\"{o}}ter and
Bertrand Simon and
Andreas Wiese},
title = {Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic
Update Time},
journal = {CoRR},
volume = {abs/2007.08415},
year = {2020},
url = {https://arxiv.org/abs/2007.08415},
eprinttype = {arXiv},
eprint = {2007.08415},
timestamp = {Fri, 12 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-08415.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-05181,
author = {Franziska Eberle and
Ruben Hoeksma and
Nicole Megow and
Lukas N{\"{o}}lke and
Kevin Schewior and
Bertrand Simon},
title = {Speed-Robust Scheduling},
journal = {CoRR},
volume = {abs/2011.05181},
year = {2020},
url = {https://arxiv.org/abs/2011.05181},
eprinttype = {arXiv},
eprint = {2011.05181},
timestamp = {Fri, 12 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-05181.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-07385,
author = {Thomas Erlebach and
Michael Hoffmann and
Murilo S. de Lima and
Nicole Megow and
Jens Schl{\"{o}}ter},
title = {Untrusted Predictions Improve Trustable Query Policies},
journal = {CoRR},
volume = {abs/2011.07385},
year = {2020},
url = {https://arxiv.org/abs/2011.07385},
eprinttype = {arXiv},
eprint = {2011.07385},
timestamp = {Wed, 18 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-07385.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/MegowSS20,
author = {Nicole Megow and
David B. Shmoys and
Ola Svensson},
title = {Scheduling (Dagstuhl Seminar 20081)},
journal = {Dagstuhl Reports},
volume = {10},
number = {2},
pages = {50--75},
year = {2020},
url = {https://doi.org/10.4230/DagRep.10.2.50},
doi = {10.4230/DAGREP.10.2.50},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/MegowSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/darts/ChenHHMB19,
author = {Jian{-}Jia Chen and
Tobias Hahn and
Ruben Hoeksma and
Nicole Megow and
Georg von der Br{\"{u}}ggen},
title = {Scheduling Self-Suspending Tasks: New and Old Results (Artifact)},
journal = {Dagstuhl Artifacts Ser.},
volume = {5},
number = {1},
pages = {06:1--06:3},
year = {2019},
url = {https://doi.org/10.4230/DARTS.5.1.6},
doi = {10.4230/DARTS.5.1.6},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/darts/ChenHHMB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/EberleFMM19,
author = {Franziska Eberle and
Felix A. Fischer and
Jannik Matuschke and
Nicole Megow},
title = {On index policies for stochastic minsum scheduling},
journal = {Oper. Res. Lett.},
volume = {47},
number = {3},
pages = {213--218},
year = {2019},
url = {https://doi.org/10.1016/j.orl.2019.03.007},
doi = {10.1016/J.ORL.2019.03.007},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/EberleFMM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AbedCDGMMRR19,
author = {Fidaa Abed and
Lin Chen and
Yann Disser and
Martin Gro{\ss} and
Nicole Megow and
Julie Mei{\ss}ner and
Alexander T. Richter and
Roman Rischke},
title = {Scheduling maintenance jobs in networks},
journal = {Theor. Comput. Sci.},
volume = {754},
pages = {107--121},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2018.02.020},
doi = {10.1016/J.TCS.2018.02.020},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AbedCDGMMRR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecrts/ChenHHMB19,
author = {Jian{-}Jia Chen and
Tobias Hahn and
Ruben Hoeksma and
Nicole Megow and
Georg von der Br{\"{u}}ggen},
editor = {Sophie Quinton},
title = {Scheduling Self-Suspending Tasks: New and Old Results},
booktitle = {31st Euromicro Conference on Real-Time Systems, {ECRTS} 2019, July
9-12, 2019, Stuttgart, Germany},
series = {LIPIcs},
volume = {133},
pages = {16:1--16:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ECRTS.2019.16},
doi = {10.4230/LIPICS.ECRTS.2019.16},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/ecrts/ChenHHMB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/0009EMSS19,
author = {Lin Chen and
Franziska Eberle and
Nicole Megow and
Kevin Schewior and
Cliff Stein},
editor = {Andrea Lodi and
Viswanath Nagarajan},
title = {A General Framework for Handling Commitment in Online Throughput Maximization},
booktitle = {Integer Programming and Combinatorial Optimization - 20th International
Conference, {IPCO} 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11480},
pages = {141--154},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17953-3\_11},
doi = {10.1007/978-3-030-17953-3\_11},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/0009EMSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1912-09170,
author = {Bertrand Simon and
Joachim Falk and
Nicole Megow and
J{\"{u}}rgen Teich},
title = {Energy Minimization in {DAG} Scheduling on MPSoCs at Run-Time: Theory
and Practice},
journal = {CoRR},
volume = {abs/1912.09170},
year = {2019},
url = {http://arxiv.org/abs/1912.09170},
eprinttype = {arXiv},
eprint = {1912.09170},
timestamp = {Fri, 12 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1912-09170.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1912-10769,
author = {Franziska Eberle and
Nicole Megow and
Kevin Schewior},
title = {Optimally handling commitment issues in online throughput maximization},
journal = {CoRR},
volume = {abs/1912.10769},
year = {2019},
url = {http://arxiv.org/abs/1912.10769},
eprinttype = {arXiv},
eprint = {1912.10769},
timestamp = {Fri, 03 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1912-10769.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/0009MS18,
author = {Lin Chen and
Nicole Megow and
Kevin Schewior},
title = {An O(log m)-Competitive Algorithm for Online Machine Minimization},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {6},
pages = {2057--2077},
year = {2018},
url = {https://doi.org/10.1137/17M116032X},
doi = {10.1137/17M116032X},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/0009MS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/MegowV18,
author = {Nicole Megow and
Jos{\'{e}} Verschae},
title = {Dual Techniques for Scheduling on a Machine with Varying Speed},
journal = {{SIAM} J. Discret. Math.},
volume = {32},
number = {3},
pages = {1541--1571},
year = {2018},
url = {https://doi.org/10.1137/16M105589X},
doi = {10.1137/16M105589X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/MegowV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/DurrEMM18,
author = {Christoph D{\"{u}}rr and
Thomas Erlebach and
Nicole Megow and
Julie Mei{\ss}ner},
editor = {Anna R. Karlin},
title = {Scheduling with Explorable Uncertainty},
booktitle = {9th Innovations in Theoretical Computer Science Conference, {ITCS}
2018, January 11-14, 2018, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {94},
pages = {30:1--30:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2018.30},
doi = {10.4230/LIPICS.ITCS.2018.30},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/innovations/DurrEMM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-08238,
author = {Lin Chen and
Franziska Eberle and
Nicole Megow and
Kevin Schewior and
Cliff Stein},
title = {A general framework for handling commitment in online throughput maximization},
journal = {CoRR},
volume = {abs/1811.08238},
year = {2018},
url = {http://arxiv.org/abs/1811.08238},
eprinttype = {arXiv},
eprint = {1811.08238},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-08238.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-12657,
author = {Lin Chen and
Nicole Megow and
Roman Rischke and
Leen Stougie and
Jos{\'{e}} Verschae},
title = {Optimal Algorithms for Scheduling under Time-of-Use Tariffs},
journal = {CoRR},
volume = {abs/1811.12657},
year = {2018},
url = {http://arxiv.org/abs/1811.12657},
eprinttype = {arXiv},
eprint = {1811.12657},
timestamp = {Mon, 03 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-12657.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/HalldorssonMS18,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Nicole Megow and
Clifford Stein},
title = {Scheduling (Dagstuhl Seminar 18101)},
journal = {Dagstuhl Reports},
volume = {8},
number = {3},
pages = {1--20},
year = {2018},
url = {https://doi.org/10.4230/DagRep.8.3.1},
doi = {10.4230/DAGREP.8.3.1},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/HalldorssonMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MegowMS17,
author = {Nicole Megow and
Julie Mei{\ss}ner and
Martin Skutella},
title = {Randomization Helps Computing a Minimum Spanning Tree under Uncertainty},
journal = {{SIAM} J. Comput.},
volume = {46},
number = {4},
pages = {1217--1240},
year = {2017},
url = {https://doi.org/10.1137/16M1088375},
doi = {10.1137/16M1088375},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/MegowMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DisserKMS17,
author = {Yann Disser and
Max Klimm and
Nicole Megow and
Sebastian Stiller},
title = {Packing a Knapsack of Unknown Capacity},
journal = {{SIAM} J. Discret. Math.},
volume = {31},
number = {3},
pages = {1477--1497},
year = {2017},
url = {https://doi.org/10.1137/16M1070049},
doi = {10.1137/16M1070049},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DisserKMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Abed0DGMMRR17,
author = {Fidaa Abed and
Lin Chen and
Yann Disser and
Martin Gro{\ss} and
Nicole Megow and
Julie Mei{\ss}ner and
Alexander T. Richter and
Roman Rischke},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Scheduling Maintenance Jobs in Networks},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {19--30},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_3},
doi = {10.1007/978-3-319-57586-5\_3},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/Abed0DGMMRR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/FockeMM17,
author = {Jacob Focke and
Nicole Megow and
Julie Mei{\ss}ner},
editor = {Costas S. Iliopoulos and
Solon P. Pissis and
Simon J. Puglisi and
Rajeev Raman},
title = {Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments},
booktitle = {16th International Symposium on Experimental Algorithms, {SEA} 2017,
June 21-23, 2017, London, {UK}},
series = {LIPIcs},
volume = {75},
pages = {22:1--22:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.SEA.2017.22},
doi = {10.4230/LIPICS.SEA.2017.22},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/wea/FockeMM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Abed0DGMMRR17,
author = {Fidaa Abed and
Lin Chen and
Yann Disser and
Martin Gro{\ss} and
Nicole Megow and
Julie Mei{\ss}ner and
Alexander T. Richter and
Roman Rischke},
title = {Scheduling Maintenance Jobs in Networks},
journal = {CoRR},
volume = {abs/1701.08809},
year = {2017},
url = {http://arxiv.org/abs/1701.08809},
eprinttype = {arXiv},
eprint = {1701.08809},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Abed0DGMMRR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-02592,
author = {Christoph D{\"{u}}rr and
Thomas Erlebach and
Nicole Megow and
Julie Mei{\ss}ner},
title = {Scheduling with Explorable Uncertainty},
journal = {CoRR},
volume = {abs/1709.02592},
year = {2017},
url = {http://arxiv.org/abs/1709.02592},
eprinttype = {arXiv},
eprint = {1709.02592},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-02592.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MegowSVW16,
author = {Nicole Megow and
Martin Skutella and
Jos{\'{e}} Verschae and
Andreas Wiese},
title = {The Power of Recourse for Online {MST} and {TSP}},
journal = {{SIAM} J. Comput.},
volume = {45},
number = {3},
pages = {859--880},
year = {2016},
url = {https://doi.org/10.1137/130917703},
doi = {10.1137/130917703},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MegowSVW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/LubbeckeMMW16,
author = {Elisabeth L{\"{u}}bbecke and
Olaf Maurer and
Nicole Megow and
Andreas Wiese},
title = {A New Approach to Online Scheduling: Approximating the Optimal Competitive
Ratio},
journal = {{ACM} Trans. Algorithms},
volume = {13},
number = {1},
pages = {15:1--15:34},
year = {2016},
url = {https://doi.org/10.1145/2996800},
doi = {10.1145/2996800},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/LubbeckeMMW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/MegowW16,
author = {Nicole Megow and
Mary Wootters},
title = {Special Issue: {APPROX-RANDOM} 2015: Guest Editors' Foreword},
journal = {Theory Comput.},
volume = {12},
number = {1},
pages = {1--3},
year = {2016},
url = {https://doi.org/10.4086/toc.2016.v012a013},
doi = {10.4086/TOC.2016.V012A013},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/MegowW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChenMS16,
author = {Lin Chen and
Nicole Megow and
Kevin Schewior},
editor = {Robert Krauthgamer},
title = {An O(log \emph{m})-Competitive Algorithm for Online Machine Minimization},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {155--163},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch12},
doi = {10.1137/1.9781611974331.CH12},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChenMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/0009MS16,
author = {Lin Chen and
Nicole Megow and
Kevin Schewior},
editor = {Christian Scheideler and
Seth Gilbert},
title = {The Power of Migration in Online Machine Minimization},
booktitle = {Proceedings of the 28th {ACM} Symposium on Parallelism in Algorithms
and Architectures, {SPAA} 2016, Asilomar State Beach/Pacific Grove,
CA, USA, July 11-13, 2016},
pages = {175--184},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2935764.2935786},
doi = {10.1145/2935764.2935786},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spaa/0009MS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/MestreM16,
author = {Juli{\'{a}}n Mestre and
Nicole Megow},
title = {Universal Sequencing on an Unreliable Machine},
booktitle = {Encyclopedia of Algorithms},
pages = {2304--2308},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_543},
doi = {10.1007/978-1-4939-2864-4\_543},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/MestreM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/BansalMS16,
author = {Nikhil Bansal and
Nicole Megow and
Clifford Stein},
title = {Scheduling (Dagstuhl Seminar 16081)},
journal = {Dagstuhl Reports},
volume = {6},
number = {2},
pages = {97--118},
year = {2016},
url = {https://doi.org/10.4230/DagRep.6.2.97},
doi = {10.4230/DAGREP.6.2.97},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BansalMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/CorreaM15,
author = {Jos{\'{e}} R. Correa and
Nicole Megow},
title = {Clique partitioning with value-monotone submodular cost},
journal = {Discret. Optim.},
volume = {15},
pages = {26--36},
year = {2015},
url = {https://doi.org/10.1016/j.disopt.2014.11.001},
doi = {10.1016/J.DISOPT.2014.11.001},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/CorreaM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChenMRS15,
author = {Lin Chen and
Nicole Megow and
Roman Rischke and
Leen Stougie},
editor = {Naveen Garg and
Klaus Jansen and
Anup Rao and
Jos{\'{e}} D. P. Rolim},
title = {Stochastic and Robust Scheduling in the Cloud},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {40},
pages = {175--186},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.175},
doi = {10.4230/LIPICS.APPROX-RANDOM.2015.175},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/ChenMRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/MegowMS15,
author = {Nicole Megow and
Julie Mei{\ss}ner and
Martin Skutella},
editor = {Nikhil Bansal and
Irene Finocchi},
title = {Randomization Helps Computing a Minimum Spanning Tree under Uncertainty},
booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
Greece, September 14-16, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9294},
pages = {878--890},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48350-3\_73},
doi = {10.1007/978-3-662-48350-3\_73},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/esa/MegowMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ChenMRSV15,
author = {Lin Chen and
Nicole Megow and
Roman Rischke and
Leen Stougie and
Jos{\'{e}} Verschae},
editor = {Giuseppe F. Italiano and
Giovanni Pighizzini and
Donald Sannella},
title = {Optimal Algorithms and a {PTAS} for Cost-Aware Scheduling},
booktitle = {Mathematical Foundations of Computer Science 2015 - 40th International
Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {9235},
pages = {211--222},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48054-0\_18},
doi = {10.1007/978-3-662-48054-0\_18},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/ChenMRSV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/15/Megow15,
author = {Nicole Megow},
editor = {Andreas S. Schulz and
Martin Skutella and
Sebastian Stiller and
Dorothea Wagner},
title = {Robustness and Approximation for Universal Sequencing},
booktitle = {Gems of Combinatorial Optimization and Graph Algorithms},
pages = {133--141},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-24971-1\_13},
doi = {10.1007/978-3-319-24971-1\_13},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/sp/15/Megow15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChenMS15a,
author = {Lin Chen and
Nicole Megow and
Kevin Schewior},
title = {An O(m{\^{}}2 log m)-Competitive Algorithm for Online Machine Minimization},
journal = {CoRR},
volume = {abs/1506.05721},
year = {2015},
url = {http://arxiv.org/abs/1506.05721},
eprinttype = {arXiv},
eprint = {1506.05721},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChenMS15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GuntherKM14,
author = {Elisabeth G{\"{u}}nther and
Felix G. K{\"{o}}nig and
Nicole Megow},
title = {Scheduling and packing malleable and parallel tasks with precedence
constraints of bounded width},
journal = {J. Comb. Optim.},
volume = {27},
number = {1},
pages = {164--181},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9498-3},
doi = {10.1007/S10878-012-9498-3},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/GuntherKM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/MegowV14,
author = {Nicole Megow and
Tjark Vredeveld},
title = {A Tight 2-Approximation for Preemptive Stochastic Scheduling},
journal = {Math. Oper. Res.},
volume = {39},
number = {4},
pages = {1297--1310},
year = {2014},
url = {https://doi.org/10.1287/moor.2014.0653},
doi = {10.1287/MOOR.2014.0653},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/MegowV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DisserKMS14,
author = {Yann Disser and
Max Klimm and
Nicole Megow and
Sebastian Stiller},
editor = {Ernst W. Mayr and
Natacha Portier},
title = {Packing a Knapsack of Unknown Capacity},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science
{(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France},
series = {LIPIcs},
volume = {25},
pages = {276--287},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.STACS.2014.276},
doi = {10.4230/LIPICS.STACS.2014.276},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/DisserKMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChenMMS14,
author = {Lin Chen and
Nicole Megow and
Kevin Schewior},
title = {New Results on Online Resource Minimization},
journal = {CoRR},
volume = {abs/1407.7998},
year = {2014},
url = {http://arxiv.org/abs/1407.7998},
eprinttype = {arXiv},
eprint = {1407.7998},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChenMMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MegowV13,
author = {Nicole Megow and
Jos{\'{e}} Verschae},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {Dual Techniques for Scheduling on a Machine with Varying Speed},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7965},
pages = {745--756},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39206-1\_63},
doi = {10.1007/978-3-642-39206-1\_63},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/MegowV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/MegowM13,
author = {Nicole Megow and
Juli{\'{a}}n Mestre},
editor = {Robert D. Kleinberg},
title = {Instance-sensitive robustness guarantees for sequencing with unknown
packing and covering constraints},
booktitle = {Innovations in Theoretical Computer Science, {ITCS} '13, Berkeley,
CA, USA, January 9-12, 2013},
pages = {495--504},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2422436.2422490},
doi = {10.1145/2422436.2422490},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/MegowM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rtss/BonifaciMMW13,
author = {Vincenzo Bonifaci and
Alberto Marchetti{-}Spaccamela and
Nicole Megow and
Andreas Wiese},
title = {Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time
Tasks},
booktitle = {Proceedings of the {IEEE} 34th Real-Time Systems Symposium, {RTSS}
2013, Vancouver, BC, Canada, December 3-6, 2013},
pages = {236--245},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/RTSS.2013.31},
doi = {10.1109/RTSS.2013.31},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/rtss/BonifaciMMW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuntherMMW13,
author = {Elisabeth G{\"{u}}nther and
Olaf Maurer and
Nicole Megow and
Andreas Wiese},
editor = {Sanjeev Khanna},
title = {A New Approach to Online Scheduling: Approximating the Optimal Competitive
Ratio},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
2013},
pages = {118--128},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105.9},
doi = {10.1137/1.9781611973105.9},
timestamp = {Tue, 02 Feb 2021 17:07:29 +0100},
biburl = {https://dblp.org/rec/conf/soda/GuntherMMW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1303-1912,
author = {Nicole Megow and
Andreas Wiese},
title = {Competitive-Ratio Approximation Schemes for Minimizing the Makespan
in the Online-List Model},
journal = {CoRR},
volume = {abs/1303.1912},
year = {2013},
url = {http://arxiv.org/abs/1303.1912},
eprinttype = {arXiv},
eprint = {1303.1912},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1303-1912.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DisserKMS13,
author = {Yann Disser and
Max Klimm and
Nicole Megow and
Sebastian Stiller},
title = {Packing a Knapsack of Unknown Capacity},
journal = {CoRR},
volume = {abs/1307.2806},
year = {2013},
url = {http://arxiv.org/abs/1307.2806},
eprinttype = {arXiv},
eprint = {1307.2806},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DisserKMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/HohnJM12,
author = {Wiebke H{\"{o}}hn and
Tobias Jacobs and
Nicole Megow},
title = {On Eulerian extensions and their application to no-wait flowshop scheduling},
journal = {J. Sched.},
volume = {15},
number = {3},
pages = {295--309},
year = {2012},
url = {https://doi.org/10.1007/s10951-011-0241-1},
doi = {10.1007/S10951-011-0241-1},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/HohnJM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EpsteinLMMMSS12,
author = {Leah Epstein and
Asaf Levin and
Alberto Marchetti{-}Spaccamela and
Nicole Megow and
Juli{\'{a}}n Mestre and
Martin Skutella and
Leen Stougie},
title = {Universal Sequencing on an Unreliable Machine},
journal = {{SIAM} J. Comput.},
volume = {41},
number = {3},
pages = {565--586},
year = {2012},
url = {https://doi.org/10.1137/110844210},
doi = {10.1137/110844210},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/EpsteinLMMMSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BonifaciCMM12,
author = {Vincenzo Bonifaci and
Ho{-}Leung Chan and
Alberto Marchetti{-}Spaccamela and
Nicole Megow},
title = {Algorithms and complexity for periodic real-time scheduling},
journal = {{ACM} Trans. Algorithms},
volume = {9},
number = {1},
pages = {6:1--6:19},
year = {2012},
url = {https://doi.org/10.1145/2390176.2390182},
doi = {10.1145/2390176.2390182},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BonifaciCMM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/BaruahBDLMMS12,
author = {Sanjoy K. Baruah and
Vincenzo Bonifaci and
Gianlorenzo D'Angelo and
Haohan Li and
Alberto Marchetti{-}Spaccamela and
Nicole Megow and
Leen Stougie},
title = {Scheduling Real-Time Mixed-Criticality Jobs},
journal = {{IEEE} Trans. Computers},
volume = {61},
number = {8},
pages = {1140--1152},
year = {2012},
url = {https://doi.org/10.1109/TC.2011.142},
doi = {10.1109/TC.2011.142},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tc/BaruahBDLMMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChanMSS12,
author = {Ho{-}Leung Chan and
Nicole Megow and
Ren{\'{e}} Sitters and
Rob van Stee},
title = {A note on sorting buffers offline},
journal = {Theor. Comput. Sci.},
volume = {423},
pages = {11--18},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2011.12.077},
doi = {10.1016/J.TCS.2011.12.077},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChanMSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MegowMS12,
author = {Nicole Megow and
Kurt Mehlhorn and
Pascal Schweitzer},
title = {Online graph exploration: New results on old and new algorithms},
journal = {Theor. Comput. Sci.},
volume = {463},
pages = {62--72},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2012.06.034},
doi = {10.1016/J.TCS.2012.06.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MegowMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MegowSVW12,
author = {Nicole Megow and
Martin Skutella and
Jos{\'{e}} Verschae and
Andreas Wiese},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {The Power of Recourse for Online {MST} and {TSP}},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7391},
pages = {689--700},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_58},
doi = {10.1007/978-3-642-31594-7\_58},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/MegowSVW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-0897,
author = {Elisabeth G{\"{u}}nther and
Olaf Maurer and
Nicole Megow and
Andreas Wiese},
title = {A New Approach to Online Scheduling: Approximating the Optimal Competitive
Ratio},
journal = {CoRR},
volume = {abs/1204.0897},
year = {2012},
url = {http://arxiv.org/abs/1204.0897},
eprinttype = {arXiv},
eprint = {1204.0897},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-0897.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-6216,
author = {Nicole Megow and
Jos{\'{e}} Verschae},
title = {Scheduling on a machine with varying speed: Minimizing cost and energy
via dual schedules},
journal = {CoRR},
volume = {abs/1211.6216},
year = {2012},
url = {http://arxiv.org/abs/1211.6216},
eprinttype = {arXiv},
eprint = {1211.6216},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-6216.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/MegowMS11,
author = {Nicole Megow and
Rolf H. M{\"{o}}hring and
Jens Schulz},
title = {Decision Support and Optimization in Shutdown and Turnaround Scheduling},
journal = {{INFORMS} J. Comput.},
volume = {23},
number = {2},
pages = {189--204},
year = {2011},
url = {https://doi.org/10.1287/ijoc.1100.0393},
doi = {10.1287/IJOC.1100.0393},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/MegowMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AnandGM11,
author = {S. Anand and
Naveen Garg and
Nicole Megow},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Meeting Deadlines: How Much Speed Suffices?},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6755},
pages = {232--243},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7\_20},
doi = {10.1007/978-3-642-22006-7\_20},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AnandGM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MegowMS11,
author = {Nicole Megow and
Kurt Mehlhorn and
Pascal Schweitzer},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Online Graph Exploration: New Results on Old and New Algorithms},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {6756},
pages = {478--489},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22012-8\_38},
doi = {10.1007/978-3-642-22012-8\_38},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/MegowMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/EpsteinLMMMSS10,
author = {Leah Epstein and
Asaf Levin and
Alberto Marchetti{-}Spaccamela and
Nicole Megow and
Juli{\'{a}}n Mestre and
Martin Skutella and
Leen Stougie},
editor = {Friedrich Eisenbrand and
F. Bruce Shepherd},
title = {Universal Sequencing on a Single Machine},
booktitle = {Integer Programming and Combinatorial Optimization, 14th International
Conference, {IPCO} 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6080},
pages = {230--243},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13036-6\_18},
doi = {10.1007/978-3-642-13036-6\_18},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/EpsteinLMMMSS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BaruahBDLMMS10,
author = {Sanjoy K. Baruah and
Vincenzo Bonifaci and
Gianlorenzo D'Angelo and
Haohan Li and
Alberto Marchetti{-}Spaccamela and
Nicole Megow and
Leen Stougie},
editor = {Petr Hlinen{\'{y}} and
Anton{\'{\i}}n Kucera},
title = {Scheduling Real-Time Mixed-Criticality Jobs},
booktitle = {Mathematical Foundations of Computer Science 2010, 35th International
Symposium, {MFCS} 2010, Brno, Czech Republic, August 23-27, 2010.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6281},
pages = {90--101},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15155-2\_10},
doi = {10.1007/978-3-642-15155-2\_10},
timestamp = {Fri, 30 Aug 2019 10:02:28 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BaruahBDLMMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BonifaciCMM10,
author = {Vincenzo Bonifaci and
Ho{-}Leung Chan and
Alberto Marchetti{-}Spaccamela and
Nicole Megow},
editor = {Moses Charikar},
title = {Algorithms and Complexity for Periodic Real-Time Scheduling},
booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
pages = {1350--1359},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.109},
doi = {10.1137/1.9781611973075.109},
timestamp = {Tue, 02 Feb 2021 17:07:39 +0100},
biburl = {https://dblp.org/rec/conf/soda/BonifaciCMM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-4355,
author = {Ho{-}Leung Chan and
Nicole Megow and
Rob van Stee and
Ren{\'{e}} Sitters},
title = {The Sorting Buffer Problem is NP-hard},
journal = {CoRR},
volume = {abs/1009.4355},
year = {2010},
url = {http://arxiv.org/abs/1009.4355},
eprinttype = {arXiv},
eprint = {1009.4355},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1009-4355.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/CorreaMRS09,
author = {Jos{\'{e}} R. Correa and
Nicole Megow and
Rajiv Raman and
Karol Suchan},
editor = {Sonia Cafieri and
Antonio Mucherino and
Giacomo Nannicini and
Fabien Tarissan and
Leo Liberti},
title = {Cardinality Constrained Graph Partitioning into Cliques with Submodular
Costs},
booktitle = {Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial
Optimization, {CTW} 2009, Paris, France, June 2-4 2009},
pages = {347--350},
year = {2009},
url = {http://www.lix.polytechnique.fr/ctw09/ctw09-proceedings.pdf\#page=359},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colognetwente/CorreaMRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/GuntherKM09,
author = {Elisabeth G{\"{u}}nther and
Felix G. K{\"{o}}nig and
Nicole Megow},
editor = {Evripidis Bampis and
Klaus Jansen},
title = {Scheduling and Packing Malleable Tasks with Precedence Constraints
of Bounded Width},
booktitle = {Approximation and Online Algorithms, 7th International Workshop, {WAOA}
2009, Copenhagen, Denmark, September 10-11, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5893},
pages = {170--181},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-12450-1\_16},
doi = {10.1007/978-3-642-12450-1\_16},
timestamp = {Thu, 23 Sep 2021 11:48:40 +0200},
biburl = {https://dblp.org/rec/conf/waoa/GuntherKM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ors/FroylandKMDW08,
author = {Gary Froyland and
Thorsten Koch and
Nicole Megow and
Emily Duane and
Howard Wren},
title = {Optimizing the landside operation of a container terminal},
journal = {{OR} Spectr.},
volume = {30},
number = {1},
pages = {53--75},
year = {2008},
url = {https://doi.org/10.1007/s00291-007-0082-7},
doi = {10.1007/S00291-007-0082-7},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ors/FroylandKMDW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/or/Megow07,
author = {Nicole Megow},
editor = {J{\"{o}}rg Kalcsics and
Stefan Nickel},
title = {Coping with Incomplete Information in Scheduling - Stochastic and
Online Models},
booktitle = {Operations Research, Proceedings 2007, Selected Papers of the Annual
International Conference of the German Operations Research Society
(GOR), Saarbr{\"{u}}cken, Germany, September 5-7, 2007},
series = {Operations Research Proceedings},
pages = {17--22},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77903-2\_3},
doi = {10.1007/978-3-540-77903-2\_3},
timestamp = {Fri, 28 Jun 2019 11:06:19 +0200},
biburl = {https://dblp.org/rec/conf/or/Megow07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/MegowUV06,
author = {Nicole Megow and
Marc Uetz and
Tjark Vredeveld},
title = {Models and Algorithms for Stochastic Online Scheduling},
journal = {Math. Oper. Res.},
volume = {31},
number = {3},
pages = {513--525},
year = {2006},
url = {https://doi.org/10.1287/moor.1060.0201},
doi = {10.1287/MOOR.1060.0201},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/MegowUV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GutierrezKMV06,
author = {Sandra Guti{\'{e}}rrez and
Sven Oliver Krumke and
Nicole Megow and
Tjark Vredeveld},
title = {How to whack moles},
journal = {Theor. Comput. Sci.},
volume = {361},
number = {2-3},
pages = {329--341},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2006.05.017},
doi = {10.1016/J.TCS.2006.05.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GutierrezKMV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/MegowV06,
author = {Nicole Megow and
Tjark Vredeveld},
editor = {Yossi Azar and
Thomas Erlebach},
title = {Approximation in Preemptive Stochastic Online Scheduling},
booktitle = {Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland,
September 11-13, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4168},
pages = {516--527},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11841036\_47},
doi = {10.1007/11841036\_47},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/MegowV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/HeinzKMRTV05,
author = {Stefan Heinz and
Sven Oliver Krumke and
Nicole Megow and
J{\"{o}}rg Rambau and
Andreas Tuchscherer and
Tjark Vredeveld},
editor = {Thomas Erlebach and
Giuseppe Persiano},
title = {The Online Target Date Assignment Problem},
booktitle = {Approximation and Online Algorithms, Third International Workshop,
{WAOA} 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {3879},
pages = {230--243},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11671411\_18},
doi = {10.1007/11671411\_18},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/HeinzKMRTV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/MegowUV05,
author = {Nicole Megow and
Marc Uetz and
Tjark Vredeveld},
editor = {Susanne Albers and
Rolf H. M{\"{o}}hring and
Georg Ch. Pflug and
R{\"{u}}diger Schultz},
title = {Models and Algorithms for Stochastic Online Scheduling},
booktitle = {Algorithms for Optimization with Incomplete Information, 16.-21. January
2005},
series = {Dagstuhl Seminar Proceedings},
volume = {05031},
publisher = {IBFI, Schloss Dagstuhl, Germany},
year = {2005},
url = {http://drops.dagstuhl.de/opus/volltexte/2005/110},
timestamp = {Thu, 10 Jun 2021 13:02:06 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/MegowUV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/MegowS04,
author = {Nicole Megow and
Andreas S. Schulz},
title = {On-line scheduling to minimize average completion time revisited},
journal = {Oper. Res. Lett.},
volume = {32},
number = {5},
pages = {485--490},
year = {2004},
url = {https://doi.org/10.1016/j.orl.2003.11.008},
doi = {10.1016/J.ORL.2003.11.008},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/MegowS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/MegowUV04,
author = {Nicole Megow and
Marc Uetz and
Tjark Vredeveld},
editor = {Giuseppe Persiano and
Roberto Solis{-}Oba},
title = {Stochastic Online Scheduling on Parallel Machines},
booktitle = {Approximation and Online Algorithms, Second International Workshop,
{WAOA} 2004, Bergen, Norway, September 14-16, 2004, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {3351},
pages = {167--180},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/11389811\_15},
doi = {10.1007/11389811\_15},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/MegowUV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/KrumkeMV03,
author = {Sven Oliver Krumke and
Nicole Megow and
Tjark Vredeveld},
editor = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {How to Whack Moles},
booktitle = {Approximation and Online Algorithms, First International Workshop,
{WAOA} 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2909},
pages = {192--205},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24592-6\_15},
doi = {10.1007/978-3-540-24592-6\_15},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/KrumkeMV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/MegowS03,
author = {Nicole Megow and
Andreas S. Schulz},
editor = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {Scheduling to Minimize Average Completion Time Revisited: Deterministic
On-Line Algorithms},
booktitle = {Approximation and Online Algorithms, First International Workshop,
{WAOA} 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2909},
pages = {227--234},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24592-6\_18},
doi = {10.1007/978-3-540-24592-6\_18},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/MegowS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
