I agree that this site is using cookies. You can find further informations here.
X
Panagiotou, Konstantinos
31  results:
Bookchapter (Online) X
Search for persons X
?
1

Asymptotics for Push on the Complete Graph:

, In: LATIN 2020: Theoretical Informatics; Lecture Notes in Computer Science,
Daknama, Rami ; Panagiotou, Konstantinos ; Reisser, Simon - p. 451-463 , 2020
Link: https://doi.org/10.1007/..
 
?
2

Systemic Risk in Networks:

, In: Network Science,
Detering, Nils ; Meyer-Brandis, Thilo ; Panagiotou, Konstantinos. - p. 59-77 , 2019
Link: https://doi.org/10.1007/..
 
?
3

Labeling Schemes for Nearest Common Ancestors through Minor..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Gawrychowski, Paweł ; Kuhn, Fabian ; Łopuszański, Jakub.. - p. 2604-2619 , 2018
Link: https://doi.org/10.1137/..
 
?
4

Labeling schemes for nearest common ancestors through minor..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Gawrychowski, Paweł ; Kuhn, Fabian ; Łopuszański, Jakub.. - p. 2604-2619 , 2018
Link: https://dl.acm.org/doi/1..
 
?
5

Going after the k-SAT threshold:

, In: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing,
Coja-Oghlan, Amin ; Panagiotou, Konstantinos - p. 705-714 , 2013
Link: https://dl.acm.org/doi/1..
 
?
6

The maximum degree of random planar graphs:

, In: Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms,
Drmota, Michael ; Giménez, Omer ; Noy, Marc.. - p. 281-287 , 2012
Link: https://dl.acm.org/doi/1..
 
?
7

Ultra-fast rumor spreading in social networks:

, In: Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms,
Fountoulakis, Nikolaos ; Panagiotou, Konstantinos ; Sauerwald, Thomas - p. 1642-1660 , 2012
Link: https://dl.acm.org/doi/1..
 
?
8

Catching the k-NAESAT threshold:

, In: Proceedings of the forty-fourth annual ACM symposium on Theory of computing,
Coja-Oglan, Amin ; Panagiotou, Konstantinos - p. 899-908 , 2012
Link: https://dl.acm.org/doi/1..
 
?
9

The multiple-orientability thresholds for random hypergraph:

, In: Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms,
Fountoulakis, Nikolaos ; Khosla, Megha ; Panagiotou, Konstantinos - p. 1222-1236 , 2011
Link: https://dl.acm.org/doi/1..
 
?
10

On the degree distribution of random planar graphs:

, In: Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms,
Panagiotou, Konstantinos ; Steger, Angelika - p. 1198-1210 , 2011
Link: https://dl.acm.org/doi/1..
 
?
11

Vertices of degree k in random maps:

, In: Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms,
Johannsen, Daniel ; Panagiotou, Konstantinos - p. 1436-1447 , 2010
Link: https://dl.acm.org/doi/1..
 
?
12

Synchrony and asynchrony in neural networks:

, In: Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms,
Kuhn, Fabian ; Panagiotou, Konstantinos ; Spencer, Joel. - p. 949-964 , 2010
Link: https://dl.acm.org/doi/1..
 
?
13

Maximal biconnected subgraphs of random planar graphs:

, In: Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms,
Panagiotou, Konstantinos ; Steger, Angelika - p. 432-440 , 2009
Link: https://dl.acm.org/doi/1..
 
?
14

On properties of random dissections and triangulations:

, In: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms,
Bernasconi, Nicla ; Panagiotou, Konstantinos ; Steger, Angelika - p. 132-141 , 2008
Link: https://dl.acm.org/doi/1..
 
?
15

On extremal subgraphs of random graphs:

, In: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms,
Brightwell, Graham ; Panagiotou, Konstantinos ; Steger, Angelika - p. 477-485 , 2007
Link: https://dl.acm.org/doi/1..
 
1-15