An optimal result on fault-tolerant cycle-embedding in alternating group graphs Fulltext Access 5 Pages 2009
A note on width-parameterized SAT: An exact machine-model characterization Fulltext Access 5 Pages 2009
1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings Fulltext Access 5 Pages 2009
Multi-dimensional dynamic facility location and fast computation at query points Fulltext Access 5 Pages 2009
A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph Fulltext Access 5 Pages 2009
An algorithm for solving the longest increasing circular subsequence problem Fulltext Access 5 Pages 2009
A DP algorithm for minimizing makespan and total completion time on a series-batching machine Fulltext Access 5 Pages 2009
Time-varying PSO – convergence analysis, convergence-related parameterization and new parameter adjustment schemes Fulltext Access 5 Pages 2009
k-difference matching in amortized linear time for all the words in a text Fulltext Access 5 Pages 2009
New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm Fulltext Access 5 Pages 2009
Incremental deployment of network monitors based on Group Betweenness Centrality Fulltext Access 5 Pages 2009
Online scheduling on unbounded parallel-batch machines to minimize the makespan Fulltext Access 5 Pages 2009
A note on minimizing makespan on a single batch processing machine with nonidentical job sizes Fulltext Access 5 Pages 2009
Bounded cost algorithms for multivalued consensus using binary consensus instances Fulltext Access 5 Pages 2009
Task distribution using factoring load balancing in Master–Worker applications Fulltext Access 5 Pages 2009
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time Fulltext Access 5 Pages 2009
The average number of block interchanges needed to sort a permutation and a recent result of Stanley Fulltext Access 5 Pages 2009
Assembling approximately optimal binary search trees efficiently using arithmetics Fulltext Access 5 Pages 2009
A Sturmian sequence related to the uniqueness conjecture for Markoff numbers Fulltext Access 6 Pages 2009
Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead Fulltext Access 6 Pages 2009
A randomized algorithm for determining dominating sets in graphs of maximum degree five Fulltext Access 6 Pages 2009
The minimum number of ee-vertex-covers among hypergraphs with ee edges of given ranks Fulltext Access 6 Pages 2009
Upper bounds of degree 3 for the probability of the union of events via linear programming Fulltext Access 6 Pages 2009
Listing minimal edge-covers of intersecting families with applications to connectivity problems Fulltext Access 6 Pages 2009
Algorithms for connected set cover problem and fault-tolerant connected set cover problem Fulltext Access 6 Pages 2009
On the inapproximability of independent domination in 2P3-free perfect graphs Fulltext Access 6 Pages 2009