| Sublinear-Space Approximation Algorithms for Max r-SAT
|
2021 |
Biswas, Arindam |
| Most Pseudo-copy Languages Are Not Context-Free
|
2021 |
Cheon, Hyunjoon |
| Deterministic Metric 1-median Selection with a 1 — o(1) Fraction of Points Ignored
|
2021 |
Chang, Ching-Lueh |
| Consistent Simplification of Polyline Tree Bundles
|
2021 |
Bosch, Yannick |
| Fault Diagnosability of Regular Networks Under the Hybrid PMC Model
|
2021 |
Liu, Jiafei |
| On the Probe Problem for (r,ℓ)-Well-Coveredness
|
2021 |
Faria, Luerbio |
| Decremental Optimization of Vertex-Coloring Under the Reconfiguration Framework
|
2021 |
Yanagisawa, Yusuke |
| The Restrained Domination and Independent Restrained Domination in Extending Supergrid Graphs
|
2021 |
Hung, Ruo-Wei |
| The Concentration of the Maximum Degree in the Duplication-Divergence Models
|
2021 |
Frieze, Alan |
| Hypercontractivity via Tensor Calculus
|
2021 |
Skorski, Maciej |
| Respecting Lower Bounds in Uniform Lower and Upper Bounded Facility Location Problem
|
2021 |
Gupta, Neelima |
| On the Hardness of Opinion Dynamics Optimization with L1-Budget on Varying Susceptibility to Persuasion
|
2021 |
Chan, T.-H. Hubert |
| Single-Pass Streaming Algorithms to Partition Graphs into Few Forests
|
2021 |
Chiang, Cheng-Hung |
| The Secretary Problem with Reservation Costs
|
2021 |
Burjons, Elisabet |
| Disconnected Matchings
|
2021 |
Gomes, Guilherme C. M. |
| Constrained Hitting Set Problem with Intervals
|
2021 |
Acharyya, Ankush |
| An Efficient Algorithm for Enumerating Longest Common Increasing Subsequences
|
2021 |
Lin, Chun |
| Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator Against Permutation Branching Programs
|
2021 |
Pyne, Edward |
| General Max-Min Fair Allocation
|
2021 |
Ko, Sheng-Yen |
| A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph
|
2021 |
Cameron, Ben |
Tag hinzufügen