Author of the publication

Tight Approximation for Partial Vertex Cover with Hard Capacities.

, , , and . ISAAC, volume 92 of LIPIcs, page 64:1-64:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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

Automatic Resource Scaling for Web Applications in the Cloud., , , , and . GPC, volume 7861 of Lecture Notes in Computer Science, page 81-90. Springer, (2013)Live Room Merger: A Real-Time Augmented Reality System for Merging Two Room Scenes., , , , , , , and . VRIC, page 8:1-8:4. ACM, (2017)A Bicameralism Voting Framework for Combining Knowledge from Clients into Better Prediction., , , , and . IEEE BigData, page 298-306. IEEE, (2019)Energy-efficient Virtual Machine Provision Algorithms for Cloud Systems., , and . UCC, page 81-88. IEEE Computer Society, (2011)Leaf sector covers with applications on circle graphs., , and . Theor. Comput. Sci., (2024)Orderly spanning trees with applications to graph encoding and graph drawing., , and . SODA, page 506-515. ACM/SIAM, (2001)Broadcasting in Heterogeneous Tree Networks with Uncertainty., , and . ISAAC, volume 7074 of Lecture Notes in Computer Science, page 200-209. Springer, (2011)Tight Approximation for Partial Vertex Cover with Hard Capacities., , , and . ISAAC, volume 92 of LIPIcs, page 64:1-64:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Orderly Spanning Trees with Applications, , and . CoRR, (2001)Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer, , and . CoRR, (2002)