Nicole Megow

About Nicole Megow

Nicole Megow, With an exceptional h-index of 23 and a recent h-index of 16 (since 2020), a distinguished researcher at Universität Bremen, specializes in the field of theoretical computer science, discrete mathematics, combinatorial optimization, approximation algorithms, scheduling.

His recent articles reflect a diverse array of research interests and contributions to the field:

Accelerating Matroid Optimization through Fast Imprecise Oracles

Santa Claus meets Makespan and Matroids: Algorithms and Reductions

Set Selection Under Explorable Stochastic Uncertainty via Covering Techniques

Solution discovery via reconfiguration for problems in P

Fast Combinatorial Algorithms for Efficient Sortation

Configuration balancing for stochastic requests

Speed-oblivious online scheduling: knowing (precise) speeds is not necessary

Sorting and hypergraph orientation under uncertainty with predictions

Nicole Megow Information

University

Position

Professor of Mathematics and Computer Science at the

Citations(all)

1825

Citations(since 2020)

770

Cited By

1327

hIndex(all)

23

hIndex(since 2020)

16

i10Index(all)

40

i10Index(since 2020)

28

Email

University Profile Page

Google Scholar

Nicole Megow Skills & Research Interests

theoretical computer science

discrete mathematics

combinatorial optimization

approximation algorithms

scheduling

Top articles of Nicole Megow

Title

Journal

Author(s)

Publication Date

Accelerating Matroid Optimization through Fast Imprecise Oracles

arXiv preprint arXiv:2402.02774

Franziska Eberle

Felix Hommelsheim

Alexander Lindermayr

Zhenwei Liu

Nicole Megow

...

2024/2/5

Santa Claus meets Makespan and Matroids: Algorithms and Reductions

Étienne Bamas

Alexander Lindermayr

Nicole Megow

Lars Rohwedder

Jens Schlöter

2024

Set Selection Under Explorable Stochastic Uncertainty via Covering Techniques

Nicole Megow

Jens Schlöter

2023/5/22

Solution discovery via reconfiguration for problems in P

arXiv preprint arXiv:2311.13478

Mario Grobler

Stephanie Maaz

Nicole Megow

Amer E Mouawad

Vijayaragunathan Ramamoorthi

...

2023/11/22

Fast Combinatorial Algorithms for Efficient Sortation

arXiv preprint arXiv:2311.05094

Madison Van Dyk

Kim Klause

Jochen Koenemann

Nicole Megow

2023/11/9

Configuration balancing for stochastic requests

Franziska Eberle

Anupam Gupta

Nicole Megow

Benjamin Moseley

Rudy Zhou

2023/5/22

Speed-oblivious online scheduling: knowing (precise) speeds is not necessary

Alexander Lindermayr

Nicole Megow

Martin Rapp

2023/7/3

Sorting and hypergraph orientation under uncertainty with predictions

arXiv preprint arXiv:2305.09245

Thomas Erlebach

Murilo Santos de Lima

Nicole Megow

Jens Schlöter

2023/5/16

Minimalistic predictions to schedule jobs with online precedence constraints

Alexandra Anna Lassota

Alexander Lindermayr

Nicole Megow

Jens Schlöter

2023/7/3

On solution discovery via reconfiguration

arXiv preprint arXiv:2304.14295

Michael R Fellows

Mario Grobler

Nicole Megow

Amer E Mouawad

Vijayaragunathan Ramamoorthi

...

2023/4/27

Recoverable Robust Optimization with Commitment

arXiv preprint arXiv:2306.08546

Felix Hommelsheim

Nicole Megow

Komal Muluk

Britta Peis

2023/6/14

Verifizierung für autonome Unterwassersysteme

Christoph Lüth

Nicole Megow

Rolf Drechsler

Udo Frese

2023/12/5

Online Throughput Maximization on Unrelated Machines: Commitment is No Burden

ACM Transactions on Algorithms

Franziska Eberle

Nicole Megow

Kevin Schewior

2022/12

Online load balancing with general reassignment cost

Operations Research Letters

Sebastian Berndt

Franziska Eberle

Nicole Megow

2022/5/1

Matching augmentation via simultaneous contractions

arXiv preprint arXiv:2211.01912

Mohit Garg

Felix Hommelsheim

Nicole Megow

2022/11/3

Double Coverage with Machine-Learned Advice

Alexander Lindermayr

Nicole Megow

Bertrand Simon

2022

On hop-constrained steiner trees in tree-like metrics

SIAM Journal on Discrete Mathematics

Martin Böhm

Ruben Hoeksma

Nicole Megow

Lukas Nölke

Bertrand Simon

2022

Permutation predictions for non-clairvoyant scheduling

Alexander Lindermayr

Nicole Megow

2022/7/11

Learning-augmented query policies for minimum spanning tree with uncertainty

arXiv preprint arXiv:2206.15201

Thomas Erlebach

Murilo Santos de Lima

Nicole Megow

Jens Schlöter

2022/6/30

A universal error measure for input predictions applied to online graph problems

Advances in Neural Information Processing Systems

Giulia Bernardini

Alexander Lindermayr

Alberto Marchetti-Spaccamela

Nicole Megow

Leen Stougie

...

2022/12/6

See List of Professors in Nicole Megow University(Universität Bremen)

Co-Authors

academic-engine