Andreas Noever

13 papers A* 2B 1Journal 10
YearRankTypeTitle / Venue / Authors
2021 J jnl
Long cycles, heavy cycles and cycle decompositions in digraphs.
J. Comb. Theory B
Charlotte Knierim, Maxime Larcher, Anders Martinsson, Andreas Noever
2020 J jnl
A general lower bound for collaborative tree exploration.
Theor. Comput. Sci.
Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger
2020 J jnl
Tight Analysis of Parallel Randomized Greedy MIS.
ACM Trans. Algorithms
Manuela Fischer, Andreas Noever
2018 A* conf
Tight Analysis of Parallel Randomized Greedy MIS.
SODA
Manuela Fischer, Andreas Noever
2017 B conf
A General Lower Bound for Collaborative Tree Exploration.
SIROCCO
Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger
2017 J jnl
A tight Erdős-Pósa function for long cycles.
J. Comb. Theory B
Frank Mousset, Andreas Noever, Nemanja Skoric, Felix Weissenberger
2017 J jnl
Local Resilience for Squares of Almost Spanning Cycles in Sparse Random Graphs.
Electron. J. Comb.
Andreas Noever, Angelika Steger
2017 J jnl
Online Ramsey games for more than two colors.
Random Struct. Algorithms
Andreas Noever
2017 J jnl
Robust Hamiltonicity of random directed graphs.
J. Comb. Theory B
Asaf Ferber, Rajko Nenadov, Andreas Noever, Ueli Peter, Nemanja Skoric
2017 J jnl
Smaller Subgraphs of Minimum Degree $k$.
Electron. J. Comb.
Frank Mousset, Andreas Noever, Nemanja Skoric
2017 J jnl
Tight Analysis of Randomized Greedy MIS.
CoRR
Manuela Fischer, Andreas Noever
2016 J jnl
A general lower bound for collaborative tree exploration.
CoRR
Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger
2015 A* conf
Robust hamiltonicity of random directed graphs
SODA
Asaf Ferber, Rajko Nenadov, Ueli Peter, Andreas Noever, Nemanja Skoric