Andreas Noever

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Long cycles, heavy cycles and cycle decompositions in digraphs.

Charlotte Knierim, Maxime Larcher, Anders Martinsson, Andreas Noever

J. Comb. Theory B, 2021

2020

A general lower bound for collaborative tree exploration.

Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger

Theor. Comput. Sci., 2020

Tight Analysis of Parallel Randomized Greedy MIS.

Manuela Fischer, Andreas Noever

ACM Trans. Algorithms, 2020

2017

Online Ramsey games for more than two colors.

Andreas Noever

Random Struct. Algorithms, 2017

A tight Erdős-Pósa function for long cycles.

Frank Mousset, Andreas Noever, Nemanja Skoric, Felix Weissenberger

J. Comb. Theory B, 2017

Robust Hamiltonicity of random directed graphs.

Asaf Ferber, Rajko Nenadov, Andreas Noever, Ueli Peter, Nemanja Skoric

J. Comb. Theory B, 2017

Tight Analysis of Randomized Greedy MIS.

Manuela Fischer, Andreas Noever

CoRR, 2017

Local Resilience for Squares of Almost Spanning Cycles in Sparse Random Graphs.

Andreas Noever, Angelika Steger

Electron. J. Comb., 2017

Smaller Subgraphs of Minimum Degree $k$.

Frank Mousset, Andreas Noever, Nemanja Skoric

Electron. J. Comb., 2017

2015

Robust hamiltonicity of random directed graphs <i>extended abstract</i>.

Asaf Ferber, Rajko Nenadov, Ueli Peter, Andreas Noever, Nemanja Skoric

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015