cs.SI

Papers

• HetFS: A Method for Fast Similarity Search with Ad-hoc Meta-paths on Heterogeneous Information Networks (2025)
  Xuqi Mao et al.
  5.84
• Compressing Graphs and Indexes with Recursive Graph Bisection (2017)
  Laxman Dhulipala and Igor Kabiljo and Brian Karrer and Giuseppe Ottaviano and Sergey Pupyrev and Alon Shalita
  —
• Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs (2018)
  Yu. A. Malkov et al.
  —
• SLING: A Near-Optimal Index Structure for SimRank (2016)
  Boyu Tian and Xiaokui Xiao
  —
• Distributed Probabilistic Bisection Search using Social Learning (2016)
  Athanasios Tsiligkaridis and Theodoros Tsiligkaridis
  —
• Meta-Path Guided Embedding for Similarity Search in Large-Scale Heterogeneous Information Networks (2016)
  Jingbo Shang et al.
  —
• Forward Backward Similarity Search in Knowledge Networks (2016)
  Baoxu Shi and Lin Yang and Tim Weninger
  —
• The Flexible Group Spatial Keyword Query (2017)
  Sabbir Ahmad et al.
  —
• An Optimal and Progressive Approach to Online Search of Top-k Influential Communities (2017)
  Fei Bi et al.
  —
• Searching for a Single Community in a Graph (2018)
  Avik Ray et al.
  —
• Finding Nearest Neighbors in graphs locally (2019)
  Abhinav Mishra
  —
• Fine-grained Search Space Classification for Hard Enumeration Variants of Subset Problems (2019)
  Juho Lauri and Sourav Dutta
  —
• Graph based Nearest Neighbor Search: Promises and Failures (2019)
  Peng-Cheng Lin and Wan-Lei Zhao
  —
• Indexing Graph Search Trees and Applications (2019)
  Sankardeep Chakraborty et al.
  —
• Efficient Algorithms for Approximate Single-Source Personalized PageRank Queries (2019)
  Sibo Wang et al.
  —
• Fast Algorithms for Intimate-Core Group Search in Weighted Graphs (2019)
  Longxu Sun et al.
  —
• Local Search for Group Closeness Maximization on Big Graphs (2019)
  Eugenio Angriman et al.
  —
• Mixed Integer Programming for Searching Maximum Quasi-Bicliques (2020)
  Dmitry I. Ignatov et al.
  —
• Approximate Nearest Neighbour Search on Privacy-aware Encoding of User Locations to Identify Susceptible Infections in Simulated Epidemics (2020)
  Chandan Biswas et al.
  —
• A Process for the Evaluation of Node Embedding Methods in the Context of Node Classification (2020)
  Christoph Martin et al.
  —
• Scalable Top-k Query on Information Networks with Hierarchical Inheritance Relations (2020)
  Fubao Wu et al.
  —
• Bot-Match: Social Bot Detection with Recursive Nearest Neighbors Search (2020)
  David M. Beskow and Kathleen M. Carley
  —
• Adaptive Community Search in Dynamic Networks (2020)
  Ioanna Tsalouchidou and Francesco Bonchi and Ricardo Baeza-Yates
  —
• Better Fewer but Better: Community Search with Outliers (2020)
  Francesco Bonchi et al.
  —
• Effectively Counting s-t Simple Paths in Directed Graphs (2022)
  Mostafa Haghir Chehreghani
  —
• Efficiently Answering Quality Constrained Shortest Distance Queries in Large Graphs (2022)
  You Peng et al.
  —
• Effective Community Search on Large Attributed Bipartite Graphs (2023)
  Zongyu Xu et al.
  —
• Metric Search for Rank List Compatibility Matching with Applications (2023)
  Wenqi Guo et al.
  —
• Efficient and Effective Similarity Search over Bipartite Graphs (2023)
  Renchi Yang
  —
• Scalable Community Search with Accuracy Guarantee on Attributed Graphs (2024)
  Yuxiang Wang et al.
  —
• Deep Overlapping Community Search via Subspace Embedding (2025)
  Qing Sima et al.
  —
• Maximum $k$-Plex Search: An Alternated Reduction-and-Bound Method (2024)
  Shuohao Gao et al.
  —
• Early Detection of Misinformation for Infodemic Management: A Domain Adaptation Approach (2026)
  Minjia Mao et al.
  —
• Spectral Toolkit of Algorithms for Graphs: Technical Report (2) (2024)
  Peter Macgregor et al.
  —
• $k$-local Graphs (2025)
  Christian Beth et al.
  —
• How Low Can You Go? Searching for the Intrinsic Dimensionality of Complex Networks using Metric Node Embeddings (2025)
  Nikolaos Nakis and Niels Raunkj{\ae}r Holm and Andreas Lyhne Fiehn and Morten M{\o}rup
  —
• Maximum Degree-Based Quasi-Clique Search via an Iterative Framework (2025)
  Hongbo Xia et al.
  —
• Effective and Efficient Conductance-based Community Search at Billion Scale (2025)
  Longlong Lin et al.
  —
• Multimodal LLMs See Sentiment (2026)
  Neemias B. da Silva et al.
  —
• HiGraph: A Large-Scale Hierarchical Graph Dataset for Malware Analysis (2026)
  Han Chen et al.
  —
• PerSoMed: A Large-Scale Balanced Dataset for Persian Social Media Text Classification (2026)
  Isun Chehreh et al.
  —
• Optimal Exploration of New Products under Assortment Decisions (2026)
  Jackie Baek et al.
  —
• Aitchison Embeddings for Learning Compositional Graph Representations (2026)
  Nikolaos Nakis et al.
  —
• Can Visual Mamba Improve AI-Generated Image Detection? An In-Depth Investigation (2026)
  Mamadou Keita et al.
  —
• From Accuracy to Auditability: A Survey of Determinism in Financial AI Systems (2026)
  Ruizhe Zhou et al.
  —
• SAHG: Sector-Anisotropic Hyperbolic Graph Model for Social Bot Detection (2026)
  Hanning Lu et al.
  —