https://nerva.informatik.uni-bonn.de/ 2026-04-06T00:57:26+00:00 https://nerva.informatik.uni-bonn.de/ https://nerva.informatik.uni-bonn.de/lib/exe/fetch.php/wiki/dokuwiki.svg text/html 2021-09-24T07:32:54+00:00 Anonymous (anonymous@undisclosed.example.com) https://nerva.informatik.uni-bonn.de/doku.php/research/beyondworstcase?rev=1632468774&do=diff Beyond the Worst-Case Analysis of Algorithms The complexity of many optimization problems and algorithms seems well understood. However, often theoretical results contradict observations made in experiments and practice. Some NP-hard optimization problems can be solved efficiently in practice and for many problems algorithms with exponential worst-case running time outperform polynomial-time algorithms. The reason for this discrepancy is the pessimistic worst-case perspective, in which the perf… text/html 2023-11-30T15:47:40+00:00 Anonymous (anonymous@undisclosed.example.com) https://nerva.informatik.uni-bonn.de/doku.php/research/clusteringcurves?rev=1701359260&do=diff Algorithms and Data Structures for Geometric Objects The Fréchet distance mathematically formalizes a notion of similarity or distance for curves. It is similar to the well-known Hausdorff distance for sets, but it in contrast to the Hausdorff distance, it takes the ordering of the points along the curves into account. One can intuitively define the distance measure as follows. Imagine walking forwards along the two curves simultaneously with varying speeds. The maximum distance between the two… text/html 2021-05-21T12:40:26+00:00 Anonymous (anonymous@undisclosed.example.com) https://nerva.informatik.uni-bonn.de/doku.php/research/geometricchallenge?rev=1621600826&do=diff Surveillance Route Problems Traditional optimal watchman or exploration routes consider the problem of computing the shortest path that sees or visits all objects of a given environment along a shortest roundtrip. For a surveillance approach it is more important that the time period where a certain object is not under vision or control has to be short. Thus, we are searching for example for consecutive round trips such that among all important objects the maximal time period where the object i… text/html 2021-09-29T11:11:10+00:00 Anonymous (anonymous@undisclosed.example.com) https://nerva.informatik.uni-bonn.de/doku.php/research/hierarchicalclustering?rev=1632913870&do=diff Hierarchical Clustering Nowadays extracting information out of collected data is an important task in research and economy. Cluster analysis describes one way to gain such information. The task is to find a partition of the data set into several clusters, while satisfying the natural property that similar data points are most likely contained in the same cluster. In order to evaluate how well this property is fulfilled one can choose from a variety of objectives, with k-center, k-median and k-… text/html 2021-03-05T09:30:42+00:00 Anonymous (anonymous@undisclosed.example.com) https://nerva.informatik.uni-bonn.de/doku.php/research/postedprices?rev=1614936642&do=diff Posting Prices under Uncertainty Most markets we participate in every day work via posted prices. Usually, items have prices and customers choose the (set of) items they like best. From the perspective of combinatorial optimization, allocating items is actually a complex problem. For example, if one wants to maximize social welfare, that is, overall happiness, solving only the allocation problem is already hard. A central question in our research is to what extent prices can yield an (approxima… text/html 2019-09-26T09:46:06+00:00 Anonymous (anonymous@undisclosed.example.com) https://nerva.informatik.uni-bonn.de/doku.php/research/researchseminar?rev=1569491166&do=diff Informal Algorithms Seminar Room: In the current semester, the seminar takes place in room 2.050! Date Name Topic 4.10.2019 11:00 Dennis Rohde (TU Dortmund) Random projections and sampling algorithms for clustering of high-dimensional polygonal curves text/html 2022-05-30T08:35:21+00:00 Anonymous (anonymous@undisclosed.example.com) https://nerva.informatik.uni-bonn.de/doku.php/research/rrcgws2022?rev=1653899721&do=diff Rhein-Ruhr Computational Geometry Workshop 2022 We are holding a workshop on current topics in computational geometry at the Institute of Computer Science of the University of Bonn. The aim of the workshop is to gather researchers in the Rhein-Ruhr area to discuss open problems and work together in small groups on these problems. The scientific organization of the workshop is done by Kevin Buchin (TU Dortmund), Maike Buchin (Ruhr Uni Bochum) and Anne Driemel (Uni Bonn). text/html 2023-11-30T16:39:58+00:00 Anonymous (anonymous@undisclosed.example.com) https://nerva.informatik.uni-bonn.de/doku.php/research/start?rev=1701362398&do=diff Research Here you can find some more information on our current research interests: * Beyond the Worst-Case Analysis of Algorithms * Posted Prices under Uncertainty * Algorithms and Data Structures for Geometric Objects * Hierarchical Clustering Funded Research Projects We are involved in the following funded research projects: * Lamarr-Institute , Institute for Machine Learning and Artificial Intelligence text/html 2021-05-21T06:16:07+00:00 Anonymous (anonymous@undisclosed.example.com) https://nerva.informatik.uni-bonn.de/doku.php/research/surveillance?rev=1621577767&do=diff There are some geometric questions or conjectures that have attracted a lot of attention but up to now there is no final answer. The overall aim is to consider interesting related problems that might lead to a general solution of the problems. Surveillance Route Problems text/html 2022-11-11T11:32:35+00:00 Anonymous (anonymous@undisclosed.example.com) https://nerva.informatik.uni-bonn.de/doku.php/research/theorietag2022?rev=1668166355&do=diff GI-Theorietag 2022 83rd Workshop on Algorithms and Complexity The 83rd Theorietag will take place in Bonn. This workshop is organized by the Algorithms and Complexity group of the University of Bonn and supported by the Gesellschaft für Informatik and the Hausdorff Center for Mathematics. The workshop has no formal proceedings. Ongoing work as well as published work can be presented. text/html 2016-12-07T16:06:06+00:00 Anonymous (anonymous@undisclosed.example.com) https://nerva.informatik.uni-bonn.de/doku.php/research/workshop2016?rev=1481126766&do=diff Combinatorial Optimization meets Parameterized Complexity December 13-14, 2016, University of Bonn We are happy to announce the workshop “Optimization meets Parameterized Complexity” on December 13-14, 2016. Invited speakers are * Fabrizio Grandoni (IDSIA, Lugano)