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 SIGIR 2026 / reviewers in the wild / expert

Alexander Gilbers

dblp:21/7187 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2014
—ORCID · none

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

Theory of computation · 3 · 3 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 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
Computational geometry · 100%

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

TopicWeightPapersLastEvidence papers
Computational geometry
visibility		 0.112011
A new upper bound for the VC-dimension of visibility regions · SCG 2011
Computational geometry › visibility
art gallery problem		 0.012011
A new upper bound for the VC-dimension of visibility regions · SCG 2011
Computational geometry › visibility
guard placement		 0.012011
A new upper bound for the VC-dimension of visibility regions · SCG 2011

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

epsilon-net · 0.1combinatorial reduction · 0.1
YearPublicationVenuePosition
2014 A new upper bound for the VC-dimension of visibility regions
Alexander Gilbers, Rolf Klein
 Comput. Geom.1
2014 VC-dimension of perimeter visibility domains
Alexander Gilbers
 Inf. Process. Lett.1
2011 A new upper bound for the VC-dimension of visibility regions
abstract
In this paper we are proving the following fact. Let P be an arbitrary simple polygon, and let S be an arbitrary set of 15 points inside P. Then there exists a subset T of S that is not "visually discernible", that is, T ≠ vis(v) ∩ S holds for the visibility regions vis(v) of all points v in P. In other words, the VC-dimension $d$ of visibility regions in a simple polygon cannot exceed 14. Since Valtr [v-ggwps-98] proved in 1998 that d ∈ [6,23] holds, no progress has been made on this bound. Our reduction immediately implies a smaller upper bound to the number of guards needed to cover P by ε-net theorems.
Alexander Gilbers, Rolf Klein
 SCG1
2009 New Results on Visibility in Simple Polygons
Alexander Gilbers, Rolf Klein
 WADS1