Jochen Koenemann

University of Waterloo

H-index: 29

North America-Canada

About Jochen Koenemann

Jochen Koenemann, With an exceptional h-index of 29 and a recent h-index of 16 (since 2020), a distinguished researcher at University of Waterloo, specializes in the field of Combinatorial Optimization, Approximation Algorithms, Algorithmic Game Theory.

His recent articles reflect a diverse array of research interests and contributions to the field:

On the complexity of nucleolus computation for bipartite b-matching games

Dynamic discretization discovery under hard node storage constraints

Economics and Computation

Fast Combinatorial Algorithms for Efficient Sortation

Scalable timing-aware network design via lagrangian decomposition

A framework for computing the nucleolus via dynamic programming

Sparse dynamic discretization discovery via arc-dependent time discretizations

Approximation and Online Algorithms: 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers

Jochen Koenemann Information

University	University of Waterloo
Position	___
Citations(all)	3304
Citations(since 2020)	913
Cited By	2845
hIndex(all)	29
hIndex(since 2020)	16
i10Index(all)	49
i10Index(since 2020)	26
Email	Access Email
University Profile Page	University of Waterloo
Google Scholar	View Google Scholar Profile

Jochen Koenemann Skills & Research Interests

Combinatorial Optimization

Approximation Algorithms

Algorithmic Game Theory

Top articles of Jochen Koenemann

Title	Journal	Author(s)	Publication Date
On the complexity of nucleolus computation for bipartite b-matching games	Theoretical Computer Science	Jochen Könemann Justin Toth Felix Zhou	2024/6/1
Dynamic discretization discovery under hard node storage constraints	arXiv preprint arXiv:2303.01419	Madison Van Dyk Jochen Koenemann	2023/3/2
Economics and Computation	ACM Transactions on	David Pennock Ilya Segal Eduardo Azevedo Moshe Babaioff Maria-Forina Balcan ...	2022
Fast Combinatorial Algorithms for Efficient Sortation	arXiv preprint arXiv:2311.05094	Madison Van Dyk Kim Klause Jochen Koenemann Nicole Megow	2023/11/9
Scalable timing-aware network design via lagrangian decomposition	European Journal of Operational Research	Cristiana L Lara Jochen Koenemann Yisu Nie Cid C de Souza	2023/8/16
A framework for computing the nucleolus via dynamic programming	ACM Transactions on Economics and Computation	Jochen Koenemann Justin Toth	2023/6/24
Sparse dynamic discretization discovery via arc-dependent time discretizations	arXiv preprint arXiv:2305.19176	Madison Van Dyk Jochen Koenemann	2023/5/30
Approximation and Online Algorithms: 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers		Jochen Koenemann Britta Peis	2022
Hitting weighted even cycles in planar graphs	SIAM journal on discrete mathematics	Alexander Göke Jochen Koenemann Matthias Mnich Hao Sun	2022
Travelling on graphs with small highway dimension	Algorithmica	Yann Disser Andreas Emil Feldmann Max Klimm Jochen Könemann	2021/5
Approximating Stable Matchings with Ties of Bounded Size		Jochen Koenemann Kanstantsin Pashkovich Natig Tofigzade	2020/9/8
A general framework for computing the nucleolus via dynamic programming		Jochen Könemann Justin Toth	2020/9/8
Computing the nucleolus of weighted cooperative matching games in polynomial time	Mathematical Programming	Jochen Könemann Kanstantsin Pashkovich Justin Toth	2020/9