| 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 |
| Weisfeiler-Leman and Graph Spectra
|
2023 |
Rattan, Gaurav |
| Fast Algorithms for Solving the Hamilton Cycle Problem with High Probability
|
2023 |
Anastos, Michael |
| Timeliness through Telephones: Approximating Information Freshness in Vector Clock Models
|
2023 |
Chen, Da Qi |
| The Complete Classification for Quantified Equality Constraints
|
2023 |
Zhuk, Dmitriy |
| Approaching the Soundness Barrier: A Near Optimal Analysis of the Cube versus Cube Test
|
2023 |
Minzer, Dor |
| Algorithmizing the Multiplicity Schwartz-Zippel Lemma
|
2023 |
Bhandari, Siddharth |
| Approximating Knapsack and Partition via Dense Subset Sums
|
2023 |
Deng, Mingyang |
| Conflict-Free Hypergraph Matchings
|
2023 |
Glock, Stefan |
| On Problems Related to Unbounded SubsetSum: A Unified Combinatorial Approach
|
2023 |
Deng, Mingyang |
| 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 |
Tag hinzufügen