| Invited Talks
|
2021 |
Fernau, Henning |
| Algorithms for Energy Conservation in Heterogeneous Data Centers
|
2021 |
Albers, Susanne |
| On the Role of 3’s for the 1-2-3 Conjecture
|
2021 |
Bensmail, Julien |
| The Weisfeiler-Leman Algorithm and Recognition of Graph Properties
|
2021 |
Fuhlbrück, Frank |
| Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity
|
2021 |
Gima, Tatsuya |
| Can Local Optimality Be Used for Efficient Data Reduction?
|
2021 |
Komusiewicz, Christian |
| Distributed Distance-r Covering Problems on Sparse High-Girth Graphs
|
2021 |
Amiri, Saeed Akhoondian |
| Reconfiguration of Connected Graph Partitions via Recombination
|
2021 |
Akitaya, Hugo A. |
| Upper Tail Analysis of Bucket Sort and Random Tries
|
2021 |
Bercea, Ioana O. |
| FPT and Kernelization Algorithms for the Induced Tree Problem
|
2021 |
Gomes, Guilherme Castro Mendes |
| The Multi-budget Maximum Weighted Coverage Problem
|
2021 |
Cellinese, Francesco |
| On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering
|
2021 |
Figiel, Aleksander |
| Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential Approximation
|
2021 |
Dublois, Louis |
| Covering a Set of Line Segments with a Few Squares
|
2021 |
Gudmundsson, Joachim |
| Circumventing Connectivity for Kernelization
|
2021 |
Jain, Pallavi |
| Globally Rigid Augmentation of Minimally Rigid Graphs in R2
|
2021 |
Kiraly, Csaba |
| Extending Partial Representations of Rectangular Duals with Given Contact Orientations
|
2021 |
Chaplick, Steven |
| Colouring Graphs of Bounded Diameter in the Absence of Small Cycles
|
2021 |
Martin, Barnaby |
| Three Problems on Well-Partitioned Chordal Graphs
|
2021 |
Ahn, Jungho |
| On Vertex-Weighted Graph Realizations
|
2021 |
Bar-Noy, Amotz |
Tag hinzufügen