News

This year's PhilTag 13 is hosted by Würzburg University Library as part of the Kallimachos project. We'll be at the OCR workshop, presenting Glyph Miner. This is a tool for locating glyphs in early modern prints, developed at our chair.

At ACM SIGSPATIAL 2015, Benedikt Budig presented the poster "There and Back Again: Using Fréchet-Distance Diagrams to Find Trajectory Turning Points", which was awarded "Best Poster Award Runners up".

The paper "Active Learning for Classifying Template Matches in Historical Maps" was awarded at DS 2015.

Several international students and a PostDoc are visiting Chair I.

In the last two weeks, two PhD students from our group have successfully defended their PhD theses in public disputations.

At this year's ACM International Conference on Advances in Geographic Information Systems (ACM GIS) in Dallas, the Chair of Computer Science I was represented with several papers.

The Bavarian Minister of Science visited poster presentations and demos in order to learn about the JIM project of the University of Würzburg.

Thomas van Dijk and Jan-Henrik Haunert received the Best Short Presentation award at the Web and Wireless GIS 2013 (W2GIS) conference for the presentation of their paper "A probabilistic model for road selection in mobile maps."

Jan-Henrik Haunert received the Otto von Gruber Award 2012 of the International Society for Photogrammetry and Remote Sensing (ISPRS).

Point set embeddings of graphs are drawings of graphs in which nodes lie only on positions allowed by a specified input point set. At chair I such embeddings have been investigated with the additional constraint that all crossing angles of two edges are large. Martin Fink presents the results at the conference WALCOM'12.

Die Deutsche Forschungsgemeinschaft (DFG) stell Forschungsgelder für das deutsche Teilprojekt von "Graph Drawings and Representations" des European Research Council (ERC), das im Juli in Prag gestartet ist, zur Verfügung.

Internet maps often have a small number of levels of detail, thus zooming may imply abrupt changes. This distracts users. In a new project, algorithms are developed that allow for a continuous transformation between different scales.

The chair of computer science I participates in the european research project GraDR, which aims at investigating several problems in relation to graph drawings and representations.

In centrality problems we search for a set of nodes of a graph that - as a group - is located as central as possible. At the conference WALCOM'11, Martin Fink presents algorithms and additional results for the centrality problem "Maximum Betweenness Centrality", which he investigated together with Spoerhase.

Location problems deal with the choice of locations for facilities that are to be opened. At the conference ISAAC'10, Joachim Spoerhase presents an optimal algorithm for the so-called single maximum coverage location problem on tree-graphs.