# Ioannis Koutis

Ioannis Koutis

Associate Professor, Computer Science

4105 Guttenberg Information Technologies Center

About Me

Ioannis Koutis is an Associate Professor of Computer Science at the New Jersey Institute of Technology. His work includes fast linear system solvers and algorithms for network partitioning and sparsification. These algorithms are capable of handling very large networks and they have found practical applications in various contexts, including Machine Learning, Electronic Design Automation, and Computational Biology. He has also introduced a general 'algebraic fingerprints' method that has enabled the design of faster exact and parameterized algorithms for a multitude of computationally hard problems. He has received support from the National Science Foundation, including an NSF CAREER award.

Education

Ph.D.; Carnegie Mellon University; Computer Science; 2007

Diploma; University of Patras; Computer Engineering and Informatics; 1998

Diploma; University of Patras; Computer Engineering and Informatics; 1998

Awards & Honors

2020 Excellence in Teaching Award, Ying Wu College of Computing, NJIT

2017 ICALP Best Paper Award, European Association for Theoretical Computer Science

2014 Visiting Faculty, Institute of Computational and Experimental Mathematics

2014 Visiting Faculty, Simon's Institute for the Theory of Computing

2012 NSF CAREER award, National Science Foundation

2017 ICALP Best Paper Award, European Association for Theoretical Computer Science

2014 Visiting Faculty, Institute of Computational and Experimental Mathematics

2014 Visiting Faculty, Simon's Institute for the Theory of Computing

2012 NSF CAREER award, National Science Foundation

Website

2023 Spring Courses

DS 677 - DEEP LEARNING

CS 725 - INDEPENDENT STUDY I

CS 701B - MASTER'S THESIS

CS 726 - INDEPENDENT STUDY II

CS 488 - INDEPENDENT STUDY IN CS

CS 700B - MASTER'S PROJECT

DS 675 - MACHINE LEARNING

CS 792 - PRE-DOCTORAL RESEARCH

CS 790A - DOCT DISSERTATION & RES

CS 725 - INDEPENDENT STUDY I

CS 701B - MASTER'S THESIS

CS 726 - INDEPENDENT STUDY II

CS 488 - INDEPENDENT STUDY IN CS

CS 700B - MASTER'S PROJECT

DS 675 - MACHINE LEARNING

CS 792 - PRE-DOCTORAL RESEARCH

CS 790A - DOCT DISSERTATION & RES

Past Courses

CS 435: ADV DATA STRUCT-ALG DES

CS 610: DATA STRUCTURE & ALG

CS 611: COMPUTABILITY & COMPLEX

CS 675: MACHINE LEARNING

CS 677: DEEP LEARNING

CS 610: DATA STRUCTURE & ALG

CS 611: COMPUTABILITY & COMPLEX

CS 675: MACHINE LEARNING

CS 677: DEEP LEARNING

Research Interests

Algorithm design;

Spectral graph theory;

Algebraic algorithms for computationally hard problems;

Applications in Graph Machine Learning and Deep Learning.

Spectral graph theory;

Algebraic algorithms for computationally hard problems;

Applications in Graph Machine Learning and Deep Learning.

Journal Article

Koutis, Ioannis, & Miller, Gary, & Peng, Richard (2023). A Generalized Cheeger Inequality.

Koutis, Ioannis, & Aghaieabiane, Niloofar (2021). A novel calibration step in gene co-expression network construction.

Koutis, Ioannis, & Levin, Alex, & Peng, Richard (2016). Faster spectral sparsification and numerical algorithms for SDD matrices.

Koutis, Ioannis, & Williams, Ryan (2016). Limits and Applications of Group Algebras for Parameterized Problems.

Cucuringu, Mihai, & Koutis, Ioannis, & Chawla, Sanjay, & Miller, Gary, & Peng, Richard (2016). Scalable Constrained Clustering: A Generalized Spectral Method.

