2024
[Publications] 2 Papers accepted at GD 2024 (20.07.2024)
At the conference 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024), taking place September 16 - 20, 2024, in Vienna, Austria, two articles from our research group have been accepted:
- On k-Plane Insertion into Plane Drawings von Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada & Ignaz Rutter
Proceedings Version: TBA
Arxiv Version: https://arxiv.org/abs/2402.14552 - Weakly Leveled Planarity with Bounded Span von Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter & Ioannis G. Tollis
Proceedings Version: TBA
Arxiv Version: https://arxiv.org/abs/2409.01889
[Publications] Article published in Algorithmica (18.03.2024)
The article Perfect Matchings with Crossings by Aichholzer, Ruy Fabila Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider & Birgit Vogtenhuber has been published in the journal Algorithmica in the Special Issue der IWOCA 2022.
Journal Version: https://doi.org/10.1007/s00453-023-01147-7
[Publications] Paper accepted at EuroCG 2024 (12.02.2024)
The article On k-Plane Insertion into Plane Drawings by Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada & Ignaz Rutter has been accepted at the conference 40th European Workshop on Computational Geometry (EuroCG 2024), which will take place März 13 - 15, 2024, in Ioannina, Greece.
Proceedings Version: https://eurocg2024.math.uoi.gr/data/uploads/paper_56.pdf
Arxiv Version: https://arxiv.org/abs/2402.14552
[Publications] Article published in Information Processing Letters (01.01.2024)
The article Recognizing well-dominated graphs is coNP-complete by Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann & Uéverton S. Souza has been published in the journal Information Processing Letters.
Journal Version: https://doi.org/10.1016/j.ipl.2023.106419
Arxiv Version: https://arxiv.org/abs/2208.08864
2023
[Publications] Paper accepted at LATIN 2024 (15.12.2023)
The article Geometric Thickness of Multigraphs is ∃ℝ-Complete byHenry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis & Birgit Vogtenhuber has been accepted at the conference 16th Latin American Symposium on Theoretical Informatics (LATIN 2024), which takes place March 18 - 22, 2024, in Puerto Varas, Chile.
Proceedings Version: https://doi.org/10.1007/978-3-031-55598-5_22
Arxiv Version: https://arxiv.org/abs/2312.05010
[Publications] Paper accepted at WALCOM 2024 (04.11.2023)
The article On Layered Area-Proportional Rectangle Contact Representations by Carolina Haase & Philipp Kindermann has been accepted at the conference 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024), which takes place on March 18 - 20, 2024, in Kanazawa, Japan.
Proceedings Version: https://doi.org/10.1007/978-981-97-0566-5_12
Arxiv Version: https://arxiv.org/abs/2311.15057
[Publications] Article published in Journal of Graph Algorithms and Applications (01.11.2023)
The article The Computational Complexity of the ChordLink Model by Philipp Kindermann, Jan Sauer & Alexander Wolff has been published in the Journal of Graph Algorithms and Applications.
Journal Version: https://doi.org/10.1016/j.comgeo.2021.101820
[Publications] Paper accepted at ISAAC 2023 (30.08.2023)
The article The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable by Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani & Kirill Simonov has been accepted at the 34th International Symposium on Algorithms and Computation (ISAAC 2023), which takes place on December 03 - 06, 2023, in Kyoto, Japan.
Proceedings Version: https://doi.org/10.4230/LIPIcs.ISAAC.2023.46
Arxiv Version: https://arxiv.org/abs/2309.15454
[Publications] 3 Papers accepted at GD 2023 (16.07.2023)
At the conference 31st International Symposium on Graph Drawing and Network Visualization (GD 2023), taking place September 18 - 22, 2023, in Isola delle Femmine (Palermo), Italy, three articles from our research group have been accepted:
- Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth von Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani & Kirill Simonov
Proceedings Version: https://doi.org/10.1007/978-3-031-49275-4_14
Arxiv Version: https://arxiv.org/abs/2309.01264 - Mutual Witness Proximity Drawings of Isomorphic Trees von Carolina Haase, Philipp Kindermann, William J. Lenhart & Giuseppe Liotta
Proceedings Version: https://doi.org/10.1007/978-3-031-49272-3_21
Arxiv Version: https://arxiv.org/abs/2309.01463 - Three Edge-Disjoint Plane Spanning Paths in a Point Set von Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta & Pavel Valtr
Proceedings Version: https://doi.org/10.1007/978-3-031-49272-3_22
Arxiv Version: https://arxiv.org/abs/2306.07237
[Publications] Special Issue on Parameterized and Approximation Algorithms in Graph Drawing edited (01.07.2023)
Giordano Da Lozzo & Philipp Kindermann have edited a special issue of the Journal of Graph Algorithms and Applications with the title Special Issue on Parameterized and Approximation Algorithms in Graph Drawing.
Special Issue: https://jgaa.info/index.php/jgaa/issue/view/issue27.6
[Publications] Article published in IEEE Computer Graphics and Applications (06.04.2023)
The article Splitting Vertices in 2-Layer Graph Drawings by Abu Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu & Markus Wallinger has been published in the journal IEEE Computer Graphics and Applications.
Journal Version: https://doi.org/10.1109/MCG.2023.3264244
Arxiv Version: https://arxiv.org/abs/2301.10872
[Announcement] Graph Drawing Contest 2023 (14.02.2023)
The 30th Annual Graph Drawing Contest shall be held in conjunction with the 31st International Symposium on Graph Drawing and Network Visualization (GD 2023). The contest has two parts: the Creative Topic and the Live Challenge. They are briefly described below - details on both contests can be found on the contest webpage:
http://www.graphdrawing.org/gdcontest/2023/
Creative Topic
The creative topic is provided a year in advance and focusses on free-form visualisation of a specific graph. Participants are invited to submit a creative drawing of this graph that evokes exploration and understanding the graph. The submissions will be judged by the contest committee. This year’s topic is Boardgame Recommendations.
Live Challenge
The live challenge will be held during the conference (exact date and time to be announced) in a format similar to a typical programming contest, where teams are presented with a collection of challenge graphs and have approximately one hour to submit their highest scoring drawings (either created manually, or automatically). This year the challenge will focus on minimizing crossings, when drawing a graph by assigning its vertices to a given set of locations.
Awards
Awards will be given to the top submissions in each of the contests.
Contest committee
Philipp Kindermann, Fabian Klute, Tamara Mchedlidze, Wouter Meulemans (chair), Debajyoti Mondal
2022
[Publications] Article published in Theoretical Computer Science (10.11.2022)
The article On mixed linear layouts of series-parallel graphs by Patrizio Angelini, Michael A. Bekos, Philipp Kindermann & Tamara Mchedlidze has been published in the journal Theoretical Computer Science.
Journal Version: https://doi.org/10.1016/j.tcs.2022.09.019
Arxiv Version: https://arxiv.org/abs/2008.10475
[Publications] 2 Papers accepted at SOFSEM 2023 (30.09.2022)
At the conference 48th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2022), taking place January 15 - 18, 2023, in Nový Smokovec, Slovakia, stattfinden wird, three articles from our research group have been accepted:
- The Complexity of Finding Tangles von Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff & Johannes Zink
Proceedings Version: https://doi.org/10.1007/978-3-031-23101-8_1
Arxiv Version: https://arxiv.org/abs/2312.16213 - Parameterized Approaches to Orthogonal Compaction von Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff & Meirav Zehavi
Proceedings Version: https://doi.org/10.1007/978-3-031-23101-8_8
Arxiv Version: https://arxiv.org/abs/2210.05019
[News] Best Presentation Award at GD 2022 (25.09.2022)
At the Conference Graph Drawing and Network Visualization (GD 2022), the talk Morphing Rectangular Duals by Philipp Kindermann was awarded with the Best Presentation Award. The presentation can be watched on YouTube (link in the picture).
[Announcement] Computational Geometry Challenge 2023 (31.08.2022)
We are happy to announce theFifth Computational Geometry Challenge, as part of CG Week in Dallas, TX, USA, June 12-15, 2023.
As in previous years, the objective will be to compute good solutions to instances of a difficult geometric optimization problem. The specific problem chosen for the 2023 Challenge is
Minimum Coverage by Convex Polygons.
Description
Given a geometric region, P, in the plane, which may be a simple polygon or a polygon with holes. The task is to cover P with a collection, C1,…, Ck, of convex polygons, each contained within P.
Objective
Minimize k, the number of convex polygons in the cover.
Motivation
Optimal coverage problems have an extensive history in Computational Geometry. In fact, the well-known SoCG logo shows that an optimal solution to the Minimum Cover by rectangles may include (rotated) rectangles whose vertices are not among those of the input polygon P, even in the case that P is an orthogonal simple polygon. It is also relevant in practical contexts, such as surveillance and robot navigation. The Minimum Cover by Convex Polygons problem is not only NP-hard, but was recently shown to be ∃R-complete, which most likely implies that it is not in the class NP.
Details of the competition (such as benchmark instances, data formats, and rules for submission and evaluation) will be announced in the coming weeks. Appropriate steps will be undertaken (e.g., by restricting the classes of feasible subsets) to ensure straightforward, automated verification of solutions.The contributors with the most outstanding solutions will be recognized at CG Week 2023 and invited to present their results, both at the event and in the proceedings.
We are looking forward to your contributions and welcome questions and comments!
Instances
A large number and variety of input polygonal regions P will be provided for the competition. These will be released at a later time. (See below.)
Credit: This problem was suggested by Dan Halperin, Tel Aviv University.
Challenge Team: Sándor Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra
Advisory Board: Bill Cook, Andreas Fabri, Dan Halperin, Michael Kerber, Philipp Kindermann, Joe Mitchell, Kevin Verbeek
Timeline
A first batch of test instances will be released in late September 2022; the actual benchmark instances for the Challenge will be released in October. The contest will close in early 2023.
- First test instances: September 30, 2022
- Contest instances: October 28, 2022
- Contest Closes: January 27, 2023
[News] New group member: Carolina Haase, MSc. (01.08.2022)
We have the pleasure of welcoming a new team member: Carolina Haase is starting her doctoral studies today. She wrote her master's thesis on the topic of "On Layered Area-Proportional Rectangle Contact Representations" under the supervision of Philipp Kindermann.
[Publications] 3 Papers accepted at GD 2022 (18.07.2022)
At the 30th International Symposium on Graph Drawing and Network Visualization (GD 2022), taking place on September 13 - 16, 2022, in Tokyo, three articles from our research group have been accepted:
- Outside-Obstacle Representations with All Vertices on the Outer Face von Oksana Firman, Philipp Kindermann, Jonathan Klawitter, Boris Klemz, Felix Klesen & Alexander Wolff
Proceedings Version: https://doi.org/10.1007/978-3-031-22203-0_31
Arxiv Version: https://arxiv.org/abs/2202.13015 - Morphing Rectangular Duals von Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff
Proceedings Version: https://doi.org/10.1007/978-3-031-22203-0_28
Arxiv Version: https://arxiv.org/abs/2112.03040 - The Rique-Number of Graphs von Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen G. Kobourov, Jan Kratochvíl, Ignaz Rutter
Proceedings Version: https://doi.org/10.1007/978-3-031-22203-0_27
Arxiv Version: https://doi.org/10.48550/arXiv.2209.00424
[Publications] Article published in Theoretical Computer Science (05.06.2022)
The article Simple algorithms for partial and simultaneous rectangular duals with given contact orientations by Steven Chaplick, Stefan Felsner, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter & Alexander Wolff has been published in the journalTheoretical Computer Science.
Journal Version: https://doi.org/10.1016/j.tcs.2022.03.031
Arxiv Version: https://arxiv.org/abs/2102.02013
[Publications] Paper accepted at IWOCA 2022 (04.04.2022)
The article Perfect Matchings with Crossings by Oswin Aichholzer, Ruy Fabila Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider & Birgit Vogtenhuber has been accepted at the 33rd International Workshop on Combinatorial Algorithms (IWOCA 2022), which will take place on June 7 - 9, 2022, in Trier.
Proceedings Version: https://doi.org/10.1007/978-3-031-06678-8_4
[Announcement] Graph Drawing Contest 2022 (17.03.2022)
The 30th International Symposium on Graph Drawing and Network Visualization will take (hopefully) place in Tokyo, Japan, from September 13 to 16, 2022. As has been tradition since 1994, the symposium will be accompanied by a Graph Drawing Contest, allowing all community members to demonstrate their graph drawing skills in a fun competitive setting. Due to the uncertainty regarding future travel and physical meeting restrictions caused by the Corona virus outbreak, the contest will be either held completely online or in a hybrid format. Details of the exact format of the contest will be announced around the Graph Drawing submission deadline. The contest has two parts: the Creative Topics and the Live Challenge.
1. Live Challenge
Following popular tradition, a live challenge will be held the day before the symposium in a format similar to a typical programming contest. Teams are presented with a collection of challenge graphs and have approximately one hour to submit their highest scoring drawings. This year, the challenge focuses on
minimizing the planar polyline edge-length ratio on a fixed grid.
Teams may either draw the graphs manually (manual category), or use their own customized tools (automatic category). Remote participation will be possible for both the manual and the automatic category.
The live challenge will take place during the conference.
To solve the instances and submit your solutions, you will be provided with a dedicated tool:
https://graphdrawingcontest.appspot.com/tool.jsp
Note that the target function changed slightly compared to last year, but the tool has not been updated yet for the new function.
For more details, visit
http://graphdrawing.org/gdcontest/contest2022/challenge.html
2. Creative Topics
For your entertainment and inspiration, we have composed two nice graphs that you may draw with full artistic freedom.
- Opera Network
The data represents a collection of opera performances that took place across Europe between 1775 and 1833. The data was extracted from the RISM database and was offered by Frans Wiering - professor of Utrecht University studing Musicology. There are several possibilities on how a network can be extracted from this data. We leave it to the participants to decide how and whether to model this data set as a network. - Aesthetic Experience Network
The data set represents 8 networks that model an aesthetic experience of the viewers when observing artworks. The analyzed artworks are 8 paintings by Klee, Kandinsky, Mortensen, Miro and Winter. Each of the 14 nodes represents one of the two polarities of an aesthetic effect, and the edges are weighted by conditional dependence relations among aesthetic effects.
In both cases, you may visualize the graph in any way you like. Submissions will be judged on a list of criteria that includes, but is not limited to, readability, aesthetics, novelty, and design quality. The weighting of the criteria might be different for the two graphs. Submissions will be handled through EasyChair. For more details, visit
http://graphdrawing.org/gdcontest/contest2022/topics.html
Submission deadline: September 05 (23:59 PDT)
3. Awards
We are hoping to be able to award a monetary prize to up to three submissions in each of the four different categories. Details will follow.
We are looking forward to your submissions!
The Graph Drawing Contest Committee,
Philipp Kindermann (chair), Tamara Mchedlidze, and Wouter Meulemans
[Announcement] IWOCA 2022 @Trier (12.03.2022)
From June 7th to 9th, we are organizing the 33rd International Workshop on Combinatorial Algorithms (IWOCA'22) in Trier. You can find further information on the conference website.
[Publications] Article published in Theoretical Computer Science (04.01.2022)
The article Crossing numbers of beyond-planar graphs by Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani & Pavel Valtr has been published in the journal Theoretical Computer Science.
Journal Version: https://doi.org/10.1016/j.tcs.2021.10.016
Arxiv Version: https://arxiv.org/abs/1908.03153
[Publications] Article published in Computational Geometry: Theory and Applications (01.01.2022)
The article Minimum rectilinear polygons for given angle sequences by William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin & Alexander Wolff has been published in the journal Computational Geometry: Theory & Applications.
Journal Version: https://doi.org/10.1016/j.comgeo.2021.101820
Arxiv Version: https://arxiv.org/abs/1606.06940
2021
[Announcement] Computational Geometry Challenge 2022 (21.07.2021)
We are happy to announce the 4th Geometric Optimization Challenge, as part of CG Week in Berlin, Germany, June 7-10, 2022
As in the last year, the objective will be to compute good solutions to instances of a difficult geometric optimization problem. The specific problem chosen for the 2022 Challenge is the following:
Minimum Partition into Plane Subgraphs
Given a geometric graph G=(V,E), with vertices represented by points in the plane, and edges by straight-line connections between vertices. The task is to partition E into as few subsets E1,…,Ek as possible, such that each subgraph Gi=(V,Ei) is plane: In the given geometric representation, line segments representing edges my touch at end points if and only if the corresponding edges are incident in Gi; no edges my cross, i.e., share points that are not segment end points.
The problem is related to a variety of classic problems, ranging from coloring and graph partitioning to extremal graph theory. For example, edge coloring in planar graphs H (for which it is a long-standing conjecture that it is NP-hard for graphs of maximum degree Δ=4 or 5 to decide whether they have an edge coloring with Δ colors) is a special case: From a straight-line drawing of H, slightly extend all line segments, so that they cross at the vertices of H, and nowhere else.
The related problem of partitioning a geometric graph into a minimum number of plane spanning trees has also received considerable attention.
Details of the competition (such as benchmark instances, data formats, and rules for submission and evaluation) will be announced in coming weeks; see the timeline below.
The contributors with the most outstanding solutions will be recognized at CG Week and invited to present their results, both at the event and in the proceedings.
We are looking forward to your contributions and welcome questions and comments!
Challenge Team: Sándor Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra
Advisory Board: Bill Cook, Andreas Fabri, Michael Kerber, Philipp Kindermann, Kevin Verbeek
Timeline:
- By August 19, 2020: Release of first test instances
- September 19, 2021: Contest instances, contest opens
- January 19, 2022: Contest closes
- March 15, 2021: Final versions of proceedings contributions due
Credit: This problem was suggested by Johannes Obenaus, FU Berlin.
[Publications] Paper accepted at GD 2021 (17.07.2021)
The article One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons by Patrizio Angelini, Philipp Kindermann, Andre Löffler, Lena Schlipf & Antonios Symvonis has been accepted at the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021), which will take place in Tübingen on September 14 - 17, 2021.
Proceedings Version: https://doi.org/10.1007/978-3-030-92931-2_13
Arxiv Version: https://arxiv.org/abs/2108.12321
[Publications] Article published in Computer Graphics Forum (29.06.2021)
The article ClusterSets: Optimizing Planar Clusters in Categorical Point Data by Jakob Geiger, Sabine Cornelsen, Jan-Henrik Haunert, Philipp Kindermann, Tamara Mchedlidze, Martin Nöllenburg, Yoshio Okamoto & Alexander Wolff has been published in the journal Computer Graphics Forum.
Journal Version (Open Access): https://doi.org/10.1111/cgf.14322
[Announcement] Graph Drawing Contest 2021 (22.04.2021)
The 29th International Symposium on Graph Drawing and Network Visualization will (hopefully!) take place in Tübingen, Germany, from September 14 to 17, 2021. As has been tradition since 1994, the symposium will be accompanied by a Graph Drawing Contest, allowing all community members to demonstrate their graph drawing skills in a fun competitive setting. The contest has two parts: the Creative Topics and the Live Challenge.
1. Live Challenge
Following popular tradition, a live challenge will be held during the symposium in a format similar to a typical programming contest. Teams are presented with a collection of challenge graphs and have approximately one hour to submit their highest scoring drawings. This year, the challenge focuses on
minimizing the planar polyline edge-length ratio on a fixed grid.
In the automatic category, teams use their own customized tools (or a lot of manual effort) to draw the graphs. Participation in this category can be.
In the manual category, teams solve (smaller) instances and submit their solutions via a dedicated tool, similar to the one used last year:
https://graphdrawingcontest.appspot.com/tool.jsp
In case that the conference will be organized in an online or hybrid format, remote participation will also be possible in the manual category.
For more details, visit
http://graphdrawing.org/gdcontest/contest2021/index.php?id=live-challenge
2. Creative Topics
For your entertainment and inspiration, we have composed two nice graphs that you may draw with full artistic freedom.
- Movie Remakes
A movie remake is a production of a film that is based upon an earlier production. A remake tells the same story as the original but uses a different cast and may alter the theme or target audience. For this topic, you have the task to visualize a graph of movie remakes by different directors. The data contains a list of directors, and pairs of movies: the original and the remake (both with title, year, and directors). The data has been crawled from Wikipedia and consists of 91 directors and 102 pairs of movies. You are free to decide which parts of the data to visualize and how to visualize it. - Argumentation Network: The Great Devonian Controversy – A Logical Reconstruction
The network shows a logical reconstruction of a scientific debate among 19th century geologists, namely the Great Devonian Controversy. The network contains 335 vertices which are of two types: statements and arguments. Each argument has one or more sentences as premises and one sentence as a conclusion. The network contains 1016 edges. The edges connect statements to statements and statements to arguments.
In both cases, you may visualize the graph in any way you like. Submissions will be judged on a list of criteria that includes, but is not limited to, readability, aesthetics, novelty, and design quality. The weighting of the criteria might be different for the two graphs. Submissions will be handled through EasyChair. For more details, visit
http://graphdrawing.org/gdcontest/contest2021/index.php?id=creative-topics
Submission deadline: September 08 2021 (23:59 PDT)
3. Awards
We are planning to award a monetary prize to up to three submissions in each of the four different categories.
We are looking forward to your submissions!
The Graph Drawing Contest Committee,
Philipp Kindermann (chair), Tamara Mchedlidze, and Wouter Meulemans
[Publications] Paper accepted at EuroVis 2021 (09.04.2021)
The article ClusterSets: Optimizing Planar Clusters in Categorical Point Data by Jakob Geiger, Sabine Cornelsen, Jan-Henrik Haunert, Philipp Kindermann, Tamara Mchedlidze, Martin Nöllenburg, Yoshio Okamoto & Alexander Wolff has been accepted at the 23rd Annual Eurographics Visualization Conference (EuroVis 2021), scheduled to take place online on June 14 - 18. The article will be published in the journal Computer Graphics Forum.
Journal Version (Open Access): https://doi.org/10.1111/cgf.14322
[Publications] Paper accepted at CIAC 2021 (02.04.2021)
The article Extending Partial Representations of Rectangular Duals with Given Contact Orientations by Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter & Alexander Wolff has been accepted at the 12th International Conference on Algorithms and Complexity (CIAC 2021), which will take place online on May 10 - 12, 2021.
Proceedings Version: https://link.springer.com/chapter/10.1007/978-3-030-75242-2_24
Arxiv Version: https://arxiv.org/abs/2102.02013
[News] Founding of the professorship (01.04.2021)
As of April 1, 2021, Philipp Kindermann was appointed to the junior professorship for Algorithms in the Department IV - Computer Science. The Algorithmics research group focuses on problems across all areas of algorithm development and analysis, particularly in the visualization of graphs, graph algorithms, and computational geometry.