1: Planar Confluent Orthogonal Drawings of 4-Modal Digraphs
2: Recognizing DAGs with Page-Number 2 is NP-complete
3: Scalable Multilevel and Memetic Signed Graph Clustering
4: Finding Near-Optimal Weight Independent Sets at Scale
5: Minimizing Completion Times for Stochastic Jobs via Batched Free Times
6: Graph Exploration with Embedding-Guided Layouts
7: Configuration Balancing for Stochastic Requests
8: Randomized Approximation Schemes for the Tutte Polynomial and Random Clustering in Subdense and Superdense Graphs
9: Minimum Coverage Instrumentation
10: Fitting Metrics and Ultrametrics with Minimum Disagreements
11: Achievable Rates and Algorithms for Group Testing with Runlength Constraints
12: Shape-Faithful Graph Drawings
13: Small Point-Sets Supporting Graph Stories
14: On the Fixed-Parameter Tractability of Capacitated Clustering
15: On Sparse Hitting Sets: from Fair Vertex Cover to Highway Dimension
16: Unit-length Rectangular Drawings of Graphs
17: Approximation Algorithms for Drone Delivery Packing Problem
18: Sorting Genomes by Prefix Double-Cut-and-Joins
19: Improved Deterministic Algorithms for Non-monotone Submodular Maximization
20: Unbalancing Binary Trees
21: Pattern matching under DTW distance
22: Combinatorial Algorithms for Subsequence Matching: A Survey
23: Computing all-vs-all MEMs in run-length encoded collections of HiFi reads
24: On weighted graph separation problems and flow-augmentation