Author of the publication

1-Bounded Space Algorithms for 2-Dimensional Bin Packing.

, , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 321-330. Springer, (2009)

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

Optimal methods for coordinated enroute web caching for tree networks., , , and . ACM Trans. Internet Techn., 5 (3): 480-507 (2005)An O(n) Algorithm for Determining a Near-Optimal Computation Order of Matrix Chain Products.. Commun. ACM, 21 (7): 544-549 (1978)Generalized Planted (l, d)-Motif Problem with Negative Set., and . WABI, volume 3692 of Lecture Notes in Computer Science, page 264-275. Springer, (2005)The Point Placement Problem on a Line - Improved Bounds for Pairwise Distance Queries., , , and . WABI, volume 4645 of Lecture Notes in Computer Science, page 372-382. Springer, (2007)A New Subgraph of Minimum Weight Triangulations., , and . ISAAC, volume 1178 of Lecture Notes in Computer Science, page 266-274. Springer, (1996)Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees., and . ISAAC, volume 2223 of Lecture Notes in Computer Science, page 172-184. Springer, (2001)A tight lower bound for job scheduling with cancellation., , , , and . Inf. Process. Lett., 97 (1): 1-3 (2006)An efficient motif discovery algorithm with unknown motif length and number of binding sites., and . IJDMB, 1 (2): 201-215 (2006)Finding exact optimal motifs in matrix representation by partitioning., and . ECCB/JBI, page 92. (2005)Multimedia object placement for hybrid transparent data replication., , , and . GLOBECOM, page 5. IEEE, (2005)