VLDB 2026 Research / reviewers in the wild / expert
Lorenzo Venturello
dblp:260/0865
· DBLP profile ↗
5ranked-venue papers
0as first author
5since 2021 · last 2026
0000-0002-6797-5270ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 4 · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | The cd-Index of Semi-Eulerian PosetsabstractAbstract. We generalize the definition of the [Formula: see text]-index of an Eulerian poset to the class of semi-Eulerian posets. For connected simplicial semi-Eulerian Buchsbaum posets, we show that all coefficients of the [Formula: see text]-index are nonnegative. This proves a conjecture of Novik for odd-dimensional manifolds and extends it to the even-dimensional case. Martina Juhnke, José Alejandro Samper, Lorenzo Venturello |
SIAM J. Discret. Math. | 3 |
| 2024 | Voronoi diagrams of algebraic varieties under polyhedral norms
Adrian Becedas, Kathlén Kohn, Lorenzo Venturello |
J. Symb. Comput. | 3 |
| 2023 | On the Gamma-Vector of Symmetric Edge PolytopesabstractAbstract. We study [Formula: see text]-vectors associated with [Formula: see text]-vectors of symmetric edge polytopes both from a deterministic and a probabilistic point of view. On the deterministic side, we prove nonnegativity of [Formula: see text] for any graph and completely characterize the case when [Formula: see text]. The latter also confirms a conjecture by Lutz and Nevo in the realm of symmetric edge polytopes. On the probabilistic side, we show that the [Formula: see text]-vectors of symmetric edge polytopes of most Erdős–Rényi random graphs are asymptotically almost surely nonnegative up to any fixed entry. This proves that Gal’s conjecture holds asymptotically almost surely for arbitrary unimodular triangulations in this setting. Alessio D'Alì, Martina Juhnke, Daniel Köhne, Lorenzo Venturello |
SIAM J. Discret. Math. | 4 |
| 2021 | Octahedralizing 3-Colorable 3-PolytopesabstractWe investigate the question of whether any d-colorable simplicial d-polytope can be octahedralized, i.e., can be subdivided to a d-dimensional geometric cross-polytopal complex. We give a positive answer in dimension 3, with the additional property that the octahedralization introduces no new vertices on the boundary of the polytope. Giulia Codenotti, Lorenzo Venturello |
Discret. Comput. Geom. | 2 |
| 2021 | Wasserstein distance to independence models
Türkü Özlüm Çelik, Asgar Jamneshan, Guido Montúfar, Bernd Sturmfels, Lorenzo Venturello |
J. Symb. Comput. | 5 |