StringologyTimes

Data Structures and Algorithms: 2024/6/29-31

1: Maximum Bipartite vs. Triangle-Free Subgraph
2: Fast Computation of the Discrete Fourier Transform Square Index Coefficients
3: The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs
4: Leveraging Fixed-Parameter Tractability for Robot Inspection Planning
5: On Line-Separable Weighted Unit-Disk Coverage and Related Problems
6: Unweighted Geometric Hitting Set for Line-Constrained Disks and Related Problems
7: Wooly Graphs : A Mathematical Framework For Knitting
8: A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs
9: A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs
10: Enumeration of minimal transversals of hypergraphs of bounded VC-dimension