Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Walter Kern
@article{DBLP:journals/corr/abs-2301-13181,
author = {M{\'{a}}rton Benedek and
P{\'{e}}ter Bir{\'{o}} and
Walter Kern and
D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
Dani{\"{e}}l Paulusma},
title = {Partitioned Matching Games for International Kidney Exchange},
journal = {CoRR},
volume = {abs/2301.13181},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.13181},
doi = {10.48550/ARXIV.2301.13181},
eprinttype = {arXiv},
eprint = {2301.13181},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-13181.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KernMPSL22,
author = {Walter Kern and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith and
Erik Jan van Leeuwen},
title = {Disjoint paths and connected subgraphs for \emph{H}-free graphs},
journal = {Theor. Comput. Sci.},
volume = {898},
pages = {59--68},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2021.10.019},
doi = {10.1016/J.TCS.2021.10.019},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KernMPSL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/BenedekBKP22,
author = {M{\'{a}}rton Benedek and
P{\'{e}}ter Bir{\'{o}} and
Walter Kern and
Dani{\"{e}}l Paulusma},
editor = {Piotr Faliszewski and
Viviana Mascardi and
Catherine Pelachaud and
Matthew E. Taylor},
title = {Computing Balanced Solutions for Large International Kidney Exchange
Schemes},
booktitle = {21st International Conference on Autonomous Agents and Multiagent
Systems, {AAMAS} 2022, Auckland, New Zealand, May 9-13, 2022},
pages = {82--90},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems
{(IFAAMAS)}},
year = {2022},
url = {https://www.ifaamas.org/Proceedings/aamas2022/pdfs/p82.pdf},
doi = {10.5555/3535850.3535861},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/atal/BenedekBKP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/KernMPSL21,
author = {Walter Kern and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith and
Erik Jan van Leeuwen},
editor = {Paola Flocchini and
Lucia Moura},
title = {Disjoint Paths and Connected Subgraphs for H-Free Graphs},
booktitle = {Combinatorial Algorithms - 32nd International Workshop, {IWOCA} 2021,
Ottawa, ON, Canada, July 5-7, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12757},
pages = {414--427},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-79987-8\_29},
doi = {10.1007/978-3-030-79987-8\_29},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwoca/KernMPSL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-06349,
author = {Walter Kern and
Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith and
Erik Jan van Leeuwen},
title = {Disjoint Paths and Connected Subgraphs for H-Free Graphs},
journal = {CoRR},
volume = {abs/2105.06349},
year = {2021},
url = {https://arxiv.org/abs/2105.06349},
eprinttype = {arXiv},
eprint = {2105.06349},
timestamp = {Tue, 18 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-06349.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-06788,
author = {M{\'{a}}rton Benedek and
P{\'{e}}ter Bir{\'{o}} and
Walter Kern and
Dani{\"{e}}l Paulusma},
title = {Computing Balanced Solutions for Large International Kidney Exchange
Schemes},
journal = {CoRR},
volume = {abs/2109.06788},
year = {2021},
url = {https://arxiv.org/abs/2109.06788},
eprinttype = {arXiv},
eprint = {2109.06788},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-06788.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scw/HofKKPP20,
author = {Frits Hof and
Walter Kern and
Sascha Kurz and
Kanstantsin Pashkovich and
Dani{\"{e}}l Paulusma},
title = {Simple games versus weighted voting games: bounding the critical threshold
value},
journal = {Soc. Choice Welf.},
volume = {54},
number = {4},
pages = {609--621},
year = {2020},
url = {https://doi.org/10.1007/s00355-019-01221-6},
doi = {10.1007/S00355-019-01221-6},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scw/HofKKPP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KernP20,
author = {Walter Kern and
Dani{\"{e}}l Paulusma},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Contracting to a Longest Path in H-Free Graphs},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {22:1--22:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.22},
doi = {10.4230/LIPICS.ISAAC.2020.22},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/KernP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/BiroKPP19,
author = {P{\'{e}}ter Bir{\'{o}} and
Walter Kern and
D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
Dani{\"{e}}l Paulusma},
editor = {Edith Elkind and
Manuela Veloso and
Noa Agmon and
Matthew E. Taylor},
title = {Generalized Matching Games for International Kidney Exchange},
booktitle = {Proceedings of the 18th International Conference on Autonomous Agents
and MultiAgent Systems, {AAMAS} '19, Montreal, QC, Canada, May 13-17,
2019},
pages = {413--421},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
year = {2019},
url = {http://dl.acm.org/citation.cfm?id=3331721},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/atal/BiroKPP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FaigleKP18,
author = {Ulrich Faigle and
Walter Kern and
Britta Peis},
title = {Greedy Oriented Flows},
journal = {Algorithmica},
volume = {80},
number = {4},
pages = {1298--1314},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0306-4},
doi = {10.1007/S00453-017-0306-4},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FaigleKP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/geb/BiroKPW18,
author = {P{\'{e}}ter Bir{\'{o}} and
Walter Kern and
Dani{\"{e}}l Paulusma and
P{\'{e}}ter Wojuteczky},
title = {The stable fixtures problem with payments},
journal = {Games Econ. Behav.},
volume = {108},
pages = {245--268},
year = {2018},
url = {https://doi.org/10.1016/j.geb.2017.02.002},
doi = {10.1016/J.GEB.2017.02.002},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/geb/BiroKPW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/HofKKP18,
author = {Frits Hof and
Walter Kern and
Sascha Kurz and
Dani{\"{e}}l Paulusma},
editor = {Xiaotie Deng},
title = {Simple Games Versus Weighted Voting Games},
booktitle = {Algorithmic Game Theory - 11th International Symposium, {SAGT} 2018,
Beijing, China, September 11-14, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11059},
pages = {69--81},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-99660-8\_7},
doi = {10.1007/978-3-319-99660-8\_7},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sagt/HofKKP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-02192,
author = {Frits Hof and
Walter Kern and
Sascha Kurz and
Dani{\"{e}}l Paulusma},
title = {Simple Games versus Weighted Voting Games},
journal = {CoRR},
volume = {abs/1805.02192},
year = {2018},
url = {http://arxiv.org/abs/1805.02192},
eprinttype = {arXiv},
eprint = {1805.02192},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-02192.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-01542,
author = {Walter Kern and
Dani{\"{e}}l Paulusma},
title = {Contracting to a Longest Path in H-Free Graphs},
journal = {CoRR},
volume = {abs/1810.01542},
year = {2018},
url = {http://arxiv.org/abs/1810.01542},
eprinttype = {arXiv},
eprint = {1810.01542},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-01542.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-08841,
author = {Frits Hof and
Walter Kern and
Sascha Kurz and
Kanstantsin Pashkovich and
Dani{\"{e}}l Paulusma},
title = {Simple Games versus Weighted Voting Games: Bounding the Critical Threshold
Value},
journal = {CoRR},
volume = {abs/1810.08841},
year = {2018},
url = {http://arxiv.org/abs/1810.08841},
eprinttype = {arXiv},
eprint = {1810.08841},
timestamp = {Wed, 31 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-08841.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KernM17,
author = {Walter Kern and
Bodo Manthey},
title = {Approximating bounded-degree spanning trees and connected factors
with leaves},
journal = {Oper. Res. Lett.},
volume = {45},
number = {2},
pages = {115--118},
year = {2017},
url = {https://doi.org/10.1016/j.orl.2017.01.002},
doi = {10.1016/J.ORL.2017.01.002},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/KernM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/JongKSU17,
author = {Jasper de Jong and
Walter Kern and
Berend Steenhuisen and
Marc Uetz},
editor = {Roberto Solis{-}Oba and
Rudolf Fleischer},
title = {The Asymptotic Price of Anarchy for k-uniform Congestion Games},
booktitle = {Approximation and Online Algorithms - 15th International Workshop,
{WAOA} 2017, Vienna, Austria, September 7-8, 2017, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {10787},
pages = {317--328},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-89441-6\_23},
doi = {10.1007/978-3-319-89441-6\_23},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/JongKSU17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/dnb/Kern16,
author = {Walter Kern},
title = {Patternbasierte Abbildung von Rich-Client-Aspekten auf webbasierte
Systeme im Kontext der Barrierefreiheitsanforderungen im Bereich E-Governement},
school = {University of Regensburg, Germany},
year = {2016},
url = {https://d-nb.info/1123048886},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/dnb/Kern16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/QiuK16,
author = {Xian Qiu and
Walter Kern},
title = {Approximate core allocations and integrality gap for the bin packing
game},
journal = {Theor. Comput. Sci.},
volume = {627},
pages = {26--35},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.02.018},
doi = {10.1016/J.TCS.2016.02.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/QiuK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KernMU16,
author = {Walter Kern and
Bodo Manthey and
Marc Uetz},
title = {Note on {VCG} vs. Price Raising for Matching Markets},
journal = {CoRR},
volume = {abs/1604.04157},
year = {2016},
url = {http://arxiv.org/abs/1604.04157},
eprinttype = {arXiv},
eprint = {1604.04157},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KernMU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HarrenK15,
author = {Rolf Harren and
Walter Kern},
title = {Improved Lower Bound for Online Strip Packing},
journal = {Theory Comput. Syst.},
volume = {56},
number = {1},
pages = {41--72},
year = {2015},
url = {https://doi.org/10.1007/s00224-013-9494-8},
doi = {10.1007/S00224-013-9494-8},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/HarrenK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/QiuK15,
author = {Xian Qiu and
Walter Kern},
title = {Improved approximation algorithms for a bilevel knapsack problem},
journal = {Theor. Comput. Sci.},
volume = {595},
pages = {120--129},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.06.027},
doi = {10.1016/J.TCS.2015.06.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/QiuK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BiroKPW15,
author = {P{\'{e}}ter Bir{\'{o}} and
Walter Kern and
Dani{\"{e}}l Paulusma and
P{\'{e}}ter Wojuteczky},
editor = {Ernst W. Mayr},
title = {The Stable Fixtures Problem with Payments},
booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International
Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {9224},
pages = {49--63},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-53174-7\_4},
doi = {10.1007/978-3-662-53174-7\_4},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/BiroKPW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BiroKPW15,
author = {P{\'{e}}ter Bir{\'{o}} and
Walter Kern and
Dani{\"{e}}l Paulusma and
P{\'{e}}ter Wojuteczky},
title = {The Stable Fixtures Problem with Payments},
journal = {CoRR},
volume = {abs/1508.06420},
year = {2015},
url = {http://arxiv.org/abs/1508.06420},
eprinttype = {arXiv},
eprint = {1508.06420},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/BiroKPW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KernQ14,
author = {Walter Kern and
Xian Qiu},
title = {Note on non-uniform bin packing games},
journal = {Discret. Appl. Math.},
volume = {165},
pages = {175--184},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2012.08.002},
doi = {10.1016/J.DAM.2012.08.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KernQ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BiroBGKP14,
author = {P{\'{e}}ter Bir{\'{o}} and
Matthijs Bomhoff and
Petr A. Golovach and
Walter Kern and
Dani{\"{e}}l Paulusma},
title = {Solutions for the stable roommates problem with payments},
journal = {Theor. Comput. Sci.},
volume = {540},
pages = {53--61},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2013.03.027},
doi = {10.1016/J.TCS.2013.03.027},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BiroBGKP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/QiuK14,
author = {Xian Qiu and
Walter Kern},
editor = {Zhipeng Cai and
Alex Zelikovsky and
Anu G. Bourgeois},
title = {Improved Approximation Algorithms for a Bilevel Knapsack Problem},
booktitle = {Computing and Combinatorics - 20th International Conference, {COCOON}
2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8591},
pages = {312--323},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08783-2\_27},
doi = {10.1007/978-3-319-08783-2\_27},
timestamp = {Thu, 20 Aug 2020 15:36:49 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/QiuK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BomhoffKS13,
author = {Matthijs Bomhoff and
Walter Kern and
Georg Still},
title = {A note on perfect partial elimination},
journal = {Discret. Math.},
volume = {313},
number = {14},
pages = {1558--1563},
year = {2013},
url = {https://doi.org/10.1016/j.disc.2013.04.001},
doi = {10.1016/J.DISC.2013.04.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BomhoffKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KernP13,
author = {Walter Kern and
Jacob Jan Paulus},
title = {A tight analysis of Brown-Baker-Katseff sequences for online strip
packing},
journal = {J. Comb. Optim.},
volume = {26},
number = {2},
pages = {333--344},
year = {2013},
url = {https://doi.org/10.1007/s10878-012-9463-1},
doi = {10.1007/S10878-012-9463-1},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KernP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/KernQ13,
author = {Walter Kern and
Xian Qiu},
editor = {Ding{-}Zhu Du and
Guochuan Zhang},
title = {The 1/4-Core of the Uniform Bin Packing Game Is Nonempty},
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 = {41--52},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38768-5\_6},
doi = {10.1007/978-3-642-38768-5\_6},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/KernQ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijgt/BiroKP12,
author = {P{\'{e}}ter Bir{\'{o}} and
Walter Kern and
Dani{\"{e}}l Paulusma},
title = {Computing solutions for matching games},
journal = {Int. J. Game Theory},
volume = {41},
number = {1},
pages = {75--90},
year = {2012},
url = {https://doi.org/10.1007/s00182-011-0273-y},
doi = {10.1007/S00182-011-0273-Y},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijgt/BiroKP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BomhoffKS12,
author = {Matthijs Bomhoff and
Walter Kern and
Georg Still},
title = {On bounded block decomposition problems for under-specified systems
of equations},
journal = {J. Comput. Syst. Sci.},
volume = {78},
number = {1},
pages = {336--347},
year = {2012},
url = {https://doi.org/10.1016/j.jcss.2011.05.011},
doi = {10.1016/J.JCSS.2011.05.011},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BomhoffKS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/FaigleKP12,
author = {Ulrich Faigle and
Walter Kern and
Britta Peis},
title = {A ranking model for the greedy algorithm and discrete convexity},
journal = {Math. Program.},
volume = {132},
number = {1-2},
pages = {393--407},
year = {2012},
url = {https://doi.org/10.1007/s10107-010-0406-2},
doi = {10.1007/S10107-010-0406-2},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/FaigleKP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KernQ12,
author = {Walter Kern and
Xian Qiu},
title = {Integrality gap analysis for bin packing games},
journal = {Oper. Res. Lett.},
volume = {40},
number = {5},
pages = {360--363},
year = {2012},
url = {https://doi.org/10.1016/j.orl.2012.06.007},
doi = {10.1016/J.ORL.2012.06.007},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/KernQ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BiroBGKP12,
author = {P{\'{e}}ter Bir{\'{o}} and
Matthijs Bomhoff and
Petr A. Golovach and
Walter Kern and
Dani{\"{e}}l Paulusma},
editor = {Martin Charles Golumbic and
Michal Stern and
Avivit Levy and
Gila Morgenstern},
title = {Solutions for the Stable Roommates Problem with Payments},
booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International
Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised
Selcted Papers},
series = {Lecture Notes in Computer Science},
volume = {7551},
pages = {69--80},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34611-8\_10},
doi = {10.1007/978-3-642-34611-8\_10},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/BiroBGKP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1206-5167,
author = {Ulrich Faigle and
Walter Kern and
Britta Peis},
title = {Max-Flow on Regular Spaces},
journal = {CoRR},
volume = {abs/1206.5167},
year = {2012},
url = {http://arxiv.org/abs/1206.5167},
eprinttype = {arXiv},
eprint = {1206.5167},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1206-5167.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/KernQ11,
author = {Walter Kern and
Xian Qiu},
editor = {Ludovica Adacher and
Marta Flamini and
Gianmaria Leo and
Gaia Nicosia and
Andrea Pacifici and
Veronica Piccialli},
title = {Improved Taxation Rate for Bin Packing Games},
booktitle = {Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial
optimization. Extended Abstracts, Villa Mondragone, Frascati, Italy,
June 14-16, 2011},
pages = {173--176},
year = {2011},
url = {http://ctw2011.dia.uniroma3.it/ctw\_proceedings.pdf\#page=185},
timestamp = {Thu, 12 Mar 2020 11:34:41 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/KernQ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tapas/FaigleKP11,
author = {Ulrich Faigle and
Walter Kern and
Britta Peis},
editor = {Alberto Marchetti{-}Spaccamela and
Michael Segal},
title = {On Greedy and Submodular Matrices},
booktitle = {Theory and Practice of Algorithms in (Computer) Systems - First International
{ICST} Conference, {TAPAS} 2011, Rome, Italy, April 18-20, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6595},
pages = {116--126},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-19754-3\_13},
doi = {10.1007/978-3-642-19754-3\_13},
timestamp = {Tue, 14 May 2019 10:00:49 +0200},
biburl = {https://dblp.org/rec/conf/tapas/FaigleKP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tapas/KernQ11,
author = {Walter Kern and
Xian Qiu},
editor = {Alberto Marchetti{-}Spaccamela and
Michael Segal},
title = {Improved Taxation Rate for Bin Packing Games},
booktitle = {Theory and Practice of Algorithms in (Computer) Systems - First International
{ICST} Conference, {TAPAS} 2011, Rome, Italy, April 18-20, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6595},
pages = {175--180},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-19754-3\_18},
doi = {10.1007/978-3-642-19754-3\_18},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tapas/KernQ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/HarrenK11,
author = {Rolf Harren and
Walter Kern},
editor = {Roberto Solis{-}Oba and
Giuseppe Persiano},
title = {Improved Lower Bound for Online Strip Packing - (Extended Abstract)},
booktitle = {Approximation and Online Algorithms - 9th International Workshop,
{WAOA} 2011, Saarbr{\"{u}}cken, Germany, September 8-9, 2011,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7164},
pages = {211--218},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-29116-6\_18},
doi = {10.1007/978-3-642-29116-6\_18},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/HarrenK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Kern10,
author = {Walter Kern},
title = {Book review},
journal = {Oper. Res. Lett.},
volume = {38},
number = {5},
pages = {492},
year = {2010},
url = {https://doi.org/10.1016/j.orl.2010.07.001},
doi = {10.1016/J.ORL.2010.07.001},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Kern10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/software/KernSW10,
author = {Walter Kern and
Christian Silberbauer and
Christian Wolff},
title = {The Dimension Architecture: {A} New Approach to Resource Access},
journal = {{IEEE} Softw.},
volume = {27},
number = {5},
pages = {74--81},
year = {2010},
url = {https://doi.org/10.1109/MS.2010.128},
doi = {10.1109/MS.2010.128},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/software/KernSW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/KernP10,
author = {Walter Kern and
Jacob Jan Paulus},
editor = {Ulrich Faigle and
Rainer Schrader and
Daniel Herrmann},
title = {A tight Analysis of Brown-Baker-Katseff Sequences for Online Strip
Packing},
booktitle = {9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
Cologne, Germany, May 25-27, 2010. Extended Abstracts},
pages = {109--110},
year = {2010},
timestamp = {Tue, 09 Nov 2010 19:12:38 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/KernP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/BiroKP10,
author = {P{\'{e}}ter Bir{\'{o}} and
Walter Kern and
Dani{\"{e}}l Paulusma},
editor = {Jan Kratochv{\'{\i}}l and
Angsheng Li and
Jir{\'{\i}} Fiala and
Petr Kolman},
title = {On Solution Concepts for Matching Games},
booktitle = {Theory and Applications of Models of Computation, 7th Annual Conference,
{TAMC} 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6108},
pages = {117--127},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13562-0\_12},
doi = {10.1007/978-3-642-13562-0\_12},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/tamc/BiroKP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/KernP09,
author = {Walter Kern and
Dani{\"{e}}l Paulusma},
title = {On the Core and \emph{f}-Nucleolus of Flow Games},
journal = {Math. Oper. Res.},
volume = {34},
number = {4},
pages = {981--991},
year = {2009},
url = {https://doi.org/10.1287/moor.1090.0405},
doi = {10.1287/MOOR.1090.0405},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/KernP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/NiebergHK08,
author = {Tim Nieberg and
Johann L. Hurink and
Walter Kern},
title = {Approximation schemes for wireless networks},
journal = {{ACM} Trans. Algorithms},
volume = {4},
number = {4},
pages = {49:1--49:17},
year = {2008},
url = {https://doi.org/10.1145/1383369.1383380},
doi = {10.1145/1383369.1383380},
timestamp = {Mon, 06 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/NiebergHK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FuchsKW07,
author = {Bernhard Fuchs and
Walter Kern and
Xinhui Wang},
title = {The Number of Tree Stars Is \emph{O} \({}^{\mbox{*}}\)(1.357\({}^{\mbox{
\emph{k} }}\))},
journal = {Algorithmica},
volume = {49},
number = {3},
pages = {232--244},
year = {2007},
url = {https://doi.org/10.1007/s00453-007-9020-y},
doi = {10.1007/S00453-007-9020-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FuchsKW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/FuchsKW07,
author = {Bernhard Fuchs and
Walter Kern and
Xinhui Wang},
title = {Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees},
journal = {Math. Methods Oper. Res.},
volume = {66},
number = {1},
pages = {117--125},
year = {2007},
url = {https://doi.org/10.1007/s00186-007-0146-0},
doi = {10.1007/S00186-007-0146-0},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/FuchsKW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/KernW07,
author = {Walter Kern and
Gerhard J. Woeginger},
title = {Quadratic programming and combinatorial minimum weight product problems},
journal = {Math. Program.},
volume = {110},
number = {3},
pages = {641--649},
year = {2007},
url = {https://doi.org/10.1007/s10107-006-0047-7},
doi = {10.1007/S10107-006-0047-7},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/KernW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FuchsKMRRW07,
author = {Bernhard Fuchs and
Walter Kern and
Daniel M{\"{o}}lle and
Stefan Richter and
Peter Rossmanith and
Xinhui Wang},
title = {Dynamic Programming for Minimum Steiner Trees},
journal = {Theory Comput. Syst.},
volume = {41},
number = {3},
pages = {493--500},
year = {2007},
url = {https://doi.org/10.1007/s00224-007-1324-4},
doi = {10.1007/S00224-007-1324-4},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FuchsKMRRW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/KernW07,
author = {Walter Kern and
Xinhui Wang},
editor = {Johann L. Hurink and
Walter Kern and
Gerhard F. Post and
Georg Still},
title = {On full components for Rectilinear Steiner tree},
booktitle = {Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization,
University of Twente, Enschede, The Netherlands, 29-31 May, 2007},
pages = {85--88},
publisher = {University of Twente},
year = {2007},
timestamp = {Mon, 06 Apr 2020 17:04:26 +0200},
biburl = {https://dblp.org/rec/conf/colognetwente/KernW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/colognetwente/2007,
editor = {Johann L. Hurink and
Walter Kern and
Gerhard F. Post and
Georg Still},
title = {Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization,
University of Twente, Enschede, The Netherlands, 29-31 May, 2007},
publisher = {University of Twente},
year = {2007},
timestamp = {Mon, 06 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colognetwente/2007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FuchsKW06,
author = {Bernhard Fuchs and
Walter Kern and
Xinhui Wang},
title = {The number of tree stars is O\({}^{\mbox{*}}\)(1.357\({}^{\mbox{k}}\))},
journal = {Electron. Notes Discret. Math.},
volume = {25},
pages = {183--185},
year = {2006},
url = {https://doi.org/10.1016/j.endm.2006.06.070},
doi = {10.1016/J.ENDM.2006.06.070},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FuchsKW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/PopKS06,
author = {Petrica C. Pop and
Walter Kern and
Georg Still},
title = {A new relaxation method for the generalized minimum spanning tree
problem},
journal = {Eur. J. Oper. Res.},
volume = {170},
number = {3},
pages = {900--908},
year = {2006},
url = {https://doi.org/10.1016/j.ejor.2004.07.058},
doi = {10.1016/J.EJOR.2004.07.058},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/PopKS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/FaigleKK06,
author = {Ulrich Faigle and
Walter Kern and
Jeroen Kuipers},
title = {Computing an Element in the Lexicographic Kernel of a Game},
journal = {Math. Methods Oper. Res.},
volume = {63},
number = {3},
pages = {427--433},
year = {2006},
url = {https://doi.org/10.1007/s00186-006-0065-5},
doi = {10.1007/S00186-006-0065-5},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/FaigleKK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BrueggemannHK06,
author = {Tobias Br{\"{u}}ggemann and
Johann L. Hurink and
Walter Kern},
title = {Quality of move-optimal schedules for minimizing total weighted completion
time},
journal = {Oper. Res. Lett.},
volume = {34},
number = {5},
pages = {583--590},
year = {2006},
url = {https://doi.org/10.1016/j.orl.2005.08.003},
doi = {10.1016/J.ORL.2005.08.003},
timestamp = {Mon, 06 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BrueggemannHK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KernW06,
author = {Walter Kern and
Gerhard J. Woeginger},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Quadratic Programming and Combinatorial Minimum Weight Product Problems},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {42--49},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_7},
doi = {10.1007/11758471\_7},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KernW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FuchsHK05,
author = {Bernhard Fuchs and
Winfried Hochst{\"{a}}ttler and
Walter Kern},
title = {Online matching on a line},
journal = {Theor. Comput. Sci.},
volume = {332},
number = {1-3},
pages = {251--264},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2004.10.028},
doi = {10.1016/J.TCS.2004.10.028},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FuchsHK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/PopSK05,
author = {Petrica C. Pop and
Georg Still and
Walter Kern},
editor = {Hajo Broersma and
Matthew Johnson and
Stefan Szeider},
title = {An Approximation Algorithm for the Generalized Minimum Spanning Tree
Problem with Bounded Cluster Size},
booktitle = {Algorithms and Complexity in Durham 2005 - Proceedings of the First
ACiD Workshop, 8-10 July 2005, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {4},
pages = {115--121},
publisher = {King's College, London},
year = {2005},
timestamp = {Tue, 24 Jul 2007 20:35:20 +0200},
biburl = {https://dblp.org/rec/conf/acid/PopSK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/KernP04,
author = {Walter Kern and
Dani{\"{e}}l Paulusma},
title = {The computational complexity of the elimination problem in generalized
sports competitions},
journal = {Discret. Optim.},
volume = {1},
number = {2},
pages = {205--214},
year = {2004},
url = {https://doi.org/10.1016/j.disopt.2003.12.003},
doi = {10.1016/J.DISOPT.2003.12.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/KernP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BruggemannK04,
author = {Tobias Br{\"{u}}ggemann and
Walter Kern},
title = {An improved local search algorithm for 3-SAT},
journal = {Electron. Notes Discret. Math.},
volume = {17},
pages = {69--73},
year = {2004},
url = {https://doi.org/10.1016/j.endm.2004.03.021},
doi = {10.1016/J.ENDM.2004.03.021},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BruggemannK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ErdosFHK04,
author = {P{\'{e}}ter L. Erd{\"{o}}s and
Ulrich Faigle and
Winfried Hochst{\"{a}}ttler and
Walter Kern},
title = {Note on the game chromatic index of trees},
journal = {Theor. Comput. Sci.},
volume = {313},
number = {3},
pages = {371--376},
year = {2004},
url = {https://doi.org/10.1016/j.tcs.2002.10.002},
doi = {10.1016/J.TCS.2002.10.002},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ErdosFHK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrueggemannK04,
author = {Tobias Br{\"{u}}ggemann and
Walter Kern},
title = {An improved deterministic local search algorithm for 3-SAT},
journal = {Theor. Comput. Sci.},
volume = {329},
number = {1-3},
pages = {303--313},
year = {2004},
url = {https://doi.org/10.1016/j.tcs.2004.08.002},
doi = {10.1016/J.TCS.2004.08.002},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BrueggemannK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/BruggemannK04,
author = {Tobias Br{\"{u}}ggemann and
Walter Kern},
editor = {Leo Liberti and
Francesco Maffioli},
title = {An Improved Local Search Algorithm for 3-SAT},
booktitle = {{CTW04} Workshop on Graphs and Combinatorial Optimization, Scientific
Program, Villa Vigoni, Menaggio (CO), Italy, 31st May to 2nd June
2004},
pages = {66--70},
year = {2004},
timestamp = {Tue, 09 Nov 2010 19:23:16 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/BruggemannK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/NiebergHK04,
author = {Tim Nieberg and
Johann L. Hurink and
Walter Kern},
editor = {Juraj Hromkovic and
Manfred Nagl and
Bernhard Westfechtel},
title = {A Robust {PTAS} for Maximum Weight Independent Sets in Unit Disk Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG
2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {3353},
pages = {214--221},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30559-0\_18},
doi = {10.1007/978-3-540-30559-0\_18},
timestamp = {Mon, 06 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/NiebergHK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FuchsHK03,
author = {Bernhard Fuchs and
Winfried Hochst{\"{a}}ttler and
Walter Kern},
title = {Online Matching On a Line},
journal = {Electron. Notes Discret. Math.},
volume = {13},
pages = {49--51},
year = {2003},
url = {https://doi.org/10.1016/S1571-0653(04)00436-6},
doi = {10.1016/S1571-0653(04)00436-6},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FuchsHK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/KernP03,
author = {Walter Kern and
Dani{\"{e}}l Paulusma},
title = {Matching Games: The Least Core and the Nucleolus},
journal = {Math. Oper. Res.},
volume = {28},
number = {2},
pages = {294--308},
year = {2003},
url = {https://doi.org/10.1287/moor.28.2.294.14477},
doi = {10.1287/MOOR.28.2.294.14477},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/KernP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KernP01,
author = {Walter Kern and
Dani{\"{e}}l Paulusma},
title = {The new {FIFA} rules are hard: complexity aspects of sports competitions},
journal = {Discret. Appl. Math.},
volume = {108},
number = {3},
pages = {317--323},
year = {2001},
url = {https://doi.org/10.1016/S0166-218X(00)00241-9},
doi = {10.1016/S0166-218X(00)00241-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KernP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/DumbK01,
author = {A. F. Dumb and
Walter Kern},
title = {A simple dual ascent algorithm for the multilevel facility location
problem},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {14--17},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80067-8},
doi = {10.1016/S1571-0653(05)80067-8},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/DumbK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/PopKSF01,
author = {Petrica C. Pop and
Walter Kern and
Georg Still and
Ulrich Faigle},
title = {Relaxation methods for the Generalized Minimum Spanning Tree Problem},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {76--79},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80085-X},
doi = {10.1016/S1571-0653(05)80085-X},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/PopKSF01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/HuntingFK01,
author = {Marcel Hunting and
Ulrich Faigle and
Walter Kern},
title = {A Lagrangian relaxation approach to the edge-weighted clique problem},
journal = {Eur. J. Oper. Res.},
volume = {131},
number = {1},
pages = {119--131},
year = {2001},
url = {https://doi.org/10.1016/S0377-2217(99)00449-X},
doi = {10.1016/S0377-2217(99)00449-X},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/HuntingFK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijgt/FaigleKK01,
author = {Ulrich Faigle and
Walter Kern and
Jeroen Kuipers},
title = {On the computation of the nucleolus of a cooperative game},
journal = {Int. J. Game Theory},
volume = {30},
number = {1},
pages = {79--98},
year = {2001},
url = {https://doi.org/10.1007/s001820100065},
doi = {10.1007/S001820100065},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijgt/FaigleKK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/BumbK01,
author = {Adriana Felicia Bumb and
Walter Kern},
editor = {Michel X. Goemans and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {A Simple Dual Ascent Algorithm for the Multilevel Facility Location
Problem},
booktitle = {Approximation, Randomization and Combinatorial Optimization: Algorithms
and Techniques, 4th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2001 and 5th International
Workshop on Randomization and Approximation Techniques in Computer
Science, {RANDOM} 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2129},
pages = {55--62},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44666-4\_10},
doi = {10.1007/3-540-44666-4\_10},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/random/BumbK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/FaigleKP00,
author = {Ulrich Faigle and
Walter Kern and
Dani{\"{e}}l Paulusma},
title = {Note on the computational complexity of least core concepts for min-cost
spanning tree games},
journal = {Math. Methods Oper. Res.},
volume = {52},
number = {1},
pages = {23--38},
year = {2000},
url = {https://doi.org/10.1007/s001860000059},
doi = {10.1007/S001860000059},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/FaigleKP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/FaigleK00,
author = {Ulrich Faigle and
Walter Kern},
title = {On the core of ordered submodular cost games},
journal = {Math. Program.},
volume = {87},
number = {3},
pages = {483--499},
year = {2000},
url = {https://doi.org/10.1007/s101070050008},
doi = {10.1007/S101070050008},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/FaigleK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/order/FaigleK00,
author = {Ulrich Faigle and
Walter Kern},
title = {An Order-theoretic Framework for the Greedy Algorithm with Applications
to the Core and Weber Set of Cooperative Games},
journal = {Order},
volume = {17},
number = {4},
pages = {353--375},
year = {2000},
url = {https://doi.org/10.1023/A:1006406424957},
doi = {10.1023/A:1006406424957},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/order/FaigleK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/FaigleKN99,
author = {Ulrich Faigle and
Walter Kern and
Willem M. Nawijn},
title = {A Greedy On-Line Algorithm for thek-Track Assignment Problem},
journal = {J. Algorithms},
volume = {31},
number = {1},
pages = {196--210},
year = {1999},
url = {https://doi.org/10.1006/jagm.1998.1001},
doi = {10.1006/JAGM.1998.1001},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/FaigleKN99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijgt/FaigleKK98,
author = {Ulrich Faigle and
Walter Kern and
Jeroen Kuipers},
title = {Note Computing the nucleolus of min-cost spanning tree games is NP-hard
- Computing the nucleolus of min-cost spanning tree games is NP-hard},
journal = {Int. J. Game Theory},
volume = {27},
number = {3},
pages = {443--450},
year = {1998},
url = {https://doi.org/10.1007/s001820050083},
doi = {10.1007/S001820050083},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijgt/FaigleKK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/FaigleKFH98,
author = {Ulrich Faigle and
Walter Kern and
S{\'{a}}ndor P. Fekete and
Winfried Hochst{\"{a}}ttler},
title = {The nucleon of cooperative games and an algorithm for matching games},
journal = {Math. Program.},
volume = {83},
pages = {195--211},
year = {1998},
url = {https://doi.org/10.1007/BF02680558},
doi = {10.1007/BF02680558},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/FaigleKFH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FaigleK98,
author = {Ulrich Faigle and
Walter Kern},
title = {Approximate Core Allocation for Binpacking Games},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {3},
pages = {387--399},
year = {1998},
url = {https://doi.org/10.1137/S0895480296308074},
doi = {10.1137/S0895480296308074},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FaigleK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijgt/FaigleKFH97,
author = {Ulrich Faigle and
Walter Kern and
S{\'{a}}ndor P. Fekete and
Winfried Hochst{\"{a}}ttler},
title = {On the complexity of testing membership in the core of min-cost spanning
tree games},
journal = {Int. J. Game Theory},
volume = {26},
number = {3},
pages = {361--366},
year = {1997},
url = {https://doi.org/10.1007/BF01263277},
doi = {10.1007/BF01263277},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijgt/FaigleKFH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/FaigleHKPS97,
author = {Ulrich Faigle and
Marcel Hunting and
Walter Kern and
Ravi Prakash and
K. J. Supowit},
title = {Simplices by point-sliding and the Yamnitsky-Levin algorithm},
journal = {Math. Methods Oper. Res.},
volume = {46},
number = {1},
pages = {131--142},
year = {1997},
url = {https://doi.org/10.1007/BF01199467},
doi = {10.1007/BF01199467},
timestamp = {Sat, 13 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/FaigleHKPS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/FaigleGK96,
author = {Ulrich Faigle and
Renate Garbe and
Walter Kern},
title = {Randomized Online Algorithms for Maximizing Busy Time Interval Scheduling},
journal = {Computing},
volume = {56},
number = {2},
pages = {95--104},
year = {1996},
url = {https://doi.org/10.1007/BF02309339},
doi = {10.1007/BF02309339},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/FaigleGK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/FaigleKS96,
author = {Ulrich Faigle and
Walter Kern and
Boris Spieker},
title = {On the communication complexity of \emph{t} -intersection problems
in generalized Boolean algebras},
journal = {Math. Methods Oper. Res.},
volume = {43},
number = {2},
pages = {239--254},
year = {1996},
url = {https://doi.org/10.1007/BF01680375},
doi = {10.1007/BF01680375},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/FaigleKS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/FaigleK96,
author = {Ulrich Faigle and
Walter Kern},
title = {Submodular linear programs on forests},
journal = {Math. Program.},
volume = {72},
pages = {195--206},
year = {1996},
url = {https://doi.org/10.1007/BF02592089},
doi = {10.1007/BF02592089},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/FaigleK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/FaigleKS96,
author = {Ulrich Faigle and
Walter Kern and
Martin Streng},
title = {Note on the computational complexity of j-radii of polytopes in Real\({}^{\mbox{n}}\)},
journal = {Math. Program.},
volume = {73},
pages = {1--5},
year = {1996},
url = {https://doi.org/10.1007/BF02592095},
doi = {10.1007/BF02592095},
timestamp = {Tue, 01 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/FaigleKS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FaigleHK96,
author = {Ulrich Faigle and
Alan J. Hoffman and
Walter Kern},
title = {A Characterization of Nonnegative Box-Greedy Matrices},
journal = {{SIAM} J. Discret. Math.},
volume = {9},
number = {1},
pages = {1--6},
year = {1996},
url = {https://doi.org/10.1137/0409001},
doi = {10.1137/0409001},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FaigleHK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FaigleGK95,
author = {Ulrich Faigle and
Noud Gademann and
Walter Kern},
title = {A Random Polynomial Time Algorithm for Well-rounding Convex Bodies},
journal = {Discret. Appl. Math.},
volume = {58},
number = {2},
pages = {117--144},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(93)E0123-G},
doi = {10.1016/0166-218X(93)E0123-G},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FaigleGK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ErdosFK95,
author = {P{\'{e}}ter L. Erd{\"{o}}s and
Ulrich Faigle and
Walter Kern},
title = {On the average rank of LYM-sets},
journal = {Discret. Math.},
volume = {144},
number = {1-3},
pages = {11--22},
year = {1995},
url = {https://doi.org/10.1016/0012-365X(94)00282-N},
doi = {10.1016/0012-365X(94)00282-N},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ErdosFK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR95-007,
author = {Ulrich Faigle and
S{\'{a}}ndor P. Fekete and
Winfried Hochst{\"{a}}ttler and
Walter Kern},
title = {The Nucleon of Cooperative Games and an Algorithm for Matching Games},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR95-007}},
year = {1995},
url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-007/index.html},
eprinttype = {ECCC},
eprint = {TR95-007},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR95-012,
author = {Ulrich Faigle and
S{\'{a}}ndor P. Fekete and
Winfried Hochst{\"{a}}ttler and
Walter Kern},
title = {On the Complexity of Testing Membership in the Core of min-Cost Spanning
Tree Games},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR95-012}},
year = {1995},
url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-012/index.html},
eprinttype = {ECCC},
eprint = {TR95-012},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR95-014,
author = {Ulrich Faigle and
Walter Kern and
Martin Streng},
title = {Note On the Computational Complexity of j-Radii of Polytopes in R\({}^{\mbox{n}}\)},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR95-014}},
year = {1995},
url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-014/index.html},
eprinttype = {ECCC},
eprint = {TR95-014},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR95-016,
author = {Ulrich Faigle and
S{\'{a}}ndor P. Fekete and
Winfried Hochst{\"{a}}ttler and
Walter Kern},
title = {On Approximately Fair Cost Allocation in Euclidean {TSP} Games},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR95-016}},
year = {1995},
url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-016/index.html},
eprinttype = {ECCC},
eprint = {TR95-016},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/FaigleK94,
author = {Ulrich Faigle and
Walter Kern},
title = {Computational Complexity of Some Maximum Average Weight Problems with
Precedence Constraints},
journal = {Oper. Res.},
volume = {42},
number = {4},
pages = {688--693},
year = {1994},
url = {https://doi.org/10.1287/opre.42.4.688},
doi = {10.1287/OPRE.42.4.688},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/FaigleK94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Kern93,
author = {Walter Kern},
title = {On the Depth of Combinatorial Optimization Problems},
journal = {Discret. Appl. Math.},
volume = {43},
number = {2},
pages = {115--129},
year = {1993},
url = {https://doi.org/10.1016/0166-218X(93)90003-7},
doi = {10.1016/0166-218X(93)90003-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Kern93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/FaigleK93,
author = {Ulrich Faigle and
Walter Kern},
title = {On some approximately balanced combinatorial cooperative games},
journal = {{ZOR} Methods Model. Oper. Res.},
volume = {38},
number = {2},
pages = {141--152},
year = {1993},
url = {https://doi.org/10.1007/BF01414210},
doi = {10.1007/BF01414210},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/FaigleK93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/ErdosFK92,
author = {P{\'{e}}ter L. Erd{\"{o}}s and
Ulrich Faigle and
Walter Kern},
title = {A Group-Theoretic Setting for Some Intersecting Sperner Families},
journal = {Comb. Probab. Comput.},
volume = {1},
pages = {323--334},
year = {1992},
url = {https://doi.org/10.1017/S0963548300000377},
doi = {10.1017/S0963548300000377},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/ErdosFK92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/FaigleK92,
author = {Ulrich Faigle and
Walter Kern},
title = {Some Convergence Results for Probabilistic Tabu Search},
journal = {{INFORMS} J. Comput.},
volume = {4},
number = {1},
pages = {32--37},
year = {1992},
url = {https://doi.org/10.1287/ijoc.4.1.32},
doi = {10.1287/IJOC.4.1.32},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/FaigleK92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kern92,
author = {Walter Kern},
title = {Learning Convex Bodies under Uniform Distribution},
journal = {Inf. Process. Lett.},
volume = {43},
number = {1},
pages = {35--39},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90026-R},
doi = {10.1016/0020-0190(92)90026-R},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Kern92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nn/Shawe-TaylorAK92,
author = {John Shawe{-}Taylor and
Martin Anthony and
Walter Kern},
title = {Classes of feedforward neural networks and their circuit complexity},
journal = {Neural Networks},
volume = {5},
number = {6},
pages = {971--977},
year = {1992},
url = {https://doi.org/10.1016/S0893-6080(05)80093-0},
doi = {10.1016/S0893-6080(05)80093-0},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/nn/Shawe-TaylorAK92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/FaigleK91,
author = {Ulrich Faigle and
Walter Kern},
title = {Some Order Dimension Bounds for Communication Complexity Problems},
journal = {Acta Informatica},
volume = {28},
number = {6},
pages = {593--601},
year = {1991},
url = {https://doi.org/10.1007/BF01463947},
doi = {10.1007/BF01463947},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/FaigleK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamrev/Kern91,
author = {Walter Kern},
title = {Simulated Annealing and Boltzmann Machines: {A} Stochastic Approach
to Combinatorial Optimization and Neural Computing (Emile Aarts and
Jan Korst)},
journal = {{SIAM} Rev.},
volume = {33},
number = {2},
pages = {323},
year = {1991},
url = {https://doi.org/10.1137/1033080},
doi = {10.1137/1033080},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamrev/Kern91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/KernW90,
author = {Walter Kern and
Alfred Wanka},
title = {On a Problem About Covering Lines by Squares},
journal = {Discret. Comput. Geom.},
volume = {5},
pages = {77--82},
year = {1990},
url = {https://doi.org/10.1007/BF02187780},
doi = {10.1007/BF02187780},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/KernW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/AlfterKW90,
author = {Marion Alfter and
Walter Kern and
Alfred Wanka},
title = {On adjoints and dual matroids},
journal = {J. Comb. Theory, Ser. {B}},
volume = {50},
number = {2},
pages = {208--213},
year = {1990},
url = {https://doi.org/10.1016/0095-8956(90)90075-B},
doi = {10.1016/0095-8956(90)90075-B},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/AlfterKW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/HohmannK90,
author = {Christoph Hohmann and
Walter Kern},
title = {Optimization and optimality test for the Max-Cut Problem},
journal = {{ZOR} Methods Model. Oper. Res.},
volume = {34},
number = {3},
pages = {195--206},
year = {1990},
url = {https://doi.org/10.1007/BF01415982},
doi = {10.1007/BF01415982},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/HohmannK90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/actaC/FaigleKT89,
author = {Ulrich Faigle and
Walter Kern and
Gy{\"{o}}rgy Tur{\'{a}}n},
title = {On the performance of on-line algorithms for partition problems},
journal = {Acta Cybern.},
volume = {9},
number = {2},
pages = {107--119},
year = {1989},
url = {https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3359},
timestamp = {Wed, 16 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/actaC/FaigleKT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/HochstattlerK89,
author = {Winfried Hochst{\"{a}}ttler and
Walter Kern},
title = {Matroid matching in pseudomodular lattices},
journal = {Comb.},
volume = {9},
number = {2},
pages = {145--152},
year = {1989},
url = {https://doi.org/10.1007/BF02124676},
doi = {10.1007/BF02124676},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/HochstattlerK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Kern89,
author = {Walter Kern},
title = {On the Rate of Convergence of Some Stochastic Processes},
journal = {Math. Oper. Res.},
volume = {14},
number = {2},
pages = {275--280},
year = {1989},
url = {https://doi.org/10.1287/moor.14.2.275},
doi = {10.1287/MOOR.14.2.275},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/Kern89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Kern89,
author = {Walter Kern},
title = {A probabilistic analysis of the switching algorithm for the euclidean
{TSP}},
journal = {Math. Program.},
volume = {44},
number = {1-3},
pages = {213--219},
year = {1989},
url = {https://doi.org/10.1007/BF01587089},
doi = {10.1007/BF01587089},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Kern89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BachemK88,
author = {Achim Bachem and
Walter Kern},
title = {On sticky matroids},
journal = {Discret. Math.},
volume = {69},
number = {1},
pages = {11--18},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90173-2},
doi = {10.1016/0012-365X(88)90173-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BachemK88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Kern88,
author = {Walter Kern},
title = {On finite locally projective planar spaces},
journal = {J. Comb. Theory, Ser. {A}},
volume = {48},
number = {2},
pages = {247--254},
year = {1988},
url = {https://doi.org/10.1016/0097-3165(88)90011-8},
doi = {10.1016/0097-3165(88)90011-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Kern88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BachemK86,
author = {Achim Bachem and
Walter Kern},
title = {Adjoints of oriented matroids},
journal = {Comb.},
volume = {6},
number = {4},
pages = {299--308},
year = {1986},
url = {https://doi.org/10.1007/BF02579255},
doi = {10.1007/BF02579255},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BachemK86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/Kern86,
author = {Walter Kern},
title = {An efficient algorithm for solving a special class of LP's},
journal = {Computing},
volume = {37},
number = {3},
pages = {219--226},
year = {1986},
url = {https://doi.org/10.1007/BF02252513},
doi = {10.1007/BF02252513},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/Kern86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BachemK86,
author = {Achim Bachem and
Walter Kern},
title = {Extension Equivalence of Oriented Matroids},
journal = {Eur. J. Comb.},
volume = {7},
number = {3},
pages = {193--197},
year = {1986},
url = {https://doi.org/10.1016/S0195-6698(86)80020-8},
doi = {10.1016/S0195-6698(86)80020-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/BachemK86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/KeklikoglouWK78,
author = {J. Keklikoglou and
Hermann K.{-}G. Walter and
Walter Kern},
title = {The behaviour of parsing time under grammar morphisms},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {12},
number = {2},
pages = {83--97},
year = {1978},
url = {https://doi.org/10.1051/ita/1978120200831},
doi = {10.1051/ITA/1978120200831},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/KeklikoglouWK78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/Kern77,
author = {Walter Kern},
title = {Speicheroptimale Formel{\"{u}}bersetzung},
journal = {Acta Informatica},
volume = {7},
pages = {269--287},
year = {1977},
url = {https://doi.org/10.1007/BF00290337},
doi = {10.1007/BF00290337},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/Kern77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/FalkenhausenADR66,
author = {Hasso von Falkenhausen and
Hans Peter Amann and
K. Dietz and
H. R{\"{u}}st and
P. Roos and
Walter Kern and
D. Schneider and
K. Neumann and
G. Dahmen},
title = {Buchbesprechungen},
journal = {Unternehmensforschung},
volume = {10},
number = {1},
pages = {58--64},
year = {1966},
url = {https://doi.org/10.1007/BF01918285},
doi = {10.1007/BF01918285},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/FalkenhausenADR66.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/Kern65,
author = {Walter Kern},
title = {Buchbesprechung},
journal = {Unternehmensforschung},
volume = {9},
number = {1},
pages = {55--56},
year = {1965},
url = {https://doi.org/10.1007/BF01976182},
doi = {10.1007/BF01976182},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/Kern65.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 2024-04-25 05:48 CEST 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:
