% Key papers for Graph comparison and random features (scime atlas, https://atlas.scime.ai). Authors are not included: add them from the paper pages.

@inproceedings{cvpr2018_graph_13170,
  title = {{Graph-Cut RANSAC}},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)},
  year = {2018},
  url = {https://openaccess.thecvf.com/content_cvpr_2018/html/Barath_Graph-Cut_RANSAC_CVPR_2018_paper.html},
}

@inproceedings{cvpr2016_fanng_11539,
  title = {{FANNG: Fast Approximate Nearest Neighbour Graphs}},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)},
  year = {2016},
}

@inproceedings{icml2019_optimal_37631,
  title = {{Optimal Transport for structured data with application on graphs}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2019},
  url = {https://icml.cc/virtual/2019/poster/4110},
}

@inproceedings{cvpr2017_joint_12369,
  title = {{Joint Graph Decomposition \& Node Labeling: Problem, Algorithms, Applications}},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)},
  year = {2017},
}

@inproceedings{aaai2017_finding_99773,
  title = {{Finding Critical Users for Social Network Engagement: The Collapsed k-Core Problem}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2017},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/10482},
}

@inproceedings{aaai2017_an_101072,
  title = {{An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2017},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/10648},
}

@inproceedings{neurips2019_got_58310,
  title = {{GOT: An Optimal Transport framework for Graph comparison}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2019},
  url = {https://nips.cc/virtual/2019/poster/14318},
}

@inproceedings{aaai2017_asymmetric_104454,
  title = {{Asymmetric Discrete Graph Hashing}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2017},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/10831},
}

@inproceedings{neurips2022_bond_65245,
  title = {{BOND: Benchmarking Unsupervised Outlier Node Detection on Static Attributed Graphs}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2022},
  url = {https://nips.cc/virtual/2022/poster/55721},
}

@inproceedings{aaai2018_distance_105776,
  title = {{Distance-Aware DAG Embedding for Proximity Search on Heterogeneous Graphs}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2018},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/11885},
}

@inproceedings{neurips2018_retgk_57577,
  title = {{RetGK: Graph Kernels based on Return Probabilities of Random Walks}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2018},
  url = {https://nips.cc/virtual/2018/poster/11394},
}

@inproceedings{aaai2021_improving_766,
  title = {{Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2021},
  url = {https://aaai.org/papers/12453-improving-maximum-k-plex-solver-via-second-order-reduction-and-graph-color-bounding/},
}

@inproceedings{aaai2017_a_101079,
  title = {{A Fast Algorithm to Compute Maximum k-Plexes in Social Network Analysis}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2017},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/10655},
}

@inproceedings{cvpr2018_link_13337,
  title = {{Link and Code: Fast Indexing With Graphs and Compact Regression Codes}},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)},
  year = {2018},
  url = {https://openaccess.thecvf.com/content_cvpr_2018/html/Douze_Link_and_Code_CVPR_2018_paper.html},
}

@inproceedings{neurips2016_edge_55699,
  title = {{Edge-exchangeable graphs and sparsity}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2016},
  url = {https://nips.cc/virtual/2016/poster/7022},
}

@inproceedings{neurips2019_exploring_58243,
  title = {{Exploring Algorithmic Fairness in Robust Graph Covering Problems}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2019},
  url = {https://nips.cc/virtual/2019/poster/14464},
}

@inproceedings{aaai2020_enumerating_101067,
  title = {{Enumerating Maximal k-Plexes with Worst-Case Time Guarantee}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2020},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/5625},
}

@inproceedings{aaai2018_goccf_102440,
  title = {{gOCCF: Graph-Theoretic One-Class Collaborative Filtering Based on Uninteresting Items}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2018},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/11707},
}

@inproceedings{cvpr2019_explore_14171,
  title = {{Explore-Exploit Graph Traversal for Image Retrieval}},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)},
  year = {2019},
}

