default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Heiko Röglin
University of Bonn, Institute of Computer Science
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 119 matches
- 2024
- Lukas Drexler, Jan Eube, Kelin Luo, Dorian Reineccius, Heiko Röglin, Melanie Schmidt, Julian Wargalla:
Connected k-Center and k-Diameter Clustering. Algorithmica 86(11): 3425-3464 (2024) - Anna Arutyunova, Anna Großwendt, Heiko Röglin, Melanie Schmidt, Julian Wargalla:
Upper and lower bounds for complete linkage in general metric spaces. Mach. Learn. 113(1): 489-518 (2024) - Frederik Brüning, Anne Driemel, Alperen Ergür, Heiko Röglin:
On the number of iterations of the DBA algorithm. SDM 2024: 172-180 - Frederik Brüning, Anne Driemel, Alperen Ergür, Heiko Röglin:
On the number of iterations of the DBA algorithm. CoRR abs/2401.05841 (2024) - 2023
- René Beier, Heiko Röglin, Clemens Rösner, Berthold Vöcking:
The smoothed number of Pareto-optimal solutions in bicriteria integer optimization. Math. Program. 200(1): 319-355 (2023) - Lukas Drexler, Jan Eube, Kelin Luo, Heiko Röglin, Melanie Schmidt, Julian Wargalla:
Connected k-Center and k-Diameter Clustering. ICALP 2023: 50:1-50:20 - Matthias Englert, Heiko Röglin, Berthold Vöcking:
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP. CoRR abs/2302.06889 (2023) - 2022
- Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, Heiko Röglin:
Minimum-error triangulations for sea surface reconstruction. J. Comput. Geom. 14(2): 108-171 (2022) - Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, Heiko Röglin:
Minimum-Error Triangulations for Sea Surface Reconstruction. SoCG 2022: 7:1-7:18 - Anna Arutyunova, Heiko Röglin:
The Price of Hierarchical Clustering. ESA 2022: 10:1-10:14 - Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman J. Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, Heiko Röglin:
Minimum-Error Triangulations for Sea Surface Reconstruction. CoRR abs/2203.07325 (2022) - Anna Arutyunova, Heiko Röglin:
The Price of Hierarchical Clustering. CoRR abs/2205.01417 (2022) - Lukas Drexler, Jan Eube, Kelin Luo, Heiko Röglin, Melanie Schmidt, Julian Wargalla:
Connected k-Center and k-Diameter Clustering. CoRR abs/2211.02176 (2022) - 2021
- Anna Arutyunova, Anna Großwendt, Heiko Röglin, Melanie Schmidt, Julian Wargalla:
Upper and Lower Bounds for Complete Linkage in General Metric Spaces. APPROX-RANDOM 2021: 18:1-18:22 - Peter Rottmann, Anne Driemel, Herman J. Haverkort, Heiko Röglin, Jan-Henrik Haunert:
Bicriteria Aggregation of Polygons via Graph Cuts. GIScience (II) 2021: 6:1-6:16 - 2020
- Britta Peis, Oliver Schaudt, Heiko Röglin, Bert Randerath, Rainer Schrader, Frank Vallentin:
Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017). Discret. Appl. Math. 272: 1 (2020) - Anup Bhattacharya, Jan Eube, Heiko Röglin, Melanie Schmidt:
Noisy, Greedy and Not so Greedy k-Means++. ESA 2020: 18:1-18:21 - Heiko Röglin:
Smoothed Analysis of Pareto Curves in Multiobjective Optimization. Beyond the Worst-Case Analysis of Algorithms 2020: 334-358 - Heiko Röglin:
Smoothed Analysis of Pareto Curves in Multiobjective Optimization. CoRR abs/2010.11064 (2020) - 2019
- Anna Großwendt, Heiko Röglin, Melanie Schmidt:
Analysis of Ward's Method. SODA 2019: 2939-2957 - Anna Großwendt, Heiko Röglin, Melanie Schmidt:
Analysis of Ward's Method. CoRR abs/1907.05094 (2019) - Anup Bhattacharya, Jan Eube, Heiko Röglin, Melanie Schmidt:
Noisy, Greedy and Not So Greedy k-means++. CoRR abs/1912.00653 (2019) - 2018
- Matthias Mnich, Heiko Röglin, Clemens Rösner:
New deterministic algorithms for solving parity games. Discret. Optim. 30: 73-95 (2018) - Alantha Newman, Heiko Röglin, Johanna Seif:
The Alternating Stock Size Problem and the Gasoline Puzzle. ACM Trans. Algorithms 14(2): 19:1-19:23 (2018) - Carsten Fischer, Heiko Röglin:
Probabilistic Analysis of Online (Class-Constrained) Bin Packing and Bin Covering. LATIN 2018: 461-474 - 2017
- Anna Großwendt, Heiko Röglin:
Improved Analysis of Complete-Linkage Clustering. Algorithmica 78(4): 1131-1150 (2017) - Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin:
Polynomial kernels for weighted problems. J. Comput. Syst. Sci. 84: 1-10 (2017) - Michael Etscheid, Heiko Röglin:
Smoothed Analysis of Local Search for the Maximum-Cut Problem. ACM Trans. Algorithms 13(2): 25:1-25:12 (2017) - Heiko Röglin, Clemens Rösner:
The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization. TAMC 2017: 543-555 - Bodo Manthey, Claire Mathieu, Heiko Röglin, Eli Upfal:
Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141). Dagstuhl Reports 7(4): 1-22 (2017)
skipping 89 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2025-01-21 09:17 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint