| 2024 | IPCO | Fast Combinatorial Algorithms for Efficient Sortation. | Madison Van Dyk, Kim Klause, Jochen Knemann, Nicole Megow |
| 2021 | SAGT | On the Complexity of Nucleolus Computation for Bipartite b-Matching Games. | Jochen Knemann, Justin Toth, Felix Zhou |
| 2020 | SAGT | Approximating Stable Matchings with Ties of Bounded Size. | Jochen Knemann, Kanstantsin Pashkovich, Natig Tofigzade |
| 2020 | SAGT | A General Framework for Computing the Nucleolus via Dynamic Programming. | Jochen Knemann, Justin Toth |
| 2019 | IPCO | Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time. | Jochen Knemann, Kanstantsin Pashkovich, Justin Toth |
| 2019 | WG | Travelling on Graphs with Small Highway Dimension. | Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Knemann |
| 2018 | SODA | Approximating Weighted Tree Augmentation via Chvtal-Gomory Cuts. | Samuel Fiorini, Martin Gro, Jochen Knemann, Laura Sanit |
| 2016 | ISAAC | Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. | Andreas Emil Feldmann, Jochen Knemann, Kanstantsin Pashkovich, Laura Sanit |
| 2015 | ESA | Approximate Deadline-Scheduling with Precedence Constraints. | Hossein Efsandiari, Mohammad Taghi Hajiaghayi, Jochen Knemann, Hamid Mahini, David L. Malec, Laura Sanit |
| 2015 | ICALP | A (1+ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs. | Andreas Emil Feldmann, Wai Shing Fung, Jochen Knemann, Ian Post |
| 2014 | IPCO | Finding Small Stabilizers for Unstable Graphs. | Adrian Bock, Karthekeyan Chandrasekaran, Jochen Knemann, Britta Peis, Laura Sanit |
| 2014 | IPCO | Linear Programming Hierarchies Suffice for Directed Steiner Tree. | Zachary Friggstad, Jochen Knemann, Young Kun-Ko, Anand Louis, Mohammad Shadravan, Madhur Tulsiani |
| 2014 | SAGT | Stable Marriage with General Preferences - Extended Abstract. | Linda Farczadi, Konstantinos Georgiou, Jochen Knemann |
| 2013 | COCOON | Social Exchange Networks with Distant Bargaining. | Konstantinos Georgiou, George Karakostas, Jochen Knemann, Zuzanna Stamirowska |
| 2013 | ESA | Network Bargaining with General Capacities. | Linda Farczadi, Konstantinos Georgiou, Jochen Knemann |
| 2013 | ESA | Better Approximation Algorithms for Technology Diffusion. | Jochen Knemann, Sina Sadeghian Sadeghabad, Laura Sanit |
| 2013 | FOCS | An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree. | Jochen Knemann, Sina Sadeghian Sadeghabad, Laura Sanit |
| 2012 | SODA | Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. | Timothy M. Chan, Elyot Grant, Jochen Knemann, Malcolm Sharpe |
| 2012 | SAGT | Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances. | Jochen Knemann, Kate Larson, David Steiner |
| 2011 | ISAAC | The School Bus Problem on Trees. | Adrian Bock, Elyot Grant, Jochen Knemann, Laura Sanit |
| 2010 | IPCO | On Generalizations of Network Design Problems with Degree Bounds. | Nikhil Bansal, Rohit Khandekar, Jochen Knemann, Viswanath Nagarajan, Britta Peis |
| 2010 | IPCO | On Column-Restricted and Priority Covering Integer Programs. | Deeparnab Chakrabarty, Elyot Grant, Jochen Knemann |
| 2010 | IPCO | Hypergraphic LP Relaxations for Steiner Trees. | Deeparnab Chakrabarty, Jochen Knemann, David Pritchard |
| 2008 | WAOA | Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees. | Jochen Knemann, Ojas Parekh, David Pritchard |
| 2007 | SODA | An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. | Anupam Gupta, Jochen Knemann, Stefano Leonardi, R. Ravi, Guido Schfer |
| 2006 | ESA | A Unified Approach to Approximating Partial Covering Problems. | Jochen Knemann, Ojas Parekh, Danny Segev |
| 2006 | LATIN | Cut Problems in Graphs with a Budget Constraint. | Roee Engelberg, Jochen Knemann, Stefano Leonardi, Joseph Naor |
| 2006 | STOC | Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. | Lisa Fleischer, Jochen Knemann, Stefano Leonardi, Guido Schfer |
| 2005 | COCOON | Distributed Weighted Vertex Cover via Maximal Matchings. | Fabrizio Grandoni, Jochen Knemann, Alessandro Panconesi |
| 2005 | ICALP | From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem. | Jochen Knemann, Stefano Leonardi, Guido Schfer, Stefan H. M. van Zwam |
| 2005 | PODC | Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. | Fabrizio Grandoni, Jochen Knemann, Alessandro Panconesi, Mauro Sozio |
| 2005 | SODA | Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy. | Luca Becchetti, Jochen Knemann, Stefano Leonardi, Martin Pl |
| 2005 | SODA | A group-strategyproof mechanism for Steiner forests. | Jochen Knemann, Stefano Leonardi, Guido Schfer |
| 2003 | SODA | A combinatorial algorithm for computing a maximum independent set in a t-perfect graph. | Friedrich Eisenbrand, Stefan Funke, Naveen Garg, Jochen Knemann |
| 2003 | STOC | Primal-dual meets local search: approximating MST's with nonuniform degree bounds. | Jochen Knemann, R. Ravi |
| 2003 | STACS | Non-clairvoyant Scheduling for Minimizing Mean Slowdown. | Nikhil Bansal, Kedar Dhamdhere, Jochen Knemann, Amitabh Sinha |
| 2000 | STOC | A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees. | Jochen Knemann, R. Ravi |
| 1998 | FOCS | Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems. | Naveen Garg, Jochen Knemann |