@inproceedings{aaai2020_understanding_99743,
  title = {{Understanding and Improving Proximity Graph Based Maximum Inner Product Search}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2020},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/5344},
}

@inproceedings{aaai2024_large_6424,
  title = {{Large-Scale Multi-Robot Coverage Path Planning via Local Search}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2024},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/29707},
}

@inproceedings{neurips2024_long_73402,
  title = {{Long-range Meta-path Search on Large-scale Heterogeneous Graphs}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2024},
  url = {https://neurips.cc/virtual/2024/poster/94053},
}

@inproceedings{aaai2024_optimal_6866,
  title = {{Optimal Quasi-clique: Hardness, Equivalence with Densest-k-Subgraph, and Quasi-partitioned Community Mining}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2024},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/28705},
}

@inproceedings{aaai2024_limited_6533,
  title = {{Limited Query Graph Connectivity Test}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2024},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/30059},
}

@inproceedings{aaai2024_multiple_6725,
  title = {{Multiple-Source Localization from a Single-Snapshot Observation Using Graph Bayesian Optimization}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2024},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/30262},
}

@inproceedings{aaai2024_threshold_7563,
  title = {{Threshold-Based Responsive Simulated Annealing for Directed Feedback Vertex Set Problem}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2024},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/30075},
}

@inproceedings{aaai2024_exact_5887,
  title = {{Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2024},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/29686},
}

@inproceedings{aaai2025_pre_10338,
  title = {{Pre-Assignment Problem for Unique Minimum Vertex Cover on Bounded Clique-Width Graphs}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2025},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/34893},
}

@inproceedings{icml2024_probabilistic_45436,
  title = {{Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2024},
  url = {https://icml.cc/virtual/2024/poster/33015},
}

@inproceedings{neurips2024_efficient_71180,
  title = {{Efficient Streaming Algorithms for Graphlet Sampling}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2024},
  url = {https://neurips.cc/virtual/2024/poster/96049},
}

@inproceedings{neurips2024_bayesian_71646,
  title = {{Bayesian Optimization of Functions over Node Subsets in Graphs}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2024},
  url = {https://neurips.cc/virtual/2024/poster/95631},
}

@inproceedings{neurips2024_cspg_73905,
  title = {{CSPG: Crossing Sparse Proximity Graphs for Approximate Nearest Neighbor Search}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2024},
  url = {https://neurips.cc/virtual/2024/poster/93606},
}

@inproceedings{aaai2025_3dpgs_7871,
  title = {{3DPGS: 3D Probabilistic Graph Search for Archaeological Piece Grouping}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2025},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/32246},
}

@inproceedings{aaai2025_approximating_8138,
  title = {{Approximating Optimal Labelings for Temporal Connectivity}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2025},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/34849},
}

@inproceedings{aaai2025_breaking_8303,
  title = {{Breaking Symmetries in Quantified Graph Search: A Comparative Study}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2025},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/33223},
}

@inproceedings{iclr2024_repelling_33544,
  title = {{Repelling Random Walks}},
  booktitle = {International Conference on Learning Representations (ICLR)},
  year = {2024},
  url = {https://iclr.cc/virtual/2024/poster/19531},
}

@inproceedings{iclr2024_general_35550,
  title = {{General Graph Random Features}},
  booktitle = {International Conference on Learning Representations (ICLR)},
  year = {2024},
  url = {https://iclr.cc/virtual/2024/poster/17523},
}

@inproceedings{icml2024_individual_43611,
  title = {{Individual Fairness in Graph Decomposition}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2024},
  url = {https://icml.cc/virtual/2024/poster/34841},
}

@inproceedings{icml2025_improved_46130,
  title = {{Improved Approximations for Hard Graph Problems using Predictions}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2025},
  url = {https://icml.cc/virtual/2025/poster/46430},
}

@inproceedings{icml2025_algorithms_46603,
  title = {{Algorithms and Hardness for Active Learning on Graphs}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2025},
  url = {https://icml.cc/virtual/2025/poster/45966},
}