82. Workshop on Algorithms and Complexity (Theorietag)
The Workshop on Algorithms and Complexity (Theorietag) is a recurring event featured by Fachgruppe Algorithmen and Fachgruppe Komplexität of the Gesellschaft für Informatik. A list of past occurrences can be found here.
This Theorietag is supported by DFG Research Group ADYN.
- Start: 08.06.2022, 13:00
- End: 09.06.2022, 11:30
- Organizer: Anselm Haak
- Invited talk: Pascal Schweitzer from Darmstadt will talk about “The Theory of Practical Graph Isomorphism Solving”.
- If you would like to attend, please register by E-Mail to email@example.com until 25.05.2022.
- If you plan to give a talk, please include the title and abstract (preferrably LaTeX) in your mail, also by 25.05.2022. If there is a corresponding manuscript available online, please also send the link for that. Talks should be ~25 minutes long (including discussion).
- Location: PA Building on Campus Westend of Goethe-Universität Frankfurt, which is building 10 on the map below (Google Maps), see here for directions to the campus.
- Schedule: See below.
- Programme: Download pdf here.
The workshop is aimed at all those interested in research in the field of theoretical computer science. The focus is mainly on complexity, algorithms and data structures, as well as parallel and distributed algorithms. Participation in the workshop does not constitute a publication, so both ongoing and completed work can be presented. A declared goal of the workshop is to enable contact between young and senior scientists.
The workshop will take place offline again for the first time since the beginning of the pandemic.
|12:30 - 13:05||Check-In and Coffee|
|13:05 - 13:10||Welcome|
|13:10 - 14:00||Invited Talk: The Theory of Practical Graph Isomorphism Solving (Pascal Schweitzer, Darmstadt)|
|14:00 - 14:25||Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks (Marcus Wilhelm, Karlsruhe)|
|14:25 - 14:50||Break|
|14:50 - 15:15||Parameterized Local Search for Max c-Cut (Nils Morawietz, Marburg)|
|15:15 - 15:40||Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings (Johannes Meintrup, Gießen)|
|15:40 - 16:05||The Complexity of Finding Fair Many-to-One Matchings (Tomohiro Koana, Berlin)|
|16:05 - 16:30||Break|
|16:30 - 16:55||Sublinear-Time Probabilistic Cellular Automata (Augusto Modanese, Karlsruhe)|
|16:55 - 17:20||Subsequences With Gap Constraints: Complexity Bounds for Matching and Analysis Problems (Markus Schmid, Berlin)|
|17:20 - 17:45||Equation satisfiability for finite solvable groups (Armin Weiß, Stuttgart)|
|17:45 - 18:30||Transition|
|18:30 - <22:00||Dinner|
|08:30 - 09:05||Coffee|
|09:05 - 09:30||On Computing Exact Means of Time Series Using the Move-Split-Merge Metric (Jana Holznigenkemper, Marburg)|
|09:30 - 09:55||PPSZ is better than you think (Dominik Scheder, Shanghai)|
|09:55 - 10:20||Counter Claim Augmented Argumentation Frameworks (Yasir Mahmood, Hannover)|
|10:20 - 10:40||Break|
|10:40 - 11:05||Logical Charactarizations of Algebraic Circuit Classes over Rings (Sabrina Gaube, Hannover)|
|11:05 - 11:30||Public Signals in Network Congestion Games (Tim Koglin, Frankfurt)|
The final meeting of the DFG Priority Programme “Algorithms for Big Data” will take place directly after this workshop (09.06.-10.06.) at the same venue. Please consider attending that meeting as well.