Jochen Könemann

ORCID

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 42

Top Venues

Publications

Jochen Könemann, Justin Toth, Felix Zhou
On the complexity of nucleolus computation for bipartite b-matching games. Theor. Comput. Sci. 998 (2024)
Madison Van Dyk, Jochen Könemann
Sparse dynamic discretization discovery via arc-dependent time discretizations. Comput. Oper. Res. 169 (2024)
Madison Van Dyk, Kim Klause, Jochen Könemann, Nicole Megow
Fast Combinatorial Algorithms for Efficient Sortation. IPCO (2024)
Madison Van Dyk, Jochen Könemann
Sparse dynamic discretization discovery via arc-dependent time discretizations. CoRR (2023)
Madison Van Dyk, Jochen Könemann
Dynamic discretization discovery under hard node storage constraints. CoRR (2023)
Cristiana L. Lara, Jochen Könemann, Yisu Nie, Cid C. de Souza
Scalable timing-aware network design via lagrangian decomposition. Eur. J. Oper. Res. 309 (1) (2023)
Jochen Könemann, Justin Toth
A Framework for Computing the Nucleolus via Dynamic Programming. ACM Trans. Economics and Comput. 11 (2023)
Madison Van Dyk, Kim Klause, Jochen Könemann, Nicole Megow
Fast Combinatorial Algorithms for Efficient Sortation. CoRR (2023)
Alexander Göke, Jochen Könemann, Matthias Mnich, Hao Sun
Hitting Weighted Even Cycles in Planar Graphs. SIAM J. Discret. Math. 36 (4) (2022)
Jochen Könemann, Justin Toth, Felix Zhou
On the Complexity of Nucleolus Computation for Bipartite b-Matching Games. SAGT (2021)
Alexander Göke, Jochen Könemann, Matthias Mnich, Hao Sun
Hitting Weighted Even Cycles in Planar Graphs. APPROX-RANDOM (2021)
Jochen Könemann, Justin Toth, Felix Zhou
On the Complexity of Nucleolus Computation for Bipartite b-Matching Games. CoRR (2021)
Alexander Göke, Jochen Könemann, Matthias Mnich, Hao Sun
Hitting Weighted Even Cycles in Planar Graphs. CoRR (2021)
Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann
Travelling on Graphs with Small Highway Dimension. Algorithmica 83 (5) (2021)
Jochen Könemann, Justin Toth
A General Framework for Computing the Nucleolus via Dynamic Programming. SAGT (2020)
Jochen Könemann, Kanstantsin Pashkovich, Justin Toth
Computing the nucleolus of weighted cooperative matching games in polynomial time. Math. Program. 183 (1) (2020)
Jochen Könemann, Justin Toth
A General Framework for Computing the Nucleolus Via Dynamic Programming. CoRR (2020)
Jochen Könemann, Kanstantsin Pashkovich, Natig Tofigzade
Approximating Stable Matchings with Ties of Bounded Size. SAGT (2020)
Jochen Könemann, Kanstantsin Pashkovich, Natig Tofigzade
On the Approximability of the Stable Matching Problem with Ties of Constant Size up to the Integrality Gap. CoRR (2020)
Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann
Travelling on Graphs with Small Highway Dimension. WG (2019)
Karthekeyan Chandrasekaran, Corinna Gottschalk, Jochen Könemann, Britta Peis, Daniel Schmand, Andreas Wierz
Additive stabilizers for unstable graphs. Discret. Optim. 31 (2019)
Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann
Travelling on Graphs with Small Highway Dimension. CoRR (2019)
Jochen Könemann, Kanstantsin Pashkovich, Justin Toth
Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time. IPCO (2019)
Stephan Held, Jochen Könemann, Jens Vygen
Vehicle routing with subtours. Discret. Optim. 33 (2019)
Adam Smith, Jochen Könemann
Special Section on the Forty-Sixth Annual ACM Symposium on Theory of Computing (STOC 2014). SIAM J. Comput. 47 (5) (2018)
Jochen Könemann, Kanstantsin Pashkovich, Justin Toth
Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time. CoRR (2018)
Stephan Held, Jochen Könemann, Jens Vygen
Vehicle Routing with Subtours. CoRR (2018)
Andreas Emil Feldmann, Wai Shing Fung, Jochen Könemann, Ian Post
A (1+ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs. SIAM J. Comput. 47 (4) (2018)
Samuel Fiorini, Martin Groß, Jochen Könemann, Laura Sanità
Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts. SODA (2018)
Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen
On the Integrality Gap of the Prize-Collecting Steiner Forest LP. APPROX-RANDOM (2017)
Samuel Fiorini, Martin Groß, Jochen Könemann, Laura Sanità
A 3/2-Approximation Algorithm for Tree Augmentation via Chvátal-Gomory Cuts. CoRR (2017)
Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen
On the Integrality Gap of the Prize-Collecting Steiner Forest LP. CoRR (2017)
Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich, Laura Sanità
Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. ISAAC (2016)
Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich, Laura Sanità
Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. CoRR (2016)
Jochen Könemann, Kanstantsin Pashkovich, Justin Toth
An elementary integrality proof of Rothblum's stable matching formulation. Oper. Res. Lett. 44 (6) (2016)
Jochen Könemann, Kanstantsin Pashkovich, Justin Toth
The Power of Locality: An Elementary Integrality Proof of Rothblum's Stable Matching Formulation. CoRR (2016)
Ahmad Abdi, Andreas Emil Feldmann, Bertrand Guenin, Jochen Könemann, Laura Sanità
Lehman's Theorem and the Directed Steiner Tree Problem. SIAM J. Discret. Math. 30 (1) (2016)
Linda Farczadi, Konstantinos Georgiou, Jochen Könemann
Stable Marriage with General Preferences. Theory Comput. Syst. 59 (4) (2016)
Zachary Friggstad, Jochen Könemann, Mohammad Shadravan
A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs . SWAT (2016)
Karthekeyan Chandrasekaran, Corinna Gottschalk, Jochen Könemann, Britta Peis, Daniel Schmand, Andreas Wierz
Additive Stabilizers for Unstable Graphs. CoRR (2016)
Andreas Emil Feldmann, Jochen Könemann, Neil Olver, Laura Sanità
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. Math. Program. 160 (1-2) (2016)
Zachary Friggstad, Jochen Könemann, Mohammad Shadravan
A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs. CoRR (2016)
Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità
Finding small stabilizers for unstable graphs. Math. Program. 154 (1-2) (2015)
A. Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer
Efficient cost-sharing mechanisms for prize-collecting problems. Math. Program. 152 (1-2) (2015)
Hossein Efsandiari, Mohammad Taghi Hajiaghayi, Jochen Könemann, Hamid Mahini, David L. Malec, Laura Sanità
Approximate Deadline-Scheduling with Precedence Constraints. ESA (2015)
Andreas Emil Feldmann, Wai Shing Fung, Jochen Könemann, Ian Post
A (1+ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs. ICALP (1) (2015)
Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Jochen Könemann, Hamid Mahini, David L. Malec, Laura Sanità
Approximate Deadline-Scheduling with Precedence Constraints. CoRR (2015)
Andreas Emil Feldmann, Wai Shing Fung, Jochen Könemann, Ian Post
A (1 + ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs. CoRR (2015)
Jochen Könemann, Kate Larson, David Steiner
Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances. Theory Comput. Syst. 57 (3) (2015)
Linda Farczadi, Konstantinos Georgiou, Jochen Könemann
Stable marriage with general preferences. CoRR (2014)
Andreas Emil Feldmann, Jochen Könemann, Neil Olver, Laura Sanità
On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree. APPROX-RANDOM (2014)
Zachary Friggstad, Jochen Könemann, Young Kun-Ko, Anand Louis, Mohammad Shadravan, Madhur Tulsiani
Linear Programming Hierarchies Suffice for Directed Steiner Tree. IPCO (2014)
Linda Farczadi, Konstantinos Georgiou, Jochen Könemann
Stable Marriage with General Preferences - Extended Abstract. SAGT (2014)
Jochen Könemann, Ojas Parekh, David Pritchard
Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation. Algorithmica 68 (3) (2014)
Konstantinos Georgiou, George Karakostas, Jochen Könemann, Zuzanna Stamirowska
Social exchange networks with distant bargaining. Theor. Comput. Sci. 554 (2014)
Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità
Finding Small Stabilizers for Unstable Graphs. IPCO (2014)
Jochen Könemann, Sina Sadeghian Sadeghabad, Laura Sanità
Better Approximation Algorithms for Technology Diffusion. ESA (2013)
Jochen Könemann, Sina Sadeghian Sadeghabad, Laura Sanità
An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree CoRR (2013)
Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis
On generalizations of network design problems with degree bounds. Math. Program. 141 (1-2) (2013)
Linda Farczadi, Konstantinos Georgiou, Jochen Könemann
Network bargaining with general capacities. CoRR (2013)
Jochen Könemann, Sina Sadeghian Sadeghabad, Laura Sanità
An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree. FOCS (2013)
Linda Farczadi, Konstantinos Georgiou, Jochen Könemann
Network Bargaining with General Capacities. ESA (2013)
Deeparnab Chakrabarty, Jochen Könemann, David Pritchard
Hypergraphic LP Relaxations for Steiner Trees. SIAM J. Discret. Math. 27 (1) (2013)
Adrian Bock, Elyot Grant, Jochen Könemann, Laura Sanità
The School Bus Problem on Trees. Algorithmica 67 (1) (2013)
Konstantinos Georgiou, George Karakostas, Jochen Könemann, Zuzanna Stamirowska
Social Exchange Networks with Distant Bargaining. COCOON (2013)
Jochen Könemann, Kate Larson, David Steiner
Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances. SAGT (2012)
Isaac Fung, Konstantinos Georgiou, Jochen Könemann, Malcolm Sharpe
Efficient Algorithms for Solving Hypergraphic Steiner Tree Relaxations in Quasi-Bipartite Instances CoRR (2012)
Timothy M. Chan, Elyot Grant, Jochen Könemann, Malcolm Sharpe
Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. SODA (2012)
Jochen Könemann, Kate Larson, David Steiner
Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances CoRR (2012)
Jochen Könemann, Ojas Parekh, Danny Segev
A Unified Approach to Approximating Partial Covering Problems. Algorithmica 59 (4) (2011)
Adrian Bock, Elyot Grant, Jochen Könemann, Laura Sanità
The School Bus Problem on Trees. ISAAC (2011)
Jochen Könemann, David Pritchard, Kunlun Tan
A partition-based relaxation for Steiner trees. Math. Program. 127 (2) (2011)
Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann
On Column-restricted and Priority Covering Integer Programs CoRR (2010)
Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann
On Column-Restricted and Priority Covering Integer Programs. IPCO (2010)
Deeparnab Chakrabarty, Jochen Könemann, David Pritchard
Hypergraphic LP Relaxations for Steiner Trees. IPCO (2010)
Deeparnab Chakrabarty, Jochen Könemann, David Pritchard
Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound. Oper. Res. Lett. 38 (6) (2010)
Deeparnab Chakrabarty, Jochen Könemann, David Pritchard
Integrality Gap of the Hypergraphic Relaxation of Steiner Trees: a short proof of a 1.55 upper bound CoRR (2010)
Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis
On Generalizations of Network Design Problems with Degree Bounds CoRR (2010)
Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis
On Generalizations of Network Design Problems with Degree Bounds. IPCO (2010)
Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer
Strict Cost Sharing Schemes for Steiner Forest. SIAM J. Comput. 39 (8) (2010)
Deeparnab Chakrabarty, Jochen Könemann, David Pritchard
Hypergraphic LP Relaxations for Steiner Trees CoRR (2009)
Jochen Könemann, Stefano Leonardi, Guido Schäfer, Stefan H. M. van Zwam
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game. SIAM J. Comput. 37 (5) (2008)
Joseph Cheriyan, Howard J. Karloff, Rohit Khandekar, Jochen Könemann
On the integrality ratio for tree augmentation. Oper. Res. Lett. 36 (4) (2008)
Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi
Distributed weighted vertex cover via maximal matchings. ACM Trans. Algorithms 5 (1) (2008)
Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover. SIAM J. Comput. 38 (3) (2008)
Jochen Könemann, Ojas Parekh, David Pritchard
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees. WAOA (2008)
Naveen Garg, Jochen Könemann
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems. SIAM J. Comput. 37 (2) (2007)
Jochen Könemann, David Pritchard, Kunlun Tan
A Partition-Based Relaxation For Steiner Trees CoRR (2007)
Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer
An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. SODA (2007)
Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor
Cut problems in graphs with a budget constraint. J. Discrete Algorithms 5 (2) (2007)
Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál
Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy. ACM Trans. Algorithms 3 (2) (2007)
Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor
Cut Problems in Graphs with a Budget Constraint. LATIN (2006)
Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. STOC (2006)
Jochen Könemann, Ojas Parekh, Danny Segev
A Unified Approach to Approximating Partial Covering Problems. ESA (2006)
Jochen Könemann, Asaf Levin, Amitabh Sinha
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. Algorithmica 41 (2) (2005)
Jochen Könemann, R. Ravi
Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds. SIAM J. Comput. 34 (3) (2005)
Jochen Könemann, Stefano Leonardi, Guido Schäfer, Stefan H. M. van Zwam
From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem. ICALP (2005)
Ernst Althaus, Stefan Funke, Sariel Har-Peled, Jochen Könemann, Edgar A. Ramos, Martin Skutella
-hop minimum-spanning trees. Oper. Res. Lett. 33 (2) (2005)
Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. PODC (2005)
Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál
Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy. SODA (2005)

Jochen Könemann.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jochen Könemann