StringologyTimes

Data Structures and Algorithms: 2018/3/01-07

1: An Approximate Pareto Set for Minimizing the Maximum Lateness and Makespan on Parallel Machines
2: Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network
3: INSPECTRE: Privately Estimating the Unseen
4: An efficient algorithm to test forcibly-connectedness of graphical degree sequences
5: Simple and Local Independent Set Approximation
6: Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-And-Solve
7: Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars
8: On the Relation of Strong Triadic Closure and Cluster Deletion
9: Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpi'nski gasket
10: Maximum Volume Subset Selection for Anchored Boxes
11: Hardness of Approximate Nearest Neighbor Search
12: Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set
13: Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering
14: Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation
15: An improved FPT algorithm for Independent Feedback Vertex Set
16: Multivariate Fine-Grained Complexity of Longest Common Subsequence
17: Histogram Sort with Sampling
18: Station Assignment with Reallocation
19: Design, Generation, and Validation of Extreme Scale Power-Law Graphs
20: Maximizing Efficiency in Dynamic Matching Markets
21: Two-Dimensional Block Trees
22: Optimizing Learned Bloom Filters by Sandwiching
23: Controlled quantum search on structured databases
24: String Attractors: Verification and Optimization
25: Optimal Substring-Equality Queries with Applications to Sparse Text Indexing
26: John’s Walk
27: Revisiting Frequency Moment Estimation in Random Order Streams
28: Matched Filters for Noisy Induced Subgraph Detection
29: Population stability: regulating size in the presence of an adversary
30: Submodular maximization with uncertain knapsack capacity
31: Compact Representations of Event Sequences
32: Sketching for Principal Component Regression