126
Professor Jochen Koenemann
Department of Combinatorics and Optimization
Language Skills
Language Read Write Speak Understand Peer Review
English Yes Yes Yes Yes Yes
French Yes Yes Yes Yes No
German Yes Yes Yes Yes Yes
Degrees
- 2003/5 Doctorate, Algorithms, Combinatorics & Optimization, Carnegie-Mellon University Supervisors: R. Ravi, 1998/7 - 2003/5
- 1998/7
Recognitions
Master's Equivalent, Theoretical Computer Science, Universitat des Saarlandes Supervisors: Naveen Garg, 1993/9 - 1998/7; Kurt Mehlhorn, 1993/9 - 1998/7
2015/5 Outstanding Performance Award University of Waterloo
Prize / Award
The University of Waterloo's Outstanding Performance Award rewards faculty members for outstanding contribution in teaching and scholarship.
2012/5 Outstanding Performance Award University of Waterloo
Prize / Award
The University of Waterloo's Outstanding Performance Award rewards faculty members for outstanding contribution in teaching and scholarship.
2012/3 - 2015/3 NSERC Discovery Accelerator Supplement - 120,000
Natural Sciences and Engineering Research Council of Canada (NSERC) Prize / Award
The DAS program provides substantial and timely resources to researchers who have a superior research program that is highly rated in terms of originality and innovation, and who show strong potential to become international leaders within their field. These additional resources should enable a researcher with an established research program to capitalize on an opportunity (e.g., a recent research breakthrough, a paradigm shift, or a new strategy to tackle a scientific problem or research question, etc.). Each award is valued at $120,000.
2010/4 - 2012/4 Early Researcher Award, Project Title "Algorithmic Game Theory and Approximate Network Design" - 84,000
Government of Ontario Prize / Award
Professor Jochen Koenemann
127
The Early Researcher Awards program gives funding to new researchers working at publicly funded Ontario research institutions to build a research team.
User Profile
Research Specialization Keywords: Combinatorial Optimization, Theoretical Computer Science, Approximation Algorithms, Algorithmic Game Theory
Employment
2013/7 Professor
Combinatorics & Optimization, University of Waterloo Full-time, Professor
Tenure Status: Tenure 2016/9 - 2019/8 Department Chair
Combinatorics & Optimization, University of Waterloo Full-time, Professor
Tenure Status: Tenure 2008/7 - 2013/6 Associate Professor
Combinatorics & Optimization, University of Waterloo Full-time, Associate Professor
Tenure Status: Tenure 2010/9 - 2011/8 Department Chair
Combinatorics & Optimization, University of Waterloo Full-time
Tenure Status: Tenure 2003/7 - 2008/6 Assistant Professor
Combinatorics & Optimization, University of Waterloo Full-time, Assistant Professor
Tenure Status: Tenure Track 2003/7 - 2004/6 Visiting Researcher
Dipartimento di Informatica e Sistemistica, Universita Degli Studi di Roma 'La Sapienza' Full-time, Visiting Professorship, Assistant Professor
Tenure Status: Non Tenure Track
Research Funding History
Awarded [n=1] 2017/4 - 2023/3 Principal Applicant
Efficient Algorithms for Combinatorial Optimization Problems in Networks and Beyond, Grant
Funding Sources:
Natural Sciences and Engineering Research Council of Canada (NSERC) Total Funding - 210,000
Portion of Funding Received - 0 Funding Competitive?: Yes Completed [n=2]
Professor Jochen Koenemann
128 2012/4 - 2017/3
Co-investigator
Flexible and Effective Techniques for the Design of Approximation Algorithms, Grant Funding Sources:
Natural Sciences and Engineering Research Council of Canada (NSERC) Flexible and Effective Techniques for the Design of Approximation Algorithms Total Funding - 210,000
Portion of Funding Received - 210,000 Funding Competitive?: Yes
2007/4 - 2012/3 Principal Applicant
Algorithmic Game Theory and Approximate Network Design, Grant Funding Sources:
Natural Sciences and Engineering Research Council of Canada (NSERC) Algorithmic Game Theory and Approximate Network Design
Total Funding - 125,000
Portion of Funding Received - 125,000 Funding Competitive?: Yes
Student/Postdoctoral Supervision
Master’s non-Thesis [n=1]
2011/9 - 2013/12 Devanshu Pandey (Completed) , University of Waterloo
Principal Supervisor Thesis/Project Title: Vehicle Routing: A Survey of Approximation Algorithms Techniques Present Position: Big Data Technical Lead, Bell Canada
Master’s Thesis [n=7] 2015/9 - 2016/12 Principal Supervisor
William Justin Toth (Completed) , University of Waterloo
Thesis/Project Title: Stable Matchings in Two and Three Dimensions Present Position: PhD Student, University of Waterloo
2012/5 - 2014/7 Principal Supervisor
Mohammad Shadravan (Completed) , University of Waterloo
Thesis/Project Title: Applying Lift and Project to the Directed Steiner Tree Problem Present Position: Graduate Student, Columbia University, New York
2012/5 - 2013/7 Principal Supervisor
Sina Sadeghian (Completed) , University of Waterloo
Thesis/Project Title: Node-weighted Prize-Collecting Steiner Tree and Applications Present Position: Chief Technology Officer, ApplyBoard
2011/9 - 2013/9 Principal Supervisor
Malcolm Sharpe (Withdrawn) , University of Waterloo
Thesis/Project Title: Efficient and Improved Steiner Tree Algorithms Present Position: unknown
2010/5 - 2011/9 Principal Supervisor
Elyot Grant (Completed) , University of Waterloo
Thesis/Project Title: Covering Problems via Structural Approaches Present Position: Co-Founder, Lunarch Studios
2009/9 - 2012/12 Co-Supervisor
David Steiner (Completed) , University of Waterloo
Thesis/Project Title: Network Bargaining: Creating Stability using Blocking Sets Present Position: Google
2008/9 - 2010/9 Principal Supervisor
Marcus Shea (Completed) , University of Waterloo
Thesis/Project Title: Iterative Rounding Approximation Algorithms in Network Design Present Position: Front Office Quantitative Researcher, BMO Capital Markets Doctorate [n=5]
Professor Jochen Koenemann
129 2017/1 - 2022/1
Principal Supervisor
William Justin Toth (In Progress) , University of Waterloo Thesis/Project Title: Aspects of Cooperative Matching Games Present Position: PhD Student, University of Waterloo
2016/9 - 2021/5 Principal Supervisor
Hao Sun (In Progress) , University of Waterloo Student Degree Expected Date: 2021/5
Thesis/Project Title: Approximating Directed Feedback Vertex Sets in Planar Graphs Present Position: PhD Student, University of Waterloo
2012/5 - 2015/7 Principal Supervisor
Linda Farczadi (Completed) , University of Waterloo Thesis/Project Title: Matchings and Games on Networks
Present Position: PDF, Ecole Polytechnique Federale de Lausanne 2011/9 - 2015/8
Principal Supervisor
Isaac Fung (Withdrawn) , University of Waterloo
Thesis/Project Title: Advances in Approximating Network Design Problems 2006/9 - 2010/9
Principal Supervisor
David Pritchard (Completed) , University of Waterloo
Thesis/Project Title: LP Tools and Approximation Algorithms for Combinatorial Optimization
Present Position: Google
Post-doctorate [n=9] 2016/10 - 2017/12 Co-Supervisor
Martin Gross (Completed) , University of Waterloo Thesis/Project Title: Approximation Algorithms
Present Position: Postdoctoral Researcher, University of Aachen (RWTH) 2016/8 - 2018/7
Co-Supervisor
Kanstantsin Pashkovich (In Progress) , University of Waterloo Thesis/Project Title: Stable Matchings, Approximation Algorithms 2014/9 - 2015/5
Co-Supervisor
Umang Bhaskar (Completed) , University of Waterloo Thesis/Project Title: Algorithmic Game Theory
Present Position: Assistant Professor, Tata Institute of Fundamental Research 2012/9 - 2014/12
Co-Supervisor
Ian Post (Completed) , University of Waterloo
Thesis/Project Title: Metric Embeddings and Approximation Algorithms Present Position: Google
2012/9 - 2015/5 Co-Supervisor
Andreas Emil Feldmann (Completed) , University of Waterloo
Thesis/Project Title: Metric Embeddings and Approximate Network Design Present Position: Assistant Professor, Charles University, Prague, Czechia 2011/9 - 2014/12
Co-Supervisor
Zachary Friggstad (Completed) , University of Waterloo
Thesis/Project Title: New Techniques for Approximate Network Design Present Position: Assistant Professor, University of Alberta, Edmonton 2011/9 - 2011/12
Co-Supervisor
Yogi Sharma (Completed) , University of Waterloo
Thesis/Project Title: Approximation Algorithms for Network Design Present Position: Dropbox
2010/9 - 2012/9 Co-Supervisor
Konstantinos Georgiou (Completed) , University of Waterloo Thesis/Project Title: Algorithmic Game Theory & Network Design Present Position: Assistant Professor, Reyerson University
Professor Jochen Koenemann
130 2008/9 - 2010/9
Co-Supervisor
Deeparnab Chakrabarty (Completed) , University of Waterloo Thesis/Project Title: Approximation Algorithms for Network Design Present Position: Assistant Professor, Dartmouth College
Research Associate [n=3] 2014/12 - 2015/4
Principal Supervisor
Deon Nicholas, University of Waterloo
Thesis/Project Title: Optimization in Cranofacial Surgery Present Position: Dropbox
2014/5 - 2014/8 Principal Supervisor
Jason Lin (Completed) , University of Waterloo
Thesis/Project Title: Directed Multicut in Planar Graphs
Present Position: Software Engineer at Microsoft, Seattle, USA 2011/5 - 2011/8
Co-Supervisor
Alexander Remorov (Completed) , University of Waterloo
Thesis/Project Title: Primal-Dual Algorithms for Rational Convex Programs Present Position: Graduate Student, Massachussets Institute of Technology
Event Administration
2016/1 - 2017/6 Chair (local arrangements), Integer Programming and Combinatorial Optimization, Conference, 2017/6 - 2017/6
2014/9 - 2015/12 Co-Organizer, Hausdorff Trimester Program on Combinatorial Optimization, Course, 2015/9 - 2015/12
2013/1 - 2013/8 Co-Organizer, Workshop on Flexible Network Design, Workshop, 2013/7 - 2013/8
Editorial Activities
2015/4 - 2025/4 Associate Editor, Journal of Computer and System Sciences, Journal 2018/1 - 2023/1 Co-Editor, Mathematical Programming (Series A), Journal
2011/6 - 2021/6 Associate Editor, Surveys in Operations Research, Journal
2014/5 - 2016/7 Guest Editor (Best papers of STOC'14), SIAM Journal on Computing, Journal
Committee Memberships
2018/2 Committee Member, ACM Conference on Economics and Computation (EC), Association for Computing Machinery
2017/9 Committee Member, European Symposium on Algorithms (ESA), Technical University Vienna
2017/6 Committee Member, Conference on Integer Programming and Combinatorial Optimization (IPCO), University of Waterloo
I am the local chair for IPCO'17 in Waterloo. In this capacity, I am also member of the program committee.
2017/1 Committee Member, ACM-SIAM Symposium on Discrete Algorithms (SODA), Society for Industrial and Applied Mathematics (SIAM)
2016/6 Committee Member, Conference on Integer Programming and Combinatorial Optimization (IPCO), University of Liege, Belgium
2015/9 Committee Member, International Symposium on Algorithmic Game Theory (SAGT), Universitat des Saarlandes
Professor Jochen Koenemann
131
2014/9 Committee Member, International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), Universitat de Barcelona 2014/6 Committee Member, ACM Conference on Economics and Computation (EC),
Association for Computing Machinery
2014/5 Committee Member, ACM Symposium on Theory of Computing (STOC), Society for Industrial and Applied Mathematics (SIAM)
2014/1 Committee Member, ACM-SIAM Symposium on Discrete Algorithms (SODA), Society for Industrial and Applied Mathematics (SIAM)
2013/12 Committee Member, Conference on Web and Internet Economics (WINE), Harvard University
2013/10 Committee Member, International Symposium on Algorithmic Game Theory (SAGT), Aachen Technical University
2012/9 Committee Member, European Symposium on Algorithms (ESA), University of Ljubljana 2012/8 Co-chair, International Symposium on Mathematical Programming (ISMP), Technische
Universitat Berlin
I was a co-chair for the cluster on Combinatorial Optimization, responsible for organizing 80 sessions with three talks each.
2012/8 Committee Member, International Workshop on Approximation Algorithms for
Combinatorial Optimization Problems (APPROX), Massachusetts Institute of Technology 2012/4 Committee Member, International Symposium on Combinatorial Optimization (ISCO),
University of Athens
2011/6 Committee Member, Workshop on Approximation and Online Algorithms (WAOA), Universitat des Saarlandes
2010/9 Committee Member, Workshop on Approximation and Online Algorithms (WAOA), The University of Liverpool
Other Memberships
2010/10 Member, Mathematical Optimization Society
MOS is an international organization dedicated to the promotion and the maintenance of high professional standards in the subject of mathematical optimization.
2004/1 Member, Association for Computing Machinery
ACM, the world's largest educational and scientific computing society, delivers resources that advance computing as a science and a profession. ACM provides the computing field's premier Digital Library and serves its members and the computing profession with leading-edge publications, conferences, and career resources.
Presentations
1. (2017). Improved Approximation for Tree Augmentation via Chvatal Gomory Cuts. 2017 Workshop on Models and Algorithms for Planning and Scheduling Problems, Seeon Abbey, Germany
Main Audience: Researcher Invited?: Yes, Keynote?: Yes
Professor Jochen Koenemann
132
2. (2016). Network Bargaining – Where Bargaining & Matching Theory Meet. Invited talk at CWI, Amsterdam, Netherlands
Invited?: Yes, Keynote?: No
3. (2016). Approximate Deadline Scheduling with Precedence Constraints. Invited main talk at Colloquium of Research Area KL "Algorithms & Complexity" of the Hausdorff Center for Mathematics, Bonn, Germany Invited?: Yes, Keynote?: No
4. (2016). Network Bargaining – Where Bargaining & Matching Theory Meet. Invited Talk at London School of Economics, London, United Kingdom Invited?: Yes, Keynote?: No
5. (2016). Probabilistic Embeddings of Low Highway Dimension Graphs into Graphs of Bounded Treewidth. Discrete Optimization, Zurich, Switzerland
Invited?: Yes, Keynote?: No
6. (2016). Network Bargaining – Where Bargaining & Matching Theory Meet. Invited talk in Graduate Colloqium, Berlin, Germany
Invited?: Yes, Keynote?: No
7. (2016). Aproximate Price Collecting Network Design. Symposium for Discrete Mathematics, Berlin, Germany
Invited?: Yes, Keynote?: Yes
8. (2015). Recent News for an old Steiner Tree Formulation. ALGO'15, Patras, Greece Invited?: Yes, Keynote?: Yes
9. (2015). Approximate Deadline Scheduling with Precedence Constraints. Invited Talk at work- shop “Efficient algorithms in game theory, optimization and data science”, Aachen, Germany Invited?: Yes, Keynote?: No
10. (2015). Approximate Deadline Scheduling with Precedence Constraints.Invited talk at Workshop
'Discrepancy and Modern Roundings' at Bellairs centre, Holetown, Barbados Invited?: Yes, Keynote?: No 11. (2015). Recent News for an old Steiner Tree Formulation. Invited Talk at University of Michigan, Ann
Arbor, United States
Invited?: Yes, Keynote?: No
12. (2015). Approximate Deadline Scheduling with Precedence Constraints. Invited talk at ESA'15, Patras, Greece
Invited?: Yes, Keynote?: No
13. (2015). Approximate Deadline Scheduling with Precedence Constraints. Invited talk at ISMP, Pittsburgh, United States
Invited?: Yes, Keynote?: No
14. (2013). Diffusion and Node-Weighted Steiner Trees.Workshop on Combinatorial Optimization at Bellairs Centre, Holetown, Barbados
Invited?: Yes, Keynote?: No
15. (2012). Stabilizing Unstable Instances of Network Bargaining. Workshop on Algorithmic Game Theory at Bellairs Centre, Holetown, Barbados
Invited?: Yes, Keynote?: No
16. (2012). Structured Set-Cover via Geometric Sampling.Invited Talk at TU Berlin, Berlin, Germany Invited?: Yes, Keynote?: No
Professor Jochen Koenemann
133
17. (2011). LP Relaxations for Steiner Trees. Invited talk at McMaster University, Hamilton, Canada Invited?: Yes, Keynote?: No
18. (2011). Structured Set-Cover via Geometric Sampling.Workshop on Approximation Algorithms at the Banff Centre, Banff, Canada
Invited?: Yes, Keynote?: No
19. (2011). LP Relaxations for Steiner Trees.Invited Talk at University of Miami, Miami, United States Invited?: Yes, Keynote?: No
Publications
Journal Articles
1. J. Koenemann, K. Pashkovich*, J. Toth*. (2016). An Elementary Integrality Proof of Rothblum's Stable Matching Formulation. Operations Research Letters.
Accepted
Refereed?: Yes, Open Access?: Yes
2. A. E. Feldmann, J. Koenemann, N. Olver, L. Sanità. (2016). On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. Mathematical Programming. 160(1): 379-406.
Published
Refereed?: Yes, Open Access?: Yes
3. Linda Farczadi, Konstantinos Georgiou, Jochen Könemann. (2016). Stable Marriage with General Preferences. Theory of Computing Systems. 59(4)
Published
Refereed?: Yes, Open Access?: No
4. A. Abdi, A. E. Feldmann*, B. Guenin, J. Koenemann, and L. Sanit̀a.(2016). Lehman’s theorem and the directed steiner tree problem.SIAM J. Discrete Math.30(1): 141-153.
Published
Refereed?: Yes, Open Access?: Yes
5. A. Gupta, J. Koenemann, S. Leonardi, R. Ravi, and G. Schaefer.(2015). Efficient cost-sharing mechanismsfor prize-collecting problems.Math. Program., Series A. 152(1-2): 147-188. Published
Refereed?: Yes, Open Access?: Yes
6. A. Bock, K. Chandrasekaran, J. Koenemann, B. Peis, and L. Sanita.(2015). Finding small stabilizers for unstable graphs.Math. Program., Series A. 154(1-2): 173-196.
Published
Refereed?: Yes, Open Access?: Yes
7. J. Koenemann, K. Larson, and D. Steiner*.(2015). Network bargaining: Using approximate blocking sets tostabilize unstable instances.Theory Comput. Syst.57(3): 655-672.
Published
Refereed?: Yes, Open Access?: Yes
8. K. Georgiou*, G. Karakostas, J. Koenemann, and Z. Stamirowska.(2014). Social exchange networks with distant bargaining.Theoret. Comput. Sci.554: 263-274.
Professor Jochen Koenemann
134 Refereed?: Yes, Open Access?: Yes
9. J. Koenemann, O. Parekh, and D. Pritchard*.(2014). Multicommodity flow in trees: Packing via covering and iterated relaxation.Algorithmica. 68(3): 776-804.
Published
Refereed?: Yes, Open Access?: Yes
10. A. Bock, E. Grant*, J. Koenemann, and L. Sanit̀a.(2013). The school bus problem on trees.Algorithmica. 67(1): 49-64.
Published
Refereed?: Yes, Open Access?: Yes
11. D. Chakrabarty*, J. Koenemann, and D. Pritchard*.(2013). Hypergraphic LP relaxations for Steiner trees.SIAM J. Discrete Math.27(1): 507-533.
Published
Refereed?: Yes, Open Access?: Yes
12. N. Bansal, R. Khandekar, J. Koenemann, V. Nagarajan, and B. Peis.(2013). On generalizations of networkdesign problems with degree bounds.Math. Programming, Series A. 141(1-2): 479-506. Published
Refereed?: Yes, Open Access?: Yes
13. J. Koenemann, O. Parekh, and D. Segev. (2011). A unified approach to approximating partial covering problems.Algorithmica. 59(4): 489-509.
Published
Refereed?: Yes, Open Access?: Yes
14. J. Koenemann, D. Pritchard*, and K. Tan*. (2011). A partition-based relaxation for Steiner trees.Math. Program- ming, Series A. 127(2): 345-370.
Published
Refereed?: Yes, Open Access?: Yes
Books
1. B. Guenin, J. Koenemann, and L. Tuncel.(2015). A Gentle Introduction to Optimization. Published, Cambridge University Press Refereed?: No
Conference Publications
1. Samuel Fiorini, Martin Gross, Jochen Koenemann, Laura Sanità. (2018). Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts. ACM-SIAM Symposium of Discrete Algorithms, (817-831) Paper Published
Refereed?: Yes, Invited?: Yes
2. Jochen Koenemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen. (2017). On the Integrality Gap of the Prize-Collecting Steiner Forest LP. The 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, (1-17)
Paper Published
Professor Jochen Koenemann
135
3. A. E. Feldmann*, J. Koenemann, K. Pashkovich*, L. Sanita. (2016). Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. The 27th International Symposium on Algorithms and Computation (ISAC),
Conference Date: 2016/12 Paper
Accepted
Refereed?: Yes, Invited?: Yes
4. Z. Friggstad, J. Koenemann, and M. Shadravan*. (2016). A logarithmic integrality gap bound for directed Steiner tree in quasi-bipartite graphs.Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), (1-11)
Conference Date: 2016/6 Paper
Published
Refereed?: Yes, Invited?: Yes
5. H. Efsandiari, M. T. Hajiaghayi, J. Koenemann, H. Mahini, D. L. Malec, and L. Sanit̀a.(2015). Approximate deadline-scheduling with precedence constraints.European Symposium on Algorithms (ESA), (483-495) Conference Date: 2015/9
Paper Published
Refereed?: Yes, Invited?: Yes
6. A.E. Feldmann*, W.S. Fung*, J. Koenemann, and I.Post*. (2015). A(1+ε)-embedding of low highway dimension graphs into bounded treewidth graphs.International Colloquium on Automata, Languages, and Programming (ICALP), (469-480)
Conference Date: 2015/7 Paper
Published
Refereed?: Yes, Invited?: Yes
7. L.Farczadi*, C.Georgiou*,and J.Koenemann.(2014). Stable marriage with general preferences.Symposium on Algorithmic Game Theory (SAGT),
Conference Date: 2014/10 Paper
Published
Refereed?: Yes, Invited?: Yes
8. A. Feldmann*, J. Koenemann, N. Olver, and L. Sanit̀a.(2014). On the equivalence of the bidirected and hyper-graphic relaxations for Steiner tree.Int. Workshop on Approx. Alg. for Comb. Opt. Problems (APPROX),
Conference Date: 2014/8 Paper
Published
Refereed?: Yes, Invited?: Yes
9. A. Bock*, K. Chandrasekaran, J. Koenemann, B. Peis, and L. Sanit̀a.(2014). Finding small stabilizers for unstable graphs. MPS Conference on Integer Programming and Combinatorial Optimization (IPCO), (150- 161)
Professor Jochen Koenemann
136 Paper
Published
Refereed?: Yes, Invited?: Yes
10. Z. Friggstad*, J. Koenemann,Y. Kun-Ko,A. Louis, M. Shadravan*, and M. Tulsiani.(2014). Linear
programming hierarchies suffice for directed Steiner tree.MPS Conference on Integer Programming and Combinatorial Optimization (IPCO), (285-296)
Conference Date: 2014/6 Paper
Published
Refereed?: Yes, Invited?: Yes
11. J. Koenemann, S. Sadeghian Sadeghabad*, and L. Sanit̀a. (2013). An lmp o(log n)-approximation algorithmfor node weighted prize collecting Steiner tree.IEEE Symposium on Foundations of Computer Science (FOCS),
Conference Date: 2013/10 Paper
Published
Refereed?: Yes, Invited?: Yes
12. L. Farczadi*, K. Georgiou*, and J. Koenemann.(2013). Network bargaining with general capacities.European Symposium on Algorithms (ESA), (433-444)
Conference Date: 2013/9 Paper
Published
Refereed?: Yes, Invited?: Yes
13. J. Koenemann, S. Sadeghian Sadeghabad*, and L. Sanit̀a.(2013). Better approximation algorithms for technology diffusion.European Symposium on Algorithms (ESA), (637-646) Conference Date: 2013/9 Paper
Published
Refereed?: Yes, Invited?: Yes
14. K. Georgiou*, G. Karakostas, J. Koenemann, and Z. Stamirowska. (2013). Social exchange networks with distant bargaining.Int. Computing & Combinatorics Conf. (COCOON), (29-40) Conference Date: 2013/6 Paper
Published
Refereed?: Yes, Invited?: Yes
15. J. Koenemann, K. Larson, and D. Steiner*. (2012). Network bargaining: Using approximate blocking sets tostabilize unstable instances.Symposium on Algorithmic Game Theory (SAGT), Conference Date: 2012/10
Paper Published
Refereed?: Yes, Invited?: Yes
16. T. Chan, E. Grant*, J. Koenemann, and M. Sharpe*. (2012). Weighted capacitated, priority, and geometric setcover via improved quasi-uniform sampling.ACM-SIAM Symposium on Discrete Algorithms (SODA), (1576-1585)
Conference Date: 2012/1 Paper
Professor Jochen Koenemann
137 Published
Refereed?: Yes, Invited?: Yes
17. A. Bock, E. Grant*, J. Koenemann, and L. Sanit̀a. (2011). The school bus problem in trees.Int. Symp. on Algorithms and Computation (ISAC), (10-19)
Conference Date: 2011/12 Paper
Published
138