Author of the publication

Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs.

, , , and . ESA, volume 3669 of Lecture Notes in Computer Science, page 472-483. Springer, (2005)

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

Complexity of two dual criteria scheduling problems., , and . Oper. Res. Lett., 35 (2): 211-220 (2007)Makespan Minimization with Machine Availability Constraints., , and . Discret. Math. Algorithms Appl., 1 (2): 141-152 (2009)Approximation Schemes for Scheduling with Availability Constraints., , and . FAW, volume 6213 of Lecture Notes in Computer Science, page 77-88. Springer, (2010)Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints., and . Theor. Comput. Sci., 412 (12-14): 1081-1091 (2011)Exponential inapproximability and FPTAS for scheduling with availability constraints., , and . Theor. Comput. Sci., 410 (27-29): 2663-2674 (2009)Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity., , and . Theor. Comput. Sci., (June 2023)Approximation schemes for parallel machine scheduling with availability constraints., , and . Discret. Appl. Math., 159 (15): 1555-1565 (2011)Coordinated scheduling of production and delivery with production window and delivery capacity constraints., , and . Theor. Comput. Sci., (2012)Minimizing the Number of Late Multi-Task Jobs on Identical Machines in Parallel., , and . FedCSIS, volume 8 of Annals of Computer Science and Information Systems, page 577-584. IEEE, (2016)Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs., , , and . ESA, volume 3669 of Lecture Notes in Computer Science, page 472-483. Springer, (2005)