Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Jochen Könemann
@article{DBLP:journals/eor/LaraKNS23,
author = {Cristiana L. Lara and
Jochen K{\"{o}}nemann and
Yisu Nie and
Cid C. de Souza},
title = {Scalable timing-aware network design via lagrangian decomposition},
journal = {Eur. J. Oper. Res.},
volume = {309},
number = {1},
pages = {152--169},
year = {2023},
url = {https://doi.org/10.1016/j.ejor.2023.01.018},
doi = {10.1016/J.EJOR.2023.01.018},
timestamp = {Sat, 29 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/LaraKNS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/KonemannT23,
author = {Jochen K{\"{o}}nemann and
Justin Toth},
title = {A Framework for Computing the Nucleolus via Dynamic Programming},
journal = {{ACM} Trans. Economics and Comput.},
volume = {11},
pages = {3:1--3:21},
year = {2023},
url = {https://doi.org/10.1145/3580375},
doi = {10.1145/3580375},
timestamp = {Tue, 25 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/teco/KonemannT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-01419,
author = {Madison Van Dyk and
Jochen K{\"{o}}nemann},
title = {Dynamic discretization discovery under hard node storage constraints},
journal = {CoRR},
volume = {abs/2303.01419},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.01419},
doi = {10.48550/ARXIV.2303.01419},
eprinttype = {arXiv},
eprint = {2303.01419},
timestamp = {Mon, 06 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-01419.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-19176,
author = {Madison Van Dyk and
Jochen K{\"{o}}nemann},
title = {Sparse dynamic discretization discovery via arc-dependent time discretizations},
journal = {CoRR},
volume = {abs/2305.19176},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.19176},
doi = {10.48550/ARXIV.2305.19176},
eprinttype = {arXiv},
eprint = {2305.19176},
timestamp = {Wed, 07 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-19176.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-05094,
author = {Madison Van Dyk and
Kim Klause and
Jochen K{\"{o}}nemann and
Nicole Megow},
title = {Fast Combinatorial Algorithms for Efficient Sortation},
journal = {CoRR},
volume = {abs/2311.05094},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.05094},
doi = {10.48550/ARXIV.2311.05094},
eprinttype = {arXiv},
eprint = {2311.05094},
timestamp = {Tue, 14 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-05094.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GokeKMS22,
author = {Alexander G{\"{o}}ke and
Jochen K{\"{o}}nemann and
Matthias Mnich and
Hao Sun},
title = {Hitting Weighted Even Cycles in Planar Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {36},
number = {4},
pages = {2830--2862},
year = {2022},
url = {https://doi.org/10.1137/21m144894x},
doi = {10.1137/21M144894X},
timestamp = {Sat, 11 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/GokeKMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DisserFKK21,
author = {Yann Disser and
Andreas Emil Feldmann and
Max Klimm and
Jochen K{\"{o}}nemann},
title = {Travelling on Graphs with Small Highway Dimension},
journal = {Algorithmica},
volume = {83},
number = {5},
pages = {1352--1370},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00785-5},
doi = {10.1007/S00453-020-00785-5},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DisserFKK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GokeKMS21,
author = {Alexander G{\"{o}}ke and
Jochen K{\"{o}}nemann and
Matthias Mnich and
Hao Sun},
editor = {Mary Wootters and
Laura Sanit{\`{a}}},
title = {Hitting Weighted Even Cycles in Planar Graphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2021, August 16-18, 2021, University
of Washington, Seattle, Washington, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {207},
pages = {25:1--25:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.25},
doi = {10.4230/LIPICS.APPROX/RANDOM.2021.25},
timestamp = {Tue, 21 Sep 2021 09:36:32 +0200},
biburl = {https://dblp.org/rec/conf/approx/GokeKMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/KonemannTZ21,
author = {Jochen K{\"{o}}nemann and
Justin Toth and
Felix Zhou},
editor = {Ioannis Caragiannis and
Kristoffer Arnsfelt Hansen},
title = {On the Complexity of Nucleolus Computation for Bipartite b-Matching
Games},
booktitle = {Algorithmic Game Theory - 14th International Symposium, {SAGT} 2021,
Aarhus, Denmark, September 21-24, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12885},
pages = {171--185},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-85947-3\_12},
doi = {10.1007/978-3-030-85947-3\_12},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sagt/KonemannTZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/waoa/2021,
editor = {Jochen K{\"{o}}nemann and
Britta Peis},
title = {Approximation and Online Algorithms - 19th International Workshop,
{WAOA} 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12982},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92702-8},
doi = {10.1007/978-3-030-92702-8},
isbn = {978-3-030-92701-1},
timestamp = {Fri, 14 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/2021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-07161,
author = {Jochen K{\"{o}}nemann and
Justin Toth and
Felix Zhou},
title = {On the Complexity of Nucleolus Computation for Bipartite b-Matching
Games},
journal = {CoRR},
volume = {abs/2105.07161},
year = {2021},
url = {https://arxiv.org/abs/2105.07161},
eprinttype = {arXiv},
eprint = {2105.07161},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-07161.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-04763,
author = {Alexander G{\"{o}}ke and
Jochen K{\"{o}}nemann and
Matthias Mnich and
Hao Sun},
title = {Hitting Weighted Even Cycles in Planar Graphs},
journal = {CoRR},
volume = {abs/2107.04763},
year = {2021},
url = {https://arxiv.org/abs/2107.04763},
eprinttype = {arXiv},
eprint = {2107.04763},
timestamp = {Tue, 20 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-04763.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/KonemannPT20,
author = {Jochen K{\"{o}}nemann and
Kanstantsin Pashkovich and
Justin Toth},
title = {Computing the nucleolus of weighted cooperative matching games in
polynomial time},
journal = {Math. Program.},
volume = {183},
number = {1},
pages = {555--581},
year = {2020},
url = {https://doi.org/10.1007/s10107-020-01483-4},
doi = {10.1007/S10107-020-01483-4},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/KonemannPT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/KonemannPT20,
author = {Jochen K{\"{o}}nemann and
Kanstantsin Pashkovich and
Natig Tofigzade},
editor = {Tobias Harks and
Max Klimm},
title = {Approximating Stable Matchings with Ties of Bounded Size},
booktitle = {Algorithmic Game Theory - 13th International Symposium, {SAGT} 2020,
Augsburg, Germany, September 16-18, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12283},
pages = {178--192},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-57980-7\_12},
doi = {10.1007/978-3-030-57980-7\_12},
timestamp = {Thu, 10 Sep 2020 16:38:24 +0200},
biburl = {https://dblp.org/rec/conf/sagt/KonemannPT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/KonemannT20,
author = {Jochen K{\"{o}}nemann and
Justin Toth},
editor = {Tobias Harks and
Max Klimm},
title = {A General Framework for Computing the Nucleolus via Dynamic Programming},
booktitle = {Algorithmic Game Theory - 13th International Symposium, {SAGT} 2020,
Augsburg, Germany, September 16-18, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12283},
pages = {307--321},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-57980-7\_20},
doi = {10.1007/978-3-030-57980-7\_20},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sagt/KonemannT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-05228,
author = {Jochen K{\"{o}}nemann and
Kanstantsin Pashkovich and
Natig Tofigzade},
title = {On the Approximability of the Stable Matching Problem with Ties of
Constant Size up to the Integrality Gap},
journal = {CoRR},
volume = {abs/2005.05228},
year = {2020},
url = {https://arxiv.org/abs/2005.05228},
eprinttype = {arXiv},
eprint = {2005.05228},
timestamp = {Thu, 14 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-05228.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-10853,
author = {Jochen K{\"{o}}nemann and
Justin Toth},
title = {A General Framework for Computing the Nucleolus Via Dynamic Programming},
journal = {CoRR},
volume = {abs/2005.10853},
year = {2020},
url = {https://arxiv.org/abs/2005.10853},
eprinttype = {arXiv},
eprint = {2005.10853},
timestamp = {Thu, 28 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-10853.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/ChandrasekaranG19,
author = {Karthekeyan Chandrasekaran and
Corinna Gottschalk and
Jochen K{\"{o}}nemann and
Britta Peis and
Daniel Schmand and
Andreas Wierz},
title = {Additive stabilizers for unstable graphs},
journal = {Discret. Optim.},
volume = {31},
pages = {56--78},
year = {2019},
url = {https://doi.org/10.1016/j.disopt.2018.08.003},
doi = {10.1016/J.DISOPT.2018.08.003},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/ChandrasekaranG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/HeldKV19,
author = {Stephan Held and
Jochen K{\"{o}}nemann and
Jens Vygen},
title = {Vehicle routing with subtours},
journal = {Discret. Optim.},
volume = {33},
pages = {87--100},
year = {2019},
url = {https://doi.org/10.1016/j.disopt.2019.03.003},
doi = {10.1016/J.DISOPT.2019.03.003},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/HeldKV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/KonemannPT19,
author = {Jochen K{\"{o}}nemann and
Kanstantsin Pashkovich and
Justin Toth},
editor = {Andrea Lodi and
Viswanath Nagarajan},
title = {Computing the Nucleolus of Weighted Cooperative Matching Games in
Polynomial Time},
booktitle = {Integer Programming and Combinatorial Optimization - 20th International
Conference, {IPCO} 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11480},
pages = {413--426},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17953-3\_31},
doi = {10.1007/978-3-030-17953-3\_31},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/KonemannPT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DisserFKK19,
author = {Yann Disser and
Andreas Emil Feldmann and
Max Klimm and
Jochen K{\"{o}}nemann},
editor = {Ignasi Sau and
Dimitrios M. Thilikos},
title = {Travelling on Graphs with Small Highway Dimension},
booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International
Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21,
2019, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {11789},
pages = {175--189},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-30786-8\_14},
doi = {10.1007/978-3-030-30786-8\_14},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/DisserFKK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-07040,
author = {Yann Disser and
Andreas Emil Feldmann and
Max Klimm and
Jochen K{\"{o}}nemann},
title = {Travelling on Graphs with Small Highway Dimension},
journal = {CoRR},
volume = {abs/1902.07040},
year = {2019},
url = {http://arxiv.org/abs/1902.07040},
eprinttype = {arXiv},
eprint = {1902.07040},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-07040.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FeldmannFKP18,
author = {Andreas Emil Feldmann and
Wai Shing Fung and
Jochen K{\"{o}}nemann and
Ian Post},
title = {A (1+{\(\epsilon\)})-Embedding of Low Highway Dimension Graphs into
Bounded Treewidth Graphs},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {4},
pages = {1667--1704},
year = {2018},
url = {https://doi.org/10.1137/16M1067196},
doi = {10.1137/16M1067196},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FeldmannFKP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SmithK18,
author = {Adam Smith and
Jochen K{\"{o}}nemann},
title = {Special Section on the Forty-Sixth Annual {ACM} Symposium on Theory
of Computing {(STOC} 2014)},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {5},
pages = {1807--1808},
year = {2018},
url = {https://doi.org/10.1137/18N974637},
doi = {10.1137/18N974637},
timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SmithK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Fiorini0KS18,
author = {Samuel Fiorini and
Martin Gro{\ss} and
Jochen K{\"{o}}nemann and
Laura Sanit{\`{a}}},
editor = {Artur Czumaj},
title = {Approximating Weighted Tree Augmentation via Chv{\'{a}}tal-Gomory
Cuts},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {817--831},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.53},
doi = {10.1137/1.9781611975031.53},
timestamp = {Tue, 02 Feb 2021 17:07:58 +0100},
biburl = {https://dblp.org/rec/conf/soda/Fiorini0KS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-04991,
author = {Stephan Held and
Jochen K{\"{o}}nemann and
Jens Vygen},
title = {Vehicle Routing with Subtours},
journal = {CoRR},
volume = {abs/1801.04991},
year = {2018},
url = {http://arxiv.org/abs/1801.04991},
eprinttype = {arXiv},
eprint = {1801.04991},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-04991.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-03249,
author = {Jochen K{\"{o}}nemann and
Kanstantsin Pashkovich and
Justin Toth},
title = {Computing the Nucleolus of Weighted Cooperative Matching Games in
Polynomial Time},
journal = {CoRR},
volume = {abs/1803.03249},
year = {2018},
url = {http://arxiv.org/abs/1803.03249},
eprinttype = {arXiv},
eprint = {1803.03249},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-03249.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KonemannOP0SV17,
author = {Jochen K{\"{o}}nemann and
Neil Olver and
Kanstantsin Pashkovich and
R. Ravi and
Chaitanya Swamy and
Jens Vygen},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {On the Integrality Gap of the Prize-Collecting Steiner Forest {LP}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {17:1--17:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.17},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.17},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/KonemannOP0SV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ipco/2017,
editor = {Friedrich Eisenbrand and
Jochen K{\"{o}}nemann},
title = {Integer Programming and Combinatorial Optimization - 19th International
Conference, {IPCO} 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10328},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-59250-3},
doi = {10.1007/978-3-319-59250-3},
isbn = {978-3-319-59249-7},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/2017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FioriniGKS17,
author = {Samuel Fiorini and
Martin Gro{\ss} and
Jochen K{\"{o}}nemann and
Laura Sanit{\`{a}}},
title = {A 3/2-Approximation Algorithm for Tree Augmentation via Chv{\'{a}}tal-Gomory
Cuts},
journal = {CoRR},
volume = {abs/1702.05567},
year = {2017},
url = {http://arxiv.org/abs/1702.05567},
eprinttype = {arXiv},
eprint = {1702.05567},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FioriniGKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KonemannOP0SV17,
author = {Jochen K{\"{o}}nemann and
Neil Olver and
Kanstantsin Pashkovich and
R. Ravi and
Chaitanya Swamy and
Jens Vygen},
title = {On the Integrality Gap of the Prize-Collecting Steiner Forest {LP}},
journal = {CoRR},
volume = {abs/1706.06565},
year = {2017},
url = {http://arxiv.org/abs/1706.06565},
eprinttype = {arXiv},
eprint = {1706.06565},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KonemannOP0SV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/FeldmannKOS16,
author = {Andreas Emil Feldmann and
Jochen K{\"{o}}nemann and
Neil Olver and
Laura Sanit{\`{a}}},
title = {On the equivalence of the bidirected and hypergraphic relaxations
for Steiner tree},
journal = {Math. Program.},
volume = {160},
number = {1-2},
pages = {379--406},
year = {2016},
url = {https://doi.org/10.1007/s10107-016-0987-5},
doi = {10.1007/S10107-016-0987-5},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/FeldmannKOS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FarczadiGK16,
author = {Linda Farczadi and
Konstantinos Georgiou and
Jochen K{\"{o}}nemann},
title = {Stable Marriage with General Preferences},
journal = {Theory Comput. Syst.},
volume = {59},
number = {4},
pages = {683--699},
year = {2016},
url = {https://doi.org/10.1007/s00224-016-9687-z},
doi = {10.1007/S00224-016-9687-Z},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FarczadiGK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KonemannPT16,
author = {Jochen K{\"{o}}nemann and
Kanstantsin Pashkovich and
Justin Toth},
title = {An elementary integrality proof of Rothblum's stable matching formulation},
journal = {Oper. Res. Lett.},
volume = {44},
number = {6},
pages = {754--756},
year = {2016},
url = {https://doi.org/10.1016/j.orl.2016.09.011},
doi = {10.1016/J.ORL.2016.09.011},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/KonemannPT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AbdiFGKS16,
author = {Ahmad Abdi and
Andreas Emil Feldmann and
Bertrand Guenin and
Jochen K{\"{o}}nemann and
Laura Sanit{\`{a}}},
title = {Lehman's Theorem and the Directed Steiner Tree Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {30},
number = {1},
pages = {141--153},
year = {2016},
url = {https://doi.org/10.1137/15M1007185},
doi = {10.1137/15M1007185},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AbdiFGKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FeldmannKPS16,
author = {Andreas Emil Feldmann and
Jochen K{\"{o}}nemann and
Kanstantsin Pashkovich and
Laura Sanit{\`{a}}},
editor = {Seok{-}Hee Hong},
title = {Fast Approximation Algorithms for the Generalized Survivable Network
Design Problem},
booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC}
2016, December 12-14, 2016, Sydney, Australia},
series = {LIPIcs},
volume = {64},
pages = {33:1--33:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.33},
doi = {10.4230/LIPICS.ISAAC.2016.33},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/FeldmannKPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FriggstadKS16,
author = {Zachary Friggstad and
Jochen K{\"{o}}nemann and
Mohammad Shadravan},
editor = {Rasmus Pagh},
title = {A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite
Graphs},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {3:1--3:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.3},
doi = {10.4230/LIPICS.SWAT.2016.3},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/swat/FriggstadKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FeldmannKPS16,
author = {Andreas Emil Feldmann and
Jochen K{\"{o}}nemann and
Kanstantsin Pashkovich and
Laura Sanit{\`{a}}},
title = {Fast Approximation Algorithms for the Generalized Survivable Network
Design Problem},
journal = {CoRR},
volume = {abs/1604.07049},
year = {2016},
url = {http://arxiv.org/abs/1604.07049},
eprinttype = {arXiv},
eprint = {1604.07049},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FeldmannKPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FriggstadKS16,
author = {Zachary Friggstad and
Jochen K{\"{o}}nemann and
Mohammad Shadravan},
title = {A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite
Graphs},
journal = {CoRR},
volume = {abs/1604.08132},
year = {2016},
url = {http://arxiv.org/abs/1604.08132},
eprinttype = {arXiv},
eprint = {1604.08132},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FriggstadKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KonemannPT16,
author = {Jochen K{\"{o}}nemann and
Kanstantsin Pashkovich and
Justin Toth},
title = {The Power of Locality: An Elementary Integrality Proof of Rothblum's
Stable Matching Formulation},
journal = {CoRR},
volume = {abs/1605.04427},
year = {2016},
url = {http://arxiv.org/abs/1605.04427},
eprinttype = {arXiv},
eprint = {1605.04427},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KonemannPT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChandrasekaranG16,
author = {Karthekeyan Chandrasekaran and
Corinna Gottschalk and
Jochen K{\"{o}}nemann and
Britta Peis and
Daniel Schmand and
Andreas Wierz},
title = {Additive Stabilizers for Unstable Graphs},
journal = {CoRR},
volume = {abs/1608.06797},
year = {2016},
url = {http://arxiv.org/abs/1608.06797},
eprinttype = {arXiv},
eprint = {1608.06797},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChandrasekaranG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/GuptaKLRS15,
author = {Anupam Gupta and
Jochen K{\"{o}}nemann and
Stefano Leonardi and
R. Ravi and
Guido Sch{\"{a}}fer},
title = {Efficient cost-sharing mechanisms for prize-collecting problems},
journal = {Math. Program.},
volume = {152},
number = {1-2},
pages = {147--188},
year = {2015},
url = {https://doi.org/10.1007/s10107-014-0781-1},
doi = {10.1007/S10107-014-0781-1},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/GuptaKLRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BockCKPS15,
author = {Adrian Bock and
Karthekeyan Chandrasekaran and
Jochen K{\"{o}}nemann and
Britta Peis and
Laura Sanit{\`{a}}},
title = {Finding small stabilizers for unstable graphs},
journal = {Math. Program.},
volume = {154},
number = {1-2},
pages = {173--196},
year = {2015},
url = {https://doi.org/10.1007/s10107-014-0854-1},
doi = {10.1007/S10107-014-0854-1},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/BockCKPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KonemannL015,
author = {Jochen K{\"{o}}nemann and
Kate Larson and
David Steiner},
title = {Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable
Instances},
journal = {Theory Comput. Syst.},
volume = {57},
number = {3},
pages = {655--672},
year = {2015},
url = {https://doi.org/10.1007/s00224-015-9650-4},
doi = {10.1007/S00224-015-9650-4},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KonemannL015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/EfsandiariHKMMS15,
author = {Hossein Efsandiari and
Mohammad Taghi Hajiaghayi and
Jochen K{\"{o}}nemann and
Hamid Mahini and
David L. Malec and
Laura Sanit{\`{a}}},
editor = {Nikhil Bansal and
Irene Finocchi},
title = {Approximate Deadline-Scheduling with Precedence Constraints},
booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
Greece, September 14-16, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9294},
pages = {483--495},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48350-3\_41},
doi = {10.1007/978-3-662-48350-3\_41},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/esa/EfsandiariHKMMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FeldmannFKP15,
author = {Andreas Emil Feldmann and
Wai Shing Fung and
Jochen K{\"{o}}nemann and
Ian Post},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {A (1+{\(\epsilon\)})-Embedding of Low Highway Dimension Graphs into
Bounded Treewidth Graphs},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {469--480},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_38},
doi = {10.1007/978-3-662-47672-7\_38},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/FeldmannFKP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FeldmannFKP15,
author = {Andreas Emil Feldmann and
Wai Shing Fung and
Jochen K{\"{o}}nemann and
Ian Post},
title = {A {(1} + {\(\epsilon\)})-Embedding of Low Highway Dimension Graphs
into Bounded Treewidth Graphs},
journal = {CoRR},
volume = {abs/1502.04588},
year = {2015},
url = {http://arxiv.org/abs/1502.04588},
eprinttype = {arXiv},
eprint = {1502.04588},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FeldmannFKP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EfsandiariHKMMS15,
author = {Hossein Esfandiari and
Mohammad Taghi Hajiaghayi and
Jochen K{\"{o}}nemann and
Hamid Mahini and
David L. Malec and
Laura Sanit{\`{a}}},
title = {Approximate Deadline-Scheduling with Precedence Constraints},
journal = {CoRR},
volume = {abs/1507.00748},
year = {2015},
url = {http://arxiv.org/abs/1507.00748},
eprinttype = {arXiv},
eprint = {1507.00748},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EfsandiariHKMMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KonemannPP14,
author = {Jochen K{\"{o}}nemann and
Ojas Parekh and
David Pritchard},
title = {Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation},
journal = {Algorithmica},
volume = {68},
number = {3},
pages = {776--804},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9701-z},
doi = {10.1007/S00453-012-9701-Z},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KonemannPP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GeorgiouKKS14,
author = {Konstantinos Georgiou and
George Karakostas and
Jochen K{\"{o}}nemann and
Zuzanna Stamirowska},
title = {Social exchange networks with distant bargaining},
journal = {Theor. Comput. Sci.},
volume = {554},
pages = {263--274},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2013.11.033},
doi = {10.1016/J.TCS.2013.11.033},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GeorgiouKKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/FeldmannKOS14,
author = {Andreas Emil Feldmann and
Jochen K{\"{o}}nemann and
Neil Olver and
Laura Sanit{\`{a}}},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Nikhil R. Devanur and
Cristopher Moore},
title = {On the Equivalence of the Bidirected and Hypergraphic Relaxations
for Steiner Tree},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona,
Spain},
series = {LIPIcs},
volume = {28},
pages = {176--191},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.176},
doi = {10.4230/LIPICS.APPROX-RANDOM.2014.176},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/FeldmannKOS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/BockCKPS14,
author = {Adrian Bock and
Karthekeyan Chandrasekaran and
Jochen K{\"{o}}nemann and
Britta Peis and
Laura Sanit{\`{a}}},
editor = {Jon Lee and
Jens Vygen},
title = {Finding Small Stabilizers for Unstable Graphs},
booktitle = {Integer Programming and Combinatorial Optimization - 17th International
Conference, {IPCO} 2014, Bonn, Germany, June 23-25, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8494},
pages = {150--161},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07557-0\_13},
doi = {10.1007/978-3-319-07557-0\_13},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/BockCKPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/FriggstadKKLST14,
author = {Zachary Friggstad and
Jochen K{\"{o}}nemann and
Young Kun{-}Ko and
Anand Louis and
Mohammad Shadravan and
Madhur Tulsiani},
editor = {Jon Lee and
Jens Vygen},
title = {Linear Programming Hierarchies Suffice for Directed Steiner Tree},
booktitle = {Integer Programming and Combinatorial Optimization - 17th International
Conference, {IPCO} 2014, Bonn, Germany, June 23-25, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8494},
pages = {285--296},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07557-0\_24},
doi = {10.1007/978-3-319-07557-0\_24},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/FriggstadKKLST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/FarczadiGK14,
author = {Linda Farczadi and
Konstantinos Georgiou and
Jochen K{\"{o}}nemann},
editor = {Ron Lavi},
title = {Stable Marriage with General Preferences - Extended Abstract},
booktitle = {Algorithmic Game Theory - 7th International Symposium, {SAGT} 2014,
Haifa, Israel, September 30 - October 2, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8768},
pages = {25--36},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44803-8\_3},
doi = {10.1007/978-3-662-44803-8\_3},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/sagt/FarczadiGK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FarczadiGK14,
author = {Linda Farczadi and
Konstantinos Georgiou and
Jochen K{\"{o}}nemann},
title = {Stable marriage with general preferences},
journal = {CoRR},
volume = {abs/1407.1853},
year = {2014},
url = {http://arxiv.org/abs/1407.1853},
eprinttype = {arXiv},
eprint = {1407.1853},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FarczadiGK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BockGKS13,
author = {Adrian Bock and
Elyot Grant and
Jochen K{\"{o}}nemann and
Laura Sanit{\`{a}}},
title = {The School Bus Problem on Trees},
journal = {Algorithmica},
volume = {67},
number = {1},
pages = {49--64},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9711-x},
doi = {10.1007/S00453-012-9711-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BockGKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BansalKKNP13,
author = {Nikhil Bansal and
Rohit Khandekar and
Jochen K{\"{o}}nemann and
Viswanath Nagarajan and
Britta Peis},
title = {On generalizations of network design problems with degree bounds},
journal = {Math. Program.},
volume = {141},
number = {1-2},
pages = {479--506},
year = {2013},
url = {https://doi.org/10.1007/s10107-012-0537-8},
doi = {10.1007/S10107-012-0537-8},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/BansalKKNP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChakrabartyKP13,
author = {Deeparnab Chakrabarty and
Jochen K{\"{o}}nemann and
David Pritchard},
title = {Hypergraphic {LP} Relaxations for Steiner Trees},
journal = {{SIAM} J. Discret. Math.},
volume = {27},
number = {1},
pages = {507--533},
year = {2013},
url = {https://doi.org/10.1137/110845793},
doi = {10.1137/110845793},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ChakrabartyKP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/GeorgiouKKS13,
author = {Konstantinos Georgiou and
George Karakostas and
Jochen K{\"{o}}nemann and
Zuzanna Stamirowska},
editor = {Ding{-}Zhu Du and
Guochuan Zhang},
title = {Social Exchange Networks with Distant Bargaining},
booktitle = {Computing and Combinatorics, 19th International Conference, {COCOON}
2013, Hangzhou, China, June 21-23, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7936},
pages = {29--40},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38768-5\_5},
doi = {10.1007/978-3-642-38768-5\_5},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/GeorgiouKKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FarczadiGK13,
author = {Linda Farczadi and
Konstantinos Georgiou and
Jochen K{\"{o}}nemann},
editor = {Hans L. Bodlaender and
Giuseppe F. Italiano},
title = {Network Bargaining with General Capacities},
booktitle = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
France, September 2-4, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8125},
pages = {433--444},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40450-4\_37},
doi = {10.1007/978-3-642-40450-4\_37},
timestamp = {Mon, 03 Jan 2022 22:19:39 +0100},
biburl = {https://dblp.org/rec/conf/esa/FarczadiGK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KonemannSS13,
author = {Jochen K{\"{o}}nemann and
Sina Sadeghian Sadeghabad and
Laura Sanit{\`{a}}},
editor = {Hans L. Bodlaender and
Giuseppe F. Italiano},
title = {Better Approximation Algorithms for Technology Diffusion},
booktitle = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
France, September 2-4, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8125},
pages = {637--646},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40450-4\_54},
doi = {10.1007/978-3-642-40450-4\_54},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/KonemannSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KonemannSS13,
author = {Jochen K{\"{o}}nemann and
Sina Sadeghian Sadeghabad and
Laura Sanit{\`{a}}},
title = {An {LMP} O(log n)-Approximation Algorithm for Node Weighted Prize
Collecting Steiner Tree},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2013, 26-29 October, 2013, Berkeley, CA, {USA}},
pages = {568--577},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/FOCS.2013.67},
doi = {10.1109/FOCS.2013.67},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KonemannSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-2127,
author = {Jochen K{\"{o}}nemann and
Sina Sadeghian Sadeghabad and
Laura Sanit{\`{a}}},
title = {An {LMP} O(log n)-Approximation Algorithm for Node Weighted Prize
Collecting Steiner Tree},
journal = {CoRR},
volume = {abs/1302.2127},
year = {2013},
url = {http://arxiv.org/abs/1302.2127},
eprinttype = {arXiv},
eprint = {1302.2127},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-2127.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FarczadiGK13,
author = {Linda Farczadi and
Konstantinos Georgiou and
Jochen K{\"{o}}nemann},
title = {Network bargaining with general capacities},
journal = {CoRR},
volume = {abs/1306.4302},
year = {2013},
url = {http://arxiv.org/abs/1306.4302},
eprinttype = {arXiv},
eprint = {1306.4302},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FarczadiGK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/KonemannLS12,
author = {Jochen K{\"{o}}nemann and
Kate Larson and
David Steiner},
editor = {Maria J. Serna},
title = {Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable
Instances},
booktitle = {Algorithmic Game Theory - 5th International Symposium, {SAGT} 2012,
Barcelona, Spain, October 22-23, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7615},
pages = {216--226},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33996-7\_19},
doi = {10.1007/978-3-642-33996-7\_19},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/sagt/KonemannLS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChanGKS12,
author = {Timothy M. Chan and
Elyot Grant and
Jochen K{\"{o}}nemann and
Malcolm Sharpe},
editor = {Yuval Rabani},
title = {Weighted capacitated, priority, and geometric set cover via improved
quasi-uniform sampling},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {1576--1585},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.125},
doi = {10.1137/1.9781611973099.125},
timestamp = {Tue, 02 Feb 2021 17:07:31 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChanGKS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-5049,
author = {Isaac Fung and
Konstantinos Georgiou and
Jochen K{\"{o}}nemann and
Malcolm Sharpe},
title = {Efficient Algorithms for Solving Hypergraphic Steiner Tree Relaxations
in Quasi-Bipartite Instances},
journal = {CoRR},
volume = {abs/1202.5049},
year = {2012},
url = {http://arxiv.org/abs/1202.5049},
eprinttype = {arXiv},
eprint = {1202.5049},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-5049.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-6683,
author = {Jochen K{\"{o}}nemann and
Kate Larson and
David Steiner},
title = {Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable
Instances},
journal = {CoRR},
volume = {abs/1207.6683},
year = {2012},
url = {http://arxiv.org/abs/1207.6683},
eprinttype = {arXiv},
eprint = {1207.6683},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-6683.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KonemannPS11,
author = {Jochen K{\"{o}}nemann and
Ojas Parekh and
Danny Segev},
title = {A Unified Approach to Approximating Partial Covering Problems},
journal = {Algorithmica},
volume = {59},
number = {4},
pages = {489--509},
year = {2011},
url = {https://doi.org/10.1007/s00453-009-9317-0},
doi = {10.1007/S00453-009-9317-0},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KonemannPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/KonemannPT11,
author = {Jochen K{\"{o}}nemann and
David Pritchard and
Kunlun Tan},
title = {A partition-based relaxation for Steiner trees},
journal = {Math. Program.},
volume = {127},
number = {2},
pages = {345--370},
year = {2011},
url = {https://doi.org/10.1007/s10107-009-0289-2},
doi = {10.1007/S10107-009-0289-2},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/KonemannPT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BockGKS11,
author = {Adrian Bock and
Elyot Grant and
Jochen K{\"{o}}nemann and
Laura Sanit{\`{a}}},
editor = {Takao Asano and
Shin{-}Ichi Nakano and
Yoshio Okamoto and
Osamu Watanabe},
title = {The School Bus Problem on Trees},
booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC}
2011, Yokohama, Japan, December 5-8, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7074},
pages = {10--19},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25591-5\_3},
doi = {10.1007/978-3-642-25591-5\_3},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BockGKS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/voecking2011/Konemann11,
author = {Jochen K{\"{o}}nemann},
editor = {Berthold V{\"{o}}cking and
Helmut Alt and
Martin Dietzfelbinger and
R{\"{u}}diger Reischuk and
Christian Scheideler and
Heribert Vollmer and
Dorothea Wagner},
title = {Winning Strategies for a Matchstick Game},
booktitle = {Algorithms Unplugged},
pages = {259--265},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-15328-0\_26},
doi = {10.1007/978-3-642-15328-0\_26},
timestamp = {Wed, 14 Jun 2017 20:29:01 +0200},
biburl = {https://dblp.org/rec/books/sp/voecking2011/Konemann11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ChakrabartyKP10,
author = {Deeparnab Chakrabarty and
Jochen K{\"{o}}nemann and
David Pritchard},
title = {Integrality gap of the hypergraphic relaxation of Steiner trees: {A}
short proof of a 1.55 upper bound},
journal = {Oper. Res. Lett.},
volume = {38},
number = {6},
pages = {567--570},
year = {2010},
url = {https://doi.org/10.1016/j.orl.2010.09.004},
doi = {10.1016/J.ORL.2010.09.004},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ChakrabartyKP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FleischerKLS10,
author = {Lisa Fleischer and
Jochen K{\"{o}}nemann and
Stefano Leonardi and
Guido Sch{\"{a}}fer},
title = {Strict Cost Sharing Schemes for Steiner Forest},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {8},
pages = {3616--3632},
year = {2010},
url = {https://doi.org/10.1137/090767108},
doi = {10.1137/090767108},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/FleischerKLS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/BansalKKNP10,
author = {Nikhil Bansal and
Rohit Khandekar and
Jochen K{\"{o}}nemann and
Viswanath Nagarajan and
Britta Peis},
editor = {Friedrich Eisenbrand and
F. Bruce Shepherd},
title = {On Generalizations of Network Design Problems with Degree Bounds},
booktitle = {Integer Programming and Combinatorial Optimization, 14th International
Conference, {IPCO} 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6080},
pages = {110--123},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13036-6\_9},
doi = {10.1007/978-3-642-13036-6\_9},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipco/BansalKKNP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/ChakrabartyGK10,
author = {Deeparnab Chakrabarty and
Elyot Grant and
Jochen K{\"{o}}nemann},
editor = {Friedrich Eisenbrand and
F. Bruce Shepherd},
title = {On Column-Restricted and Priority Covering Integer Programs},
booktitle = {Integer Programming and Combinatorial Optimization, 14th International
Conference, {IPCO} 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6080},
pages = {355--368},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13036-6\_27},
doi = {10.1007/978-3-642-13036-6\_27},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/ChakrabartyGK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/ChakrabartyKP10,
author = {Deeparnab Chakrabarty and
Jochen K{\"{o}}nemann and
David Pritchard},
editor = {Friedrich Eisenbrand and
F. Bruce Shepherd},
title = {Hypergraphic {LP} Relaxations for Steiner Trees},
booktitle = {Integer Programming and Combinatorial Optimization, 14th International
Conference, {IPCO} 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6080},
pages = {383--396},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13036-6\_29},
doi = {10.1007/978-3-642-13036-6\_29},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/ChakrabartyKP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1003-1507,
author = {Deeparnab Chakrabarty and
Elyot Grant and
Jochen K{\"{o}}nemann},
title = {On Column-restricted and Priority Covering Integer Programs},
journal = {CoRR},
volume = {abs/1003.1507},
year = {2010},
url = {http://arxiv.org/abs/1003.1507},
eprinttype = {arXiv},
eprint = {1003.1507},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1003-1507.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1003-2977,
author = {Nikhil Bansal and
Rohit Khandekar and
Jochen K{\"{o}}nemann and
Viswanath Nagarajan and
Britta Peis},
title = {On Generalizations of Network Design Problems with Degree Bounds},
journal = {CoRR},
volume = {abs/1003.2977},
year = {2010},
url = {http://arxiv.org/abs/1003.2977},
eprinttype = {arXiv},
eprint = {1003.2977},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1003-2977.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1006-2249,
author = {Deeparnab Chakrabarty and
Jochen K{\"{o}}nemann and
David Pritchard},
title = {Integrality Gap of the Hypergraphic Relaxation of Steiner Trees: a
short proof of a 1.55 upper bound},
journal = {CoRR},
volume = {abs/1006.2249},
year = {2010},
url = {http://arxiv.org/abs/1006.2249},
eprinttype = {arXiv},
eprint = {1006.2249},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1006-2249.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0910-0281,
author = {Deeparnab Chakrabarty and
Jochen K{\"{o}}nemann and
David Pritchard},
title = {Hypergraphic {LP} Relaxations for Steiner Trees},
journal = {CoRR},
volume = {abs/0910.0281},
year = {2009},
url = {http://arxiv.org/abs/0910.0281},
eprinttype = {arXiv},
eprint = {0910.0281},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0910-0281.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/CheriyanKKK08,
author = {Joseph Cheriyan and
Howard J. Karloff and
Rohit Khandekar and
Jochen K{\"{o}}nemann},
title = {On the integrality ratio for tree augmentation},
journal = {Oper. Res. Lett.},
volume = {36},
number = {4},
pages = {399--401},
year = {2008},
url = {https://doi.org/10.1016/j.orl.2008.01.009},
doi = {10.1016/J.ORL.2008.01.009},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/CheriyanKKK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KonemannLSZ08,
author = {Jochen K{\"{o}}nemann and
Stefano Leonardi and
Guido Sch{\"{a}}fer and
Stefan H. M. van Zwam},
title = {A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest
Game},
journal = {{SIAM} J. Comput.},
volume = {37},
number = {5},
pages = {1319--1341},
year = {2008},
url = {https://doi.org/10.1137/050646408},
doi = {10.1137/050646408},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/KonemannLSZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GrandoniKPS08,
author = {Fabrizio Grandoni and
Jochen K{\"{o}}nemann and
Alessandro Panconesi and
Mauro Sozio},
title = {A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex
Cover},
journal = {{SIAM} J. Comput.},
volume = {38},
number = {3},
pages = {825--840},
year = {2008},
url = {https://doi.org/10.1137/06065310X},
doi = {10.1137/06065310X},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GrandoniKPS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GrandoniKP08,
author = {Fabrizio Grandoni and
Jochen K{\"{o}}nemann and
Alessandro Panconesi},
title = {Distributed weighted vertex cover via maximal matchings},
journal = {{ACM} Trans. Algorithms},
volume = {5},
number = {1},
pages = {6:1--6:12},
year = {2008},
url = {https://doi.org/10.1145/1435375.1435381},
doi = {10.1145/1435375.1435381},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/GrandoniKP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/KonemannPP08,
author = {Jochen K{\"{o}}nemann and
Ojas Parekh and
David Pritchard},
editor = {Evripidis Bampis and
Martin Skutella},
title = {Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity
Trees},
booktitle = {Approximation and Online Algorithms, 6th International Workshop, {WAOA}
2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5426},
pages = {1--14},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-93980-1\_1},
doi = {10.1007/978-3-540-93980-1\_1},
timestamp = {Thu, 23 Sep 2021 11:48:40 +0200},
biburl = {https://dblp.org/rec/conf/waoa/KonemannPP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Konemann08,
author = {Jochen K{\"{o}}nemann},
editor = {Berthold V{\"{o}}cking and
Helmut Alt and
Martin Dietzfelbinger and
R{\"{u}}diger Reischuk and
Christian Scheideler and
Heribert Vollmer and
Dorothea Wagner},
title = {Gewinnstrategie f{\"{u}}r ein Streichholzspiel},
booktitle = {Taschenbuch der Algorithmen},
series = {eXamen.press},
pages = {267--273},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-76394-9\_26},
doi = {10.1007/978-3-540-76394-9\_26},
timestamp = {Tue, 16 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Konemann08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/EngelbergKLN07,
author = {Roee Engelberg and
Jochen K{\"{o}}nemann and
Stefano Leonardi and
Joseph Naor},
title = {Cut problems in graphs with a budget constraint},
journal = {J. Discrete Algorithms},
volume = {5},
number = {2},
pages = {262--279},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.05.002},
doi = {10.1016/J.JDA.2006.05.002},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/EngelbergKLN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GargK07,
author = {Naveen Garg and
Jochen K{\"{o}}nemann},
title = {Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional
Packing Problems},
journal = {{SIAM} J. Comput.},
volume = {37},
number = {2},
pages = {630--652},
year = {2007},
url = {https://doi.org/10.1137/S0097539704446232},
doi = {10.1137/S0097539704446232},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GargK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BecchettiKLP07,
author = {Luca Becchetti and
Jochen K{\"{o}}nemann and
Stefano Leonardi and
Martin P{\'{a}}l},
title = {Sharing the cost more efficiently: Improved approximation for multicommodity
rent-or-buy},
journal = {{ACM} Trans. Algorithms},
volume = {3},
number = {2},
pages = {23},
year = {2007},
url = {https://doi.org/10.1145/1240233.1240246},
doi = {10.1145/1240233.1240246},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BecchettiKLP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuptaKLRS07,
author = {Anupam Gupta and
Jochen K{\"{o}}nemann and
Stefano Leonardi and
R. Ravi and
Guido Sch{\"{a}}fer},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {An efficient cost-sharing mechanism for the prize-collecting Steiner
forest problem},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {1153--1162},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283507},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GuptaKLRS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0712-3568,
author = {Jochen K{\"{o}}nemann and
David Pritchard and
Kunlun Tan},
title = {A Partition-Based Relaxation For Steiner Trees},
journal = {CoRR},
volume = {abs/0712.3568},
year = {2007},
url = {http://arxiv.org/abs/0712.3568},
eprinttype = {arXiv},
eprint = {0712.3568},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0712-3568.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KonemannPS06,
author = {Jochen K{\"{o}}nemann and
Ojas Parekh and
Danny Segev},
editor = {Yossi Azar and
Thomas Erlebach},
title = {A Unified Approach to Approximating Partial Covering Problems},
booktitle = {Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland,
September 11-13, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4168},
pages = {468--479},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11841036\_43},
doi = {10.1007/11841036\_43},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/KonemannPS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/EngelbergKLN06,
author = {Roee Engelberg and
Jochen K{\"{o}}nemann and
Stefano Leonardi and
Joseph Naor},
editor = {Jos{\'{e}} R. Correa and
Alejandro Hevia and
Marcos A. Kiwi},
title = {Cut Problems in Graphs with a Budget Constraint},
booktitle = {{LATIN} 2006: Theoretical Informatics, 7th Latin American Symposium,
Valdivia, Chile, March 20-24, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3887},
pages = {435--446},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11682462\_41},
doi = {10.1007/11682462\_41},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/EngelbergKLN06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FleischerKLS06,
author = {Lisa Fleischer and
Jochen K{\"{o}}nemann and
Stefano Leonardi and
Guido Sch{\"{a}}fer},
editor = {Jon M. Kleinberg},
title = {Simple cost sharing schemes for multicommodity rent-or-buy and stochastic
Steiner tree},
booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
Seattle, WA, USA, May 21-23, 2006},
pages = {663--670},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1132516.1132609},
doi = {10.1145/1132516.1132609},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FleischerKLS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KonemannLS04,
author = {Jochen K{\"{o}}nemann and
Asaf Levin and
Amitabh Sinha},
title = {Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem},
journal = {Algorithmica},
volume = {41},
number = {2},
pages = {117--129},
year = {2005},
url = {https://doi.org/10.1007/s00453-004-1121-2},
doi = {10.1007/S00453-004-1121-2},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KonemannLS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/AlthausFHKRS05,
author = {Ernst Althaus and
Stefan Funke and
Sariel Har{-}Peled and
Jochen K{\"{o}}nemann and
Edgar A. Ramos and
Martin Skutella},
title = {Approximating \emph{k}-hop minimum-spanning trees},
journal = {Oper. Res. Lett.},
volume = {33},
number = {2},
pages = {115--120},
year = {2005},
url = {https://doi.org/10.1016/j.orl.2004.05.005},
doi = {10.1016/J.ORL.2004.05.005},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/AlthausFHKRS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KonemannR05,
author = {Jochen K{\"{o}}nemann and
R. Ravi},
title = {Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform
Degree Bounds},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {3},
pages = {763--773},
year = {2005},
url = {https://doi.org/10.1137/S0097539702418048},
doi = {10.1137/S0097539702418048},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KonemannR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/GrandoniKP05,
author = {Fabrizio Grandoni and
Jochen K{\"{o}}nemann and
Alessandro Panconesi},
editor = {Lusheng Wang},
title = {Distributed Weighted Vertex Cover via Maximal Matchings},
booktitle = {Computing and Combinatorics, 11th Annual International Conference,
{COCOON} 2005, Kunming, China, August 16-29, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3595},
pages = {839--848},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11533719\_85},
doi = {10.1007/11533719\_85},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/GrandoniKP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KonemannLSZ05,
author = {Jochen K{\"{o}}nemann and
Stefano Leonardi and
Guido Sch{\"{a}}fer and
Stefan H. M. van Zwam},
editor = {Lu{\'{\i}}s Caires and
Giuseppe F. Italiano and
Lu{\'{\i}}s Monteiro and
Catuscia Palamidessi and
Moti Yung},
title = {From Primal-Dual to Cost Shares and Back: {A} Stronger {LP} Relaxation
for the Steiner Forest Problem},
booktitle = {Automata, Languages and Programming, 32nd International Colloquium,
{ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3580},
pages = {930--942},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11523468\_75},
doi = {10.1007/11523468\_75},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/KonemannLSZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/GrandoniKPS05,
author = {Fabrizio Grandoni and
Jochen K{\"{o}}nemann and
Alessandro Panconesi and
Mauro Sozio},
editor = {Marcos Kawazoe Aguilera and
James Aspnes},
title = {Primal-dual based distributed algorithms for vertex cover with semi-hard
capacities},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM} Symposium on Principles
of Distributed Computing, {PODC} 2005, Las Vegas, NV, USA, July 17-20,
2005},
pages = {118--125},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1073814.1073835},
doi = {10.1145/1073814.1073835},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/GrandoniKPS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BecchettiKLP05,
author = {Luca Becchetti and
Jochen K{\"{o}}nemann and
Stefano Leonardi and
Martin P{\'{a}}l},
title = {Sharing the cost more efficiently: improved approximation for multicommodity
rent-or-buy},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {375--384},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070485},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BecchettiKLP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KonemannLS05,
author = {Jochen K{\"{o}}nemann and
Stefano Leonardi and
Guido Sch{\"{a}}fer},
title = {A group-strategyproof mechanism for Steiner forests},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {612--619},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070517},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/KonemannLS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KonemannKPS03,
author = {Jochen K{\"{o}}nemann and
Goran Konjevod and
Ojas Parekh and
Amitabh Sinha},
title = {Improved Approximations for Tour and Tree Covers},
journal = {Algorithmica},
volume = {38},
number = {3},
pages = {441--449},
year = {2004},
url = {https://doi.org/10.1007/s00453-003-1071-0},
doi = {10.1007/S00453-003-1071-0},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KonemannKPS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BansalDKS04,
author = {Nikhil Bansal and
Kedar Dhamdhere and
Jochen K{\"{o}}nemann and
Amitabh Sinha},
title = {Non-Clairvoyant Scheduling for Minimizing Mean Slowdown},
journal = {Algorithmica},
volume = {40},
number = {4},
pages = {305--318},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1115-0},
doi = {10.1007/S00453-004-1115-0},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BansalDKS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/EvenGKRS04,
author = {Guy Even and
Naveen Garg and
Jochen K{\"{o}}nemann and
R. Ravi and
Amitabh Sinha},
title = {Min-max tree covers of graphs},
journal = {Oper. Res. Lett.},
volume = {32},
number = {4},
pages = {309--315},
year = {2004},
url = {https://doi.org/10.1016/j.orl.2003.11.010},
doi = {10.1016/J.ORL.2003.11.010},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/EvenGKRS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KonemannLPS04,
author = {Jochen K{\"{o}}nemann and
Yanjun Li and
Ojas Parekh and
Amitabh Sinha},
title = {An approximation algorithm for the edge-dilation \emph{k}-center problem\({}^{\mbox{,
}}\)},
journal = {Oper. Res. Lett.},
volume = {32},
number = {5},
pages = {491--495},
year = {2004},
url = {https://doi.org/10.1016/j.orl.2003.11.011},
doi = {10.1016/J.ORL.2003.11.011},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/KonemannLPS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/KonemannR03,
author = {Jochen K{\"{o}}nemann and
R. Ravi},
editor = {Paritosh K. Pandya and
Jaikumar Radhakrishnan},
title = {Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost
Steiner Trees},
booktitle = {{FST} {TCS} 2003: Foundations of Software Technology and Theoretical
Computer Science, 23rd Conference, Mumbai, India, December 15-17,
2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2914},
pages = {289--301},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24597-1\_25},
doi = {10.1007/978-3-540-24597-1\_25},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/KonemannR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/EvenGKRS03,
author = {Guy Even and
Naveen Garg and
Jochen K{\"{o}}nemann and
R. Ravi and
Amitabh Sinha},
editor = {Sanjeev Arora and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Amit Sahai},
title = {Covering Graphs Using Trees and Stars},
booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms
and Techniques, 6th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International
Workshop on Randomization and Approximation Techniques in Computer
Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2764},
pages = {24--35},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45198-3\_3},
doi = {10.1007/978-3-540-45198-3\_3},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/random/EvenGKRS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/KonemannLS03,
author = {Jochen K{\"{o}}nemann and
Asaf Levin and
Amitabh Sinha},
editor = {Sanjeev Arora and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Amit Sahai},
title = {Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem},
booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms
and Techniques, 6th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International
Workshop on Randomization and Approximation Techniques in Computer
Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2764},
pages = {109--121},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45198-3\_10},
doi = {10.1007/978-3-540-45198-3\_10},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/random/KonemannLS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EisenbrandFGK03,
author = {Friedrich Eisenbrand and
Stefan Funke and
Naveen Garg and
Jochen K{\"{o}}nemann},
title = {A combinatorial algorithm for computing a maximum independent set
in a t-perfect graph},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {517--522},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644194},
timestamp = {Wed, 14 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/EisenbrandFGK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BansalDKS03,
author = {Nikhil Bansal and
Kedar Dhamdhere and
Jochen K{\"{o}}nemann and
Amitabh Sinha},
editor = {Helmut Alt and
Michel Habib},
title = {Non-clairvoyant Scheduling for Minimizing Mean Slowdown},
booktitle = {{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer
Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2607},
pages = {260--270},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-36494-3\_24},
doi = {10.1007/3-540-36494-3\_24},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BansalDKS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KonemannR03,
author = {Jochen K{\"{o}}nemann and
R. Ravi},
editor = {Lawrence L. Larmore and
Michel X. Goemans},
title = {Primal-dual meets local search: approximating MST's with nonuniform
degree bounds},
booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing,
June 9-11, 2003, San Diego, CA, {USA}},
pages = {389--395},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/780542.780600},
doi = {10.1145/780542.780600},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KonemannR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KonemannR02,
author = {Jochen K{\"{o}}nemann and
R. Ravi},
title = {A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded
Minimum Spanning Trees},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {6},
pages = {1783--1793},
year = {2002},
url = {https://doi.org/10.1137/S009753970036917X},
doi = {10.1137/S009753970036917X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KonemannR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KonemannLPS02,
author = {Jochen K{\"{o}}nemann and
Yanjun Li and
Ojas Parekh and
Amitabh Sinha},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Approximation Algorithms for Edge-Dilation k-Center Problems},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {210--219},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_22},
doi = {10.1007/3-540-45471-3\_22},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/KonemannLPS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KonemannKPS00,
author = {Jochen K{\"{o}}nemann and
Goran Konjevod and
Ojas Parekh and
Amitabh Sinha},
editor = {Klaus Jansen and
Samir Khuller},
title = {Improved approximations for tour and tree covers},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {184--193},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_19},
doi = {10.1007/3-540-44436-X\_19},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/KonemannKPS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KonemannR00,
author = {Jochen K{\"{o}}nemann and
R. Ravi},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {A matter of degree: improved approximation algorithms for degree-bounded
minimum spanning trees},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {537--546},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335371},
doi = {10.1145/335305.335371},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KonemannR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GargK98,
author = {Naveen Garg and
Jochen K{\"{o}}nemann},
title = {Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional
Packing Problems},
booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
November 8-11, 1998, Palo Alto, California, {USA}},
pages = {300--309},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SFCS.1998.743463},
doi = {10.1109/SFCS.1998.743463},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GargK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BurnikelKMNSU95,
author = {Christoph Burnikel and
Jochen K{\"{o}}nemann and
Kurt Mehlhorn and
Stefan N{\"{a}}her and
Stefan Schirra and
Christian Uhrig},
editor = {Jack Snoeyink},
title = {Exact Geometric Computation in {LEDA}},
booktitle = {Proceedings of the Eleventh Annual Symposium on Computational Geometry,
Vancouver, B.C., Canada, June 5-12, 1995},
pages = {C18--C19},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/220279.220330},
doi = {10.1145/220279.220330},
timestamp = {Mon, 14 Jun 2021 16:25:05 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BurnikelKMNSU95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2023-11-15 20:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
