| Dynamically Optimal Self-adjusting Single-Source Tree Networks
|
2020 |
Avin, Chen |
| Tight Bounds on Sensitivity and Block Sensitivity of Some Classes of Transitive Functions
|
2020 |
Chaubal, Siddhesh |
| On Symmetry and Initialization for Neural Networks
|
2020 |
Nachum, Ido |
| Lower Bounds for Max-Cut via Semidefinite Programming
|
2020 |
Carlson, Charles |
| On Minimal-Perimeter Lattice Animals
|
2020 |
Barequet, Gill |
| A Method to Prove the Nonrationality of Some Combinatorial Generating Functions
|
2020 |
Bóna, Miklós |
| On Some Subclasses of Split B1-EPG Graphs
|
2020 |
Deniz, Zakir |
| 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 |
Tag hinzufügen