Jochen Koenemann

Amazon (United States) — United States

Computer Science · Physical Sciences

4h-index46citations29works1.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(11), Game Theory and Voting Systems(8), Advanced Graph Theory Research(6), Auction Theory and Applications(5), Game Theory and Applications(4)

Publications29 total

Fast Combinatorial Algorithms for Efficient Sortation
Mathematical Programming·2025
Sparse dynamic discretization discovery via arc-dependent time discretizations
Computers & Operations Research·2024· 1 citedOpen Access
Fast Combinatorial Algorithms for Efficient Sortation
Lecture notes in computer science·2024· 2 cited
Fast Combinatorial Algorithms for Efficient Sortation
arXiv (Cornell University)·2023Open Access
Sparse dynamic discretization discovery via arc-dependent time discretizations
arXiv (Cornell University)·2023Open Access
Dynamic discretization discovery under hard node storage constraints
arXiv (Cornell University)·2023· 1 citedOpen Access
A Framework for Computing the Nucleolus via Dynamic Programming
ACM Transactions on Economics and Computation·2023· 2 cited
Scalable timing-aware network design via lagrangian decomposition
European Journal of Operational Research·2023· 10 cited
Hitting Weighted Even Cycles in Planar Graphs
SIAM Journal on Discrete Mathematics·2022
On the Complexity of Nucleolus Computation for Bipartite b-Matching Games
arXiv (Cornell University)·2021· 1 citedOpen Access
Hitting Weighted Even Cycles in Planar Graphs
arXiv (Cornell University)·2021Open Access
Approximation and Online Algorithms
Lecture notes in computer science·2021· 2 cited
Hitting Weighted Even Cycles in Planar Graphs
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021Open Access
A General Framework for Computing the Nucleolus Via Dynamic Programming
arXiv (Cornell University)·2020· 4 citedOpen Access
Approximating Stable Matchings with Ties of Bounded Size
Lecture notes in computer science·2020Open Access
Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time
arXiv (Cornell University)·2018Open Access
Integer Programming and Combinatorial Optimization
Lecture notes in computer science·2017· 8 cited
A Logarithmic Integrality Gap Bound for Directed Steiner Tree in\n Quasi-bipartite Graphs
arXiv (Cornell University)·2016Open Access
A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2016· 3 citedOpen Access
Approximate Deadline-Scheduling with Precedence Constraints
arXiv (Cornell University)·2015Open Access
page 1 of 2Next →

Frequent Co-authors

Madison Van Dyk(6), Kim Klause(3), Nicole Megow(3), Alexander Göke(3), Matthias Mnich(3), Hao Sun(3), Justin Toth(2), Amitabh Sinha(2), Zachary Friggstad(2), Mohammad Shadravan(2), Kate Larson(2), Justin Toth(2), Kanstantsin Pashkovich(2), Cristiana L. Lara(1), Yisu Nie(1), Cid C. de Souza(1), Friedrich Eisenbrand(1), Linda Farczadi(1), Konstantinos Georgiou(1), Nikhil Bansal(1)