Sotiris Kanellopoulos

Theoretical Computer Science PhD Student

National Technical University of Athens Archimedes Research Unit
Email Google Scholar ↗ DBLP ↗ View CV
Portrait of Sotiris Kanellopoulos
Research profile

I am a final-year PhD student in Theoretical Computer Science at the National Technical University of Athens, advised by Aris Pagourtzis. My research focuses on Algorithms, Computational Complexity, Fairness, and Scheduling, and is supported by a PhD fellowship from the Archimedes Research Unit.

During my PhD I have worked on the following topics:

  • Perpetual Scheduling problems
  • Fair Division and Mechanism Design
  • Approximation Schemes for Subset Sum problems
  • Temporal Path and Temporal Cover problems
  • Descriptive and Counting Complexity
  • Parameterized Complexity
  • Subclasses of TFNP
  • Dynamic Connectivity

Publications

  1. The Complexity of Computing Class Probabilities in BID Probabilistic Databases

    S. Kanellopoulos, I. Koutras, and A. Pagourtzis

    arXiv

  2. Temporal Path Covers: Dilworth Properties and Parameterized Complexity

    L. Cioni, S. Kanellopoulos, E. Nemery, A. Pagourtzis, C. Pergaminelis, and M. Vasilakis

    arXiv

  4. EF(X) Orientations: A Parameterized Complexity Perspective

    S. Kanellopoulos, E. Nemery, C. Pergaminelis, M. M. Sotiriou, and M. Vasilakis

    arXivWINE 2026

  5. Hardness, Tractability and Density Thresholds of Finite Pinwheel Scheduling Variants

    S. Kanellopoulos, G. Mitropoulos, C. Pergaminelis, and T. Tolias

    arXivICALP 2026

  6. Beer Path Problems in Temporal Graphs

    A. D'Ascenzo, G. F. Italiano, S. Kanellopoulos, A. Mpanti, A. Pagourtzis, and C. Pergaminelis

    arXivIWOCA 2026Selected for a JCSS special issue

  7. Finite Pinwheel Scheduling: the k-Visits Problem

    S. Kanellopoulos, C. Pergaminelis, M. Kokkou, E. Markou, and A. Pagourtzis

    arXivSODA 2026

  8. Approximation Schemes for k-Subset Sum Ratio and k-Way Number Partitioning Ratio

    S. Kanellopoulos, G. Mitropoulos, A. Antonopoulos, N. Leonardos, A. Pagourtzis, C. Pergaminelis, S. Petsalakis, and K. Tsitouras

    arXivISAAC 2025

  9. The Computational Complexity of Finding Second-Order Stationary Points

    A. Kontogiannis, V. Pollatos, S. Kanellopoulos, P. Mertikopoulos, A. Pagourtzis, and I. Panageas

    HALICML 2024

  10. On the Power of Counting the Total Number of Computation Paths of NPTMs

    E. Bakali, A. Chalki, S. Kanellopoulos, A. Pagourtzis, and S. Zachos

    arXivTAMC 2024

A note regarding the usage of AI...

I strongly believe that much of the value of theoretical research stems from being understood by humans, and this is better done when it is produced and written by humans. Thus, most of my research is done with minimal AI assistance. All my manuscripts are written entirely by human hands, with the hope that this will help readers understand the presented ideas more deeply and truly learn something new. I believe this to be of paramount importance in an age where writing tends to be considered a trivial task that can be assigned to machines.