Top-K Color Queries for Document Retrieval

Topics in Matrix Sampling Algorithms

Towards a Data Reduction for the Minimum Flip Supertree Problem

Towards an $O(\sqrt[3]{\log n})$-Approximation Algorithm for {\sc Balanced Separator}

Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval

Towards an SDP-based Approach to Spectral Methods: A Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition

Towards optimal kernel for connected vertex cover in planar graphs

Towards Optimal Range Medians

Towards Optimal Sorting of 16 Elements

Towards P = NP via k-SAT: A k-SAT Algorithm Using Linear Algebra on Finite Fields

Towards Robust and Efficient Computation in Dynamic Peer-to-Peer Networks

Tractable hypergraph properties for constraint satisfaction and conjunctive queries

Traffic-Redundancy Aware Network Design

Transdichotomous Results in Computational Geometry, II: Offline Search

Transforming a random graph drawing into a Lombardi drawing

Transitive-Closure Spanners

Translating the EAH Data Compression Algorithm into Automata Theory

Tree structure compression with RePair

Treewidth computation and extremal combinatorics

Treewidth reduction for constrained separation and bipartization problems