Graph Theory

Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models COLT 2019 Making Fast Graph-based Algorithms with Graph Metric Embeddings ACL 2019 Markov Properties of Discrete Determinantal Point Processes AISTATS 2019 Modeling both Context- and Speaker-Sensitive Dependence for Emotion Detection in Multi-speaker Conversations IJCAI 2019 Modeling Conversation Structure and Temporal Dynamics for Jointly Predicting Rumor Stance and Veracity EMNLP 2019 (Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs NeurIPS 2019 Network Formation under Random Attack and Probabilistic Spread IJCAI 2019 Noise-Resilient Similarity Preserving Network Embedding for Social Networks IJCAI 2019 On Differentially Private Graph Sparsification and Applications NeurIPS 2019 On Learning Graphs with Edge-Detecting Queries ALT 2019 On the Tree Representations of Dichotomous Preferences IJCAI 2019 Optimal Surveillance of Covert Networks by Minimizing Inverse Geodesic Length AAAI 2019 Optimizing Generalized PageRank Methods for Seed-Expansion Community Detection NeurIPS 2019 PAC Learnability of Node Functions in Networked Dynamical Systems ICML 2019 Pivotal Relationship Identification: The K-Truss Minimization Problem IJCAI 2019 Planting trees in graphs, and finding them back COLT 2019 Probabilistic Watershed: Sampling all spanning forests for seeded segmentation and semi-supervised learning NeurIPS 2019 PTB Graph Parsing with Tree Approximation ACL 2019 Random Clique Covers for Graphs with Local Density and Global Sparsity UAI 2019 Random Walk Decay Centrality AAAI 2019 Random Walks on Hypergraphs with Edge-Dependent Vertex Weights ICML 2019 Reachability and Coverage Planning for Connected Agents IJCAI 2019 Reasoning Visual Dialogs With Structural and Partial Observations CVPR 2019 Relation Structure-Aware Heterogeneous Information Network Embedding AAAI 2019 REM: From Structural Entropy to Community Structure Deception NeurIPS 2019