Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Annegret Liebers

dblp:52/2037 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1999
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Algorithms and data structures · 100%

Topics — the 1 heaviest of 1, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithms and data structures › analysis of algorithms
experimental algorithmics
0.011999
Empirical Design of Geometric Algorithms · SCG 1999

Methods — techniques the papers use, named apart from their topics

case study · 0.0
YearPublicationVenuePosition
1999 Empirical Design of Geometric Algorithms
abstract
The computer--aided solution to algorithmic problems is becoming more and more important in various application domains.This is in particular true for computational geometry.For example, geometric problems naturally arise in image processing, computer graphics, and all kinds of computer-aided design, just to mention a few.Even more, the general tendency towards the application of visual aids in virtually all fields of science, technology, and business raises many new, unexpected geometric challenges.A sound mathematical treatment of these problems and a systematic computational study on the resulting algorithms are desirable.However, in practice, there are often obstacles to such an attempt.In this paper, we will systematically discuss our experiences with a few obstacles that occurred in four of our projects and significantly influenced our reasoning on algorithms in each of them.
Karsten Weihe, Ulrik Brandes, Annegret Liebers, Matthias Müller-Hannemann, Dorothea Wagner, Thomas Willhalm
SCG3
1999 On the Hardness of Recognizing Bundles in Time Table Graphs
Annegret Liebers, Dorothea Wagner, Karsten Weihe
WG1