Author of the publication

Using Bounded Degree Spanning Trees in the Design of Efficient Algorithms on Claw-Free Graphs.

, , and . WADS, volume 382 of Lecture Notes in Computer Science, page 147-162. Springer, (1989)

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

Online Primal-Dual Algorithms for Covering and Packing., and . Math. Oper. Res., 34 (2): 270-286 (2009)An Efficient Parallel Algorithm for Computing a Large Independent Set in Planar Graph., and . Algorithmica, 6 (6): 801-815 (1991)Approximation Algorithms for the Vertex Feedback Set Problem with Applications to Constraint Satisfaction and Bayesian Inference., , , and . SODA, page 344-354. ACM/SIAM, (1994)Fast Approximate Graph Partitioning Algorithms., , , and . SODA, page 639-648. ACM/SIAM, (1997)Coping with Interference: From Maximum Coverage to Planning Cellular Networks., , and . WAOA, volume 4368 of Lecture Notes in Computer Science, page 29-42. Springer, (2006)Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue., , and . ESA, volume 4698 of Lecture Notes in Computer Science, page 253-264. Springer, (2007)Dynamic Storage Allocation with Known Durations., , and . ESA, volume 1284 of Lecture Notes in Computer Science, page 378-387. Springer, (1997)Algorithmic Aspects of Bandwidth Trading., , , and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 751-766. Springer, (2003)Computing a Perfect Matching in a Line Graph.. AWOC, volume 319 of Lecture Notes in Computer Science, page 139-148. Springer, (1988)Latency Aware Placement in Multi-access Edge Computing., , and . NetSoft, page 132-140. IEEE, (2018)