Author of the publication

Better bounds for incremental frequency allocation in bipartite graphs.

, , and . Theor. Comput. Sci., (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines Without Preemption., and . Theory Comput. Syst., 56 (1): 73-81 (2015)Semi-Online Preemptive Scheduling: One Algorithm for All Variants., and . Theory Comput. Syst., 48 (3): 577-613 (2011)An Approximation Scheme For Cake Division With A Linear Number Of Cuts., and . Combinatorica, 27 (2): 205-211 (2007)Preemptive Online Scheduling: Optimal Algorithms for All Speeds., , and . Algorithmica, 53 (4): 504-522 (2009)Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines., and . ESA, volume 1643 of Lecture Notes in Computer Science, page 151-162. Springer, (1999)Improved Online Algorithms for Buffer Management in QoS Switches., , , and . ESA, volume 3221 of Lecture Notes in Computer Science, page 204-215. Springer, (2004)The optimal absolute ratio for online bin packing., , , , and . J. Comput. Syst. Sci., (2019)Online competitive algorithms for maximizing weighted throughput of unit jobs., , , , , and . J. Discrete Algorithms, 4 (2): 255-276 (2006)Paging with connections: FIFO strikes again., , , and . Theor. Comput. Sci., 377 (1-3): 55-64 (2007)The weighted 2-server problem., and . Theor. Comput. Sci., 324 (2-3): 289-312 (2004)