| Competitive Data-Structure Dynamization
|
2021 |
Mathieu, Claire |
| Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles
|
2021 |
Bera, Suman K. |
| Planar Distance Oracles with Better Time-Space Tradeoffs
|
2021 |
Long, Yaowei |
| Improved Algorithms for Solving Polynomial Systems over GF(2) by Multiple Parity-Counting
|
2021 |
Dinur, Itai |
| On Indexing and Compressing Finite Automata
|
2021 |
Cotumaccio, Nicola |
| A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting
|
2021 |
Filos-Ratsikas, Aris |
| Consistent k-Clustering for General Metrics
|
2021 |
Fichtenberger, Hendrik |
| Planar Negative K-Cycle
|
2021 |
Gawrychowski, Pawel |
| Approximating (k,£{)-Median Clustering for Polygonal Curves
|
2021 |
Buchin, Maike |
| Planar Reachability under Single Vertex or Edge Failures
|
2021 |
Italiano, Giuseppe F. |
| How to Morph Graphs on the Torus
|
2021 |
Chambers, Erin Wolf |
| Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model
|
2021 |
Nowicki, Krzysztof |
| Hardness of Approximation for Orienteering with Multiple Time Windows
|
2021 |
Garg, Naveen |
| Counting Small Permutation Patterns
|
2021 |
Even-Zohar, Chaim |
| Counting Homomorphisms to K4-minor-free Graphs, modulo 2
|
2021 |
Focke, Jacob |
| On the Orbit Closure Containment Problem and Slice Rank of Tensors
|
2021 |
Bläser, Markus |
| Dynamic Set Cover: Improved Amortized and Worst-Case Update Times
|
2021 |
Bhattacharya, Sayan |
| Coresets for Clustering in Excluded-minor Graphs and Beyond
|
2021 |
Braverman, Vladimir |
| Minimum-cost Integer Circulations in Given Homology Classes
|
2021 |
Morell, Sarah |
| Tight Bounds for Parallel Paging and Green Paging
|
2021 |
Agrawal, Kunal |
Tag hinzufügen