Mr. Kostas Sotiropoulos, my PhD advisee, has successfully defended his thesis “Methods, Algorithms and Impossibility Results for Machine Learning on Graphs”. Defending a PhD thesis requires extensive research, critical thinking, and the ability to present and defend one’s ideas in front of a committee of experts. It is an impressive accomplishment that demonstrates Mr. Sotiropoulos’s […]
In CS131, we see the “Proof from the Book” due to Euclide that the number of prime numbers is infinite. Here is another favorite proof that is based on elementary facts. Suppose that is a list of all the primes. From what we have learnt about the sum of geometric progressions we know that for […]
Few days ago I uploaded on Arxiv our preprint “Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries”. This is joint work with Tianyi, Nao, and Jakub. In this paper we study the following extension of the densest subgraph problem (DSP) that is known to be solvable exactly in polynomial time on graphs with […]
tsourakakis.com 