David F. Gleich
Orcid: 0000-0002-8107-6474Affiliations:
- Purdue University, Department of Computer Science, West Lafayette, IN, USA
According to our database1,
David F. Gleich
authored at least 125 papers
between 2004 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on twitter.com
-
on orcid.org
-
on github.com
On csauthors.net:
Bibliography
2024
A flexible PageRank-based graph embedding framework closely related to spectral eigenvector embeddings.
J. Appl. Comput. Topol., October, 2024
A spatial hypergraph model where epidemic spread demonstrates clear higher-order effects.
CoRR, 2024
Suboptimality bounds for trace-bounded SDPs enable a faster and scalable low-rank SDP solver SDPLR+.
CoRR, 2024
CoRR, 2024
Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods.
Proceedings of the ACM on Web Conference 2024, 2024
2023
SIAM J. Matrix Anal. Appl., September, 2023
Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance.
SIAM Rev., February, 2023
Multi-scale Local Network Structure Critically Impacts Epidemic Spread and Interventions.
CoRR, 2023
Theoretical bounds on the network community profile from low-rank semi-definite programming.
CoRR, 2023
Theoretical Bounds on the Network Community Profile from Low-rank Semi-definite Programming.
Proceedings of the International Conference on Machine Learning, 2023
2022
Proceedings of the Sixteenth International AAAI Conference on Web and Social Media, 2022
2021
ACM Trans. Parallel Comput., 2021
CoRR, 2021
Proceedings of the WWW '21: The Web Conference 2021, 2021
2020
Soc. Netw. Anal. Min., 2020
Addressing Computational Bottlenecks in Higher-Order Graph Matching with Tensor Kronecker Product Structure.
CoRR, 2020
Parameterized Objectives and Algorithms for Clustering Bipartite Graphs and Hypergraphs.
CoRR, 2020
Classes of preferential attachment and triangle preferential attachment models with power-law spectra.
J. Complex Networks, 2020
Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020
Proceedings of the SIAM Workshop on Combinatorial Scientific Computing, 2020
Strongly local p-norm-cut algorithms for semi-supervised learning and local graph clustering.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020
Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020
2019
SIAM J. Math. Data Sci., 2019
Coin-Flipping, Ball-Dropping, and Grass-Hopping for Generating Random Graphs from Matrices of Edge Probabilities.
SIAM Rev., 2019
SIAM J. Matrix Anal. Appl., 2019
IEEE Trans. Pattern Anal. Mach. Intell., 2019
Triangle Preferential Attachment Has Power-law Degrees and Eigenvalues; Eigenvalues Are More Stable to Network Sampling.
CoRR, 2019
Bioinform., 2019
Proceedings of the World Wide Web Conference, 2019
Proceedings of the World Wide Web Conference, 2019
Proceedings of the 2019 SIAM International Conference on Data Mining, 2019
Proceedings of the Complex Networks and Their Applications VIII, 2019
Proceedings of the Complex Networks and Their Applications VIII, 2019
Proceedings of the ASONAM '19: International Conference on Advances in Social Networks Analysis and Mining, 2019
2018
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018
Proceedings of the Algorithms and Models for the Web Graph - 15th International Workshop, 2018
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018
Proceedings of the IEEE International Conference on Data Mining, 2018
2017
Triangular Alignment (TAME): A Tensor-Based Approach for Higher-Order Network Alignment.
IEEE ACM Trans. Comput. Biol. Bioinform., 2017
Unifying Sparsest Cut, Cluster Deletion, and Modularity Clustering Objectives with Correlation Clustering.
CoRR, 2017
AptRank: an adaptive PageRank model for protein function prediction on bi-relational graphs.
Bioinform., 2017
Proceedings of the 26th International Conference on World Wide Web, 2017
Proceedings of the 2017 SIAM International Conference on Data Mining, 2017
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017
Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, 2017
2016
IEEE Trans. Knowl. Data Eng., 2016
Current and Future Challenges in Mining Large Networks: Report on the Second SDM Workshop on Mining Networks and Graphs.
SIGKDD Explor., 2016
A parallel min-cut algorithm using iteratively reweighted least squares targeting at problems with floating-point edge weights.
Parallel Comput., 2016
Proceedings of the Algorithms and Models for the Web Graph - 13th International Workshop, 2016
Proceedings of the 2016 SIAM International Conference on Data Mining, 2016
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016
Proceedings of the 33nd International Conference on Machine Learning, 2016
Proceedings of the 2016 IEEE International Conference on Big Data (IEEE BigData 2016), 2016
2015
SIAM J. Sci. Comput., 2015
Internet Math., 2015
Proceedings of the Algorithms and Models for the Web Graph - 12th International Workshop, 2015
Proceedings of the 2015 SIAM International Conference on Data Mining, Vancouver, BC, Canada, April 30, 2015
Proceedings of the 2015 SIAM International Conference on Data Mining, Vancouver, BC, Canada, April 30, 2015
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015
Differential flux balance analysis of quantitative proteomic data on protein interaction networks.
Proceedings of the 2015 IEEE Global Conference on Signal and Information Processing, 2015
2014
SIAM J. Sci. Comput., 2014
Internet Math., 2014
Proceedings of the 23rd International World Wide Web Conference, 2014
Scalable Methods for Nonnegative Matrix Factorizations of Near-separable Tall-and-skinny Matrices.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014
Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014
Anti-differentiating approximation algorithms: A case study with min-cuts, spectral, and flow.
Proceedings of the 31th International Conference on Machine Learning, 2014
2013
ACM Trans. Knowl. Discov. Data, 2013
Numer. Linear Algebra Appl., 2013
A Fast Parallel Maximum Clique Algorithm for Large Sparse Graphs and Temporal Strong Components
CoRR, 2013
A Fast Relaxation Method for Computing a Column of the Matrix Exponential of Stochastic Matrices from Large, Sparse Networks.
CoRR, 2013
A Nearly-Sublinear Method for Approximating a Column of the Matrix Exponential for Matrices from Large, Sparse Networks.
Proceedings of the Algorithms and Models for the Web Graph - 10th International Workshop, 2013
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013
Proceedings of the 2013 IEEE International Conference on Big Data (IEEE BigData 2013), 2013
2012
Internet Math., 2012
Internet Math., 2012
What if CLIQUE were fast? Maximum Cliques in Information Networks and Strong Components in Temporal Networks
CoRR, 2012
Proceedings of the Fifth International Conference on Web Search and Web Data Mining, 2012
Proceedings of the Algorithms and Models for the Web Graph - 9th International Workshop, 2012
Proceedings of the SC Conference on High Performance Computing Networking, 2012
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods.
Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012
Proceedings of the 2012 IEEE International Conference on Acoustics, 2012
2011
A Factorization of the Spectral Galerkin System for Parameterized Matrix Equations: Derivation and Applications.
SIAM J. Sci. Comput., 2011
CoRR, 2011
Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011
2010
SIAM J. Matrix Anal. Appl., 2010
Tracking the random surfer: empirically measured teleportation parameters in PageRank.
Proceedings of the 19th International Conference on World Wide Web, 2010
Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks.
Proceedings of the Algorithms and Models for the Web-Graph - 7th International Workshop, 2010
2009
Proceedings of the ICDM 2009, 2009
2008
2007
Internet Math., 2007
Using Polynomial Chaos to Compute the Influence of Multiple Random Surfers in the PageRank Model.
Proceedings of the Algorithms and Models for the Web-Graph, 5th International Workshop, 2007
Three results on the PageRank vector: eigenstructure, sensitivity, and the derivative.
Proceedings of the Web Information Retrieval and Linear Algebra Algorithms, 11.02., 2007
2004
Proceedings of the 4th IEEE International Conference on Data Mining (ICDM 2004), 2004