| Unifying Matrix Data Structures: Simplifying and Speeding-up Iterative Algorithms
|
2021 |
Brand, Jan van den |
| Soft Sequence Heaps
|
2021 |
Brodal, Gerth Stølting |
| New Bounds for the Vertices of the Integer Hull
|
2021 |
Berndt, Sebastian |
| Dispersion for Intervals: A Geometric Approach
|
2021 |
Biedl, Therese |
| Simple Dynamic Algorithms for Maximal Independent Set, Maximum Flow and Maximum Matching
|
2021 |
Gupta, Manoj |
| Recognizing (Unit) Interval Graphs by Zigzag Graph Searches
|
2021 |
Cao, Yixin |
| An Economics-Based Analysis of RANKING for Online Bipartite Matching
|
2021 |
Eden, Alon |
| Floors and Ceilings in Divide-and-Conquer Recurrences
|
2021 |
Kuszmaul, William |
| An Auction Algorithm for Bipartite Matching in Streaming and Massively Parallel Computation Models
|
2021 |
Assadi, Sepehr |
| Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture
|
2021 |
Anegg, Georg |
| Fast and Simple Modular Subset Sum
|
2021 |
Axiotis, Kyriakos |
| Recursive Random Contraction Revisited
|
2021 |
Karger, David R. |
| A Note on a Recent Algorithm for Minimum Cut
|
2021 |
Gawrychowski, Pawel |
| Generalized Sorting with Predictions
|
2021 |
Lu, Pinyan |
| A Simple Semi-Streaming Algorithm for Global Minimum Cuts
|
2021 |
Assadi, Sepehr |
| A Simple Deterministic Algorithm for Edge Connectivity
|
2021 |
Saranurak, Thatchaphol |
| A Simple and Fast Algorithm for Computing the N-th Term of a Linearly Recurrent Sequence
|
2021 |
Bostan, Alin |
| A Breezing Proof of the KMW Bound
|
2021 |
Coupette, Corinna |
| On Hardness of Approximation of Parameterized Set Cover and Label Cover: Threshold Graphs from Error Correcting Codes
|
2021 |
Karthik, C. S. |
| Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism
|
2021 |
Gibney, Daniel |
Tag hinzufügen