Inhalt des Dokuments
Research colloquium (winter term 2012/2013)
The research colloquium "Algorithmik und Komplexitätstheorie" provides talks of external guests, members of the research staff, Ph.D. students, and advanced students (theses) about recent results and research topics in theoretical computer science and related areas. The core areas are algorithmics and computational complexity theory.
Location: The colloquium is held at Ernst-Reuter Platz 7 ("TU Hochhaus"), fifth floor, room 512.
| Date | Speaker | Language | Topic |
|---|---|---|---|
| 11.10. 17:15 | Tobias
Friedrich | german/english* | Rumor Spreading in
Social Networks [1] |
| 19.10. 14:15 | Vincent
Froese | german | Combinatorial Feature Selection Problems: Parameterized
Algorithms and Complexity [2] |
| 22.10. 11:00 | Jérôme Lang | english | Condorcet Winning Sets
[3] |
| 26.10.
14:15 | Robert Bredereck | german/english* | A Multivariate
Complexity Analysis of Lobbying in Multiple Referenda
[4] |
| 02.11.
14:15 | Falk Hüffner | german/english* | Partitioning
Networks into Highly Connected Clusters with Maximum Edge Coverage
[5] |
| 09.11.
16:15 | André Nichterlein | german/english* | Constant
Thresholds Can Make Target Set Selection Tractable
[6] |
| 15.11.
16:15 | Will not take place in
favor of the Kolloquium über Kombinatorik [7] | ||
| 22.11. 16:00 | René van Bevern | german/english* | How applying
Myhill-Nerode methods to hypergraphs helps mastering the Art of
Trellis Decoding [8] |
| 29.11. 16:15 | Sepp
Hartung | german/english* | Metric Dimension is W[2]-complete [9] |
| 03.12. 17:45 | Christophe Paul | english | Linear kernel via
conflict packing - application to FAST and dense RTI problems
[10] |
| 13.12.
16:15 | Manuel Sorge | german/english* | Novel Directions
in Data Reduction for NP-Hard Problems: Truth-Table Kernelizations
[11] |
| 20.12.
16:15 | Andreas Feldmann | german/english* | Matroids and
Integrality Gaps for Hypergraphic Steiner Tree Relaxations
[12] |
| 10.01.
16:15 | Christian Komusiewicz | german/english* | Minimum Common
String Partition Parameterized by Partition Size is Fixed-Parameter
Tractable [13] |
| 17.01. 16:15 | Stefan
Kratsch | german/english* | On Polynomial Kernels for Sparse Integer Linear Programs
[14] |
| 24.01.
16:15 | Ondřej Suchý | english | Beyond Max-Cut:
lambda-Extendible Properties Parameterized Above the Poljak-Turzík
Bound [15] |
| 31.01.
16:15 | Jiehua Chen | german/english* | Are there any
nicely structured preference profiles nearby? [16] |
| 07.02. 16:15 | Gerhard Woeginger | german/english* | Multiprocessor
jobs, preemptive schedules, and one-competitive online algorithms
[17] |
| 13.02.
10:30 | Andreas Krebs | german/english* | The Complexity of
Intersecting Finite Automata Having Few Final States [18]
|
| 14.02.
16:15 | Tomasz Przedmojski | german | Algorithm Engineering for
Hierarchical Tree Clustering [19] |
* Language depends on the audience.
If you have proposals for further talks or if you want to
present interesting results feel free to send an email to the
organizer [20].
Announcements of our talks will be sent by mail to our
mailing list [21].
_12_13/talk_11_10_2700000000100/
_12_13/talk_19_10/
_12_13/talk_22_10/
_12_13/talk_26_10/
_12_13/talk_02_11/
_12_13/talk_08_11/
_12_13/talk_22_11/
_12_13/talk_30_11/
r_12_13/talk_03_12/
r_12_13/talk_13_12/
r_12_13/talk_20_12/
r_12_13/talk_10_01/
r_12_13/talk_17_01/
r_12_13/talk_24_01/
r_12_13/talk_31_01/
r_12_13/talk_07_02/
r_12_13/talk_13_02/
r_12_13/talk_14_02/
/parameter/en/id/125250/?no_cache=1&ask_mail=XOb0Rg
AKeELP4fdhGQm5C3eHNQ5hnNtzlJEu8GtEp31JLGsLVGnh%2Fg%3D%3
D&ask_name=MANUEL%20SORGE
lks