| Date |
Name |
Title |
02/05/99
15 hst. |
A. Czumaj
(Paderborn) |
Applications of
Non-Markovian Couplings to Generation
of Random Permutations |
07/03/98
14 hct. |
L.L. Lawrence and W. Bein
(Las Vegas) |
The Trackless 2-Server
Problem |
06/29/98
13 hct. |
C. Smith
(Karlsruhe) |
Towards a Theory
of Discovery |
06/26/98
15 hct. |
S. Jukna
(Trier, Vilnius) |
Entropic Approach
to Proving Lower Bounds for Branching Programs |
03/23/98
14 hct. |
J. Wirtgen
(Bonn) |
On Approximation
Intractability of the Bandwidth Problem |
01/09/98
15 hct. |
Y. Abdallah and J. Luessem
(Bonn) |
Online Algorithms and
Functional Programming Language |
01/09/98
14 hst. |
P. Berman
(Penn State) |
Sorting by reversals:
11/8 algorithm |
12/19/97
14 hst. |
C. Bazgan
(L.R.I. Paris) |
Good approximation
algorithms for a variant of "Subset Sum" problem |
12/12/97
14 hst. |
C. Günzel
(Bonn) |
Schnelle Invertierung von
Cauchy Matrizen |
11/14/97
15 hct. |
K. Wolf
(Köln) |
Finding Dense Subgraphs
with Semidefinite Programming |
09/17/97
11 hct. |
J. Wirtgen
(Bonn) |
Approximationsalgorithmen
für das Bandwidth-Problem auf Dichten Graphen |
07/11/97
14 hct. |
L. Larmore
(Las Vegas) |
On-Line Matrix
Searching |
06/27/97
14 hct. |
E. Dahlhaus
(Bonn) |
Minimum Fill-In
für Distanzerbliche Graphen |
06/09/97
11 hct. |
J. Wirtgen
(Bonn) |
Untere Schranken
für Approximationsprobleme |
05/05/97
10 hct. |
J. Wirtgen
(Bonn) |
Approximationsalgorithmen
für das Bandwidth-Problem auf Dichten Graphen |
04/28/97
11 hct. |
C. Dorgerloh
(Bonn) |
Schnelle randomisierte
und parallele Algorithmen zum Auffinden von einfachen Kreisen in
Graphen |
04/21/97
11 hct. |
J. Wirtgen
(Bonn) |
Zur Komplexität von
Dichten Approximationsproblemen |