| Improved Girth Approximation in Weighted Undirected Graphs
|
2023 |
Kadaria, Avi |
| Approximate Graph Colouring and Crystals
|
2023 |
Ciardo, Lorenzo |
| A Simple and Sharper Proof of the Hypergraph Moore Bound
|
2023 |
Hsieh, Jun-Ting |
| Approximation Algorithms for Steiner Tree Augmentation Problems
|
2023 |
Ravi, R. |
| Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization
|
2023 |
Ghaffari, Mohsen |
| Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows
|
2023 |
Cen, Ruoxu |
| Optimal Deterministic Massively Parallel Connectivity on Forests
|
2023 |
Balliu, Alkida |
| Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole
|
2023 |
Haxell, Penny |
| Exact Flow Sparsification Requires Unbounded Size
|
2023 |
Krauthgamer, Robert |
| Improved Approximation for Two-Edge-Connectivity
|
2023 |
Garg, Mohit |
| Fast Distributed Brooks' Theorem
|
2023 |
Fischer, Manuela |
| Weak Bisimulation Finiteness of Pushdown Systems with Deterministic ε-Transitions Is 2-ExpTime-Complete
|
2023 |
Göller, Stefan |
| On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Trianglar Structured ILPs
|
2023 |
Klein, Kim-Manuel |
| Small Subgraphs with Large Average Degree
|
2023 |
Janzer, Oliver |
| Faster Computation of 3-Edge-Connected Components in Digraphs
|
2023 |
Georgiadis, Loukas |
| Distributed Maximal Matching and Maximal Independent Set on Hypergraphs
|
2023 |
Balliu, Alkida |
| Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries
|
2023 |
Bateni, Mohammad Hossein |
| A New Approach to Estimating Effective Resistances and Counting Spanning Trees in Expander Graphs
|
2023 |
Li, Lawrence |
| Query Complexity of Inversion Minimization on Trees
|
2023 |
Hu, Ivan |
| Generalized Unrelated Machine Scheduling Problem
|
2023 |
Deng, Shichuan |
Tag hinzufügen