Co-occurring keywords · papers mentioning both
Papers
Extreme k-Center Clustering
AAAI 2021
Finding Diverse Trees, Paths, and More
AAAI 2021
Fractional Matchings under Preferences: Stability and Optimality
IJCAI 2021
Generalized Kings and Single-Elimination Winners in Random Tournaments
IJCAI 2021
Generalized parametric path problems
UAI 2021
Graph-theoretic Properties of the Class of Phonological Neighbourhood Networks
NAACL 2021
Iterative Connecting Probability Estimation for Networks
NeurIPS 2021
Learning Shared Subgraphs in Ising Model Pairs
AISTATS 2021
Local Search for Diversified Top-k s-plex Search Problem (Student Abstract)
AAAI 2021
Majority Opinion Diffusion in Social Networks: An Adversarial Approach
AAAI 2021
Majority Vote in Social Networks: Make Random Friends or Be Stubborn to Overpower Elites
IJCAI 2021
Minimizing Polarization and Disagreement in Social Networks via Link Recommendation
NeurIPS 2021
On Minimizing the Number of Running Buffers for Tabletop Rearrangement
RSS 2021
PTN: A Poisson Transfer Network for Semi-supervised Few-shot Learning
AAAI 2021
Sampling Partial Acyclic Orientations in Chordal Graphs by the Lovasz Local Lemma (Student Abstract)
AAAI 2021
Successor-Invariant First-Order Logic on Classes of Bounded Degree (Extended Abstract)
IJCAI 2021
Theory of Spectral Method for Union of Subspaces-Based Random Geometry Graph
ICML 2021
The Price of Connectivity in Fair Division
AAAI 2021
Active Learning in the Geometric Block Model
AAAI 2020
AI Feynman 2.0: Pareto-optimal symbolic regression exploiting graph modularity
NeurIPS 2020
A Numerical Measure of the Instability of Mapper-Type Algorithms
JMLR 2020
Community detection in sparse time-evolving graphs with a dynamical Bethe-Hessian
NeurIPS 2020
Convexity of b-matching Games
IJCAI 2020
Correlation Clustering with Asymmetric Classification Errors
ICML 2020
Enumerating Maximal k-Plexes with Worst-Case Time Guarantee
AAAI 2020