Yiannis Koutis

Publications

  • Hierarchical Mamba Meets Hyperbolic Geometry: A New Paradigm for Structured Language Embeddings
    S. Rajendra Patil, A. Parmanand Pandey, I. Koutis, M. Xu
    TMLR 2026
    arXiv Link
  • HiPerMotif: Novel parallel subgraph isomorphism in large-scale property graphs
    M. Dindoost, O. A. Rodriguez, B. Bryg, I. Koutis, D. A. Bader
    IEEE High Performance Extreme Computing Conference (HPEC) 2025
    arXiv Link
  • TGB 2.0: A Benchmark for Learning on Temporal Knowledge Graphs and Heterogeneous Graphs
    J. Gastinger, S. Huang, M. Galkin, E. Loghmani, A. Parviz, F. Poursafaei, J. Danovitch, E. Rossi, I. Koutis, H. Stuckenschmidt, R. Rabbany, G. Rabusseau
    NeurIPS 2024
    arXiv Link
  • SGCP: a spectral self-learning method for clustering genes in co-expression networks
    N. Aghaieabiane, I. Koutis
    BMC Bioinformatics 2024
    Link
  • An Open-Source Constraints-Driven General Partitioning Multi-Tool for VLSI Physical Design
    I. Bustany, G. Gasparyan, A. Kahng, I. Koutis, B. Pramanik, and Z. Wang
    ICCAD 2023
    PDF
  • K-SpecPart: Supervised Embedding Algorithms and Cut Overlay for Improved Hypergraph Partitioning
    I. Bustany, G. Gasparyan, A. Kahng, I. Koutis, B. Pramanik, Z. Wang
    IEEE TCAD 2024
    arXiv Link
  • Sidestepping Barriers for Dominating Set in Parameterized Complexity
    I. Koutis, M. Wlodarczyk, M. Zehavi
    IPEC 2023
    arXiv
  • Resource-constrained knowledge diffusion processes inspired by human peer learning
    E. Beikihassan, A. Parviz, N. Aghaieabiane, A. Hoover, I. Koutis
    ECAI 2023 [full oral presentation]
    arXiv
  • A Generalized Cheeger Inequality
    I. Koutis, G. Miller, R. Peng
    Linear Algebra and its Applications
    arXiv
  • SpecPart: A supervised spectral framework for hypergraph partitioning solution improvement
    I. Bustany, A. Kahng, I. Koutis, B. Pramanik, and Z. Wang
    ICCAD 2022
    PDF William J. McCalla Best Paper Award
  • Ensemble Learning as a Peer Process
    E. Beikihassan, A. Hoover, I. Koutis, A. Parviz
    ALOE 2022 (ICLR)
    PDF
  • Peer Learning Through Targeted Dynamic Groups Formation
    D. Wei, I. Koutis, S. Basu-Roy
    ICDE 2021
    PDF
  • Spectral Hypergraph Partitioning Revisited
    I. Koutis, B. Pramanik
    SIAM ACDA 2021 [poster]
    PDF
  • A Novel Calibration Step in Gene Co-Expression Network Construction
    N. Aghaieabiane, I. Koutis
    Frontiers Bioinformatics [short communication]
    Link
  • Spectral Modification of Graphs for Improved Spectral Clustering
    I. Koutis and H. Le
    NeurIPS 2019
    Link
  • Improved Large-Scale Graph Learning through Ridge Spectral Sparsification
    D. Calandriello, I. Koutis, A. Lazaric, M. Valco
    ICML 2018
    arXiv
  • Spectrally Robust Graph Isomorphism
    A. Kolla, I. Koutis, V. Madan, A. K. Sinop
    ICALP 2018
    arXiv
  • Directed Hamiltonicity and Out-Branchings via Generalized Laplacians
    A. Björklund, P. Kaski, I. Koutis
    ICALP 2017
    arXiv Best Paper Award
  • On fully dynamic graph sparsifiers
    I. Abraham, D. Durfee, I. Koutis, S. Krinninger, R. Peng
    FOCS 2016
    arXiv
  • Incremental Spectral Sparsification for Large-Scale Graph-Based Semi-Supervised Learning
    D. Calandriello, I. Koutis, A. Lazaric, M. Valko
    arXiv
    arXiv
  • Algebraic fingerprints for faster algorithms
    I. Koutis, R. Williams
    Communications of the ACM, January 2016
    PDF
  • Scalable Constrained Clustering: A Generalized Spectral Method
    M. Cucuringu, I. Koutis, S. Chawla, G. Miller, R. Peng
    AISTATS 2016
    arXiv
  • Spanning Edge Centrality: Large-scale computations and applications
    C. Mavroforakis, R. Garcia-Lebron, I. Koutis, E. Terzi
    WWW 2015
    PDF
  • Simple parallel and distributed algorithms for spectral graph sparsification
    I. Koutis
    SPAA 2014
    arXiv
  • A fast solver for a class of linear systems
    I. Koutis, G.Miller, R. Peng
    Communications of the ACM
    PDF
  • Faster spectral sparsification and numerical algorithms for SDD matrices
    I. Koutis, A. Levin, R. Peng
    STACS 2012
    arXiv PDF
  • Constrained multilinear detection for faster functional motif discovery
    I. Koutis
    Information Processing Letters 2012
    arXiv
  • Train marshalling is fixed parameter tractable
    L. Brueggeman, M. Fellows, R. Fleischer, M. Lackner, C. Komusiewicz, I. Koutis, A. Pfandler, F. Rosamond
    FUN 2012
    PDF
  • A nearly-m*logn solver for SDD linear systems
    I. Koutis, G. Miller, R. Peng
    FOCS 2011
    arXiv
  • Combinatorial preconditioners and multilevel solvers for problems in computer vision and image processing
    I. Koutis, G. Miller, D. Tolliver
    Computer Vision and Image Understanding 2011 / ISVC 2009
    PDF Conference PDF
  • Near linear-work parallel SDD solvers, low-diameter decomposition and low-stretch subgraphs
    G. Blelloch, I. Koutis, A. Gupta, G. Miller, R. Peng, K. Tangwongsan
    SPAA 2011
    PDF
  • Spectral counting of triangles in power-law networks via element-wise sparsification and triangle-based link recommendation
    C. Tsourakakis, P. Drineas, E. Michelakis, I. Koutis, C. Faloutsos
    Social Network Analysis and Mining / ASONAM 2009
    PDF Conference PDF
  • Approaching optimality for solving SDD systems
    I. Koutis, G. Miller, R. Peng
    FOCS 2010
    arXiv
  • Hierarchical Diagonal Blocking with precision reduction applied to combinatorial multigrid
    G. Blelloch, I. Koutis, G. Miller, K. Tangwongsan
    SC10
    PDF
  • Limits and applications of group algebras for parameterized problems
    I. Koutis and R. Williams
    ICALP 2009
    PDF Original PDF
  • Faster algebraic algorithms for path and packing problems
    I. Koutis
    ICALP 2008
    PDF
  • Graph partitioning into isolated, high conductance clusters: theory, computation and applications to preconditioning
    I. Koutis, G. Miller
    SPAA 2008
    PDF
  • Unassisted Segmentation of Multiple Retinal Layers via Spectral Rounding
    I. Koutis, D. Tolliver, H. Ishikawa, J. Shuman, G. Miller
    ARVO 2008
    PDF
  • Combinatorial and algebraic tools for optimal multilevel algorithms
    I. Koutis
    PhD Thesis, CMU-CS-07-131
    PDF
  • A linear work O(n1/6) time algorithm for solving planar Laplacians
    I. Koutis, G. L. Miller
    SODA 2007
    PDF
  • Parameterized complexity and improved inapproximability for computing the largest j-simplex in a V-polytope
    I. Koutis
    Information Processing Letters 2006
    PDF
  • Dimensionality restrictions on sums over Zpd
    I. Koutis
    Technical Report CMU-CS-07-103
    PDF Related PDF
  • A faster parameterized algorithm for set packing
    I. Koutis
    Information Processing Letters 2005
    PDF
  • On the hardness of approximate multivariate integration
    I. Koutis
    APPROX 2003
    PDF
  • Parallel computation of matrix pseudospectra: a case for load balancing
    C. Bekas, E. Kokiopoulou, I. Koutis and E. Gallopoulos
    ICS 2001
    PDF
  • Spectrum through pseudospectrum
    I. Koutis
    FOCM 1999
    arXiv
  • Exclusion regions and fast estimation of pseudospectra
    I. Koutis
    2003 SIAM annual meeting
    PDF

View full publication list on Google Scholar