Nicole Megow

According to our database1, Nicole Megow authored at least 58 papers between 2003 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Online Minimum Cost Matching on the Line with Recourse.
CoRR, 2020

Energy Minimization in DAG Scheduling on MPSoCs at Run-Time: Theory and Practice.
Proceedings of the Workshop on Next Generation Real-Time Embedded Systems, 2020

2019
Scheduling maintenance jobs in networks.
Theor. Comput. Sci., 2019

On index policies for stochastic minsum scheduling.
Oper. Res. Lett., 2019

Scheduling Self-Suspending Tasks: New and Old Results (Artifact).
DARTS, 2019

Optimally handling commitment issues in online throughput maximization.
CoRR, 2019

A General Framework for Handling Commitment in Online Throughput Maximization.
Proceedings of the Integer Programming and Combinatorial Optimization, 2019

Scheduling Self-Suspending Tasks: New and Old Results.
Proceedings of the 31st Euromicro Conference on Real-Time Systems, 2019

2018
Dual Techniques for Scheduling on a Machine with Varying Speed.
SIAM J. Discrete Math., 2018

An O(log m)-Competitive Algorithm for Online Machine Minimization.
SIAM J. Comput., 2018

Scheduling (Dagstuhl Seminar 18101).
Dagstuhl Reports, 2018

Optimal Algorithms for Scheduling under Time-of-Use Tariffs.
CoRR, 2018

Scheduling with Explorable Uncertainty.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017
Packing a Knapsack of Unknown Capacity.
SIAM J. Discrete Math., 2017

Randomization Helps Computing a Minimum Spanning Tree under Uncertainty.
SIAM J. Comput., 2017

Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

2016
Universal Sequencing on an Unreliable Machine.
Encyclopedia of Algorithms, 2016

Special Issue: APPROX-RANDOM 2015: Guest Editors' Foreword.
Theory of Computing, 2016

A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio.
ACM Trans. Algorithms, 2016

The Power of Recourse for Online MST and TSP.
SIAM J. Comput., 2016

Scheduling (Dagstuhl Seminar 16081).
Dagstuhl Reports, 2016

The Power of Migration in Online Machine Minimization.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

An O(log m)-Competitive Algorithm for Online Machine Minimization.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
Clique partitioning with value-monotone submodular cost.
Discret. Optim., 2015

An O(m^2 log m)-Competitive Algorithm for Online Machine Minimization.
CoRR, 2015

Optimal Algorithms and a PTAS for Cost-Aware Scheduling.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Stochastic and Robust Scheduling in the Cloud.
Proceedings of the Approximation, 2015

Robustness and Approximation for Universal Sequencing.
Proceedings of the Gems of Combinatorial Optimization and Graph Algorithms, 2015

2014
A Tight 2-Approximation for Preemptive Stochastic Scheduling.
Math. Oper. Res., 2014

Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width.
J. Comb. Optim., 2014

New Results on Online Resource Minimization.
CoRR, 2014

2013
Competitive-Ratio Approximation Schemes for Minimizing the Makespan in the Online-List Model
CoRR, 2013

A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks.
Proceedings of the IEEE 34th Real-Time Systems Symposium, 2013

Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints.
Proceedings of the Innovations in Theoretical Computer Science, 2013

2012
Online graph exploration: New results on old and new algorithms.
Theor. Comput. Sci., 2012

A note on sorting buffers offline.
Theor. Comput. Sci., 2012

Scheduling Real-Time Mixed-Criticality Jobs.
IEEE Trans. Computers, 2012

Algorithms and complexity for periodic real-time scheduling.
ACM Trans. Algorithms, 2012

Universal Sequencing on an Unreliable Machine.
SIAM J. Comput., 2012

On Eulerian extensions and their application to no-wait flowshop scheduling.
J. Scheduling, 2012

Scheduling on a machine with varying speed: Minimizing cost and energy via dual schedules
CoRR, 2012

2011
Decision Support and Optimization in Shutdown and Turnaround Scheduling.
INFORMS Journal on Computing, 2011

Meeting Deadlines: How Much Speed Suffices?
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
The Sorting Buffer Problem is NP-hard
CoRR, 2010

Universal Sequencing on a Single Machine.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009
Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width.
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
Optimizing the landside operation of a container terminal.
OR Spectrum, 2008

2007
Coping with Incomplete Information in Scheduling - Stochastic and Online Models.
Proceedings of the Operations Research, 2007

2006
How to whack moles.
Theor. Comput. Sci., 2006

Models and Algorithms for Stochastic Online Scheduling.
Math. Oper. Res., 2006

Approximation in Preemptive Stochastic Online Scheduling.
Proceedings of the Algorithms, 2006

2005
The Online Target Date Assignment Problem.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

2004
On-line scheduling to minimize average completion time revisited.
Oper. Res. Lett., 2004

Stochastic Online Scheduling on Parallel Machines.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

2003
Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

How to Whack Moles.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003


  Loading...