| Three Problems on Well-Partitioned Chordal Graphs
|
2021 |
Ahn, Jungho |
| On Vertex-Weighted Graph Realizations
|
2021 |
Bar-Noy, Amotz |
| Online and Approximate Network Construction from Bounded Connectivity Constraints
|
2021 |
Jansson, Jesper |
| Temporal Matching on Geometric Graph Data
|
2021 |
Picavet, Timothe |
| 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 |
| Throughput Scheduling with Equal Additive Laxit
|
2021 |
Böhm, Martin |
| Fragile Complexity of Adaptive Algorithms
|
2021 |
Bose, Prosenjit |
| A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs
|
2021 |
Chitnis, Rajesh |
| A Multistage View on 2-Satisfiability
|
2021 |
Fluschnik, Till |
| The Parameterized Suffix Tray
|
2021 |
Fujisato, Noriki |
| Online Two-Dimensional Vector Packing With Advice
|
2021 |
Nilsson, Bengt J. |
| 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 |
Tag hinzufügen