Research gatherings of the TCS group (Lehrstuhl für theoretische Informatik)

The TCS group meets at irregular intervals to discuss research issues following an informal presentation by a group member or a guest of own work or work by others. Guests are welcome, to the extent allowed by the available space, but should not expect polished presentations. Presentations and discussions may be in German or in English. The list below also indicates institute-wide colloquia with speakers invited by the TCS group.


Date
Time
Room
Speaker   Affiliation

Title
Abstract








17.01.17
17.30
3076 N
Torben Hagerup


On-the-Fly Array Initialization (joint work with Frank Kammer) pdf
08.12.16
16.30
3076 N
Frank Kammer


Space-Efficient Plane-Sweep Algorithms (joint work with Amr Elmasry)
04.03.16
11.00
3076 N
Torben Hagerup


Succinct Choice Dictionaries (joint work with Frank Kammer)
20.07.15
16.30
3076 N
Torben Hagerup


Easy Multiple-Precision Divisors and Word-RAM Constants pdf
28.05.15
16:00
2045 N
Mikio Kano
Ibaraki University

Discrete Geometry on Colored Point Sets in the Plane pdf
26.05.15
16:45
3076 N
Moritz Laudahn


Space-Efficient Euler Partition and Bipartite Edge Coloring (joint work with Torben Hagerup and Frank Kammer) pdf
26.05.15
16:00
3076 N
Frank Kammer


On Temporal Graph Exploration (joint work with Thomas Erlebach and Michael Hoffmann) pdf
03.03.15
13:15
3076 N
Frank Kammer


Space-Efficient Basic Graph Algorithms (joint work with Amr Elmasry and Torben Hagerup) pdf
14.10.14
10.30
3076 N
Tobias Lieber
ETH Zürich

Treewidth Computation in the Parallel External Memory Model pdf
17.06.14
14.00
3076 N
Torben Hagerup


Space-economical graph algorithms (joint work with Amr Elmasry and Frank Kammer) pdf
11.02.14
16.00
3076 N
Torben Hagerup


Space-Economical Depth-First Search (joint work with Amr Elmasry and Frank Kammer) pdf
31.07.13
14.00
3076 N
Jyrki Katajainen und Amr Elmasry
DIKU Copenhagen und Universität Alexandria

Numerical Systems and Data Stuctures (own work) pdf
10.07.13
14.15
3076 N
Torben Hagerup


Approximating the diameter of a graph (Roditty and Williams) pdf
17.06.13
17.30
1057 N
Jyrki Katajainen
DIKU Copenhagen

Priority queues and sorting for read-only data (joint work with Tetsuo Asano and Amr Elmasry) pdf
17.08.10
14:00
3076 N
Frank Kammer


Baumähnliche und chordale Graphen: Algorithmen und Verallgemeinerungen (own work)
17.08.10
13:15
3076 N
Torsten Tholey


Approximation Algorithms for Intersection Graphs (joint work with Frank Kammer and Heiko Voepel)
pdf
20.05.10
15:00
3076 N
Torben Hagerup


Finding the maximum suffix with fewer comparisons (joint work with Gianni Franceschini)
pdf
18.08.09
16:00
207 F
Torben Hagerup


A pictorial description of Cole's parallel merge sort (own work)
pdf
30.07.09
16:00
207 F
Benjamin Doerr
MPI Saarbrücken

Quasirandom Broadcasting
pdf
22.06.09
18:10
207 F
Frank Kammer


The disjoint paths problem on chordal graphs (joint work with Torsten Tholey)
pdf
27.05.09
16:00
207 F
Torben Hagerup


An even simpler linear-time algorithm for verifying minimum spanning trees (own work)
pdf
14.05.09
16:30
207 F
Torsten Tholey


Pfadalgorithmen und Struktureigenschaften von Graphen (own work)
pdf
07.04.09
14:00
511 F
Frank Kammer, Torsten Tholey


Treewidth of k-outerplanar graphs (own work)
21.01.09
16:00
207 F
Torsten Tholey


Improved Algorithms for the 2-Vertex-Disjoint Paths Problem (own work)
09.12.08
14:45
207 F
Frank Kammer


Complexity of Convex Coloring (joint work with Torsten Tholey)
05.12.08
10:30
511 F
Torben Hagerup


A still simpler linear-time algorithm for verifying minimum spanning trees (own work)
18.09.08
14:00
511 F
Torsten Tholey


On the optimality of planar and geometric approximation schemes (Marx)
14.08.08
10:30
207 F
Heiko Voepel


Knotenfärbung (master thesis)
pdf
10.07.08
17:00
511 F
Frank Kammer


Minor-Reduktion (Marx)
09.07.08
17:00
511 F
Torsten Tholey


Kürzeste disjunkte Wege (own work)
06.06.08
10:00
511 F
Frank Kammer


Can you beat treewidth? (Marx)
05.06.08
17:45
207 F
Torsten Tholey


Approximation Algorithms for the bicriteria MAX-CUT problem (Angel et al.)
pdf
29.04.08
11:00
511 F
Torben Hagerup


An inverse-Ackermann number-guessing game (own work)
13.02.08
15:30
207 F
Torben Hagerup


Kartenbeschriftung und Stutzen von Graphen (own work)
pdf
14.11.07
18:00
207 F
Torben Hagerup


Online and Offline Access to Short Lists (own work)
13.11.07
17:15
207 F
Frank Kammer


Geometric Problems with Imprecise Input Points (Löffler, van Kreveld)
12.11.07
17:15
207 F
Torsten Tholey


Improved Algorithms for the 2-Vertex-Disjoint Paths Problem (own work)
pdf
07.11.07
18:00
207 F
Frank Kammer, Torsten Tholey


Approximating Minimum Convex Recoloring and Maximum Disjoint Paths on Graphs of Bounded Tree Width (own work)
pdf
06.11.07
17:15
207 F
Claus Jensen
DIKU Copenhagen

Two-Tier Relaxed Heaps (own work)
pdf
28.06.07
16:15
511 F
Torsten Tholey


Disjunkte Pfade auf Graphen beschränkter Baumweite (Scheffler)

14.06.07
16:15
207 F
Torben Hagerup


Bestimmung des maximalen Suffixes (own work)
pdf
21.05.07
17:00
511 F
Frank Kammer


Multipfadeflüsse (Dinitz et al.)

10.05.07
16:15
511 F
Torsten Tholey


Approximation algorithms for unit disk graphs (van Leeuwen)

04.05.07
14:15
207 F
Jyrki Katajainen
DIKU Copenhagen

Putting your data structure on a diet (own work)
03.05.07 16:15
207 F Torben Hagerup

Ein 2-Pfade-Algorithmus (own work)
26.04.07 16:15
207 F Frank Kammer

k-outerplanarity (own work) pdf
20.02.07 11:00
511 F
Torben Hagerup

Canonization of strings (Shiloach)
26.01.06
17:00
207 F
Helmut Alt
TU Berlin

Effiziente Algorithmen - Theorie oder Praxis (own work)
26.01.06
15:30
511 F
Frank Kammer


Simultaneous Embedding (own work)
pdf