Not finding it? Sign in to also search OpenAlex live.
-
Testing H-Freeness on Sparse Graphs, the Case of Bounded Expansion2026 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Complexity and Algorithms in Graphs Open access
Samuel Humeau, Mamadou Moustapha Kanté, Daniel Mock, Timothé Picavet, Alexandre Vigny
0citations -
Root-to-Leaf Path Random Walks, Normalized Hodge Laplacians, and Cheeger Inequalities on Simplicial Complexes2026 arXiv (Cornell University) preprint Computer Science Topological and Geometric Data Analysis Open access
Francesco Viganò, Tolga Birdal, Michael T. Schaub, Mauricio Barahona
0citations