BibTeX records: Tobias Brunsch

download as .bib file

@inproceedings{DBLP:conf/wine/BrunschER16,
  author       = {Tobias Brunsch and
                  Michael Etscheid and
                  Heiko R{\"{o}}glin},
  editor       = {Yang Cai and
                  Adrian Vetta},
  title        = {Bounds for the Convergence Time of Local Search in Scheduling Problems},
  booktitle    = {Web and Internet Economics - 12th International Conference, {WINE}
                  2016, Montreal, Canada, December 11-14, 2016, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10123},
  pages        = {339--353},
  publisher    = {Springer},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-3-662-54110-4\_24},
  doi          = {10.1007/978-3-662-54110-4\_24},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wine/BrunschER16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BrunschR15,
  author       = {Tobias Brunsch and
                  Heiko R{\"{o}}glin},
  title        = {Improved Smoothed Analysis of Multiobjective Optimization},
  journal      = {J. {ACM}},
  volume       = {62},
  number       = {1},
  pages        = {4:1--4:58},
  year         = {2015},
  url          = {https://doi.org/10.1145/2699445},
  doi          = {10.1145/2699445},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/BrunschR15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BrunschCMRR15,
  author       = {Tobias Brunsch and
                  Kamiel Cornelissen and
                  Bodo Manthey and
                  Heiko R{\"{o}}glin and
                  Clemens R{\"{o}}sner},
  title        = {Smoothed Analysis of the Successive Shortest Path Algorithm},
  journal      = {{SIAM} J. Comput.},
  volume       = {44},
  number       = {6},
  pages        = {1798--1819},
  year         = {2015},
  url          = {https://doi.org/10.1137/140989893},
  doi          = {10.1137/140989893},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BrunschCMRR15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BrunschGR15,
  author       = {Tobias Brunsch and
                  Anna Gro{\ss}wendt and
                  Heiko R{\"{o}}glin},
  editor       = {Ernst W. Mayr and
                  Nicolas Ollinger},
  title        = {Solving Totally Unimodular LPs with the Shadow Vertex Algorithm},
  booktitle    = {32nd International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2015, March 4-7, 2015, Garching, Germany},
  series       = {LIPIcs},
  volume       = {30},
  pages        = {171--183},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2015},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2015.171},
  doi          = {10.4230/LIPICS.STACS.2015.171},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BrunschGR15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BrunschCMRR15,
  author       = {Tobias Brunsch and
                  Kamiel Cornelissen and
                  Bodo Manthey and
                  Heiko R{\"{o}}glin and
                  Clemens R{\"{o}}sner},
  title        = {Smoothed Analysis of the Successive Shortest Path Algorithm},
  journal      = {CoRR},
  volume       = {abs/1501.05493},
  year         = {2015},
  url          = {http://arxiv.org/abs/1501.05493},
  eprinttype    = {arXiv},
  eprint       = {1501.05493},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BrunschCMRR15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/dnb/Brunsch14,
  author       = {Tobias Brunsch},
  title        = {Smoothed Analysis of Selected Optimization Problems and Algorithms},
  school       = {University of Bonn},
  year         = {2014},
  url          = {http://hss.ulb.uni-bonn.de/2014/3543/3543.htm},
  urn          = {urn:nbn:de:hbz:5n-35439},
  timestamp    = {Sat, 17 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/dnb/Brunsch14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BrunschRRV14,
  author       = {Tobias Brunsch and
                  Heiko R{\"{o}}glin and
                  Cyriel Rutten and
                  Tjark Vredeveld},
  title        = {Smoothed performance guarantees for local search},
  journal      = {Math. Program.},
  volume       = {146},
  number       = {1-2},
  pages        = {185--218},
  year         = {2014},
  url          = {https://doi.org/10.1007/s10107-013-0683-7},
  doi          = {10.1007/S10107-013-0683-7},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/BrunschRRV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/BrunschGRR14,
  author       = {Tobias Brunsch and
                  Navin Goyal and
                  Luis Rademacher and
                  Heiko R{\"{o}}glin},
  title        = {Lower Bounds for the Average and Smoothed Number of Pareto-Optima},
  journal      = {Theory Comput.},
  volume       = {10},
  pages        = {237--256},
  year         = {2014},
  url          = {https://doi.org/10.4086/toc.2014.v010a010},
  doi          = {10.4086/TOC.2014.V010A010},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/BrunschGRR14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BrunschGR14,
  author       = {Tobias Brunsch and
                  Anna Gro{\ss}wendt and
                  Heiko R{\"{o}}glin},
  title        = {Solving Totally Unimodular LPs with the Shadow Vertex Algorithm},
  journal      = {CoRR},
  volume       = {abs/1412.5381},
  year         = {2014},
  url          = {http://arxiv.org/abs/1412.5381},
  eprinttype    = {arXiv},
  eprint       = {1412.5381},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BrunschGR14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BrunschCMR13,
  author       = {Tobias Brunsch and
                  Kamiel Cornelissen and
                  Bodo Manthey and
                  Heiko R{\"{o}}glin},
  title        = {Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and
                  Matching},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {17},
  number       = {6},
  pages        = {647--670},
  year         = {2013},
  url          = {https://doi.org/10.7155/jgaa.00310},
  doi          = {10.7155/JGAA.00310},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgaa/BrunschCMR13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BrunschR13,
  author       = {Tobias Brunsch and
                  Heiko R{\"{o}}glin},
  title        = {A bad instance for k-means++},
  journal      = {Theor. Comput. Sci.},
  volume       = {505},
  pages        = {19--26},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2012.02.028},
  doi          = {10.1016/J.TCS.2012.02.028},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BrunschR13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BrunschR13,
  author       = {Tobias Brunsch and
                  Heiko R{\"{o}}glin},
  editor       = {Fedor V. Fomin and
                  Rusins Freivalds and
                  Marta Z. Kwiatkowska and
                  David Peleg},
  title        = {Finding Short Paths on Polytopes by the Shadow Vertex Algorithm},
  booktitle    = {Automata, Languages, and Programming - 40th International Colloquium,
                  {ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {7965},
  pages        = {279--290},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-39206-1\_24},
  doi          = {10.1007/978-3-642-39206-1\_24},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/BrunschR13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BrunschCMR13,
  author       = {Tobias Brunsch and
                  Kamiel Cornelissen and
                  Bodo Manthey and
                  Heiko R{\"{o}}glin},
  editor       = {Sanjeev Khanna},
  title        = {Smoothed Analysis of the Successive Shortest Path Algorithm},
  booktitle    = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
                  2013},
  pages        = {1180--1189},
  publisher    = {{SIAM}},
  year         = {2013},
  url          = {https://doi.org/10.1137/1.9781611973105.85},
  doi          = {10.1137/1.9781611973105.85},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/BrunschCMR13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/BrunschCMR13,
  author       = {Tobias Brunsch and
                  Kamiel Cornelissen and
                  Bodo Manthey and
                  Heiko R{\"{o}}glin},
  editor       = {Subir Kumar Ghosh and
                  Takeshi Tokuyama},
  title        = {Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and
                  Matching},
  booktitle    = {{WALCOM:} Algorithms and Computation, 7th International Workshop,
                  {WALCOM} 2013, Kharagpur, India, February 14-16, 2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7748},
  pages        = {182--193},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-36065-7\_18},
  doi          = {10.1007/978-3-642-36065-7\_18},
  timestamp    = {Sat, 30 Sep 2023 09:58:46 +0200},
  biburl       = {https://dblp.org/rec/conf/walcom/BrunschCMR13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/BrunschCMR13,
  author       = {Tobias Brunsch and
                  Kamiel Cornelissen and
                  Bodo Manthey and
                  Heiko R{\"{o}}glin},
  editor       = {Kamiel Cornelissen and
                  Ruben Hoeksma and
                  Johann L. Hurink and
                  Bodo Manthey},
  title        = {Smoothed analysis of the successive shortest path algorithm},
  booktitle    = {12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
                  Enschede, Netherlands, May 21-23, 2013},
  series       = {{CTIT} Workshop Proceedings},
  volume       = {{WP} 13-01},
  pages        = {27--30},
  year         = {2013},
  timestamp    = {Mon, 06 Apr 2020 17:04:26 +0200},
  biburl       = {https://dblp.org/rec/conf/colognetwente/BrunschCMR13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-7235,
  author       = {Tobias Brunsch and
                  Heiko R{\"{o}}glin},
  title        = {Finding Short Paths on Polytopes by the Shadow Vertex Algorithm},
  journal      = {CoRR},
  volume       = {abs/1304.7235},
  year         = {2013},
  url          = {http://arxiv.org/abs/1304.7235},
  eprinttype    = {arXiv},
  eprint       = {1304.7235},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1304-7235.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BrunschR12,
  author       = {Tobias Brunsch and
                  Heiko R{\"{o}}glin},
  editor       = {Howard J. Karloff and
                  Toniann Pitassi},
  title        = {Improved smoothed analysis of multiobjective optimization},
  booktitle    = {Proceedings of the 44th Symposium on Theory of Computing Conference,
                  {STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
  pages        = {407--426},
  publisher    = {{ACM}},
  year         = {2012},
  url          = {https://doi.org/10.1145/2213977.2214016},
  doi          = {10.1145/2213977.2214016},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/BrunschR12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-3299,
  author       = {Tobias Brunsch and
                  Kamiel Cornelissen and
                  Bodo Manthey and
                  Heiko R{\"{o}}glin},
  title        = {Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and
                  Matching},
  journal      = {CoRR},
  volume       = {abs/1211.3299},
  year         = {2012},
  url          = {http://arxiv.org/abs/1211.3299},
  eprinttype    = {arXiv},
  eprint       = {1211.3299},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1211-3299.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BrunschRRV11,
  author       = {Tobias Brunsch and
                  Heiko R{\"{o}}glin and
                  Cyriel Rutten and
                  Tjark Vredeveld},
  editor       = {Camil Demetrescu and
                  Magn{\'{u}}s M. Halld{\'{o}}rsson},
  title        = {Smoothed Performance Guarantees for Local Search},
  booktitle    = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken,
                  Germany, September 5-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6942},
  pages        = {772--783},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23719-5\_65},
  doi          = {10.1007/978-3-642-23719-5\_65},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/BrunschRRV11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/BrunschR11,
  author       = {Tobias Brunsch and
                  Heiko R{\"{o}}glin},
  editor       = {Mitsunori Ogihara and
                  Jun Tarui},
  title        = {A Bad Instance for k-Means++},
  booktitle    = {Theory and Applications of Models of Computation - 8th Annual Conference,
                  {TAMC} 2011, Tokyo, Japan, May 23-25, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6648},
  pages        = {344--352},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-20877-5\_34},
  doi          = {10.1007/978-3-642-20877-5\_34},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/tamc/BrunschR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/BrunschR11a,
  author       = {Tobias Brunsch and
                  Heiko R{\"{o}}glin},
  editor       = {Mitsunori Ogihara and
                  Jun Tarui},
  title        = {Lower Bounds for the Smoothed Number of Pareto Optimal Solutions},
  booktitle    = {Theory and Applications of Models of Computation - 8th Annual Conference,
                  {TAMC} 2011, Tokyo, Japan, May 23-25, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6648},
  pages        = {416--427},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-20877-5\_41},
  doi          = {10.1007/978-3-642-20877-5\_41},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/tamc/BrunschR11a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-2686,
  author       = {Tobias Brunsch and
                  Heiko R{\"{o}}glin and
                  Cyriel Rutten and
                  Tjark Vredeveld},
  title        = {Smoothed Performance Guarantees for Local Search},
  journal      = {CoRR},
  volume       = {abs/1105.2686},
  year         = {2011},
  url          = {http://arxiv.org/abs/1105.2686},
  eprinttype    = {arXiv},
  eprint       = {1105.2686},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1105-2686.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-1546,
  author       = {Tobias Brunsch and
                  Heiko R{\"{o}}glin},
  title        = {Improved Smoothed Analysis of Multiobjective Optimization},
  journal      = {CoRR},
  volume       = {abs/1111.1546},
  year         = {2011},
  url          = {http://arxiv.org/abs/1111.1546},
  eprinttype    = {arXiv},
  eprint       = {1111.1546},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1111-1546.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1012-1163,
  author       = {Tobias Brunsch and
                  Heiko R{\"{o}}glin},
  title        = {Lower Bounds for the Smoothed Number of Pareto optimal Solutions},
  journal      = {CoRR},
  volume       = {abs/1012.1163},
  year         = {2010},
  url          = {http://arxiv.org/abs/1012.1163},
  eprinttype    = {arXiv},
  eprint       = {1012.1163},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1012-1163.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics