Cs-Ds
On finding minimal w-cutset
Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation
Network Backbone Discovery Using Edge Clustering
A Tractable Approach to Finding Closest Truncated-commute-time Neighbors in Large Graphs
Improving the Asymmetric TSP by Considering Graph Structure
Density Functions subject to a Co-Matroid Constraint
Approximation Algorithm for Non-Boolean MAX k-CSP
Lyndon Words and Short Superstrings
Lower Bounds on Information Dissemination in Dynamic Networks
Tree decomposition and parameterized algorithms for RNA structure-sequence alignment including tertiary interactions and pseudoknots
LP-rounding Algorithms for the Fault-Tolerant Facility Placement Problem
A single-exponential FPT algorithm for the $K_4$-minor cover problem
Maximum Inner-Product Search using Tree Data-structures
Root optimization of polynomials in the number field sieve
StaticGreedy: solving the scalability-accuracy dilemma in influence maximization
Creating a level playing field for all symbols in a discretization
Data-Oblivious Graph Drawing Model and Algorithms
Deciding Monotone Duality and Identifying Frequent Itemsets in Quadratic Logspace
Rerouting shortest paths in planar graphs
Relationships in Large-Scale Graph Computing
Counting inequivalent monotone Boolean functions
Algorithms and Complexity Results for Exact Bayesian Structure Learning
