| Efficient Linear and Affine Codes for Correcting Insertions/Deletions
|
2021 |
Cheng, Kuan |
| Polynomial-time Trace Reconstruction in the Smoothed Complexity Model
|
2021 |
Chen, Xi |
| Non-linear Hamilton Cycles in Linear Quasi-Random Hypergraphs
|
2021 |
Han, Jie |
| How Many Vertices Does a Random Walk Miss in a Network with Moderately Increasing the Number of Vertices?
|
2021 |
Kijima, Shuji |
| A Polynomial Time Algorithm for the k-Disjoint Shortest Paths Problem
|
2021 |
Lochet, William |
| Directed Shortest Paths via Approximate Cost Balancing
|
2021 |
Orlin, James B. |
| On Tolerant Distribution Testing in the Conditional Sampling Model
|
2021 |
Narayanan, Shyam |
| Approximation Algorithms and Hardness for Strong Unique Games
|
2021 |
Ghoshal, Suprovat |
| The Demand Query Model for Bipartite Matching
|
2021 |
Nisan, Noam |
| A Fast Minimum Degree Algorithm and Matching Lower Bound
|
2021 |
Cummings, Robert |
| An Improved Procedure for Colouring Graphs of Bounded Local Density
|
2021 |
Hurley, Eoin |
| Rolling Backwards can Move you Forward: On Embedding Problems in Sparse Expanders
|
2021 |
Draganié, Nemanja |
| Strong Connectivity Augmentation is FPT
|
2021 |
Klinkby, Kristine Vitting |
| A Refined Laser Method and Faster Matrix Multiplication
|
2021 |
Alman, Josh |
| Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers
|
2021 |
Jambulapati, Arun |
| On a Combinatorial Generation Problem of Knuth
|
2021 |
Merino, Arturo |
| Explicit Two-deletion Codes with Redundancy Matching the Existential Bound
|
2021 |
Guruswami, Venkatesan |
| Solving Hard Cut Problems via Flow-Augmentation
|
2021 |
Kim, Eun Jung |
| FPT-Approximation for FPT Problems
|
2021 |
Lokshtanov, Daniel |
| Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting
|
2021 |
Lokshtanov, Daniel |
Tag hinzufügen