| 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 |
| 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 |
| 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 |
Tag hinzufügen