Oblivious Algorithms for the Maximum Directed Cut Problem
Oblivious Buy-at-Bulk in Planar Graphs
Oblivious Medians via Online Bidding
Obtaining a Bipartite Graph by Contracting Few Edges
Obtaining a Planar Graph by Vertex Deletion
Obtaining Planarity by Contracting Few Edges
Offline Algorithmic Techniques for Several Content Delivery Problems in Some Restricted Types of Distributed Systems
Offline Algorithms for Several Network Design, Clustering and QoS Optimization Problems
On a conjecture of compatibility of multi-states characters
On a game theoretic approach to capacity maximization in wireless networks
On a New Method of Storing a Variable Size Array
On Allocating Goods to Maximize Fairness
On an optimization technique using Binary Decision Diagram
On Approximating Frequency Moments of Data Streams with Skewed Projections
On Approximating Multi-Criteria TSP
On Approximating String Selection Problems with Outliers
On Bijective Variants of the Burrows-Wheeler Transform
On Column-restricted and Priority Covering Integer Programs
On Complexity of Minimum Leaf Out-branching Problem
On Compressing Permutations and Adaptive Sorting