Iris Reinbacher

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

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:51/2479 · DBLP profile ↗

← Back

9ranked-venue papers

2as first author

0since 2021 · last 2013

—ORCID · none

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

Theory of computation · 5 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1

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		Computational geometry · 100%
Databases, data mining, and information retrieval 1 paper		Information retrieval · 100%

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

Topic	Weight	Papers	Last	Evidence papers
Computational geometry polygon decomposition	0.0	1	2003	Good NEWS: partitioning a simple polygon by compass directions · SCG 2003
Information retrieval › document retrieval › domain-specific retrieval geographic information retrieval	0.0	1	2003	Good NEWS: partitioning a simple polygon by compass directions · SCG 2003

Year	Publication	Venue	Position
2013	Maximum overlap of convex polytopes under translation Hee-Kap Ahn, Siu-Wing Cheng, Iris Reinbacher	Comput. Geom.	3
2011	Covering points by disjoint boxes with outliers Hee-Kap Ahn, Sang Won Bae 0001, Erik D. Demaine, Martin L. Demaine, Sang-Sub Kim 0001, Matias Korman, Iris Reinbacher, Wanbin Son	Comput. Geom.	7
2011	Empty pseudo-triangles in point sets Hee-Kap Ahn, Sang Won Bae 0001, Marc J. van Kreveld, Iris Reinbacher, Bettina Speckmann	Discret. Appl. Math.	4
2010	Maximum Overlap of Convex Polytopes under Translation Hee-Kap Ahn, Siu-Wing Cheng, Iris Reinbacher	ISAAC (2)	3
2008	Delineating Boundaries for Imprecise Regions Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Jack Snoeyink, Alexander Wolff 0001	Algorithmica	1
2005	Delineating Boundaries for Imprecise Regions Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Alexander Wolff 0001	ESA	1
2005	Multi-Dimensional Scattered Ranking Methods for Geographic Information Retrieval Marc J. van Kreveld, Iris Reinbacher, Avi Arampatzis, Roelof van Zwol	GeoInformatica	2
2004	Distributed Ranking Methods for Geographic Information Retrieval Marc J. van Kreveld, Iris Reinbacher, Avi Arampatzis, Roelof van Zwol	SDH	2
2003	Good NEWS: partitioning a simple polygon by compass directions abstract Motivated by geographic information retrieval, we study the problem of partitioning a simple polygon into four parts that can be considered as the North, East, West, and South. We list criteria for such partitionings, propose formalizations into geometric problems, and give efficient algorithms. An implementation and tests on country outlines show the results for three different partitionings. Marc J. van Kreveld, Iris Reinbacher	SCG	2