*Linear Algebra and its Applications*,Koutis, Ioannis, & Aghaieabiane, Niloofar (2021). A novel calibration step in gene co-expression network construction.

*Frontiers in Bioinformatics*,*1*,Koutis, Ioannis, & Levin, Alex, & Peng, Richard (2016). Faster spectral sparsification and numerical algorithms for SDD matrices.

*ACM Transactions on Algorithms (TALG)*,*12*(2), 17.Koutis, Ioannis, & Williams, Ryan (2016). Limits and Applications of Group Algebras for Parameterized Problems.

*ACM Trans. Algorithms*,*12*(3), 31:1--31:18.Cucuringu, Mihai, & Koutis, Ioannis, & Chawla, Sanjay, & Miller, Gary, & Peng, Richard (2016). Scalable Constrained Clustering: A Generalized Spectral Method.

*CoRR*,*abs/1601.04746*, SHOW MORE

Koutis, Ioannis, & Xu, Shen (2016). Simple parallel and distributed algorithms for spectral graph sparsification.

Koutis, Ioannis, & Williams, Ryan (2015). Algebraic fingerprints for faster algorithms.

Koutis, Ioannis (2014). A Simple Parallel Algorithm for Spectral Sparsification.

Koutis, Ioannis, & Miller, G., & Peng, R. (2014). Approaching Optimality for Solving SDD Linear Systems.

Blelloch, Guy, & Gupta, Anupam, & Koutis, Ioannis, & Miller, Gary, & Peng, Richard, & Tangwongsan, Kanat (2014). Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs.

Koutis, Ioannis, & Miller, Gary, & Peng, Richard (2012). A fast solver for a class of linear systems.

Koutis, Ioannis (2012). Constrained multilinear detection for faster functional motif discovery.

Koutis, Ioannis (2012). Constrained multilinear detection for faster functional motif discovery.

Koutis, Ioannis, & Levin, Alex, & Peng, Richard (2012). Faster spectral sparsification and numerical algorithms for SDD matrices.

Koutis, Ioannis, & Miller, Gary, & Tolliver, David (2011). Combinatorial preconditioners and multilevel solvers for problems in computer vision and image processing.

Tsourakakis, Charalampos, & Drineas, Petros, & Michelakis, Eirinaios, & Koutis, Ioannis, & Faloutsos, Christos (2011). Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation.

Koutis, Ioannis, & Williams, Ryan (2009). Limits and applications of group algebras for parameterized problems.

Koutis, Ioannis (2008). Faster algebraic algorithms for path and packing problems.

Koutis, Ioannis (2006). Parameterized complexity and improved inapproximability for computing the largest j-simplex in a V-polytope.

Koutis, Ioannis (2005). A faster parameterized algorithm for set packing.

Koutis, Ioannis (2003). On the hardness of approximate multivariate integration.

*ACM Transactions on Parallel Computing (TOPC)*,*3*(2), 14.Koutis, Ioannis, & Williams, Ryan (2015). Algebraic fingerprints for faster algorithms.

*Communications of the ACM*,*59*(1), 98--105.Koutis, Ioannis (2014). A Simple Parallel Algorithm for Spectral Sparsification.

*CoRR*,*abs/1402.3851*,Koutis, Ioannis, & Miller, G., & Peng, R. (2014). Approaching Optimality for Solving SDD Linear Systems.

*SIAM Journal on Computing*,*43*(1), 337-354.Blelloch, Guy, & Gupta, Anupam, & Koutis, Ioannis, & Miller, Gary, & Peng, Richard, & Tangwongsan, Kanat (2014). Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs.

*Theory Comput. Syst.*,*55*(3), 521--554.Koutis, Ioannis, & Miller, Gary, & Peng, Richard (2012). A fast solver for a class of linear systems.

*Communications of the ACM*,*55*(10), 99--107.Koutis, Ioannis (2012). Constrained multilinear detection for faster functional motif discovery.

*Inf. Process. Lett.*,*112*(22), 889--892.Koutis, Ioannis (2012). Constrained multilinear detection for faster functional motif discovery.

