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

Marcelo Sales

dblp:418/3005 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none

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

Theory of computation · 1 · 1 since 2021

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
Graph algorithms and graph theory · 41% Combinatorics and discrete mathematics · 33% Computational geometry · 26%

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

TopicWeightPapersLastEvidence papers
Combinatorics and discrete mathematics › polytope theory
0/1-polytope
1.012026
On the edge expansion of random polytopes · SODA 2026
Graph algorithms and graph theory › expander graphs
edge expansion
1.012026
On the edge expansion of random polytopes · SODA 2026
Computational geometry
polytopes
1.012026
On the edge expansion of random polytopes · SODA 2026
Graph algorithms and graph theory › expansion properties
graph expansion
0.312026
On the edge expansion of random polytopes · SODA 2026
Graph algorithms and graph theory
graph theory
0.312026
On the edge expansion of random polytopes · SODA 2026
Combinatorics and discrete mathematics › probabilistic combinatorics
random structures
0.312026
On the edge expansion of random polytopes · SODA 2026

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

probabilistic method · 1.0
YearPublicationVenuePosition
2026 On the edge expansion of random polytopes
abstract
A 0/1-polytope in \(\mathbb R^n\) is the convex hull of a subset of \(\{0,\, 1\}^n\). The graph of a polytope \(P\) is the graph whose vertices are the zero-dimensional faces of \(P\) and whose edges are the one-dimensional faces of \(P\). A conjecture of Mihail and Vazirani states that the edge expansion of the graph of every 0/1-polytope is at least one. We study a random version of the problem, where the polytope is generated by selecting vertices of \(\{0,\, 1\}^n\) independently at random with probability \(p \in (0; 1)\). Improving earlier results, we show that, for any \(p \in (0; 1)\), with high probability the edge expansion of the random 0/1-polytope is bounded from below by an absolute constant.
Asaf Ferber, Michael Krivelevich, Marcelo Sales, Wojciech Samotij
SODA3