| 2018 | KI | Condorcet's Jury Theorem for Consensus Clustering. | Brijnesh J. Jain |
| 2018 | SDM | Exact Mean Computation in Dynamic Time Warping Spaces. | Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz |
| 2014 | ICPR | Margin Perceptrons for Graphs. | Brijnesh J. Jain |
| 2014 | SSPR | Flip-Flop Sublinear Models for Graphs. | Brijnesh J. Jain |
| 2013 | CAIP | Mixtures of Radial Densities for Clustering Graphs. | Brijnesh J. Jain |
| 2013 | CSCW | User-centric evaluation of a K-furthest neighbor collaborative filtering recommender algorithm. | Alan Said, Ben Fields, Brijnesh J. Jain, Sahin Albayrak |
| 2013 | CSCW | A 3D approach to recommender system evaluation. | Alan Said, Brijnesh J. Jain, Sahin Albayrak |
| 2012 | IUI | KMulE: a framework for user-based comparison of recommender algorithms. | Alan Said, Ernesto William De Luca, Benjamin Kille, Brijnesh J. Jain, Immo Micus, Sahin Albayrak |
| 2012 | SAC | Analyzing weighting schemes in collaborative filtering: cold start, post cold start and power users. | Alan Said, Brijnesh J. Jain, Sahin Albayrak |
| 2012 | SIGIR | Estimating the magic barrier of recommender systems: a user study. | Alan Said, Brijnesh J. Jain, Sascha Narr, Till Plumbaum, Sahin Albayrak, Christian Scheel |
| 2010 | ICPR | Consistent Estimator of Median and Mean Graph. | Brijnesh J. Jain, Klaus Obermayer |
| 2010 | SSPR | Large Sample Statistics in the Domain of Graphs. | Brijnesh J. Jain, Klaus Obermayer |
| 2010 | SSPR | Learning Graph Quantization. | Brijnesh J. Jain, S. Deepak Srinivasan, Alexander Tissen, Klaus Obermayer |
| 2009 | CAIP | Algorithms for the Sample Mean of Graphs. | Brijnesh J. Jain, Klaus Obermayer |
| 2009 | IJCNN | Bimal: Bipartite matching alignment for the contact map overlap problem. | Brijnesh J. Jain, Klaus Obermayer |
| 2009 | IJCNN | Multiple alignment of contact maps. | Brijnesh J. Jain, Brijnesh Stehr, Michael Lappe, Klaus Obermayer |
| 2008 | IJCNN | On the sample mean of graphs. | Brijnesh J. Jain, Klaus Obermayer |
| 2004 | ESANN | SVM learning with the SH inner product. | Peter Geibel, Brijnesh J. Jain, Fritz Wysotzki |
| 2004 | ESANN | Neural methods for non-standard data. | Barbara Hammer, Brijnesh J. Jain |
| 2004 | ESANN | The maximum weighted clique problem and Hopfield networks. | Brijnesh J. Jain, Fritz Wysotzki |
| 2004 | IJCNN | Multi-layer perceptron learning in the domain of attributed graphs. | Brijnesh J. Jain, Fritz Wysotzki |
| 2004 | KI | Combining Recurrent Neural Networks and Support Vector Machines for Structural Pattern Recognition. | Brijnesh J. Jain, Peter Geibel, Fritz Wysotzki |
| 2004 | SSPR | Structural Perceptrons for Attributed Graphs. | Brijnesh J. Jain, Fritz Wysotzki |
| 2003 | ESANN | A Neural Graph Isomorphism Algorithm based on local Invariants. | Brijnesh J. Jain, Fritz Wysotzki |
| 2003 | ESANN | An Associative Memory for the Automorphism Group of Structures. | Brijnesh J. Jain, Fritz Wysotzki |
| 2003 | ICANN | A Novel Neural Network Approach to Solve Exact and Inexact Graph Isomorphism Problems. | Brijnesh J. Jain, Fritz Wysotzki |
| 2003 | IJCNN | Perceptron learning in the domain of graphs. | Brijnesh J. Jain, Fritz Wysotzki |
| 2003 | KI | A k-Winner-Takes-All Classifier for Structured Data. | Brijnesh J. Jain, Fritz Wysotzki |
| 2002 | KI | Fast Winner-Takes-All Networks for the Maximum Clique Problem. | Brijnesh J. Jain, Fritz Wysotzki |
| 2001 | ESANN | On the short-term-memory of WTA nets. | Brijnesh J. Jain, Fritz Wysotzki |
| 2001 | ICANN | Efficient Pattern Discrimination with Inhibitory WTA Nets. | Brijnesh J. Jain, Fritz Wysotzki |