Co-occurring keywords · papers mentioning both
Papers
Multiagent MST Cover: Pleasing All Optimally via a Simple Voting Rule
AAAI 2023
Nearly Tight Bounds For Differentially Private Multiway Cut
NeurIPS 2023
PS-AAS: Portfolio Selection for Automated Algorithm Selection in Black-Box Optimization
AutoML 2023
Reconstructing an Epidemic Outbreak Using Steiner Connectivity
AAAI 2023
Scalable Fair Influence Maximization
NeurIPS 2023
Speeding Up Bellman Ford via Minimum Violation Permutations
ICML 2023
Subset verification and search algorithms for causal DAGs
AISTATS 2023
Towards Optimal Effective Resistance Estimation
NeurIPS 2023
Uncovering the Largest Community in Social Networks at Scale
IJCAI 2023
Viewing Graph Solvability in Practice
ICCV 2023
An Exact Algorithm with New Upper Bounds for the Maximum k-Defective Clique Problem in Massive Sparse Graphs
AAAI 2022
Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study
AAAI 2022
CrossWalk: Fairness-Enhanced Node Representation Learning
AAAI 2022
Differentially Private Densest Subgraph
AISTATS 2022
Differential Network Analysis
NSDI 2022
Efficient Attribute (α,β)-Core Detection in Large Bipartite Graphs (Student Abstract)
AAAI 2022
Exact Community Recovery over Signed Graphs
AISTATS 2022
Faster and Scalable Algorithms for Densest Subgraph and Decomposition
NeurIPS 2022
Faster Fundamental Graph Algorithms via Learned Predictions
ICML 2022
Generalized Stochastic Matching
AAAI 2022
Graph Reordering for Cache-Efficient Near Neighbor Search
NeurIPS 2022
Modification-Fair Cluster Editing
AAAI 2022
NukCP: An Improved Local Search Algorithm for Maximum k-Club Problem
AAAI 2022
Offline Time-Independent Multi-Agent Path Planning
IJCAI 2022
Online and Consistent Correlation Clustering
ICML 2022