Andreas Noever

According to our database1, Andreas Noever authored at least 10 papers between 2015 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Long cycles, heavy cycles and cycle decompositions in digraphs.
J. Comb. Theory B, 2021

2020
A general lower bound for collaborative tree exploration.
Theor. Comput. Sci., 2020

Tight Analysis of Parallel Randomized Greedy MIS.
ACM Trans. Algorithms, 2020

2017
Online Ramsey games for more than two colors.
Random Struct. Algorithms, 2017

A tight Erdős-Pósa function for long cycles.
J. Comb. Theory B, 2017

Robust Hamiltonicity of random directed graphs.
J. Comb. Theory B, 2017

Tight Analysis of Randomized Greedy MIS.
CoRR, 2017

Local Resilience for Squares of Almost Spanning Cycles in Sparse Random Graphs.
Electron. J. Comb., 2017

Smaller Subgraphs of Minimum Degree $k$.
Electron. J. Comb., 2017

2015
Robust hamiltonicity of random directed graphs <i>extended abstract</i>.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015


  Loading...