Graph Theory

Computing (1+epsilon)-Approximate Degeneracy in Sublinear Time IJCAI 2023 Computing Twin-width with SAT and Branch & Bound IJCAI 2023 Counting Background Knowledge Consistent Markov Equivalent Directed Acyclic Graphs UAI 2023 D2Match: Leveraging Deep Learning and Degeneracy for Subgraph Matching ICML 2023 Deep Learning of Partial Graph Matching via Differentiable Top-K CVPR 2023 Detection-Recovery and Detection-Refutation Gaps via Reductions from Planted Clique COLT 2023 Diffusion Model for Graph Inverse Problems: Towards Effective Source Localization on Complex Networks NeurIPS 2023 Directed Acyclic Graph Structure Learning from Dynamic Graphs AAAI 2023 Directed Graphical Models and Causal Discovery for Zero-Inflated Data CLeaR 2023 Distributed Community Detection in Large Networks JMLR 2023 Do we become wiser with time? On causal equivalence with tiered background knowledge UAI 2023 Efficient Algorithms for Exact Graph Matching on Correlated Stochastic Block Models with Constant Correlation ICML 2023 Efficient Enumeration of Markov Equivalent DAGs AAAI 2023 Efficient Graph Field Integrators Meet Point Clouds ICML 2023 Equivariant Spatio-Temporal Attentive Graph Networks to Simulate Physical Dynamics NeurIPS 2023 Establishing Markov equivalence in cyclic directed graphs UAI 2023 Evaluating Robustness and Uncertainty of Graph Models Under Structural Distributional Shifts NeurIPS 2023 Exact Inference in High-order Structured Prediction ICML 2023 Exact recovery and Bregman hard clustering of node-attributed Stochastic Block Model NeurIPS 2023 Expectation-Complete Graph Representations with Homomorphisms ICML 2023 Exploring Graph Theory Methods For the Analysis of Pronunciation Variation in Spontaneous Speech Interspeech 2023 Exploring Structural Similarity in Fitness Landscapes via Graph Data Mining: A Case Study on Number Partitioning Problems IJCAI 2023 Exposing the Self-Supervised Space-Time Correspondence Learning via Graph Kernels AAAI 2023 Factorization of the Partial Covariance in Singly-Connected Path Diagrams CLeaR 2023 Faster approximate subgraph counts with privacy NeurIPS 2023