| Approximating Routing and Connectivity Problems with Multiple Distances
|
2020 |
Pedrosa, Lehilton L. C. |
| Scheduling on Hybrid Platforms: Improved Approximability Window
|
2020 |
Fagnon, Vincent |
| Leafy Spanning Arborescences in DAGs
|
2020 |
Fernandes, Cristina G. |
| PTAS for Steiner Tree on Map Graphs
|
2020 |
Byrka, Jarosław |
| A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem
|
2020 |
Pedrosa, Lehilton L. C. |
| Graph Hamiltonicity Parameterized by Proper Interval Deletion Set
|
2020 |
Golovach, Petr A. |
| Structural Parameterizations for Equitable Coloring
|
2020 |
Gomes, Guilherme C. M. |
| Graph Square Roots of Small Distance from Degree One Graphs
|
2020 |
Golovach, Petr A. |
| Flips in Higher Order Delaunay Triangulations
|
2020 |
Arseneva, Elena |
| Computing Balanced Convex Partitions of Lines
|
2020 |
Bereg, Sergey |
| Ordered Strip Packing
|
2020 |
Buchin, K. |
| Monotone Circuit Lower Bounds from Robust Sunflowers
|
2020 |
Cavalar, Bruno Pasqualotto |
| Farthest Color Voronoi Diagrams: Complexity and Algorithms
|
2020 |
Mantas, Ioannis |
| Sherali-Adams and the Binary Encoding of Combinatorial Principles
|
2020 |
Dantchev, Stefan |
| Hardness of Variants of the Graph Coloring Game
|
2020 |
Marcilon, Thiago |
| The Hardness of Sampling Connected Subgraphs
|
2020 |
Read-McFarland, Andrew |
| Steiner Trees for Hereditary Graph Classes
|
2020 |
Bodlaender, Hans L. |
| Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ Cliques
|
2020 |
Alves, Sancrey Rodrigues |
| On the Helly Subclasses of Interval Bigraphs and Circular Arc Bigraphs
|
2020 |
Groshaus, M. |
| Near-Linear Time Algorithm for Approximate Minimum Degree Spanning Trees
|
2020 |
Duan, Ran |
Tag hinzufügen