A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth
A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time
A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs
A Fast Algorithm for Three-Dimensional Layers of Maxima Problem
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
A Fast Multigrid Algorithm for Energy Minimization Under Planar Density Constraints
A fast nearest neighbor search algorithm based on vector quantization
A fast vectorised implementation of Wallace's normal random number generator
A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem
A Faster Grammar-Based Self-Index
A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth
A Fixed-Parameter Algorithm for Random Instances of Weighted d-CNF Satisfiability
A Full Derandomization of Schoening's k-SAT Algorithm
A Fully Polynomial Randomized Approximation Scheme for the All Terminal Network Reliability Problem
A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems
A General Framework for Graph Sparsification
A generalization of Hopcroft-Karp algorithm for semi-matchings and covers in bipartite graphs
A Generalized Recursive Algorithm for Binary Multiplication based on Vedic Mathematics
A Generic Top-Down Dynamic-Programming Approach to Prefix-Free Coding
A Geometric Approach to Matrix Ordering