Author of the publication

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

Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems., , and . TAMC, volume 4484 of Lecture Notes in Computer Science, page 680-691. Springer, (2007)Colorful Graph Coloring., and . FAW, volume 13461 of Lecture Notes in Computer Science, page 141-161. Springer, (2022)The Longest Common Exemplar Subsequence Problem., , , , , , and . BIBM, page 92-95. IEEE Computer Society, (2018)Algorithms for compact letter displays: Comparison and evaluation, , , , , and . Computational Statistics & Data Analysis, 52 (2): 725--736 (Oct 15, 2007)Constrained Stable Marriage with Free Edges or Few Blocking Pairs., and . COCOA, volume 13135 of Lecture Notes in Computer Science, page 468-483. Springer, (2021)Parameterized Complexity of Committee Elections with Dichotomous and Trichotomous Votes., , and . AAMAS, page 503-510. International Foundation for Autonomous Agents and Multiagent Systems, (2019)Algorithms for compact letter displays: Comparison and evaluation., , , , , and . Comput. Stat. Data Anal., 52 (2): 725-736 (2007)Stable Marriage in Euclidean Space., , and . AAMAS, page 994-1002. ACM, (2023)Parameterized Approximation Algorithms for TSP., , and . ISAAC, volume 248 of LIPIcs, page 50:1-50:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem., , , and . CPM, volume 128 of LIPIcs, page 5:1-5:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)