Transactions on Algorithms (TALG)

Recent Papers/Articles

Width of Points in the Streaming Model

READ
Bypassing UGC from Some Optimal Geometric Inapproximability Results

and 

READ
Anarchy Is Free in Network Creation

and 

READ
Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension

and 

READ
A Simple and Efficient Algorithm for Computing Market Equilibria

and 

READ
Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc Networks

and 

READ
Fast Constructions of Lightweight Spanners for General Graphs

and 

READ
Optimal Orthogonal Graph Drawing with Convex Bend Costs

and 

READ
Families with Infants: Speeding Up Algorithms for NP-Hard Problems Using FFT

and 

READ
A Constant Factor Approximation Algorithm for Fault-Tolerant

and 

READ
On the Expected Complexity of Voronoi Diagrams on Terrains

and 

READ
All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns

and 

READ
Sparse Text Indexing in Small Space

and 

READ
 
 
For support, write to support@knimbus.com
Copyright 2011-2016, Knimbus. All rights reserved.