# Ioannis Koutis

According to our database

Collaborative distances:

^{1}, Ioannis Koutis authored at least 31 papers between 2001 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Improved Large-Scale Graph Learning through Ridge Spectral Sparsification.

Proceedings of the 35th International Conference on Machine Learning, 2018

Spectrally Robust Graph Isomorphism.

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Directed Hamiltonicity and Out-Branchings via Generalized Laplacians.

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Multilinear Monomial Detection.

Encyclopedia of Algorithms, 2016

Simple Parallel and Distributed Algorithms for Spectral Graph Sparsification.

TOPC, 2016

Faster Spectral Sparsification and Numerical Algorithms for SDD Matrices.

ACM Trans. Algorithms, 2016

Algebraic fingerprints for faster algorithms.

Commun. ACM, 2016

On Fully Dynamic Graph Sparsifiers.

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

Simple and Scalable Constrained Clustering: a Generalized Spectral Method.

Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

2015

Spanning Edge Centrality: Large-scale Computation and Applications.

Proceedings of the 24th International Conference on World Wide Web, 2015

2014

Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs.

Theory Comput. Syst., 2014

Simple parallel and distributed algorithms for spectral graph sparsification.

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

2012

Constrained multilinear detection for faster functional motif discovery.

Inf. Process. Lett., 2012

A fast solver for a class of linear systems.

Commun. ACM, 2012

Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices.

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Train Marshalling Is Fixed Parameter Tractable.

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

2011

Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation.

Social Netw. Analys. Mining, 2011

Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs.

Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

A Nearly-m log n Time Solver for SDD Linear Systems.

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid.

Proceedings of the Conference on High Performance Computing Networking, 2010

Approaching Optimality for Solving SDD Linear Systems.

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2009

Combinatorial Preconditioners and Multilevel Solvers for Problems in Computer Vision and Image Processing.

Proceedings of the Advances in Visual Computing, 5th International Symposium, 2009

Limits and Applications of Group Algebras for Parameterized Problems.

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Spectral Counting of Triangles in Power-Law Networks via Element-Wise Sparsification.

Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining, 2009

2008

Graph partitioning into isolated, high conductance clusters: theory, computation and applications to preconditioning.

Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Faster Algebraic Algorithms for Path and Packing Problems.

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

A linear work, O(n

^{1/6}) time, parallel algorithm for solving planar Laplacians.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

Parameterized complexity and improved inapproximability for computing the largest j-simplex in a V-polytope.

Inf. Process. Lett., 2006

2005

A faster parameterized algorithm for set packing.

Inf. Process. Lett., 2005

2003

On the Hardness of Approximate Multivariate Integration.

Proceedings of the Approximation, 2003

2001

Towards the effective parallel computation of matrix pseudospectra.

Proceedings of the 15th international conference on Supercomputing, 2001