1: Interval-Constrained Bipartite Matching over Time
2: On the enumeration of signatures of XOR-CNF’s
3: Dynamic Deterministic Constant-Approximate Distance Oracles with $n^{\epsilon}$ Worst-Case Update Time
4: Efficient Processing of Subsequent Densest Subgraph Query
5: Rahmani Sort: A Novel Variant of Insertion Sort Algorithm with O(nlogn) Complexity
6: Computing Longest Common Subsequence under Cartesian-Tree Matching Model
7: Edit and Alphabet-Ordering Sensitivity of Lex-parse