Author of the publication

Parameterized Complexity of Fair Vertex Evaluation Problems.

, , and . MFCS, volume 138 of LIPIcs, page 33:1-33:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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

On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations., , , , , and . ESA, volume 244 of LIPIcs, page 22:1-22:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Multidimensional Stable Roommates with Master List., , , and . WINE, volume 12495 of Lecture Notes in Computer Science, page 59-73. Springer, (2020)Integer Programming and Incidence Treedepth., , , , , and . CoRR, (2020)Complexity of the Steiner Network Problem with Respect to the Number of Terminals., , , and . STACS, volume 126 of LIPIcs, page 25:1-25:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Voting and Bribing in Single-Exponential Time., , and . STACS, volume 66 of LIPIcs, page 46:1-46:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Scheduling Kernels via Configuration LP., and . CoRR, (2020)High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming., , , and . EC, page 505-523. ACM, (2019)Bribery Can Get Harder in Structured Multiwinner Approval Election., , , , and . AAMAS, page 1725-1733. ACM, (2023)Evaluating and Tuning n-fold Integer Programming., , and . SEA, volume 103 of LIPIcs, page 10:1-10:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Fine-Grained View on Bribery for Group Identification., , , and . IJCAI, page 67-73. ijcai.org, (2020)Scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic..