Sotiris Kanellopoulos
Scholar

Sotiris Kanellopoulos

Google Scholar ID: l8Dv_PEAAAAJ
PhD Student, National Technical University of Athens, Archimedes/Athena Research Center
Complexity TheoryGame TheoryApproximation AlgorithmsSchedulingGraph Theory
Google Scholar↗
Citations & Impact
All-time
Citations
7
 
H-index
1
 
i10-index
0
 
Publications
5
 
Co-authors
13
list available
Publications
7 items
The Complexity of Computing Class Probabilities in BID Probabilistic Databases
2026
Cited
0
Finite Pinwheel Covering
2026
Cited
0
Temporal Path Covers: Dilworth Properties and Parameterized Complexity
2026
Cited
0
Hardness, Tractability and Density Thresholds of finite Pinwheel Scheduling Variants
2026
Cited
0
Finite Pinwheel Scheduling: the k-Visits Problem
2025
Cited
0
Beer Path Problems in Temporal Graphs
2025
Cited
0
Approximation Schemes for k-Subset Sum Ratio and Multiway Number Partitioning Ratio
2025
Cited
0
Co-authors
12 total
Aris Pagourtzis
Aris Pagourtzis
National Technical University of Athens
Aggeliki Chalki
Aggeliki Chalki
PostDoc, Reykjavik University
Christos Pergaminelis
Christos Pergaminelis
PhD student, National Technical University of Athens, Archimedes/Athena Research Center
Andreas Kontogiannis
Andreas Kontogiannis
PhD Candidate at NTUA & Archimedes AI
Vasilis Pollatos
Vasilis Pollatos
Archimedes AI, NKUA
Ioannis Panageas
Ioannis Panageas
Assistant Professor, University of California, Irvine
Panayotis Mertikopoulos
Panayotis Mertikopoulos
CNRS
Nikos Leonardos
Nikos Leonardos
University of Athens