Co-occurring keywords · papers mentioning both
Papers
Finding Friends and Flipping Frenemies: Automatic Paraphrase Dataset Augmentation Using Graph Theory
EMNLP 2020
Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes
AAAI 2020
Flow-Based Network Creation Games
IJCAI 2020
Generalization and Representational Limits of Graph Neural Networks
ICML 2020
Hiding in Multilayer Networks
AAAI 2020
High-dimensional Gaussian graphical models on network-linked data
JMLR 2020
Measurement Dependence Inducing Latent Causal Models
UAI 2020
Non-revisiting Coverage Task with Minimal Discontinuities for Non-redundant Manipulators
RSS 2020
Online Dense Subgraph Discovery via Blurred-Graph Feedback
ICML 2020
On the Problem of Covering a 3-D Terrain
AAAI 2020
Path-Based Spectral Clustering: Guarantees, Robustness to Outliers, and Fast Algorithms
JMLR 2020
Statistical guarantees for local graph clustering
AISTATS 2020
The Complexity of Computing Maximin Share Allocations on Graphs
AAAI 2020
The weight function in the subtree kernel is decisive
JMLR 2020
Time-Inconsistent Planning: Simple Motivation Is Hard to Find
AAAI 2020
Well-Structured Committees
IJCAI 2020
A Graph Theoretic Framework of Recomputation Algorithms for Memory-Efficient Backpropagation
NeurIPS 2019
Causal Inference Under Interference And Network Uncertainty
UAI 2019
Computational Intractability and Solvability for the Birds of a Feather Game
AAAI 2019
Convergence of Gaussian Belief Propagation Under General Pairwise Factorization: Connecting Gaussian MRF with Pairwise Linear Gaussian Model
JMLR 2019
Coverage Centrality Maximization in Undirected Networks
AAAI 2019
Determining Solvability in the Birds of a Feather Card Game
AAAI 2019
Diffusion and Auction on Graphs
IJCAI 2019
Efficient Near-Optimal Testing of Community Changes in Balanced Stochastic Block Models
NeurIPS 2019
Exact inference in structured prediction
NeurIPS 2019