Nicole Megow

Q: What Schools Are Affiliated With Nicole Megow

Nicole Megow is affiliated with the following schools: University of Twente, Technical University of Munich, Technical University of Berlin, University of Bremen

Nicole Megow's AcademicInfluence.com Rankings

Nicole Megow

Computer Science

#4738

World Rank

#5003

Historical Rank

Theoretical Computer Science

#147

World Rank

#147

Historical Rank

computer-science Degrees

Nicole Megow

Mathematics

#6673

World Rank

#9196

Historical Rank

Measure Theory

#4571

World Rank

#5350

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Why Is Nicole Megow Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Nicole Megow is a German discrete mathematician and theoretical computer scientist whose research topics include combinatorial optimization, approximation algorithms, and online algorithms for scheduling. She is a professor in the faculty of mathematics and computer science at the University of Bremen.

(See a Problem?)

Nicole Megow's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Scheduling Real-Time Mixed-Criticality Jobs (2010) (190)
Models and Algorithms for Stochastic Online Scheduling (2006) (121)
Optimizing the landside operation of a container terminal (2007) (97)
On-line scheduling to minimize average completion time revisited (2004) (86)
Online graph exploration: New results on old and new algorithms (2012) (71)
Dual Techniques for Scheduling on a Machine with Varying Speed (2012) (55)
The Power of Recourse for Online MST and TSP (2012) (46)
Decision Support and Optimization in Shutdown and Turnaround Scheduling (2011) (40)
Universal Sequencing on an Unreliable Machine (2012) (40)
Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks (2013) (32)
Randomization Helps Computing a Minimum Spanning Tree under Uncertainty (2017) (29)
Universal Sequencing on a Single Machine (2010) (27)
Stochastic Online Scheduling on Parallel Machines (2004) (26)
On Eulerian extensions and their application to no-wait flowshop scheduling (2012) (25)
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio (2012) (24)
An Adversarial Model for Scheduling with Testing (2017) (24)
Packing a Knapsack of Unknown Capacity (2013) (23)
A note on sorting buffers offline (2012) (23)
An O(log m)-Competitive Algorithm for Online Machine Minimization (2015) (22)
Coping with Incomplete Information in Scheduling - Stochastic and Online Models (2007) (21)
Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width (2014) (21)
Approximation in Preemptive Stochastic Online Scheduling (2006) (21)
How to Whack Moles (2003) (20)
Meeting Deadlines: How Much Speed Suffices? (2011) (20)
Scheduling with Explorable Uncertainty (2017) (19)
Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints (2013) (16)
Approximation Results for Preemptive Stochastic Online Scheduling (2006) (16)
Algorithms and complexity for periodic real-time scheduling (2010) (14)
The Online Target Date Assignment Problem (2005) (14)
A Tight 2-Approximation for Preemptive Stochastic Scheduling (2014) (13)
A New Approach to Online Scheduling (2012) (12)
The Power of Migration in Online Machine Minimization (2016) (12)
Special Issue: APPROX-RANDOM 2015: Guest Editors' Foreword (2016) (12)
Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments (2020) (12)
The Sorting Buffer Problem is NP-hard (2010) (11)
Permutation Predictions for Non-Clairvoyant Scheduling (2022) (11)
An O(m^2 log m)-Competitive Algorithm for Online Machine Minimization (2015) (10)
Stochastic and Robust Scheduling in the Cloud (2015) (10)
Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms (2003) (10)
A general framework for handling commitment in online throughput maximization (2018) (10)
On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems (2020) (10)
Optimal Algorithms and a PTAS for Cost-Aware Scheduling (2015) (9)
Robustification of Online Graph Exploration Methods (2021) (9)
Double Coverage with Machine-Learned Advice (2021) (9)
Short Note on Scheduling on a Single Machine with one Non-availability Period (2009) (8)
Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs (2009) (8)
Competitive-Ratio Approximation Schemes for Minimizing the Makespan in the Online-List Model (2013) (7)
Scheduling Maintenance Jobs in Networks (2017) (7)
Scheduling Self-Suspending Tasks: New and Old Results (2019) (7)
Online Minimum Cost Matching with Recourse on the Line (2020) (6)
Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width (2009) (6)
Clique partitioning with value-monotone submodular cost (2015) (6)
Optimal algorithms for scheduling under time-of-use tariffs (2018) (6)
A Universal Error Measure for Input Predictions Applied to Online Graph Problems (2022) (5)
Scheduling on a machine with varying speed: Minimizing cost and energy via dual schedules (2012) (4)
Scheduling (Dagstuhl Seminar 16081) (2016) (4)
Turnaround Scheduling in Chemical Manufacturing (2007) (4)
On index policies for stochastic minsum scheduling (2019) (4)
On Eulerian Extension Problems and their Application to Sequencing Problems (2009) (4)
Stochastic Online Scheduling with Precedence Constraints (2009) (3)
Optimally handling commitment issues in online throughput maximization (2019) (3)
Non-Clairvoyant Scheduling with Predictions Revisited (2022) (3)
Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty (2022) (3)
Online load balancing with general reassignment cost (2022) (2)
A general framework for handling commitment in online throughput maximization (2020) (2)
Robustness and Approximation for Universal Sequencing (2015) (2)
New Results on Online Resource Minimization (2014) (2)
Untrusted Predictions Improve Trustable Query Policies (2020) (2)
Speed-robust scheduling: sand, bricks, and rocks (2020) (2)
Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics (2020) (2)
Erratum for “Scheduling real-time mixed-criticality jobs” (2018) (2)
Orienting (hyper)graphs under explorable stochastic uncertainty (2021) (2)
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time (2020) (2)
On Hop-Constrained Steiner Trees in Tree-Like Metrics (2020) (1)
Learning-Augmented Query Policies (2020) (1)
Approximating Preemptive Stochastic Scheduling (2009) (1)
Throughput Scheduling with Equal Additive Laxity (2022) (1)
Energy Minimization in DAG Scheduling on MPSoCs at Run-Time: Theory and Practice (2019) (1)
The Bin Scheduling Problem (2009) (1)
Online Minimum Cost Matching on the Line with Recourse (2020) (1)
Nachwuchspreis des Bürgermeisters für Forscherin der TU Berlin (2012) (0)
A New Approach to Competitive Analysis: Approximating the Optimal Competitive Ratio (2012) (0)
16 : 2 Scheduling Self-Suspending Tasks : New and Old Results 1 (2019) (0)
How to Whack Moles 1 (2004) (0)
On Eulerian extensions and their application to no-wait flowshop scheduling (2011) (0)
Models and Algorithms for Stochastic Online Scheduling 1 (2005) (0)
Conditional Directed Acyclic Graphs: On the Complexity of Computing the Worst-Case Execution Time (2019) (0)
On Solution Discovery via Reconfiguration (2023) (0)
Explorable Uncertainty Meets Decision-Making in Logistics (2021) (0)
Speed-Robust Scheduling (2020) (0)
Scheduling (Dagstuhl Seminar 20081) (2020) (0)
Title Algorithms and complexity for periodic real-time scheduling (2009) (0)
Configuration Balancing for Stochastic Requests (2022) (0)
Verification for Autonomous Underwater Systems (2019) (0)
Keller oder Dach zuerst (2010) (0)
Matching Augmentation via Simultaneous Contractions (2022) (0)
Set Selection under Explorable Stochastic Uncertainty via Covering Techniques (2022) (0)
On Index Policies in Stochastic Scheduling (2018) (0)
Preface (2021) (0)
Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width (2012) (0)
Scheduling (Dagstuhl Seminar 18101) (2018) (0)
Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary (2023) (0)
Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints (2023) (0)
Flowshop Scheduling with Respect to Machine Idle Times (2009) (0)
A General Framework for Handling Commitment in Online Admission Control (2019) (0)
A note on sorting buers oine (2011) (0)
Correction to: Approximation and Online Algorithms (2019) (0)
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden (2019) (0)
Scheduling Self-Suspending Tasks: New and Old Results (Artifact) (2019) (0)
An Adversarial Model for Scheduling with Testing (2020) (0)

This paper list is powered by the following services:

Other Resources About Nicole Megow

en.wikipedia.org

What Schools Are Affiliated With Nicole Megow?

Nicole Megow is affiliated with the following schools:

Nicole Megow's Academic­Influence.com Rankings

Why Is Nicole Megow Influential?

Nicole Megow's Published Works

Published Works

Other Resources About Nicole Megow

What Schools Are Affiliated With Nicole Megow?

Nicole Megow's AcademicInfluence.com Rankings