*arXiv preprint arXiv:1206.3483*,Koutis, Ioannis, & Levin, Alex, & Peng, Richard (2012). Faster spectral sparsification and numerical algorithms for SDD matrices.

*CoRR*,*abs/1209.5821*,Koutis, Ioannis, & Miller, Gary, & Tolliver, David (2011). Combinatorial preconditioners and multilevel solvers for problems in computer vision and image processing.

*Computer Vision and Image Understanding*,Tsourakakis, Charalampos, & Drineas, Petros, & Michelakis, Eirinaios, & Koutis, Ioannis, & Faloutsos, Christos (2011). Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation.

*Social Network Analysis and Mining*, 1--7.Koutis, Ioannis, & Williams, Ryan (2009). Limits and applications of group algebras for parameterized problems.

*International Colloquium on Automata, Languages and Programming (ICALP)*, 653--664.Koutis, Ioannis (2008). Faster algebraic algorithms for path and packing problems.

*International Colloquium on Automata, Languages and Programming (ICALP)*, 575--586.Koutis, Ioannis (2006). Parameterized complexity and improved inapproximability for computing the largest j-simplex in a V-polytope.

*Information Processing Letters*,*100*(1), 8--13.Koutis, Ioannis (2005). A faster parameterized algorithm for set packing.

*Information Processing Letters*,*94*(1), 7--9.Koutis, Ioannis (2003). On the hardness of approximate multivariate integration.

*RANDOM-APPROX*, 122--128.COLLAPSE

Conference Proceeding

SpecPart: A supervised spectral framework for hypergraph partitioning solution improvement

ACM/IEEE International Conference on Computer-Aided Design (ICCAD), October (4th Quarter/Autumn) 2022

Ensemble Learning as a Peer Process

Agent Learning in Open-Endedness (ALOE), ICLR 2022 Workshop , April (2nd Quarter/Spring) 2022

Peer Learning Through Targeted Dynamic Groups Formation

2021

Spectral hypergraph partitioning revisited

SIAM Conference on Applied and Computational Discrete Algorithms, July (3rd Quarter/Summer) 2021

Spectral Modification for Improved Spectral Clustering

Thirty-third Conference on Neural Information Processing Systems, December 2019

ACM/IEEE International Conference on Computer-Aided Design (ICCAD), October (4th Quarter/Autumn) 2022

Ensemble Learning as a Peer Process

Agent Learning in Open-Endedness (ALOE), ICLR 2022 Workshop , April (2nd Quarter/Spring) 2022

Peer Learning Through Targeted Dynamic Groups Formation

2021

Spectral hypergraph partitioning revisited

SIAM Conference on Applied and Computational Discrete Algorithms, July (3rd Quarter/Summer) 2021

Spectral Modification for Improved Spectral Clustering

Thirty-third Conference on Neural Information Processing Systems, December 2019

SHOW MORE

Improved large-scale graph learning through ridge spectral sparsification

International Conference of Machine Learning (ICML), July (3rd Quarter/Summer) 2018

Spectrally Robust Graph Isomorphism

International Colloquium of Automata, Languages and Programming (ICALP), July (3rd Quarter/Summer) 2018

Directed Hamiltonicity and Out-Branchings via Generalized Laplacians

International Colloquium of Automata, Languages and Programming (ICALP), July (3rd Quarter/Summer) 2017

On fully dynamic graph sparsifiers

Foundations of Computer Science (FOCS), 2016

Simple and scalable constrained clustering: a generalized spectral method

International Conference on Artificial Intelligence and Statistics, 2016

Spanning edge centrality: Large-scale computation and applications

The WWW conference, 2015

Simple parallel and distributed algorithms for spectral graph sparsification

ACM, 2014

Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices

Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2012

Train marshalling is fixed parameter tractable

2012

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

IEEE Computer Society, Foundations of Computer Science (FOCS), 2011

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

2011

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

