Author of the publication

Approximation Algorithms for the Longest Run Subsequence Problem.

, , , , , , , and . CPM, volume 259 of LIPIcs, page 2:1-2:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

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

Approximation algorithms for covering vertices by long paths., , , , and . CoRR, (2022)A NAND Flash Endurance Prediction Scheme with FPGA-based Memory Controller System., , , , , and . SoCC, page 68-73. IEEE, (2019)Unexpected Error Explosion in NAND Flash Memory: Observations and Prediction Scheme., , , and . ATS, page 1-6. IEEE, (2020)A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops., , , , and . Ann. Oper. Res., 335 (1): 185-204 (April 2024)Approximately covering vertices by order-5 or longer paths., , , and . CoRR, (2024)Approximation Algorithms for Covering Vertices by Long Paths., , , and . MFCS, volume 241 of LIPIcs, page 53:1-53:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Approximation Algorithms for Covering Vertices by Long Paths., , , , and . Algorithmica, 86 (8): 2625-2651 (August 2024)Process-variation Effects on 3D TLC Flash Reliability: Characterization and Mitigation Scheme., , , and . QRS, page 329-334. IEEE, (2020)An Approximation Algorithm for Covering Vertices by 4+-Paths., , , and . COCOA (1), volume 14461 of Lecture Notes in Computer Science, page 459-470. Springer, (2023)Approximation Algorithms for the Longest Run Subsequence Problem., , , , , , , and . CPM, volume 259 of LIPIcs, page 2:1-2:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)