Amirali Khosravi

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:40/433 · DBLP profile ↗

← Back

4ranked-venue papers

0as first author

0since 2021 · last 2011

0000-0002-8796-2987ORCID · corroborated

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

Theory of computation · 4

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 · 50% Approximation and online algorithms · 50%

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

Topic	Weight	Papers	Last	Evidence papers
Approximation and online algorithms approximation algorithms	0.1	1	2011	Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons · SCG 2011
Computational geometry polygon decomposition	0.1	1	2011	Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons · SCG 2011

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

approximation algorithm · 0.1

Year	Publication	Venue	Position
2011	Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons abstract Let P be a rectilinear simple polygon. The stabbing number of a partition of P into rectangles is the maximum number of rectangles stabbed by any axis-parallel line segment inside P. We present a 3-approximation algorithm for the problem of finding a partition with minimum stabbing number. It is based on an algorithm that finds an optimal partition for histograms. We also study Steiner triangulations of a simple (non-rectilinear) polygon P. Here the stabbing number is defined as the maximum number of triangles that can be stabbed by any line segment inside P. We give an O(1)-approximation algorithm for the problem of computing a Steiner triangulation with minimum stabbing number. Mohammad Ali Abam, Boris Aronov, Mark de Berg, Amirali Khosravi	SCG	4
2011	Piecewise-Linear Approximations of Uncertain Functions Mohammad Ali Abam, Mark de Berg, Amirali Khosravi	WADS	3
2011	On Rectilinear Partitions with Minimum Stabbing Number Mark de Berg, Amirali Khosravi, Sander Verdonschot, Vincent van der Weele	WADS	2
2010	Optimal Binary Space Partitions in the Plane Mark de Berg, Amirali Khosravi	COCOON	2