Researcher Portfolio

Kleindienst, Thomas

Department: Cellular and Systems Neurobiology / Bonhoeffer, MPI of Neurobiology, Max Planck Society

Researcher Profile

Position: Department: Cellular and Systems Neurobiology / Bonhoeffer, MPI of Neurobiology, Max Planck Society

Researcher ID: https://pure.mpg.de/cone/persons/resource/persons38924

External references

WorldCat Search for Kleindienst, Thomas

Google Scholar Search for Kleindienst, Thomas

Publications

(1 - 25 of 33)

Prev12Next

: Drabik, K., Dürr, A., Frei, F., Mazowiecki, F., & Węgrzycki, K. (2025). Fined-Grained Complexity of Ambiguity Problems on Automata and Directed Graphs. Retrieved from https://arxiv.org/abs/2501.14725. [PubMan] : Nederlof, J., Swennenhuis, C. M. F., & Węgrzycki, K. (2025). A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints. In Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 535-552). Philadelphia, PA: SIAM. doi:10.1137/1.9781611978322.16. [PubMan] : Dürr, A., Kipouridis, E., & Węgrzycki, K. (2025). Faster algorithms for k-Orthogonal Vectors in low dimension. Retrieved from https://arxiv.org/abs/2507.11098. [PubMan] : Künnemann, M., Mazowiecki, F., Schütze, L., Sinclair-Banks, H., & Węgrzycki, K. (2025). Coverability in VASS Revisited: Improving Rackoff’s Bound to Obtain Conditional Optimality. Journal of the ACM, 72(5): 33, pp. 1-27. doi:10.1145/376217. [PubMan] : Rohwedder, L., & Węgrzycki, K. (2025). Fine-Grained Equivalence for Problems Related to Integer Linear Programming. In R. Meka (Ed.), 16th Innovations in Theoretical Computer Science (pp. 1-18). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ITCS.2025.83. [PubMan] : Rohwedder, L., & Węgrzycki, K. (2025). Space-Efficient Algorithm for Integer Programming with Few Constraints. In N. Megow, & A. Basu (Eds.), Integer Programming and Combinatorial Optimization (pp. 442-451). Berlin: Springer. doi:10.1007/978-3-031-93112-3_32. [PubMan] : Aggarwal, D., Joux, A., Santha, M., & Węgrzycki, K. (2024). Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime. Retrieved from https://arxiv.org/abs/2407.05435. [PubMan] : Esmer, B. C., Kulik, A., Marx, D., Schepper, P., & Węgrzycki, K. (2024). Computing Generalized Convolutions Faster Than Brute Force. Algorithmica, 86, 334-366. doi:10.1007/s00453-023-01176-2. [PubMan] : Chistikov, D., Czerwiński, W., Orlikowski, L., Mazowiecki, F., Sinclair-Banks, H., & Węgrzycki, K. (2024). The Tractability Border of Reachability in Simple Vector Addition Systems with States. In IEEE 65th Annual Symposium on Foundations of Computer Science (pp. 1332-1354). Piscataway, NJ: IEEE. doi:10.1109/FOCS61266.2024.00086. [PubMan] : Cslovjecsek, J., Pilipczuk, M., & Węgrzycki, K. (2024). Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments. In T. Chan, J. Fischer, J. Iacono, & G. Herman (Eds.), 32nd Annual European Symposium on Algorithms (pp. 1-18). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ESA.2024.43. [PubMan] : Kisfaludi-Bak, S., Masaříková, J., van Leeuwen, E. J., Walczak, B., & Węgrzycki, K. (2024). Separator Theorem and Algorithms for Planar Hyperbolic Graphs. In W. Mulzer, & J. M. Phillips (Eds.), 40th International Symposium on Computational Geometry (pp. 1-17). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.SoCG.2024.67. [PubMan] : Cslovjecsek, J., Pilipczuk, M., & Węgrzycki, K. (2024). A Polynomial-time OPT Ɛ-Approximation Algorithm for Maximum Independent Set of Connected Subgraphs in a Planar Graph. In D. P. Woodruff (Ed.), Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 625-638). Philadelphia, PA: SIAM. doi:10.1137/1.9781611977912.23. [PubMan] : Bringmann, K., Staals, F., Węgrzycki, K., & van Wordragen, G. (2024). Fine-Grained Complexity of Earth Mover’s Distance Under Translation. In W. Mulzer, & J. M. Phillips (Eds.), 40th International Symposium on Computational Geometry (pp. 1-17). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.SoCG.2024.25. [PubMan] : Randolph, T., & Węgrzycki, K. (2024). Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM. In T. Chan, J. Fischer, J. Iacono, & G. Herman (Eds.), 32nd Annual European Symposium on Algorithms (pp. 1-19). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ESA.2024.96. [PubMan] : Eisenbrand, F., Rohwedder, L., & Węgrzycki, K. (2024). Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems. In IEEE 65th Annual Symposium on Foundations of Computer Science (pp. 1610-1620). Piscataway, NJ: IEEE. doi:10.1109/FOCS61266.2024.00100. [PubMan] : Focke, J., Frei, F., Li, S., Marx, D., Schepper, P., Sharma, R., & Węgrzycki, K. (2024). Hitting Meets Packing: How Hard Can It Be? In T. Chan, J. Fischer, J. Iacono, & G. Herman (Eds.), 32nd Annual European Symposium on Algorithms (pp. 1-21). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ESA.2024.55. [PubMan] : Joux, A., & Węgrzycki, K. (2024). Improving Lagarias-Odlyzko Algorithm For Average-Case Subset Sum: Modular Arithmetic Approach. Retrieved from https://arxiv.org/abs/2408.16108. [PubMan] : Olkowski, J., Pilipczuk, M., Rychlicki, M., Węgrzycki, K., & Zych-Pawlewicz, A. (2023). Dynamic Data Structures for Parameterized String Problems. In P. Berenbrink, P. Bouyer, A. Dawar, & M. M. Kanté (Eds.), 40th International Symposium on Theoretical Aspects of Computer Science (pp. 1-22). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.STACS.2023.50. [PubMan] : Künnemann, M., Mazowiecki, F., Schütze, L., Sinclair-Banks, H., & Węgrzycki, K. (2023). Coverability in VASS Revisited: Improving Rackoff’s Bound to Obtain Conditional Optimality. In K. Etessami, U. Feige, & G. Puppis (Eds.), 50th International Colloquium on Automata, Languages, and Programming (pp. 1-20). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ICALP.2023.131. [PubMan] : Nederlof, J., Pawlewicz, J., Swennenhuis, C. M. F., & Węgrzycki, K. (2023). A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. SIAM Journal on Computing, 52(6), 1369-1412. doi:10.1137/22M1478112. [PubMan] : Dross, F., Fleszar, K., Węgrzycki, K., & Zych-Pawlewicz, A. (2023). Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours. In N. Bansal, & V. Nagarajan (Eds.), Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1433-1463). Philadelphia, PA: SIAM. doi:10.1137/1.9781611977554.ch52. [PubMan] : Künnemann, M., Mazowiecki, F., Schütze, L., Sinclair-Banks, H., & Węgrzycki, K. (2023). Coverability in VASS Revisited: Improving Rackoff’s Bound to Obtain Conditional Optimality. In K. Etessami, U. Feige, & G. Puppis (Eds.), 50th International Colloquium on Automata, Languages, and Programming (pp. 1-20). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ICALP.2023.131. [PubMan] : Nederlof, J., Pilipczuk, M., Swennenhuis, C. M. F., & Węgrzycki, K. (2023). Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. SIAM Journal on Discrete Mathematics, 37(3), 1566-1586. doi:10.1137/22M1518943. [PubMan] : Caoduro, M., Cslovjecsek, J., Pilipczuk, M., & Węgrzycki, K. (2023). Independence Number of Intersection Graphs of Axis-Parallel Segments. Journal of Computational Geometry, 14(1), 144-156. doi:10.20382/jocg.v14i1a5. [PubMan] : Mazowiecki, F., Sinclair-Banks, H., & Węgrzycki, K. (2023). Coverability in 2-VASS with One Unary Counter is in NP. In O. Kupferman, & P. Sobocinski (Eds.), Foundations of Software Science and Computation Structures (pp. 196-217). Berlin: Springer. doi:10.1007/978-3-031-30829-1_10. [PubMan]