| 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 |
| Hardness and Approximation Results of Roman {3}-Domination in Graphs
|
2021 |
Goyal, Pooja |
| Sequence Graphs Realizations and Ambiguity in Language Models
|
2021 |
Khalife, Sammy |
| Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set
|
2021 |
Durocher, Stephane |
| The Coverage Problem by Aligned Disks
|
2021 |
Nakano, Shin-ichi |
| Reliability Evaluation of Subsystem Based on Exchanged Hypercube
|
2021 |
Wang, Yihong |
| A Study for Conditional Diagnosability of Pancake Graphs
|
2021 |
Chang, Nai-Wen |
| Constructing Tri-CISTs in Shuffle-Cubes
|
2021 |
Chen, Yu-Han |
| The Weakly Dimension-Balanced Pancyclicity on Toroidal Mesh Graph Tm,n When Both m and n Are Odd
|
2021 |
Juan, Justie Su-Tzu |
| Approximate the Lower-Bounded Connected Facility Location Problem
|
2021 |
Han, Lu |
| Symmetric Norm Estimation and Regression on Sliding Windows
|
2021 |
Braverman, Vladimir |
| On the d-Claw Vertex Deletion Problem
|
2021 |
Hsieh, Sun-Yuan |
| A Card-Minimal Three-Input AND Protocol Using Two Shuffles
|
2021 |
Isuzugawa, Raimu |
| All-to-All Broadcast in Dragonfly Networks
|
2021 |
Xiang, Dong |
| On Singleton Congestion Games with Resilience Against Collusion
|
2021 |
Caskurlu, Bugra |
| Approximate Distance Oracles with Improved Stretch for Sparse Graphs
|
2021 |
Roditty, Liam |
| Approximation Algorithms for Priority Steiner Tree Problems
|
2021 |
Sahneh, Faryad Darabi |
Tag hinzufügen