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

Karim A. Adiprasito

dblp:144/7501 · also Karim Alexander Adiprasito · DBLP profile ↗
← Back
6ranked-venue papers
6as first author
0since 2021 · last 2020
0000-0002-6427-687XORCID · verified

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

Graphics, computer vision, multimedia, augmented reality and games · 5 · 5 first-authorTheory of computation · 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 · 75% Mathematical optimization · 25%

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

TopicWeightPapersLastEvidence papers
Mathematical optimization
carathéodory theorem		 0.412019
Theorems of Carathéodory, Helly, and Tverberg without dimension · SODA 2019
Computational geometry
combinatorial geometry		 0.412019
Theorems of Carathéodory, Helly, and Tverberg without dimension · SODA 2019
Computational geometry › combinatorial geometry
helly theorem		 0.412019
Theorems of Carathéodory, Helly, and Tverberg without dimension · SODA 2019
Computational geometry › discrete geometry
tverberg theorem		 0.412019
Theorems of Carathéodory, Helly, and Tverberg without dimension · SODA 2019

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

combinatorial geometry · 0.4
YearPublicationVenuePosition
2020 Barycentric Subdivisions of Convex Complexes are Collapsible
Karim A. Adiprasito, Bruno Benedetti
 Discret. Comput. Geom.1
2020 Theorems of Carathéodory, Helly, and Tverberg Without Dimension
Karim A. Adiprasito, Imre Bárány, Nabil H. Mustafa, Tamás Terpai
 Discret. Comput. Geom.1
2019 Theorems of Carathéodory, Helly, and Tverberg without dimension
abstract
Motivated by Barman [6], we initiate a systematic study of the ‘no-dimensional’ analogues of some basic theorems in combinatorial and convex geometry, including the colorful Carathéodory's theorem, Tverberg's theorem, Helly's theorem as well as their fractional and colorful extensions.
Karim A. Adiprasito, Imre Bárány, Nabil H. Mustafa
 SODA1
2017 Extremal Examples of Collapsible Complexes and Random Discrete Morse Theory
Karim A. Adiprasito, Bruno Benedetti, Frank H. Lutz
 Discret. Comput. Geom.1
2015 Universality Theorems for Inscribed Polytopes and Delaunay Triangulations
Karim A. Adiprasito, Arnau Padrol, Louis Theran
 Discret. Comput. Geom.1
2012 Characterization of Polytopes via Tilings with Similar Pieces
Karim A. Adiprasito
 Discret. Comput. Geom.1