Vortragende(r): | Datum | Thema | Betreuer | |
Mehdi Fahem | 03.11. | Sorting using networks of queues and stacks | UZ | m.fahem AT tu-bs.de |
Sabine Hauf | 10.11. | On partitions of permutations into decreasing and increasing subsequences | SK | sabine_hauf AT web.de |
Klaus-Tycho Förster | 17.11. | Finding a Long Directed Cycle | LHL | k-t.foerster AT tu-bs.de |
Katja Stempel | 01.12. | On improved time bounds for permutation graph problems | KVV | k.stempel AT tu-bs.de |
Andreas Ahrens | 08.12. | Approximating minimum co-colorings | NA | a.ahrens AT tu-bs.de |
Robert Erdmann | 15.12. | The shunting problem: a graph theoretical approach | RH | robert.erdmann AT tu-bs.de |
Bastian Tendler | 22.12. | Multicommodity Facility Location | JVV | b.tendler AT tu-bs.de |
Martin Herz | 12.01. | Recognizing unit disk intersection graphs | AK | martin.herz AT tu-bs.de |
Andreas Baude | 19.01. | Network Failure Detection and Graph Connectivity | AK | a.baude AT tu-bs.de |
Andreas Landau | 26.01. | A faster distributed protocol for constructing a minimum spanning tree | SF | a.landau AT tu-bs.de |
Andreas Soppa | 02.02. | Constant-Time Distributed Dominating Set Approximation | AK | andreassoppa AT aol.com |