default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTobias Brunsch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c9]Tobias Brunsch, Michael Etscheid, Heiko Röglin
:
Bounds for the Convergence Time of Local Search in Scheduling Problems. WINE 2016: 339-353- 2015
- [j6]Tobias Brunsch, Heiko Röglin:
Improved Smoothed Analysis of Multiobjective Optimization. J. ACM 62(1): 4:1-4:58 (2015) - [j5]Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin, Clemens Rösner:
Smoothed Analysis of the Successive Shortest Path Algorithm. SIAM J. Comput. 44(6): 1798-1819 (2015) - [c8]Tobias Brunsch, Anna Großwendt, Heiko Röglin:
Solving Totally Unimodular LPs with the Shadow Vertex Algorithm. STACS 2015: 171-183 - [i8]Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin, Clemens Rösner:
Smoothed Analysis of the Successive Shortest Path Algorithm. CoRR abs/1501.05493 (2015) - 2014
- [b1]Tobias Brunsch:
Smoothed Analysis of Selected Optimization Problems and Algorithms. University of Bonn, 2014 - [j4]Tobias Brunsch, Heiko Röglin, Cyriel Rutten, Tjark Vredeveld:
Smoothed performance guarantees for local search. Math. Program. 146(1-2): 185-218 (2014) - [j3]Tobias Brunsch, Navin Goyal, Luis Rademacher, Heiko Röglin:
Lower Bounds for the Average and Smoothed Number of Pareto-Optima. Theory Comput. 10: 237-256 (2014) - [i7]Tobias Brunsch, Anna Großwendt, Heiko Röglin:
Solving Totally Unimodular LPs with the Shadow Vertex Algorithm. CoRR abs/1412.5381 (2014) - 2013
- [j2]Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin:
Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching. J. Graph Algorithms Appl. 17(6): 647-670 (2013) - [j1]Tobias Brunsch, Heiko Röglin:
A bad instance for k-means++. Theor. Comput. Sci. 505: 19-26 (2013) - [c7]Tobias Brunsch, Heiko Röglin:
Finding Short Paths on Polytopes by the Shadow Vertex Algorithm. ICALP (1) 2013: 279-290 - [c6]Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin:
Smoothed Analysis of the Successive Shortest Path Algorithm. SODA 2013: 1180-1189 - [c5]Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin:
Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching. WALCOM 2013: 182-193 - [i6]Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin:
Smoothed analysis of the successive shortest path algorithm. CTW 2013: 27-30 - [i5]Tobias Brunsch, Heiko Röglin:
Finding Short Paths on Polytopes by the Shadow Vertex Algorithm. CoRR abs/1304.7235 (2013) - 2012
- [c4]Tobias Brunsch, Heiko Röglin:
Improved smoothed analysis of multiobjective optimization. STOC 2012: 407-426 - [i4]Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin:
Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching. CoRR abs/1211.3299 (2012) - 2011
- [c3]Tobias Brunsch, Heiko Röglin, Cyriel Rutten, Tjark Vredeveld:
Smoothed Performance Guarantees for Local Search. ESA 2011: 772-783 - [c2]Tobias Brunsch, Heiko Röglin:
A Bad Instance for k-Means++. TAMC 2011: 344-352 - [c1]Tobias Brunsch, Heiko Röglin:
Lower Bounds for the Smoothed Number of Pareto Optimal Solutions. TAMC 2011: 416-427 - [i3]Tobias Brunsch, Heiko Röglin, Cyriel Rutten, Tjark Vredeveld:
Smoothed Performance Guarantees for Local Search. CoRR abs/1105.2686 (2011) - [i2]Tobias Brunsch, Heiko Röglin:
Improved Smoothed Analysis of Multiobjective Optimization. CoRR abs/1111.1546 (2011) - 2010
- [i1]Tobias Brunsch, Heiko Röglin:
Lower Bounds for the Smoothed Number of Pareto optimal Solutions. CoRR abs/1012.1163 (2010)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:55 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:
