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 -
TopoEmbedX: A General Framework for Representation Learning on Topological Domains2026 arXiv (Cornell University) preprint Computer Science Topological and Geometric Data Analysis Open access
Florian Frantzen, Ibrahem ALJabea, Inês Henriques-Cadby, Theodore Papamarkou, Mustafa Hajij, Michael T. Schaub
0citations