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
Trimmed Moebius Inversion and Graphs of Bounded Degree
Truly Online Paging with Locality of Reference
Truthful Unsplittable Flow for Large Capacity Networks
Two Multivehicle Routing Problems with Unit-Time Windows
Two snap-stabilizing point-to-point communication protocols in message-switched networks
Tying up the loose ends in fully LZW-compressed pattern matching
Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations
Unbiased Matrix Rounding
Unconstrained and Constrained Fault-Tolerant Resource Allocation
Understanding maximal repetitions in strings
Unified Compression-Based Acceleration of Edit-Distance Computation
Uniform unweighted set cover: The power of non-oblivious local search
Unifying the Landscape of Cell-Probe Lower Bounds
Unifying two Graph Decompositions with Modular Decomposition