The MathNet Korea
Information Center for Mathematical Science

### 논문검색

Information Center for Mathematical Science

SIAM Journal on Computing
( Vol.28 NO.1 / 1999 )
 Separator-Based Sparsification II: Edge and Vertex Connectivity Pages 341-381 Sublogarithmic Bounds on Space and Reversals Pages 325-340 New Collapse Consequences of NP Having Small Circuits Pages 311-324 A Spectral Algorithm for Seriation and the Consecutive Ones Problem Pages 297-310 Unoriented $\Theta$-Maxima in the Plane: Complexity and Algorithms Pages 278-296 Near-Linear Time Construction of Sparse Neighborhood Covers Pages 263-277 New Approximation Guarantees for Minimum-Weight $k$-Trees and Prize-Collectiog Salesmen Pages 254-262 Smart Smart Bounds for Weighted Response Time Scheduling Pages 237-253 Fast Algorithms for Constructing $t$-Spanners and Paths with Stretch $t$ Pages 210-236 Maximum $k$-Chains in Planar Point Sets: Combinatorial Structure and Algorithms Pages 192-209 On Syntactic Versus Computational Views of Approximability Pages 164-191 L-Printable Sets Pages 137-151 Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems Pages 105-136 The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study Through Datalog and Group Theory Pages 57-104 Weighted NP Optimization Problems: Logical Definability and Approximation Properties Pages 36-56 On the Structure of $\mathcal {NP}_{\mathbb C}$ Pages 27-35 Dynamic 2-Connectivity with Backtracking Pages 10-26 The Inverse Satisfiability Problem Pages 152-163 Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums Pages 1-9