Showing 101–119 of 119 results
/ Date/ Name
Feb 23, 2014A Tabu Search/Path Relinking Algorithm to Solve the Job Shop Scheduling ProblemFeb 19, 2014Sparse Quantile Huber Regression for Efficient and Robust EstimationFeb 14, 2014A Unifying Model for Representing Time-Varying GraphsDec 16, 2013An improved Branch-and-cut code for the maximum balanced subgraph of a signed graphApr 8, 2013Backward Path Growth for Efficient Mobile Sequential RecommendationFeb 19, 2013Random-walk domination in large graphs: problem definitions and fast solutionsJul 26, 2012On Mimicking Networks Representing Minimum Terminal CutsJul 15, 2012Memory Efficient De Bruijn Graph ConstructionMay 8, 2012Matching with CommitmentsFeb 29, 2012Sublinear Time Approximate Sum via Uniform Random SamplingDec 2, 2011On the Complexity of Approximate Sum of Sorted ListNov 7, 2011Generalised k-Steiner Tree Problems in Normed PlanesNov 3, 2011Many Sparse Cuts via Higher EigenvaluesSep 22, 2011Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout ProblemsJul 15, 2010XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation SchemeJul 15, 2010Sublinear Time Motif Discovery from Multiple SequencesJul 7, 2010A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin PackingFeb 9, 2010Estimating and Sampling Graphs with Multidimensional Random WalksJan 26, 2001Optimal Constructions of Hybrid Algorithms