1: Two-Dimensional Indirect Binary Search for the Positive One-in-Three Satisfiability Problem
2: Spectral Sparsification of Simplicial Complexes for Clustering and Label Propagation
3: Deterministic Digital Clustering of Wireless Ad Hoc Networks
4: Natasha 2: Faster Non-Convex Optimization Than SGD
5: Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs
6: Aligned Drawings of Planar Graphs
7: Cheeger Inequalities for Submodular Transformations
8: Efficient Algorithms for Checking Fast Termination in VASS
9: Online Circle and Sphere Packing
10: Tensor network method for reversible classical computation
11: An O(log log m)-competitive Algorithm for Online Machine Minimization
12: Answering Spatial Multiple-Set Intersection Queries Using 2-3 Cuckoo Hash-Filters
13: Dynamic Graph Coloring
14: Planar L-Drawings of Directed Graphs
15: On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings
16: Experimental Evaluation of Book Drawing Algorithms
17: On Vertex- and Empty-Ply Proximity Drawings
18: Planar Drawings of Fixed-Mobile Bigraphs
19: An Interactive Tool to Explore and Improve the Ply Number of Drawings
20: NodeTrix Planarity Testing with Small Clusters
21: Approximating Weighted Duo-Preservation in Comparative Genomics
22: Designing Strassen’s algorithm
23: An algorithm to simulate alternating Turing machine in signal machine
24: Simple Compact Monotone Tree Drawings
25: Visualizing Co-Phylogenetic Reconciliations
26: Sketching the order of events
27: Space-efficient classical and quantum algorithms for the shortest vector problem