Algorithmik und Komplexitätstheorie

Publikationen

2023

Artikel

N. Boehmer, T. Koana and R. Niedermeier, "A Refined Complexity Analysis of Fair Districting over Graphs" , Autonomous Agents and Multi-Agent Systems, vol. 37, no. 1, pp. 13, 2023.
V. Froese, B. Jain, M. Rymar and M. Weller, "Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series" , Algorithmica, vol. 85, pp. 492–508, 2023.

Artikel

R. Bevern, R. G. Downey, M. R. Fellows, S. Gaspers and F. A. Rosamond, "Myhill-Nerode methods for hypergraphs" , Algorithmica. Springer.
T. Koana, V. Froese and R. Niedermeier, "The Complexity of Binary Matrix Completion Under Diameter Constraints" , Journal of Computer and System Sciences, vol. 132, pp. 45–67, 2023.

2022

Thesis

E. Deltl, "Algorithmic Complexity of Bi-Criteria Multilevel Committee Election", TU Berlin, Mai 2022.

Artikel

P. Zschoche, "A faster parameterized algorithm for temporal matching" , Information Processing Letters, vol. 174, pp. 106181, 2022.

Beiträge zu Verhandlungen

N. Boehmer, R. Bredereck, E. Elkind, P. Faliszewski and S. Szufa, "Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning" in Proceedings of the Thirty-sixth Conference on Neural Information Processing Systems (NeurIPS '22), 2022.
N. Boehmer and K. Heeger, "A Fine-Grained View on Stable Many-To-One Matching Problems with Lower and Upper Quotas" , ACM Transactions on Economics and Computation, vol. 10, no. 2, pp. 9:1–9:53, 2022.

Master-Thesis

L. Glessen, "Algorithmic Approaches to Cluster Editing on Multipartite Hypergraphs", TU Berlin, 2022.
L. Kellerhals, T. Koana and P. Kunz, "Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees" in Proceedings of the 17th International Symposium on Parameterized and Exact Computation (IPEC 22), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. pp. 19:1–19:14.
N. Boehmer, P. Faliszewski, R. Niedermeier, S. Szufa and T. Wąs, "Understanding Distance Measures Among Elections" in Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI '22), ijcai.org, 2022. pp. 102–108.
A. Figiel, V. Froese, A. Nichterlein and R. Niedermeier, "There and Back Again: On Applying Data Reduction Rules by Undoing Others" in Proceedings of the 30th Annual European Symposium on Algorithms (ESA '22), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. pp. 53:1–53:15.
N. Boehmer, K. Heeger and R. Niedermeier, "Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets" in Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI '22), 2022. pp. 4851–4858.
N. Boehmer and T. Koana, "The Complexity of Finding Fair Many-to-One Matchings" in Proceedings of the 49th International Colloquium on Automata, Languages, and Programming (ICALP '22), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. pp. 27:1–27:18.
M. Bentert, N. Boehmer, K. Heeger and T. Koana, "Stable Matching with Multilayer Approval Preferences: Approvals can be Harder than Strict Preferences" in Proceedings of the 15th International Symposium on Algorithmic Game Theory (SAGT '22), Springer, 2022. pp. 436–453.
N. Boehmer, M. Brill and U. Schmidt-Kraepelin, "Proportional Representation in Matching Markets: Selecting Multiple Matchings under Dichotomous Preferences" in Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems (AAMAS '22), IFAAMAS, 2022. pp. 136–144.
R. Bredereck, A. Kaczmarczyk, J. Luo, R. Niedermeier and F. Sachse, "On Improving Resource Allocations by Sharing" in Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI '22), 2022.
N. Boehmer, R. Bredereck, K. Heeger, D. Knop and J. Luo, "Multivariate Algorithmics for Eliminating Envy by Donating Goods" in Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems (AAMAS '22), IFAAMAS, 2022. pp. 127–135.
T. Fluschnik, P. Kunz, R. Niedermeier and M. Renken, "Most Classic Problems Remain NP-hard on Relative Neighborhood Graphs and their Relatives" in Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT '22), 2022.
V. Froese, L. Kellerhals and R. Niedermeier, "Modification-Fair Cluster Editing" in Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI '22), 2022. pp. 6631–6638.
L. Kreisel, N. Boehmer, V. Froese and R. Niedermeier, "Equilibria in Schelling Games: Computational Hardness and Robustness" in Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems (AAMAS '22), IFAAMAS, 2022. pp. 761–769.
N. Boehmer, T. Koana and R. Niedermeier, "A Refined Complexity Analysis of Fair Districting over Graphs" in Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems (AAMAS '22), IFAAMAS, 2022. pp. 1548–1550.
K. Heeger, D. Hermelin, G. B. Mertzios, H. Molter, R. Niedermeier and D. Shabtay, "Equitable Scheduling on a Single Machine" , Journal of Scheduling, 2022. Springer.
M. Bentert, K. Heeger and D. Knop, "Length-bounded cuts: Proper interval graphs and structural parameters" , Journal of Computer and System Sciences, vol. 126, pp. 21-43, 2022.
R. Bredereck, K. Heeger, D. Knop and R. Niedermeier, "Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters" , Information and Computation, pp. 104943, 2022.

Seite 1 von 27