60 https://www.uni-bremen.de/en/cslog/publications This is the homepage of the working group CSLog - "Informatikmethoden zur adaptiven Steuerung in Logistik und Produktion" lead by Prof. Dr. Nicole Negow. en University of Bremen Fri, 17 Apr 2026 21:43:11 +0200 Fri, 17 Apr 2026 21:43:11 +0200 University of Bremen content-698860 Fri, 20 Mar 2026 07:30:40 +0100 https://www.uni-bremen.de/en/cslog/publications#c698860 <p><strong>The Power of Proportional Fairness for Nonclairvoyant Polytope Scheduling </strong> <a class="external-link" href="https://arxiv.org/abs/2408.14310" target="_blank">arxiv.org</a><strong> </strong> <a class="external-link" href="https://epubs.siam.org/doi/10.1137/25M1763974" target="_blank">DOI</a><br />Sven Jäger, Alexander Lindermayr, Nicole Megow<br />SIAM J. Comput. 55(2): 247-279 (2026)</p> <p><strong>Polytope Scheduling with Groups: Unified Models and Optimal Guarantees </strong><a class="external-link" href="https://arxiv.org/abs/2501.17682" target="_blank">arxiv.org</a><br />Alexander Lindermayr, Zhenwei Liu, Nicole Megow<br />IPCO 2026</p> <p><strong>A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm </strong><a class="external-link" href="https://arxiv.org/abs/2509.04654v2" title="Opens external link in new window" target="_blank" rel="noreferrer">arxiv.org</a><br />Stefan Hougardy, Bart Zondervan<br />STACS 2026</p> <p><strong>Optimal Verification of a Minimum-Weight Basis in an Uncertainty Matroid</strong> <a class="external-link" href="https://doi.org/10.4230/LIPIcs.STACS.2026.32" target="_blank">DOI</a><br />Haya Diwan, Lisa Hellerstein, Nicole Megow, Jens Schlöter<br />STACS 2026</p> <p><strong>On solution discovery via reconfiguration </strong><a class="external-link" href="https://doi.org/10.1016/j.jcss.2025.103747" target="_blank">DOI</a><br />Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz<br />Journal of Computer and System Sciences, Vol. 157, 2026</p> Content content-629362 Mon, 29 Dec 2025 08:37:44 +0100 https://www.uni-bremen.de/en/cslog/publications#c629362 <p><strong>Fast Combinatorial Algorithms for Efficient Sortation </strong> <a href="https://arxiv.org/abs/2311.05094" title="Opens external link in new window" target="_blank">arxiv.org</a> <a class="external-link" href="https://link.springer.com/article/10.1007/s10107-025-02239-8" title="Opens external link in new window" target="_blank">DOI</a><br />Madison Van Dyk, Jochen Koenemann, Nicole Megow, Kim Klause<br />Mathematical Programming 2025</p> <p><strong>Boosting Double Coverage for k-Server via Imperfect Predictions </strong> <a class="external-link" href="https://doi.org/10.1007/s00453-025-01333-9" title="Opens external link in new window" target="_blank">DOI</a><br />Alexander Lindermayr, Nicole Megow, Bertrand Simon<br />Algorithmica 87: 1477–1517, 2025</p> <p><strong>A Little Clairvoyance Is All You Need</strong><br />Anupam Gupta, Haim Kaplan, Alexander Lindermayr, Jens Schlöter, Sorrachai Yingchareonthawornchai<br />FOCS 2025</p> <p><strong>Configuration Balancing for Stochastic Requests  </strong><a href="https://arxiv.org/pdf/2208.13702.pdf" title="Öffnet externen Link in neuem Fenster" target="_blank">arxiv</a>  <a class="externalLink" href="https://doi.org/10.1007/s10107-024-02132-w" title="Opens external link in new window" target="_blank">DOI</a><br />Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley, Rudy Zhou <br />Mathematical Programming 210, 243–279 (2025)</p> <p><strong>Permutation Predictions for Non-Clairvoyant Scheduling</strong> <a href="https://dl.acm.org/doi/10.1145/3711872" title="Opens external link in new window" target="_blank">DOI</a><br />Alexander Lindermayr, Nicole Megow<br />ACM Transactions on Parallel Processing 12(2): 4:1-4:26 (2025)</p> <p><strong>Online Metric Matching on the Line with Recourse </strong><a class="externalLink" href="https://doi.org/10.1007/s00453-025-01299-8" title="Opens external link in new window" target="_blank">doi</a><br />Nicole Megow, Lukas Nölke<br />Algorithmica 87: 813–841, 2025</p> <p><strong>A 5/4-Approximation for Two-Edge Connectivity</strong><br />Miguel Bosch-Calvo, Mohit Garg, Fabrizio Grandoni, Felix Hommelsheim, Afrouz Jabal Ameli, Alexander Lindermayr<br />STOC 2025</p> <p><strong>Protecting the Connectivity of a Graph under Non-uniform Edge Failures </strong><a class="externalLink" href="https://arxiv.org/abs/2501.04540" title="Opens external link in new window" target="_blank">arxiv.org</a> <a class="externalLink" href="https://doi.org/10.4230/LIPIcs.STACS.2025.51" title="Opens external link in new window" target="_blank">doi</a><br />Felix Hommelsheim, Zhenwei Liu, Nicole Megow, Guochuan Zhang<br />STACS 2025</p> <p><strong>The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints  </strong><a href="https://arxiv.org/abs/2408.14310" title="Opens external link in new window" target="_blank" rel="noreferrer">arxiv.org</a> <a class="externalLink" href="https://doi.org/10.1137/1.9781611978322.132" title="Opens external link in new window" target="_blank">doi</a><br />Sven Jäger, Alexander Lindermayr, Nicole Megow<br />SODA 2025<br /><br /><strong>A Tight (3/2 + ε)-Approximation Algorithm for Demand Strip Packing  </strong><a class="externalLink" href="https://arxiv.org/abs/2408.08627" title="Opens external link in new window" target="_blank">arxiv.org</a> <br />Franziska Eberle, Felix Hommelsheim, Malin Rau, Stefan Walzer<br />SODA 2025.</p> Content content-555819 Tue, 16 Dec 2025 10:00:36 +0100 https://www.uni-bremen.de/en/cslog/publications#c555819 <p><strong>Accelerating Matroid Optimization through Fast Imprecise Oracles</strong>  <a href="https://arxiv.org/abs/2402.02774" title="Opens external link in new window" target="_blank">arxiv.org</a> <br />Franziska Eberle, Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu, Nicole Megow, Jens Schlöter<br />NeurIPS 2024</p> <p><strong>The Safe and Effective Use of Optimistic Period Predictions</strong><br />Sanjoy Baruah, Pontus Ekberg, Alexander Lindermayr, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie<br />RTNS 2024</p> <p><strong>Competitive Query Minimization for Stable Matching with One-Sided Uncertainty</strong>, <a href="https://arxiv.org/abs/2407.10170" title="Opens external link in new window" target="_blank">arxiv.org</a><br />Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, Amitabh Trehan<br />APPROX 2024</p> <p><strong>Solution discovery via reconfiguration for problems in P</strong><br /><a href="https://arxiv.org/abs/2304.14295" title="Opens external link in new window" target="_blank">arxiv.org</a>, <a href="https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.76" title="Opens external link in new window" target="_blank">LIPIcs</a><br />Mario Grobler, Stephanie Maaz, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Daniel Schmand, Sebastian Siebertz<br />ICALP 2024</p> <p><strong>The Bottom-Left Algorithm for the Strip Packing Problem </strong> <a class="externalLink" href="https://arxiv.org/pdf/2402.16572" title="Opens external link in new window" target="_blank">arxiv.org</a><br />Bart Zondervan, Stefan Hougardy<br />IWOCA 2024</p> <p><strong>Fast Combinatorial Algorithms for Efficient Sortation </strong> <a class="externalLink" href="https://arxiv.org/abs/2311.05094" title="Opens external link in new window" target="_blank">arxiv.org</a><br />Madison Van Dyk, Jochen Koenemann, Nicole Megow, Kim Klause<br />IPCO 2024</p> <p><strong>Santa Claus meets Makespan and Matroids: Algorithms and Reductions</strong>  <a href="https://arxiv.org/abs/2307.08453" title="Opens external link in new window" target="_blank">arxiv.org</a> <br />Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter<br />SODA 2024</p> Content content-484860 Thu, 02 Nov 2023 14:06:16 +0100 https://www.uni-bremen.de/en/cslog/publications#c484860 <p><strong>On Solution Discovery via Reconfiguration </strong><a class="externalLink" href="https://arxiv.org/abs/2304.14295" target="_blank" title="Opens external link in new window">arxiv.org</a>  <a class="externalLink" href="https://doi.org/10.3233/FAIA230334" target="_blank" title="Opens external link in new window">DOI</a><br /> Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz<br /> ECAI 2023: 700-707.</p> <p><strong>Improved Approximation Algorithms for the Expanding Search Problem </strong><a class="externalLink" href="https://arxiv.org/pdf/2301.03638.pdf" target="_blank" title="Opens external link in new window">arxiv.org</a>  <a class="externalLink" href="https://doi.org/10.4230/LIPIcs.ESA.2023.54" target="_blank" title="Opens external link in new window">DOI</a><br /> Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior<br /> ESA 2023: 54:1-54:15.</p> <p><strong>Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary</strong>  <a href="https://arxiv.org/abs/2302.00985" target="_blank" title="Opens external link in new window">arxiv.org</a>  <a class="externalLink" href="https://doi.org/10.1007/978-3-031-32726-1\_23" target="_blank" title="Opens external link in new window">DOI</a><br /> Alexander Lindermayr, Nicole Megow, Martin Rapp<br /> ICML 2023: 21312-21334.</p> <p><strong>Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints</strong>  <a href="https://arxiv.org/abs/2301.12863" target="_blank" title="Opens external link in new window">arxiv.org</a>  <a class="externalLink" href="https://proceedings.mlr.press/v202/lassota23a.html" target="_blank" title="Opens external link in new window">PMLR</a><br /> Alexandra Lassota, Alexander Lindermayr, Nicole Megow, Jens Schlöter<br /> ICML 2023: 18563-18583.</p> <p><strong>Matching Augmentation via Simultaneous Contractions</strong><strong>  </strong><a class="externalLink" href="https://arxiv.org/abs/2211.01912" target="_blank" title="Opens external link in new window">arxiv</a>  <a class="externalLink" href="https://doi.org/10.4230/LIPIcs.ICALP.2023.65" target="_blank" title="Opens external link in new window">DOI</a><br /> Mohit Garg, Felix Hommelsheim, Nicole Megow <br /> ICALP 2023: 65:1-65:17.</p> <p><strong>Sorting and Hypergraph Orientation under Uncertainty with Predictions </strong><a href="https://arxiv.org/abs/2305.09245" target="_blank" title="Opens external link in new window">arxiv.org</a>  <a class="externalLink" href="https://doi.org/10.24963/ijcai.2023/619" target="_blank" title="Opens external link in new window">DOI</a><br /> Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter<br /> IJCAI 2023: 5577-5585.</p> <p><strong>Configuration Balancing for Stochastic Requests</strong><strong>  </strong><a href="https://arxiv.org/pdf/2208.13702.pdf" target="_blank" title="Öffnet externen Link in neuem Fenster">arxiv</a>  <a class="externalLink" href="https://doi.org/10.1007/978-3-031-32726-1\_10" target="_blank" title="Opens external link in new window">DOI</a><br /> Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley, Rudy Zhou <br /> IPCO 2023: 127-141.</p> <p><strong>Set Selection under Explorable Stochastic Uncertainty via Covering Techniques  </strong><a href="https://arxiv.org/abs/2211.01097" target="_blank" title="Opens external link in new window">arxiv</a>  <a class="externalLink" href="https://doi.org/10.1007/978-3-031-32726-1\_23" target="_blank" title="Opens external link in new window">DOI</a><br /> Nicole Megow and Jens Schlöter<br /> IPCO 2023: 319-333.</p> <p><strong>Speed-Robust Scheduling: Sand, Bricks, and Rocks</strong> <a href="https://arxiv.org/abs/2011.05181" target="_blank" title="Opens external link in new window">arxiv</a> <a href="https://link.springer.com/article/10.1007/s10107-022-01829-0" target="_blank" title="Opens external link in new window">springer</a><br /> Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon<br /> Mathematical Programming: 197(2), 1009-1048, 2023</p> <p><strong>Online Throughput Maximization on Unrelated Machines: Commitment is No Burden</strong>  <a href="https://arxiv.org/abs/1912.10769" target="_blank" title="Opens external link in new window">arxiv</a> <a href="https://dl.acm.org/doi/10.1145/3569582" target="_blank" title="Opens external link in new window">acm</a><br /> Franziska Eberle, Nicole Megow, and Kevin Schewior.<br /> ACM Transactions on Algorithms: 19(1), 10:1–10:25, 2023.</p> Content content-410100 Tue, 16 Dec 2025 10:01:19 +0100 https://www.uni-bremen.de/en/cslog/publications#c410100 <p><strong>A Universal Error Measure for Input Predictions Applied to Online Graph Problems</strong>  <a href="https://arxiv.org/abs/2205.12850" title="Öffnet externen Link in neuem Fenster" target="_blank">arxiv.org</a>  <a class="externalLink" href="http://papers.nips.cc/paper\_files/paper/2022/hash/15212bd2265c4a3ab0dbc1b1982c1b69-Abstract-Conference.html" title="Opens external link in new window" target="_blank">NeurIPS</a><br />Giulia Bernardini, Alexander Lindermayr, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie, Michelle Sweering<br />NeurIPS 2022</p> <p><strong>Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty </strong><a class="externalLink" href="https://arxiv.org/pdf/2206.15201.pdf" title="Opens external link in new window" target="_blank">arxiv.org</a>  <a class="externalLink" href="https://doi.org/10.4230/LIPIcs.ESA.2022.49" title="Opens external link in new window" target="_blank">DOI</a><br />Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter<br />ESA 2022: 49:1-49:18</p> <p><strong>Throughput Scheduling with Equal Additive Laxity </strong><a class="externalLink" href="https://www.sciencedirect.com/science/article/abs/pii/S0167637722000761" title="Opens external link in new window" target="_blank">sciencedirect.com</a><br />Martin Böhm, Nicole Megow, Jens Schlöter<br />Oper. Res. Lett. 50(5): 463-469 (2022)</p> <p><strong>Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults </strong><a class="externalLink" href="https://arxiv.org/pdf/2009.05382.pdf" title="Opens external link in new window" target="_blank">arxiv.org</a>  <a class="externalLink" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.5" title="Opens external link in new window" target="_blank">DOI</a><br />David Adjiashvili, Felix Hommelsheim, Moritz Muehlenthaler and Oliver Schaudt<br />SWAT 2022: 5:1-5:19</p> <p><strong>On Hop-Constrained Steiner Trees in Tree-Like Metrics </strong><a class="externalLink" href="https://arxiv.org/abs/2003.05699" title="Opens external link in new window" target="_blank">arxiv.org</a> <a class="externalLink" href="https://epubs.siam.org/doi/10.1137/21M1425487" title="Opens external link in new window" target="_blank">siam.org</a>  <a class="download" href="t3://file?uid=136092" title="Initiates file download" target="_blank">pdf</a> <br />M. Böhm, R. Hoeksma, N. Megow, L. Nölke and B. Simon<br />SIAM J. Discrete Math 36(2):1249-1273, 2022.</p> <p><strong>Permutation Predictions for Non-Clairvoyant Scheduling</strong>  <a class="externalLink" href="https://arxiv.org/pdf/2202.10199.pdf" title="Öffnet externen Link in neuem Fenster" target="_blank">arxiv.org</a>  <a class="externalLink" href="https://doi.org/10.1145/3490148.3538579" title="Opens external link in new window" target="_blank">DOI</a><br />Alexander Lindermayr and Nicole Megow<br />SPAA 2022: 357-368</p> <p><strong>Online load balancing with general reassignment cost </strong> <a class="download" href="t3://file?uid=134046" title="Initiates file download" target="_blank">pdf</a>  <a class="externalLink" href="https://www.sciencedirect.com/science/article/pii/S0167637722000487?utm_campaign=STMJ_AUTH_SERV_PUBLISHED&utm_medium=email&utm_acid=195417535&SIS_ID=&dgcid=STMJ_AUTH_SERV_PUBLISHED&CMX_ID=&utm_in=DM245737&utm_source=AC_" title="Opens external link in new window" target="_blank">sciencedirect.com</a><br />Sebastian Berndt, Franziska Eberle, Nicole Megow<br />Operations Research Letters 50(3): 322-328, 2022</p> <p><strong>Robustification of Online Graph Exploration Methods </strong><a class="externalLink" href="https://arxiv.org/pdf/2112.05422.pdf" title="Öffnet externen Link in neuem Fenster" target="_blank">arxiv.org</a>  <a class="externalLink" href="https://doi.org/10.1609/aaai.v36i9.21208" title="Opens external link in new window" target="_blank">DOI</a><br />Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter<br />AAAI 2022: 9732-9740</p> <p><strong>Double Coverage with Machine-Learned Advice</strong>  <a class="externalLink" href="https://arxiv.org/abs/2103.01640#" title="Öffnet externen Link in neuem Fenster" target="_blank">arxiv.org</a>  <a class="externalLink" href="https://drops.dagstuhl.de/opus/volltexte/2022/15695/pdf/LIPIcs-ITCS-2022-99.pdf" title="Öffnet externen Link in neuem Fenster" target="_blank">ITCS</a><br />Alexander Lindermayr, Nicole Megow, Bertrand Simon<br />ITCS 2022: 99:1-99:18</p> Content content-410101 Thu, 02 Nov 2023 14:14:00 +0100 https://www.uni-bremen.de/en/cslog/publications#c410101 <p><strong>Explorable Uncertainty Meets Decision-Making in Logistics </strong><a class="externalLink" href="https://www.springerprofessional.de/explorable-uncertainty-meets-decision-making-in-logistics/19925260" target="_blank" title="Öffnet externen Link in neuem Fenster">springer.com</a> <br /> Nicole Megow and Jens Schlöter<br /> Dynamics in Logistics: 35-56, 2021  <a class="externalLink" href="https://www.springerprofessional.de/dynamics-in-logistics/19925238" target="_blank" title="Öffnet externen Link in neuem Fenster">springer.com </a></p> <p><strong>Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time</strong> <a href="https://arxiv.org/abs/2007.08415" target="_blank" title="Öffnet externen Link in neuem Fenster">arxiv.org</a>  <a class="externalLink" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.18" target="_blank" title="Opens external link in new window">DOI</a><br /> Franziska Eberle, Nicole Megow, Lukas Nölke, Bertrand Simon, Andreas Wiese<br /> FSTTCS 2021: 18:1-18:17</p> <p><strong>On Minimum Generalized Manhattan Connections</strong> <a href="https://link.springer.com/chapter/10.1007%2F978-3-030-83508-8_7" target="_blank" title="Öffnet externen Link in neuem Fenster">springer.com</a><br /> Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase<br /> WADS 2021: 85-100</p> <p><strong>Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty </strong> <a class="externalLink" href="https://arxiv.org/pdf/2107.00572.pdf" target="_blank" title="Öffnet externen Link in neuem Fenster">pdf</a>  <a class="externalLink" href="https://doi.org/10.4230/LIPIcs.ESA.2021.10" target="_blank" title="Opens external link in new window">DOI</a><br /> Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter<br /> ESA 2021: 10:1-10:18</p> <p><strong>Optimal Algorithms for Scheduling under Time-of-Use Tariffs </strong> <a href="https://link.springer.com/content/pdf/10.1007/s10479-021-04059-3.pdf" target="_blank" title="Opens external link in new window">pdf</a> <a href="https://doi.org/10.1007/s10479-021-04059-3" target="_blank" title="Opens external link in new window">DOI</a><br /> Lin Chen, Nicole Megow, Roman Rischke, Leen Stougie and Jose Verschae<br /> Annals of Operations Research 304(1): 85-107, 2021</p> <p><strong>Throughput Scheduling with Equal Additive Laxity </strong><a class="externalLink" href="https://link.springer.com/chapter/10.1007/978-3-030-75242-2_9" target="_blank" title="Öffnet externen Link in neuem Fenster">springer.com</a><br /> Martin Böhm, Nicole Megow, Jens Schlöter<br /> CIAC 2021: 130-143</p> <p><strong>Speed-Robust Scheduling </strong><a class="externalLink" href="https://arxiv.org/abs/2011.05181" target="_blank" title="Öffnet externen Link in neuem Fenster">arxiv.org</a>  <a class="externalLink" href="https://doi.org/10.1007/978-3-030-73879-2\_20" target="_blank" title="Opens external link in new window">DOI</a><br /> Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon<br /> IPCO 2021: 283-296</p> Content content-410102 Tue, 16 Dec 2025 10:01:36 +0100 https://www.uni-bremen.de/en/cslog/publications#c410102 <p><strong>Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments  </strong><a class="externalLink" href="https://doi.org/10.1145/3422371" title="Opens external link in new window" target="_blank">DOI</a><br />Jacob Focke, Nicole Megow, Julie Meißner.<br />ACM Journal of Experimental Algorithmics 25: 1-20 (2020)</p> <p><strong>Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics</strong>  <a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/noelke/LIPIcs-MFCS-2020-18.pdf" title="pdf" target="_blank">PDF</a>  <a class="externalLink" href="https://doi.org/10.4230/LIPIcs.MFCS.2020.18" title="Opens external link in new window" target="_blank">DOI</a><br />M. Böhm, R. Hoeksma, N. Megow, L. Nölke and B. Simon<br />MFCS, pp. 18:1-18:15, 2020</p> <p><strong>An Adversarial Model for Scheduling with Testing  </strong><a class="externalLink" href="https://doi.org/10.1007/s00453-020-00742-2" title="Opens external link in new window" target="_blank">DOI</a><br />Christoph Dürr, Thomas Erlebach, Nicole Megow and Julie Meißner<br />Algorithmica 82(12): 3630-3675, 2020</p> <p><strong>Online Minimum Cost Matching with Recourse on the Line</strong>  <a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/noelke/LIPIcs-APPROX37.pdf" title="pdf" target="_blank">PDF</a>  <a class="externalLink" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.37" title="Opens external link in new window" target="_blank">DOI</a><br />N. Megow and L. Nölke.<br />APPROX, pp. 37:1-37:16, 2020</p> <p><strong>Optimally Handling Commitment Issues in Online Throughput Maximization</strong>  <a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/feberle/EberleMS_ESA2020.pdf" title="Leitet Herunterladen der Datei ein" target="_blank">pdf</a>  <a class="externalLink" href="https://doi.org/10.4230/LIPIcs.ESA.2020.41" title="Öffnet externen Link in neuem Tab" target="_blank">dagstuhl.de</a><br />F. Eberle, N. Megow, and K. Schewior.<br />ESA, pp. 41:1-41:15, 2020.</p> <p><strong>Online Metric Algorithms with Untrusted Predictions</strong>  <a class="externalLink" href="https://arxiv.org/abs/2003.02144" target="_blank">arxiv.org</a>  <a class="externalLink" href="https://github.com/adampolak/mts-with-predictions" target="_blank">code on github</a>  <a class="externalLink" href="http://proceedings.mlr.press/v119/antoniadis20a.html" title="Opens external link in new window" target="_blank">PMLR</a><br />Antonios Antoniadis, Christian Coester, Marek Elias, Adam Polak and Bertrand Simon.<br />ICML, pp. 345-355, 2020</p> <p><strong>A General Framework for Handling Commitment in Online Throughput Maximization</strong>  <a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/feberle/pub/ChenEMSS_MathProg2020.pdf" title="Leitet Herunterladen der Datei ein" target="_blank">PDF</a>  <a class="externalLink" href="https://doi.org/10.1007/s10107-020-01469-2" title="Öffnet externen Link in neuem Fenster" target="_blank">springer.com</a><br />L. Chen, F. Eberle, N. Megow, K. Schewior, and C. Stein.<br />Mathematical Programming 183(1): 215-247, 2020</p> <p><strong>On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems</strong>  <a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/On_the_Complexity_of_Conditional_DAG_Schedulingin_Multiprocessor_Systems.pdf" target="_blank">PDF</a>  <a class="externalLink" href="https://ieeexplore.ieee.org/document/9139785" target="_blank">ieee.org</a><br />A. Marchetti-Spaccamela, N. Megow, J. Schlöter, M. Skutella, and L. Stougie.<br />IPDPS, pp. 1061-1070, 2020</p> <p><strong>Scheduling on Hybrid Platforms: Improved Approximability Window</strong>  <a class="externalLink" href="https://arxiv.org/abs/1912.03088" title="Öffnet externen Link in neuem Fenster" target="_blank">arxiv.org</a>  <a class="externalLink" href="https://doi.org/10.1007/978-3-030-61792-9\_4" title="Opens external link in new window" target="_blank">DOI</a><br />Vincent Fagnon, Imed Kacem, Giorgio Lucarelli and Bertrand Simon.<br />LATIN, pp. 38-49, 2020</p> <p><strong>Scheduling on Two Types of Resources: a Survey</strong>  <a class="externalLink" href="https://arxiv.org/abs/1909.11365" title="Öffnet externen Link in neuem Fenster" target="_blank">arxiv.org</a><br />Olivier Beaumont, Louis-Claude Canon, Lionel Eyraud-Dubois, Giorgio Lucarelli, Loris Marchal, Clément Mommessin, Bertrand Simon and Denis Trystram.<br />ACM Computing Surveys 53(3): 56:1-56:36, 2020</p> <p><strong>Energy Minimization in DAG Scheduling on MPSoCs at Run-Time: Theory and Practice</strong>  <a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/Energy_Minimization_in_DAG_Scheduling_onMPSoCs_at_Run-Time__Theory_and_Practice.pdf" target="_blank">PDF</a>  <a class="externalLink" href="https://drops.dagstuhl.de/opus/volltexte/2020/11778/" title="Öffnet externen Link in neuem Fenster" target="_blank">dagstuhl.de</a><br />Bertrand Simon, Joachim Falk, Nicole Megow and Jürgen Teich.<br />NG-RES Workshop 2:1-2:13, 2020.</p> <p><strong>A PTAS for Euclidean TSP with Hyperplane Neighborhoods </strong><a class="externalLink" href="https://arxiv.org/abs/1804.03953" title="Öffnet externen Link in neuem Tab" target="_blank">arxiv.org</a>  <a class="externalLink" href="https://doi.org/10.1145/3383466" title="Opens external link in new window" target="_blank">DOI</a><br />A. Antoniadis, K. Fleszar, R. Hoeksma, and K. Schewior.<br />ACM Trans. Algorithms 16(3): 38:1-38:16, 2020</p> Content content-410103 Tue, 18 Jan 2022 11:22:58 +0100 https://www.uni-bremen.de/en/cslog/publications#c410103 <p><strong>On the complexity of Anchored Rectangle Packing  </strong><a class="externalLink" href="https://drops.dagstuhl.de/opus/volltexte/2019/11129/" target="_blank" title="Öffnet externen Link in neuem Tab">dagstuhl.de</a><br /> A. Antoniadis, F. Biermeier, A. Cristi, C. Damerius, R. Hoeksma, D. Kaaser, P. Kling, and L. Nölke.<br /> 27th European Symposium on Algorithms (ESA) 8:1-8:14, 2019</p> <p><strong>A General Framework for Handling Commitment in Online Throughput Maximization</strong>  <a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/feberle/ChenEMSS_IPCO2019.pdf" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a>  <a class="externalLink" href="https://doi.org/10.1007/978-3-030-17953-3_11" target="_blank">springer.com</a><br /> L. Chen, F. Eberle, N. Megow, K. Schewior, C. Stein.<br /> Proceedings of IPCO 2019, pp. 141-154, 2019.</p> <p><strong>Scheduling Self-Suspending Tasks: New and Old Results </strong><a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/Scheduling_Self-Suspending_Tasks_New_and_Old_Results.pdf" target="_blank">PDF</a>  <a class="externalLink" href="https://drops.dagstuhl.de/opus/volltexte/2019/10753/" target="_blank">daghstuhl.de</a><br /> J.J. Chen, R. Hoeksma, T. Hahn, N. Megow, G. von der Brueggen<br /> Proc. of ECRTS 16:1-16:23, 2019</p> <p><strong>On Index Policies for Stochastic Minsum Scheduling  </strong><a class="externalLink" href="https://www.sciencedirect.com/science/article/pii/S016763771930015X?via%3Dihub" target="_blank" title="Öffnet externen Link in neuem Tab">sciencedirect.com</a><br /> F. Eberle, F. Fischer, J. Matuschke, N. Megow<br /> Operations Research Letters, 47(3): 213-218, 2019.</p> <p><strong>Scheduling Maintenance Jobs in Networks  </strong><a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/maintenance-TCS2018.pdf" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a>  <a class="externalLink" href="https://www.sciencedirect.com/science/article/pii/S0304397518301178?via%3Dihub" target="_blank">sciencedirect.com</a><br /> F. Abed, L. Chen, Y. Disser, M. Groß, J. Meißner, N. Megow, A.T. Richter, R. Rischke<br /> Theoretical Computer Science 754: 107-121, 2019. Special issue of STACS (invited).</p> <p><strong>Limiting the Memory Footprint when Dynamically Scheduling DAGs on Shared-Memory Platforms</strong>  <a class="externalLink" href="https://www.sciencedirect.com/science/article/pii/S0743731518305112?via%3Dihub" target="_blank" title="Öffnet externen Link in neuem Tab">sciencedirect.com</a><br /> Loris Marchal, Bertrand Simon, Frédéric Vivien.<br /> JPDC journal 128: 30-42, 2019</p> <p><strong>Network Congestion Games are Robust to Variable Demand</strong><em>  </em><a class="externalLink" href="http://lcm.csa.iisc.ernet.in/wine2017/accepted.html" target="_blank" title="Öffnet externen Link in neuem Tab">ernet.in</a><br /> J. Correa, R. Hoeksma, and M. Schröder.<br /> Presented at: The 13th Conference on Web and Internet Economics 397, WINE 2017<em> Conference proceedings only contained and extended abstract</em>.</p> <p><strong>The price of anarchy for utilitarian scheduling games on related machines.</strong>  <a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/rhoeksma/hoeksma_uetz-the_price_of_anarchy_for_utilitarian_scheduling_games_on_related_machines.pdf" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a><strong> </strong><a class="externalLink" href="https://www.sciencedirect.com/science/article/pii/S1572528617301573?via%3Dihub" target="_blank" title="Öffnet externen Link in neuem Tab">sciencedirect.com</a><br /> R. Hoeksma and M. Uetz.<br /> Discrete Optimization 31: 29-39, 2019<br /> Download <a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/rhoeksma/hoeksma_uetz-the_price_of_anarchy_for_utilitarian_scheduling_games_on_related_machines.bib" target="_blank" title="Leitet Herunterladen der Datei ein">BIB-File</a></p> Content content-410104 Tue, 16 Dec 2025 10:01:49 +0100 https://www.uni-bremen.de/en/cslog/publications#c410104 <p><strong>SUPERSET: A (super)natural variant of the card game SET</strong><i>  </i><a class="externalLink" href="http://drops.dagstuhl.de/opus/volltexte/2018/8803/" title="Öffnet externen Link in neuem Tab" target="_blank">dagstuhl.de</a><br />F. Botler, A. Cristi, R. Hoeksma, K. Schewior, and A. Tönnis.<br />9th International Conference on Fun with Algorithms 12:1-12:17, FUN 2018<br />Download <a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/rhoeksma/botler_cristi_hoeksma_schewior_toennis-SUPERSET_a__super_natural_variant_of_the_card_game_SET.bib" title="Leitet Herunterladen der Datei ein" target="_blank">BIB-File</a></p> <p><strong>Scheduling with Explorable Uncertainty  </strong><a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/DuerrEMM-ITCS2018.pdf" title="Leitet Herunterladen der Datei ein" target="_blank">PDF</a>  <a class="externalLink" href="https://link.springer.com/chapter/10.1007%2F978-3-319-94418-0_16" target="_blank">springer.com</a><br />C. Dürr, T. Erlebach, J. Meißner and N. Megow.<br />In Proc. of the 9th Innovations in Theoretical Computer Science Conference (ITCS 2018), 30:1-30:14, 2018.</p> <p><strong>An O(log m)-Competitive Algorithm for Online Machine Minimization</strong>  <a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/ChenMS-SICOMP2018.pdf" title="Leitet Herunterladen der Datei ein" target="_blank">PDF</a>  <a class="externalLink" href="https://epubs.siam.org/doi/10.1137/17M116032X" target="_blank">siam.org</a><br />L. Chen, N. Megow, K. Schewior<br />SIAM Journal on Computing 47(6), 2057–2077, 2018.</p> <p><strong>Dual techniques for scheduling on a machine with varying speed</strong>  <a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/MegowVerschae-SIDMA2018.pdf" title="Leitet Herunterladen der Datei ein" target="_blank">PDF</a>  <a class="externalLink" href="https://epubs.siam.org/doi/10.1137/16M105589X" target="_blank">siam.org</a><br />N. Megow, J. Verschae<br />SIAM Journal on Discrete Mathematics 32(3): 1541-1571, 2018.</p> <p><strong>Online Scheduling of Sequential Task Graphs on Hybrid Platforms.</strong>   <a class="externalLink" href="https://link.springer.com/chapter/10.1007%2F978-3-319-96983-1_14" title="Öffnet externen Link in neuem Tab" target="_blank">springer.com</a>  <a class="externalLink" href="https://hal.inria.fr/hal-01828301/document" title="Öffnet externen Link in neuem Tab" target="_blank">inria.fr</a><br />Louis-Claude Canon, Loris Marchal, Bertrand Simon and Frédéric Vivien.<br />Euro-Par Conference, 2018.</p> <p><strong>Parallel Scheduling of DAGs under Memory Constraints</strong>  <a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/bsimon/papers/2018-MNSV-IPDPS.pdf" title="Leitet Herunterladen der Datei ein" target="_blank">PDF</a>  <a class="externalLink" href="https://ieeexplore.ieee.org/document/8425174" title="Öffnet externen Link in neuem Tab" target="_blank">ieeexplore.ieee.org</a><br />Loris Marchal, Hanna Nagy, Bertrand Simon and Frédéric Vivien.<br />IPDPS Symposium 204-213, 2018</p> <p><strong>Malleable task-graph scheduling with a practical speed-up model.</strong>  <a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/bsimon/talks/2016-04-poster-siampp.pdf" title="Leitet Herunterladen der Datei ein" target="_blank">PDF</a><br />Loris Marchal, Bertrand Simon, Oliver Sinnen, Frédéric Vivien<br />IEEE Trans. Parallel Distrib. Syst. 29(6): 1357-1370, 2018</p> <p><strong>Approximation Algorithms for Connected Graph Factors of Minimum Weight. </strong><a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/rhoeksma/Approximation_Algorithmsfor_Connected_Graph_Factorsof_Minimum_Weight.pdf" title="Öffnet externen Link in neuem Tab" target="_blank">PDF</a><br />K. Cornelissen, R. Hoeksma, B. Manthey, N.S. Narayanaswamy, C.S. Rahul, and M. Waanders.<br />Theory of Computing Systems, 62(2):441—464, 2018.<br />external <a class="externalLink" href="https://link.springer.com/content/pdf/10.1007%2Fs00224-016-9723-z.pdf" title="Öffnet externen Link in neuem Tab" target="_blank">PDF-File</a> on springer.com</p> Content content-410105 Tue, 18 Jan 2022 11:23:01 +0100 https://www.uni-bremen.de/en/cslog/publications#c410105 <p><strong>Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments  </strong><a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/mstexplore-SEA2017.pdf" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a>  <a class="externalLink" href="https://drops.dagstuhl.de/opus/volltexte/2017/7620/" target="_blank">daghstuhl.de</a><br /> J. Focke, J. Meißner, N. Megow<br /> In Proc. of the 16th International Symposium on Experimental Algorithms (SEA 2017), LIPIcs, Article No. 22; pp. 22:1–22:14, 2017.</p> <p><strong>Scheduling Maintenance Jobs in Networks</strong>  <a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/maintenance-CIAC2017.pdf" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a>  <a class="externalLink" href="https://link.springer.com/chapter/10.1007%2F978-3-319-57586-5_3" target="_blank">springer.com</a><br /> F. Abed, L. Chen, Y. Disser, M. Groß, J. Meißner, N. Megow, A.T. Richter and R. Rischke<br /> In Proc. of the 10th International Conference on Algorithms and Complexity (CIAC 2017), LNCS 10236, pp. 19–30, 2017.</p> <p><strong>Randomization Helps Computing a Minimum Spanning Tree under Uncertainty</strong>  <a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/MegowMS-SICOMP2017.pdf" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a>  <a class="externalLink" href="https://epubs.siam.org/doi/10.1137/16M1088375" target="_blank">siam.org</a><br /> J. Meißner, N. Megow, M. Skutella<br /> SIAM Journal on Computing 46(4): 1217-1240, 2017.</p> <p><strong>Packing a Knapsack of Unknown Capacity  </strong><a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/DisserKMS-SIDMA2017.pdf" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a>  <a class="externalLink" href="https://epubs.siam.org/doi/10.1137/16M1070049" target="_blank">siam.org</a><br /> Y. Disser, M. Klimm, N. Megow, S. Stiller<br /> SIAM Journal on Discrete Mathematics 31(3): 1477-1497, 2017.</p> <p><strong>Network Congestion Games are Robust to Variable Demand</strong><em>  </em><a class="externalLink" href="http://lcm.csa.iisc.ernet.in/wine2017/accepted.html" target="_blank" title="Öffnet externen Link in neuem Tab">ernet.in</a><br /> J. Correa, R. Hoeksma, and M. Schröder.<br /> Presented at: The 13th Conference on Web and Internet Economics (WINE 2017).<em> Conference proceedings only contained and extended abstract</em>.</p> <p><strong>Posted price mechanisms for a random stream of customers.</strong><em>  </em><a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/rhoeksma/Posted_Price_Mechanisms_for_a_Random_Stream_of_Customers.pdf" target="_blank" title="Öffnet externen Link in neuem Tab">PDF</a>   <a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/rhoeksma/correa_foncea_hoeksma_oosterwijk_vredeveld-posted_price_mechanisms_for_a_random_stream_of_customers.pdf" target="_blank" title="oeffnet Datei in neuem Tab">PDF</a><br /> J. Correa, P. Foncea, R. Hoeksma, T. Oosterwijk, and T. Vredeveld.<br /> The 2017 ACM conference on Economics and Computation (EC ’17).<br /> Download <a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/rhoeksma/correa_foncea_hoeksma_oosterwijk_vredeveld-posted_price_mechanisms_for_a_random_stream_of_customers.bib" target="_blank" title="Leitet Herunterladen der Datei ein">BIB-File</a></p> Content content-410106 Tue, 16 Dec 2025 10:02:04 +0100 https://www.uni-bremen.de/en/cslog/publications#c410106 <p><strong>The Power of Migration in Online Machine Minimization  </strong><a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/chenMS-SPAA2016.pdf" title="Leitet Herunterladen der Datei ein" target="_blank">PDF</a>  <a class="externalLink" href="https://dl.acm.org/doi/10.1145/2935764.2935786" target="_blank">acm.org</a><br />L. Chen, N Megow and K. Schewior<br />In Proc. of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2016), pp. 175-184, 2016.</p> <p><strong>An O(log m)-Competitive Algorithm for Online Machine Minimization  </strong><a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/ChenMS-SODA16.pdf" title="Leitet Herunterladen der Datei ein" target="_blank">PDF</a>  <a class="externalLink" href="https://epubs.siam.org/doi/10.1137/1.9781611974331.ch12" target="_blank">siam.org</a><br />L. Chen, N. Megow and K. Schewior<br />In Proc. of the 27th ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), pp. 155-163, 2016.</p> <p><strong>A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio </strong><a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/15A_New_Approach_to_Online_Scheduling__Approximating_the_OptimalCompetitive_Ratio.pdf" target="_blank">PDF</a>  <a class="externalLink" href="https://dl.acm.org/doi/10.1145/2996800" target="_blank">acm.org</a><br />E. Lübbecke, O. Maurer, N. Megow, A. Wiese<br />ACM Transactions on Algorithms 13(1), pp. 15:1-15:34, 2016.</p> <p><strong>The Power of Recourse for Online MST and TSP</strong>  <a class="/download" href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/RecourseMST-SICOMP16.pdf" title="Leitet Herunterladen der Datei ein" target="_blank">PDF</a>  <a class="externalLink" href="https://epubs.siam.org/doi/10.1137/130917703" target="_blank">siam.org</a><br />N. Megow, M. Skutella, J. Verschae, A. Wiese<br />SIAM Journal on Computing. 45-3, pp. 859-880, 2016</p> Content content-282904 Mon, 27 Jul 2020 08:53:10 +0200 https://www.uni-bremen.de/en/cslog/publications#c282904 <p>The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.</p> Content content-398907 Wed, 04 Mar 2026 22:54:38 +0100 https://www.uni-bremen.de/en/cslog/publications#c398907 <p><strong>Explorable Uncertainty Meets Decision-Making in Logistics </strong><a class="externalLink" href="https://www.springerprofessional.de/explorable-uncertainty-meets-decision-making-in-logistics/19925260" target="_blank" title="Öffnet externen Link in neuem Fenster">springer.com</a> <br /> Nicole Megow and Jens Schlöter<br /> Dynamics in Logistics: 35-56, 2021  <a class="externalLink" href="https://www.springerprofessional.de/dynamics-in-logistics/19925238" target="_blank" title="Öffnet externen Link in neuem Fenster">springer.com </a></p> Content content-395434 Wed, 04 Mar 2026 22:54:38 +0100 https://www.uni-bremen.de/en/cslog/publications#c395434 <p><strong>On Hop-Constrained Steiner Trees in Tree-Like Metrics</strong><br /> M. Böhm, R. Hoeksma, N. Megow, L. Nölke and B. Simon<br /> Accepted for publication in SIAM J. Discrete Math, 2021.</p> Content content-385318 Wed, 04 Mar 2026 22:54:38 +0100 https://www.uni-bremen.de/en/cslog/publications#c385318 <p><strong>Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time</strong> <a href="https://arxiv.org/abs/2007.08415" target="_blank" title="Öffnet externen Link in neuem Fenster">arxiv.org</a><br /> Franziska Eberle, Nicole Megow, Lukas Nölke, Bertrand Simon, Andreas Wiese<br /> FSTTCS 2021: 18:1-18:17</p> Content content-385379 Wed, 04 Mar 2026 22:54:38 +0100 https://www.uni-bremen.de/en/cslog/publications#c385379 <p><strong>On Minimum Generalized Manhattan Connections</strong> <a href="https://link.springer.com/chapter/10.1007%2F978-3-030-83508-8_7" target="_blank" title="Öffnet externen Link in neuem Fenster">springer.com</a><br /> Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase<br /> WADS 2021: 85-100</p> Content content-367324 Wed, 04 Mar 2026 22:54:38 +0100 https://www.uni-bremen.de/en/cslog/publications#c367324 <p><strong>Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty </strong> <a class="externalLink" href="https://arxiv.org/pdf/2107.00572.pdf" target="_blank" title="Öffnet externen Link in neuem Fenster">pdf</a><br /> Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter<br /> ESA 2021: 10:1-10:18</p> Content content-336941 Wed, 04 Mar 2026 22:54:38 +0100 https://www.uni-bremen.de/en/cslog/publications#c336941 <p><strong>Optimal Algorithms for Scheduling under Time-of-Use Tariffs </strong> <a href="https://link.springer.com/content/pdf/10.1007/s10479-021-04059-3.pdf" target="_blank" title="Opens external link in new window">pdf</a> <a href="https://doi.org/10.1007/s10479-021-04059-3" target="_blank" title="Opens external link in new window">DOI</a><br /> Lin Chen, Nicole Megow, Roman Rischke, Leen Stougie and Jose Verschae<br /> Annals of Operations Research 304(1): 85-107, 2021</p> Content content-322259 Wed, 04 Mar 2026 22:54:38 +0100 https://www.uni-bremen.de/en/cslog/publications#c322259 <p><strong>Throughput Scheduling with Equal Additive Laxity </strong><a class="externalLink" href="https://link.springer.com/chapter/10.1007/978-3-030-75242-2_9" target="_blank" title="Öffnet externen Link in neuem Fenster">springer.com</a><br /> Martin Böhm, Nicole Megow, Jens Schlöter<br /> CIAC 2021: 130-143</p> Content content-322260 Wed, 04 Mar 2026 22:54:38 +0100 https://www.uni-bremen.de/en/cslog/publications#c322260 <p><strong>Speed-Robust Scheduling </strong> <a class="externalLink" href="https://arxiv.org/abs/2011.05181" target="_blank" title="Öffnet externen Link in neuem Fenster">arxiv.org</a><br /> Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon<br /> IPCO 2021: 283-296</p> Content content-398733 Wed, 04 Mar 2026 22:36:40 +0100 https://www.uni-bremen.de/en/cslog/publications#c398733 <p><strong>Robustification of Online Graph Exploration Methods </strong><a class="externalLink" href="https://arxiv.org/pdf/2112.05422.pdf" target="_blank" title="Öffnet externen Link in neuem Fenster">arxiv.org</a><br /> Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter<br /> AAAI 2022</p> Content content-392064 Wed, 04 Mar 2026 22:36:40 +0100 https://www.uni-bremen.de/en/cslog/publications#c392064 <p><strong>Double Coverage with Machine-Learned Advice</strong>  <a class="externalLink" href="https://arxiv.org/abs/2103.01640#" target="_blank" title="Öffnet externen Link in neuem Fenster">arxiv.org</a><br /> Alexander Lindermayr, Nicole Megow, Bertrand Simon<br /> ITCS 2022</p> Content content-290425 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c290425 <p><strong>Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments.</strong><br /> Jacob Focke, Nicole Megow, Julie Meißner.<br /> ACM Journal of Experimental Algorithmics 25: 1-20 (2020)<br />  </p> Content content-277430 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c277430 <p><strong>Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics</strong>  <a class="download" href="t3://file?uid=91922" target="_blank" title="pdf">PDF</a><br /> M. Böhm, R. Hoeksma, N. Megow, L. Nölke and B. Simon<br /> In Proc. of the 45th International Symposium on Mathematical Foundations of Computer Science 18:1-18:15 (MFCS2020)</p> Content content-274330 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c274330 <p><strong>An Adversarial Model for Scheduling with Testing</strong><br /> Christoph Dürr, Thomas Erlebach, Nicole Megow and Julie Meißner<br /> Algorithmica 82(12): 3630-3675, 2020</p> Content content-273880 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c273880 <p><strong>Online Minimum Cost Matching with Recourse on the Line</strong>  <a class="download" href="t3://file?uid=91923" target="_blank" title="pdf">PDF</a><br /> N. Megow and L. Nölke.<br /> 23rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems 37:1-37:16 (APPROX 2020)</p> Content content-273870 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c273870 <p><strong>Optimally Handling Commitment Issues in Online Throughput Maximization</strong>  <a class="download" href="t3://file?uid=92317" target="_blank" title="Leitet Herunterladen der Datei ein">pdf</a>  <a class="externalLink" href="https://doi.org/10.4230/LIPIcs.ESA.2020.41" target="_blank" title="Öffnet externen Link in neuem Tab">dagstuhl.de</a><br /> F. Eberle, N. Megow, and K. Schewior.<br /> ESA 2020, pp. 41:1-41:15, 2020.</p> Content content-250560 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c250560 <p><strong>A General Framework for Handling Commitment in Online Throughput Maximization</strong>  <a class="download" href="t3://file?uid=85653" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a>  <a class="externalLink" href="https://doi.org/10.1007/s10107-020-01469-2" target="_blank" title="Öffnet externen Link in neuem Fenster">springer.com</a><br /> L. Chen, F. Eberle, N. Megow, K. Schewior, and C. Stein.<br /> Mathematical Programming 183(1): 215-247, 2020</p> Content content-250558 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c250558 <p><strong>On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems</strong>  <a class="download" href="t3://file?uid=91064" target="_blank">PDF</a>  <a class="externalLink" href="https://ieeexplore.ieee.org/document/9139785" target="_blank">ieee.org</a><br /> A. Marchetti-Spaccamela, N. Megow, J. Schlöter, M. Skutella, and L. Stougie.<br /> IPDPS 1061-1070, 2020</p> Content content-250556 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c250556 <p><strong>Scheduling on Hybrid Platforms: Improved Approximability Window.</strong>  <a class="externalLink" href="https://arxiv.org/abs/1912.03088" target="_blank" title="Öffnet externen Link in neuem Fenster">arxiv.org</a><br /> Vincent Fagnon, Imed Kacem, Giorgio Lucarelli and Bertrand Simon.<br /> LATIN Symposium, 2020 - LATIN 2020: 38-49</p> Content content-250554 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c250554 <p><strong>Scheduling on Two Types of Resources: a Survey</strong>  <a class="externalLink" href="https://arxiv.org/abs/1909.11365" target="_blank" title="Öffnet externen Link in neuem Fenster">arxiv.org</a><br /> Olivier Beaumont, Louis-Claude Canon, Lionel Eyraud-Dubois, Giorgio Lucarelli, Loris Marchal, Clément Mommessin, Bertrand Simon and Denis Trystram.<br /> ACM Computing Surveys 53(3): 56:1-56:36, 2020</p> Content content-250674 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c250674 <p><strong>Energy Minimization in DAG Scheduling on MPSoCs at Run-Time: Theory and Practice</strong>  <a class="download" href="t3://file?uid=91063" target="_blank">PDF</a>  <a class="externalLink" href="https://drops.dagstuhl.de/opus/volltexte/2020/11778/" target="_blank" title="Öffnet externen Link in neuem Fenster">dagstuhl.de</a><br /> Bertrand Simon, Joachim Falk, Nicole Megow and Jürgen Teich.<br /> NG-RES Workshop 2:1-2:13, 2020.</p> Content content-236382 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236382 <p><strong>A PTAS for Euclidean TSP with Hyperplane Neighborhoods. </strong><a class="externalLink" href="https://arxiv.org/abs/1804.03953" target="_blank" title="Öffnet externen Link in neuem Tab">arxiv.org</a><br /> A. Antoniadis, K. Fleszar, R. Hoeksma, and K. Schewior.<br /> ACM Trans. Algorithms 16(3): 38:1-38:16, 2020</p> Content content-236375 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236375 <p><strong>On the complexity of Anchored Rectangle Packing  </strong><a class="externalLink" href="https://drops.dagstuhl.de/opus/volltexte/2019/11129/" target="_blank" title="Öffnet externen Link in neuem Tab">dagstuhl.de</a> <a href="https://doi.org/10.4230/LIPIcs.ESA.2019.8"> </a><br /> A. Antoniadis, F. Biermeier, A. Cristi, C. Damerius, R. Hoeksma, D. Kaaser, P. Kling, and L. Nölke.<br /> 27th European Symposium on Algorithms (ESA) 8:1-8:14, 2019</p> Content content-236376 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236376 <p><strong>A General Framework for Handling Commitment in Online Throughput Maximization</strong>  <a class="download" href="t3://file?uid=87651" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a>  <a class="externalLink" href="https://doi.org/10.1007/978-3-030-17953-3_11" target="_blank">springer.com</a><br /> L. Chen, F. Eberle, N. Megow, K. Schewior, C. Stein.<br /> Proceedings of IPCO 2019, pp. 141-154, 2019.</p> Content content-236377 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236377 <p><strong>Scheduling Self-Suspending Tasks: New and Old Results </strong><a class="download" href="t3://file?uid=91062" target="_blank">PDF</a>  <a class="externalLink" href="https://drops.dagstuhl.de/opus/volltexte/2019/10753/" target="_blank">daghstuhl.de</a><br /> J.J. Chen, R. Hoeksma, T. Hahn, N. Megow, G. von der Brueggen<br /> Proc. of ECRTS 16:1-16:23, 2019</p> Content content-236378 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236378 <p><strong>On Index Policies for Stochastic Minsum Scheduling  </strong><a class="externalLink" href="https://www.sciencedirect.com/science/article/pii/S016763771930015X?via%3Dihub" target="_blank" title="Öffnet externen Link in neuem Tab">sciencedirect.com</a><br /> F. Eberle, F. Fischer, J. Matuschke, N. Megow<br /> Operations Research Letters, 47(3): 213-218, 2019.</p> Content content-236379 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236379 <p><strong>Scheduling Maintenance Jobs in Networks  </strong><a class="download" href="t3://file?uid=68682" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a>  <a class="externalLink" href="https://www.sciencedirect.com/science/article/pii/S0304397518301178?via%3Dihub" target="_blank">sciencedirect.com</a><br /> F. Abed, L. Chen, Y. Disser, M. Groß, J. Meißner, N. Megow, A.T. Richter, R. Rischke<br /> Theoretical Computer Science 754: 107-121, 2019. Special issue of STACS (invited).</p> Content content-236380 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236380 <p><strong>Limiting the Memory Footprint when Dynamically Scheduling DAGs on Shared-Memory Platforms</strong>  <a class="externalLink" href="https://www.sciencedirect.com/science/article/pii/S0743731518305112?via%3Dihub" target="_blank" title="Öffnet externen Link in neuem Tab">sciencedirect.com</a><br /> Loris Marchal, Bertrand Simon, Frédéric Vivien.<br /> JPDC journal 128: 30-42, 2019</p> Content content-236381 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236381 <p><strong>Network Congestion Games are Robust to Variable Demand</strong><em>  </em><a class="externalLink" href="http://lcm.csa.iisc.ernet.in/wine2017/accepted.html" target="_blank" title="Öffnet externen Link in neuem Tab">ernet.in</a><br /> J. Correa, R. Hoeksma, and M. Schröder.<br /> Presented at: The 13th Conference on Web and Internet Economics 397, WINE 2017<em> Conference proceedings only contained and extended abstract</em>.</p> Content content-236390 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236390 <p><strong>The price of anarchy for utilitarian scheduling games on related machines.</strong>  <a class="download" href="t3://file?uid=68888" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a><strong> </strong><em> </em><a class="externalLink" href="https://www.sciencedirect.com/science/article/pii/S1572528617301573?via%3Dihub" target="_blank" title="Öffnet externen Link in neuem Tab">sciencedirect.com</a><br /> R. Hoeksma and M. Uetz.<br /> Discrete Optimization 31: 29-39, 2019<br /> Download <a class="download" href="t3://file?uid=68886" target="_blank" title="Leitet Herunterladen der Datei ein">BIB-File</a></p> Content content-236384 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236384 <p><strong>SUPERSET: A (super)natural variant of the card game SET</strong><em>  </em><a class="externalLink" href="http://drops.dagstuhl.de/opus/volltexte/2018/8803/" target="_blank" title="Öffnet externen Link in neuem Tab">dagstuhl.de</a><br /> F. Botler, A. Cristi, R. Hoeksma, K. Schewior, and A. Tönnis.<br /> 9th International Conference on Fun with Algorithms 12:1-12:17, FUN 2018<br /> Download <a class="download" href="t3://file?uid=68870" target="_blank" title="Leitet Herunterladen der Datei ein">BIB-File</a></p> Content content-236385 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236385 <p><strong>Scheduling with Explorable Uncertainty  </strong><a class="download" href="t3://file?uid=68669" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a>  <a class="externalLink" href="https://link.springer.com/chapter/10.1007%2F978-3-319-94418-0_16" target="_blank">springer.com</a><br /> C. Dürr, T. Erlebach, J. Meißner and N. Megow.<br /> In Proc. of the 9th Innovations in Theoretical Computer Science Conference (ITCS 2018), 30:1-30:14, 2018.</p> Content content-236386 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236386 <p><strong>An O(log m)-Competitive Algorithm for Online Machine Minimizatio</strong><strong>n</strong>  <a class="download" href="t3://file?uid=68663" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a>  <a class="externalLink" href="https://epubs.siam.org/doi/10.1137/17M116032X" target="_blank">siam.org</a><br /> L. Chen, N. Megow, K. Schewior<br /> SIAM Journal on Computing 47(6), 2057–2077, 2018.</p> Content content-236387 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236387 <p><strong>Dual techniques for scheduling on a machine with varying speed</strong>  <a class="download" href="t3://file?uid=68690" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a>  <a class="externalLink" href="https://epubs.siam.org/doi/10.1137/16M105589X" target="_blank">siam.org</a><br /> N. Megow, J. Verschae<br /> SIAM Journal on Discrete Mathematics 32(3): 1541-1571, 2018.</p> Content content-236388 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236388 <p><strong>Online Scheduling of Sequential Task Graphs on Hybrid Platforms.</strong>   <a class="externalLink" href="https://link.springer.com/chapter/10.1007%2F978-3-319-96983-1_14" target="_blank" title="Öffnet externen Link in neuem Tab">springer.com</a>  <a class="externalLink" href="https://hal.inria.fr/hal-01828301/document" target="_blank" title="Öffnet externen Link in neuem Tab">inria.fr</a><br /> Louis-Claude Canon, Loris Marchal, Bertrand Simon and Frédéric Vivien.<br /> Euro-Par Conference, 2018.</p> Content content-236389 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236389 <p><strong>Parallel Scheduling of DAGs under Memory Constraints</strong>  <a class="download" href="t3://file?uid=68627" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a>  <a class="externalLink" href="https://ieeexplore.ieee.org/document/8425174" target="_blank" title="Öffnet externen Link in neuem Tab">ieeexplore.ieee.org</a><br /> Loris Marchal, Hanna Nagy, Bertrand Simon and Frédéric Vivien.<br /> IPDPS Symposium 204-213, 2018</p> Content content-236392 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236392 <p><strong>Malleable task-graph scheduling with a practical speed-up model.</strong>  <a class="download" href="t3://file?uid=68634" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a><br /> Loris Marchal, Bertrand Simon, Oliver Sinnen, Frédéric Vivien<br /> IEEE Trans. Parallel Distrib. Syst. 29(6): 1357-1370, 2018</p> Content content-236391 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236391 <p><strong>Approximation Algorithms for Connected Graph Factors of Minimum Weight. </strong> <a class="download" href="t3://file?uid=91049" target="_blank" title="Öffnet externen Link in neuem Tab">PDF</a><br /> K. Cornelissen, R. Hoeksma, B. Manthey, N.S. Narayanaswamy, C.S. Rahul, and M. Waanders.<br /> Theory of Computing Systems, 62(2):441—464, 2018.<br /> external <a class="externalLink" href="https://link.springer.com/content/pdf/10.1007%2Fs00224-016-9723-z.pdf" target="_blank" title="Öffnet externen Link in neuem Tab">PDF-File</a> on springer.com</p> Content content-236394 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236394 <p><strong>Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments  </strong><a class="download" href="t3://file?uid=68692" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a>  <a class="externalLink" href="https://drops.dagstuhl.de/opus/volltexte/2017/7620/" target="_blank">daghstuhl.de</a><br /> J. Focke, J. Meißner, N. Megow<br /> In Proc. of the 16th International Symposium on Experimental Algorithms (SEA 2017), LIPIcs, Article No. 22; pp. 22:1–22:14, 2017.</p> Content content-236395 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236395 <p><strong>Scheduling Maintenance Jobs in Networks</strong>  <a class="download" href="t3://file?uid=68680" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a>  <a class="externalLink" href="https://link.springer.com/chapter/10.1007%2F978-3-319-57586-5_3" target="_blank">springer.com</a><br /> F. Abed, L. Chen, Y. Disser, M. Groß, J. Meißner, N. Megow, A.T. Richter and R. Rischke<br /> In Proc. of the 10th International Conference on Algorithms and Complexity (CIAC 2017), LNCS 10236, pp. 19–30, 2017.</p> Content content-236396 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236396 <p><strong>Randomization Helps Computing a Minimum Spanning Tree under Uncertainty</strong>  <a class="download" href="t3://file?uid=68686" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a>  <a class="externalLink" href="https://epubs.siam.org/doi/10.1137/16M1088375" target="_blank">siam.org</a><br /> J. Meißner, N. Megow, M. Skutella<br /> SIAM Journal on Computing 46(4): 1217-1240, 2017.</p> Content content-236397 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236397 <p><strong>Packing a Knapsack of Unknown Capacity  </strong><a class="download" href="t3://file?uid=68671" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a>  <a class="externalLink" href="https://epubs.siam.org/doi/10.1137/16M1070049" target="_blank">siam.org</a><br /> Y. Disser, M. Klimm, N. Megow, S. Stiller<br /> SIAM Journal on Discrete Mathematics 31(3): 1477-1497, 2017.</p> Content content-236398 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236398 <p><strong>Network Congestion Games are Robust to Variable Demand</strong><em>  </em><a class="externalLink" href="http://lcm.csa.iisc.ernet.in/wine2017/accepted.html" target="_blank" title="Öffnet externen Link in neuem Tab">ernet.in</a><br /> J. Correa, R. Hoeksma, and M. Schröder.<br /> Presented at: The 13th Conference on Web and Internet Economics (WINE 2017).<em> Conference proceedings only contained and extended abstract</em>.</p> Content content-236399 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236399 <p><strong>Posted price mechanisms for a random stream of customers.</strong><em>  </em><a class="download" href="t3://file?uid=91017" target="_blank" title="Öffnet externen Link in neuem Tab">PDF</a>   <a class="download" href="t3://file?uid=68876" target="_blank" title="oeffnet Datei in neuem Tab">PDF</a><br /> J. Correa, P. Foncea, R. Hoeksma, T. Oosterwijk, and T. Vredeveld.<br /> The 2017 ACM conference on Economics and Computation (EC ’17).<br /> Download <a class="download" href="t3://file?uid=68873" target="_blank" title="Leitet Herunterladen der Datei ein">BIB-File</a></p> Content content-236402 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236402 <p><strong>The Power of Migration in Online Machine Minimization  </strong><a class="download" href="t3://file?uid=68667" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a>  <a class="externalLink" href="https://dl.acm.org/doi/10.1145/2935764.2935786" target="_blank">acm.org</a><br /> L. Chen, N Megow and K. Schewior<br /> In Proc. of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2016), pp. 175-184, 2016.</p> Content content-236403 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236403 <p><strong>An O(log m)-Competitive Algorithm for Online Machine Minimization  </strong><a class="download" href="t3://file?uid=68664" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a>  <a class="externalLink" href="https://epubs.siam.org/doi/10.1137/1.9781611974331.ch12" target="_blank">siam.org</a><br /> L. Chen, N. Megow and K. Schewior<br /> In Proc. of the 27th ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), pp. 155-163, 2016.</p> Content content-236404 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236404 <p><strong>A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio </strong><a class="download" href="t3://file?uid=91060" target="_blank">PDF</a>  <a class="externalLink" href="https://dl.acm.org/doi/10.1145/2996800" target="_blank">acm.org</a><br /> E. Lübbecke, O. Maurer, N. Megow, A. Wiese<br /> ACM Transactions on Algorithms 13(1), pp. 15:1-15:34, 2016.</p> Content content-236405 Wed, 04 Mar 2026 23:43:54 +0100 https://www.uni-bremen.de/en/cslog/publications#c236405 <p><strong>The Power of Recourse for Online MST and TSP</strong>  <a class="download" href="t3://file?uid=68695" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a>  <a class="externalLink" href="https://epubs.siam.org/doi/10.1137/130917703" target="_blank">siam.org</a><br /> N. Megow, M. Skutella, J. Verschae, A. Wiese<br /> SIAM Journal on Computing. 45-3, pp. 859-880, 2016</p> Content