#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2015

2018

- This year (1)
- Last 5 years (10)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Manuela Fischer, Andreas Noever
- SODA
- 2018

We provide a tight analysis which settles the round complexity of the well-studied parallel randomized greedy MIS algorithm, thus answering the main open question of Blelloch, Fineman, and Shunâ€¦ (More)

- Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger
- SIROCCO
- 2017

We consider collaborative graph exploration with a set of k agents. All agents start at a common vertex of an initially unknown graph with n vertices and need to collectively visit all otherâ€¦ (More)

- Manuela Fischer, Andreas Noever
- ArXiv
- 2017

We provide a tight analysis which settles the round complexity of the well-studied parallel randomized greedy MIS algorithm, thus answering the main open question of Blelloch, Fineman, and Shunâ€¦ (More)

Let Î“ be a hypergraph with vertex set Î©, let p : Î© â†’ [0, 1], and let Î©p be a random set formed by including every Ï‰ âˆˆ Î© independently with probability p(Ï‰). We investigate the general question ofâ€¦ (More)

- Asaf Ferber, Rajko Nenadov, Andreas Noever, Ueli Peter, Nemanja Skoric
- J. Comb. Theory, Ser. B
- 2017

In his seminal paper from 1952 Dirac showed that the complete graph on n â‰¥ 3 vertices remains Hamiltonian even if we allow an adversary to remove bn/2c edges touching each vertex. In 1960â€¦ (More)

- Frank Mousset, Andreas Noever, Nemanja Skoric, Felix Weissenberger
- J. Comb. Theory, Ser. B
- 2017

A classic result of ErdÅ‘s and PÃ³sa says that any graph contains either k vertexdisjoint cycles or can be made acyclic by deleting at most O(k log k) vertices. Here we generalize this result byâ€¦ (More)

- Frank Mousset, Andreas Noever, Nemanja Skoric
- Electr. J. Comb.
- 2017

In 1990, ErdÅ‘s, Faudree, Rousseau and Schelp proved that for k > 2 every graph with n > k+ 1 vertices and (kâˆ’ 1)(nâˆ’k+ 2) + ( kâˆ’2 2 ) + 1 edges contains a subgraph of minimum degree k on at most n âˆ’ âˆšâ€¦ (More)

- David, Andreas Noever, +5 authors A. RELWAh

An apparatus and method for rapidly determining chemical toxicity has been evaluated. The toxicity monitor includes an automated scoring of how motile biological cells (Tetrahymena pyriformis) slowâ€¦ (More)

- Andreas Noever, Angelika Steger
- Electr. J. Comb.
- 2017

In 1962, PÃ³sa conjectured that a graph G = (V,E) contains a square of a Hamiltonian cycle if Î´(G) â‰¥ 2n/3. Only more than thirty years later KomlÃ³s, SÃ¡rkÅ‘zy, and SzemerÃ©di proved this conjecture usingâ€¦ (More)