conftrace_
← Mathematics
Mathematics & Optimization › Mathematics ›

Graph Theory

1,376 papers

Papers per year

20
59
149
67
'10
'15
'20
'25

Papers

Message-Passing Algorithms for Quadratic Minimization JMLR 2013
Supervised Feature Selection in Graphs with Path Coding Penalties and Network Flows JMLR 2013
Stationary-Sparse Causality Network Learning JMLR 2013
Lovasz theta function, SVMs and Finding Dense Subgraphs JMLR 2013
Topology Constraints in Graphical Models NIPS 2012
Bayesian nonparametric models for bipartite graphs NIPS 2012
Clustering Sparse Graphs NIPS 2012
Latent Graphical Model Selection: Efficient Methods for Locally Tree-like Graphs NIPS 2012
Fusion with Diffusion for Robust Visual Tracking NIPS 2012
Learning with Partially Absorbing Random Walks NIPS 2012
A Convex Formulation for Learning Scale-Free Networks via Submodular Relaxation NIPS 2012
Structured Learning of Gaussian Graphical Models NIPS 2012
Structure estimation for discrete graphical models: Generalized covariance matrices and their inverses NIPS 2012
Link Prediction in Graphs with Autoregressive Features NIPS 2012
On Triangular versus Edge Representations --- Towards Scalable Modeling of Networks NIPS 2012
The Lovász ϑ function, SVMs and finding large dense subgraphs NIPS 2012
Fiedler Random Fields: A Large-Scale Spectral Approach to Statistical Network Modeling NIPS 2012
Learning Networks of Heterogeneous Influence NIPS 2012
Submodular-Bregman and the Lovász-Bregman Divergences with Applications NIPS 2012
Online Sum-Product Computation Over Trees NIPS 2012
A Convex-Concave Relaxation Procedure Based Subgraph Matching Algorithm ACML 2012
Discriminative Mixtures of Sparse Latent Fields for Risk Management AISTATS 2012
Graphlet decomposition of a weighted network AISTATS 2012
Detecting Network Cliques with Radon Basis Pursuit AISTATS 2012
High-Dimensional Structured Feature Screening Using Binary Markov Random Fields AISTATS 2012