Search Results - Noever, Andreas

  • Showing 1 - 20 results of 20
Refine Results
  1. 1
    Online Ramsey games for more than two colors

    Online Ramsey games for more than two colors by Noever, Andreas

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  2. 2
    Tight Analysis of Parallel Randomized Greedy MIS

    Tight Analysis of Parallel Randomized Greedy MIS by Fischer, Manuela, Noever, Andreas

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  3. 3
    Local Resilience for Squares of Almost Spanning Cycles in Sparse Random Graphs

    Local Resilience for Squares of Almost Spanning Cycles in Sparse Random Graphs by Noever, Andreas, Steger, Angelika

    Get full text
    Items that cite this one
    Article
    Save to List
    Saved in:
  4. 4
    ON THE PROBABILITY OF NONEXISTENCE IN BINOMIAL SUBSETS

    ON THE PROBABILITY OF NONEXISTENCE IN BINOMIAL SUBSETS by Mousset, Frank, Noever, Andreas, Panagiotou, Konstantinos, Samotij, Wojciech

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  5. 5
    Long cycles, heavy cycles and cycle decompositions in digraphs

    Long cycles, heavy cycles and cycle decompositions in digraphs by Knierim, Charlotte, Larcher, Maxime, Martinsson, Anders, Noever, Andreas

    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  6. 6
    A general lower bound for collaborative tree exploration

    A general lower bound for collaborative tree exploration by Disser, Yann, Mousset, Frank, Noever, Andreas, Škorić, Nemanja, Steger, Angelika

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  7. 7
    The edge-statistics conjecture for ℓ ≪ k6/5

    The edge-statistics conjecture for ℓ ≪ k6/5 by Martinsson, Anders, Mousset, Frank, Noever, Andreas, Trujić, Miloš

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  8. 8
    Robust Hamiltonicity of random directed graphs

    Robust Hamiltonicity of random directed graphs by Ferber, Asaf, Nenadov, Rajko, Noever, Andreas, Peter, Ueli, Škorić, Nemanja

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  9. 9
    The edge-statistics conjecture for ℓ ≪ k 6/5

    The edge-statistics conjecture for ℓ ≪ k 6/5 by Martinsson, Anders, Mousset, Frank, Noever, Andreas, Trujić, Miloš

    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Smaller Subgraphs of Minimum Degree $k

    Smaller Subgraphs of Minimum Degree $k by Mousset, Frank, Noever, Andreas, Škorić, Nemanja

    Get full text
    Items that cite this one
    Article
    Save to List
    Saved in:
  11. 11
    Online Ramsey Games for more than two colors

    Online Ramsey Games for more than two colors by Noever, Andreas

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Tight Analysis of Randomized Greedy MIS

    Tight Analysis of Randomized Greedy MIS by Fischer, Manuela, Noever, Andreas

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Local resilience for squares of almost spanning cycles in sparse random graphs

    Local resilience for squares of almost spanning cycles in sparse random graphs by Noever, Andreas, Steger, Angelika

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    The edge-statistics conjecture for \(\ell \ll k^{6/5}\)

    The edge-statistics conjecture for \(\ell \ll k^{6/5}\) by Martinsson, Anders, Mousset, Frank, Noever, Andreas, Trujić, Miloš

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Long Cycles, Heavy Cycles and Cycle Decompositions in Digraphs

    Long Cycles, Heavy Cycles and Cycle Decompositions in Digraphs by Knierim, Charlotte, Larcher, Maxime, Martinsson, Anders, Noever, Andreas

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    On the probability of nonexistence in binomial subsets

    On the probability of nonexistence in binomial subsets by Mousset, Frank, Noever, Andreas, Panagiotou, Konstantinos, Samotij, Wojciech

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Smaller subgraphs of minimum degree k

    Smaller subgraphs of minimum degree k by Mousset, Frank, Noever, Andreas, Škorić, Nemanja

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    A general lower bound for collaborative tree exploration

    A general lower bound for collaborative tree exploration by Disser, Yann, Mousset, Frank, Noever, Andreas, Škorić, Nemanja, Steger, Angelika

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    A tight Erdős-Pósa function for long cycles

    A tight Erdős-Pósa function for long cycles by Mousset, Frank, Noever, Andreas, Škorić, Nemanja, Weissenberger, Felix

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Robust hamiltonicity of random directed graphs

    Robust hamiltonicity of random directed graphs by Ferber, Asaf, Nenadov, Rajko, Noever, Andreas, Ueli, Peter, Škorić, Nemanja

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: