Author of the publication

Edge-deletable IM-extendable graphs with minimum number of edges.

, , and . Discret. Math., 309 (16): 5242-5247 (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

NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time., , and . Eur. J. Oper. Res., 178 (2): 631-633 (2007)Pareto-scheduling of two competing agents with their own equal processing times., , , , and . Eur. J. Oper. Res., 301 (2): 414-431 (2022)Best semi-online algorithms for unbounded parallel batch scheduling., , and . Discret. Appl. Math., 159 (8): 838-847 (2011)A note on the complexity of two supply chain scheduling problems., and . J. Sched., 24 (4): 447-454 (2021)A note on reverse scheduling with maximum lateness objective., , , , , and . J. Sched., 16 (4): 417-422 (2013)A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs., , and . J. Sched., 6 (6): 551-555 (2003)Properly colored 2-factors of edge-colored complete bipartite graphs., , and . Discret. Math., 345 (12): 113094 (2022)Preemptive scheduling to minimize total weighted late work and weighted number of tardy jobs., , and . Comput. Ind. Eng., (2022)Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan., , , and . Inf. Process. Lett., 110 (11): 444-450 (2010)A note on LP-based approximation algorithms for capacitated facility location problem., and . Theor. Comput. Sci., (2022)