graph algorithm

Reconfiguring Shortest Paths in Graphs AAAI 2022 Reduction Algorithms for Persistence Diagrams of Networks: CoralTDA and PrunIT NeurIPS 2022 Sampling and Counting Acyclic Orientations in Chordal Graphs (Student Abstract) AAAI 2022 Sublinear Algorithms for Hierarchical Clustering NeurIPS 2022 Subset Approximation of Pareto Regions with Bi-objective A* AAAI 2022 The CLRS Algorithmic Reasoning Benchmark ICML 2022 The Complexity of Temporal Vertex Cover in Small-Degree Graphs AAAI 2022 The Triangle-Densest-K-Subgraph Problem: Hardness, Lovász Extension, and Application to Document Summarization AAAI 2022 Unbiased and Efficient Sampling of Dependency Trees EMNLP 2022 Verification and search algorithms for causal DAGs NeurIPS 2022 A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs NeurIPS 2021 A Faster Maximum Cardinality Matching Algorithm with Applications in Machine Learning NeurIPS 2021 A Fast Exact Algorithm for the Resource Constrained Shortest Path Problem AAAI 2021 A Root of a Problem: Optimizing Single-Root Dependency Parsing EMNLP 2021 Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback AAAI 2021 Bringing UMAP Closer to the Speed of Light with GPU Acceleration AAAI 2021 Efficient and Local Parallel Random Walks NeurIPS 2021 Graph Algorithms for Multiparallel Word Alignment EMNLP 2021 How to transfer algorithmic reasoning knowledge to learn new algorithms? NeurIPS 2021 Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes NeurIPS 2021 Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding AAAI 2021 Intervention Efficient Algorithms for Approximate Learning of Causal Graphs ALT 2021 Iterative Causal Discovery in the Possible Presence of Latent Confounders and Selection Bias NeurIPS 2021 Local Algorithms for Finding Densely Connected Clusters ICML 2021 Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering AAAI 2021