Symposium on Parallel Algorithms and Architectures, 2011

Approaching optimality for solving SDD linear systems

Foundations of Computer Science (FOCS), 2010

Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid

IEEE Scientific Computing, 2010

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

International Symposium of Visual Computing (ISVC), 2009

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

IEEE Computer Society, 2009

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

Symposium on Parallel Algorithms and Architectures (SPAA), 2008

A linear work, O (n^1/6) time, parallel algorithm for solving planar Laplacians

Symposium On Discrete Algorithms (SODA), 2007

Towards the effective parallel computation of matrix pseudospectra

International Conference on Supercomputing , 2001

International Conference of Machine Learning (ICML), July (3rd Quarter/Summer) 2018

Spectrally Robust Graph Isomorphism

International Colloquium of Automata, Languages and Programming (ICALP), July (3rd Quarter/Summer) 2018

Directed Hamiltonicity and Out-Branchings via Generalized Laplacians

International Colloquium of Automata, Languages and Programming (ICALP), July (3rd Quarter/Summer) 2017

On fully dynamic graph sparsifiers

Foundations of Computer Science (FOCS), 2016

Simple and scalable constrained clustering: a generalized spectral method

International Conference on Artificial Intelligence and Statistics, 2016

Spanning edge centrality: Large-scale computation and applications

The WWW conference, 2015

Simple parallel and distributed algorithms for spectral graph sparsification

ACM, 2014

Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices

Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2012

Train marshalling is fixed parameter tractable

2012

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

IEEE Computer Society, Foundations of Computer Science (FOCS), 2011

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

2011

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

Symposium on Parallel Algorithms and Architectures, 2011

Approaching optimality for solving SDD linear systems

Foundations of Computer Science (FOCS), 2010

Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid

IEEE Scientific Computing, 2010

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

International Symposium of Visual Computing (ISVC), 2009

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

IEEE Computer Society, 2009

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

Symposium on Parallel Algorithms and Architectures (SPAA), 2008

A linear work, O (n^1/6) time, parallel algorithm for solving planar Laplacians

Symposium On Discrete Algorithms (SODA), 2007

Towards the effective parallel computation of matrix pseudospectra

International Conference on Supercomputing , 2001

COLLAPSE

Chapter

Koutis, Ioannis (2016). Multilinear Monomial Detection,

*Encyclopedia of Algorithms*. (pp. 1375--1378). Encyclopedia of AlgorithmsConference Abstract

Parallel Inclusion-Exclusion Algorithm on Revealing Pseudospectra

5th Conference on Numerical Analysis (NumAn), October (4th Quarter/Autumn) 2012

The combinatorial multigrid solver

2009

Automatic multiple retinal layer segmentation in spectral domain oct scans via spectral rounding

Association for Research in Vision and Opthalmology (ARVO), 2008

5th Conference on Numerical Analysis (NumAn), October (4th Quarter/Autumn) 2012

The combinatorial multigrid solver

2009

Automatic multiple retinal layer segmentation in spectral domain oct scans via spectral rounding

Association for Research in Vision and Opthalmology (ARVO), 2008

Other

Combinatorial and algebraic algorithms for optimal multilevel algorithms

PhD thesis, Carnegie Mellon University, Pittsburgh, 2007

PhD thesis, Carnegie Mellon University, Pittsburgh, 2007

Technical Report

Dimensionality restrictions on sums over Zd

2007

2007

Professional

WSDM Conference

Committee Member, 2022

SIGKDD Conference

Committee Member, 2022

2021 WebConf

Committee Member, 2021

National Science Foundation

Reviewer, Grant Proposal, 2021

2020 WebConf

Committee Member

AAAI Conference

Committee Member, 2019

Committee Member, 2022

SIGKDD Conference

Committee Member, 2022

2021 WebConf

Committee Member, 2021

National Science Foundation

Reviewer, Grant Proposal, 2021

2020 WebConf

Committee Member

AAAI Conference

Committee Member, 2019