Konstantinos Panagiotou

Affiliations:
  • Ludwig Maximilian University of Munich, Germany


According to our database1, Konstantinos Panagiotou authored at least 63 papers between 2006 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The effect of iterativity on adversarial opinion forming.
Inf. Process. Lett., March, 2024

Limit Laws for Critical Dispersion on Complete Graphs.
CoRR, 2024

Search Games with Predictions.
CoRR, 2024

2023
Weighted online search.
J. Comput. Syst. Sci., December, 2023

Exact-Size Sampling of Enriched Trees in Linear Time.
SIAM J. Comput., October, 2023

Dispersion on the Complete Graph.
CoRR, 2023

2022
Suffocating Fire Sales.
SIAM J. Financial Math., 2022

2021
Robustness of randomized rumour spreading.
Comb. Probab. Comput., 2021

Inference and Mutual Information on Random Factor Graphs.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

2020
Asymptotics for Push on the Complete Graph.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019
Asymptotically optimal amplifiers for the Moran process.
Theor. Comput. Sci., 2019

Managing Default Contagion in Inhomogeneous Financial Networks.
SIAM J. Financial Math., 2019

Bootstrap percolation with inhibition.
Random Struct. Algorithms, 2019

Bootstrap Percolation in Directed Inhomogeneous Random Graphs.
Electron. J. Comb., 2019

Satisfiability Thresholds for Regular Occupation Problems.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Load Thresholds for Cuckoo Hashing with Double Hashing.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Labeling Schemes for Nearest Common Ancestors through Minor-Universal Trees.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Asymptotic Enumeration of Graph Classes with Many Components.
Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018

2017
Nearest Common Ancestors: Universal Trees and Improved Labeling Schemes.
CoRR, 2017

Optimal strategies for weighted ray search.
CoRR, 2017

Asynchronous Rumor Spreading on Random Graphs.
Algorithmica, 2017

Efficient Sampling Methods for Discrete Distributions.
Algorithmica, 2017

2016
The Multiple-Orientability Thresholds for Random Hypergraphs.
Comb. Probab. Comput., 2016

Random Graphs, Geometry and Asymptotic Structure.
London Mathematical Society student texts 84, Cambridge University Press, ISBN: 978-1-316-50191-7, 2016

2015
Maximizing the Minimum Load for Random Processing Times.
ACM Trans. Algorithms, 2015

Randomized Rumour Spreading: The Effect of the Network Topology.
Comb. Probab. Comput., 2015

Faster Rumor Spreading With Multiple Calls.
Electron. J. Comb., 2015

2014
Multi-target ray searching problems.
Theor. Comput. Sci., 2014

Coloring d-Embeddable k-Uniform Hypergraphs.
Discret. Comput. Geom., 2014

Internal DLA: Efficient Simulation of a Physical Growth Model - (Extended Abstract).
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
On the Insertion Time of Cuckoo Hashing.
SIAM J. Comput., 2013

Rumor spreading on random regular graphs and expanders.
Random Struct. Algorithms, 2013

On the connectivity of random graphs from addable classes.
J. Comb. Theory, Ser. B, 2013

A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps.
Algorithmica, 2013

Going after the k-SAT threshold.
Proceedings of the Symposium on Theory of Computing Conference, 2013

2012
Sharp load thresholds for cuckoo hashing.
Random Struct. Algorithms, 2012

Extremal subgraphs of random graphs.
Random Struct. Algorithms, 2012

Vertices of degree <i>k</i> in random unlabeled trees.
J. Graph Theory, 2012

Random Hyperbolic Graphs: Degree Sequence and Clustering
CoRR, 2012

A Probabilistic Analysis of Christofides' Algorithm.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

Catching the k-NAESAT threshold.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Ultra-fast rumor spreading in social networks.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

The maximum degree of random planar graphs.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Random Hyperbolic Graphs: Degree Sequence and Clustering - (Extended Abstract).
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Explosive Percolation in Erdős-Rényi-Like Random Graph Processes.
Electron. Notes Discret. Math., 2011

3-Connected Cores In Random Planar Graphs.
Comb. Probab. Comput., 2011

On the Degree Distribution of Random Planar Graphs.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Approximate Counting of Cycles in Streams.
Proceedings of the Algorithms - ESA 2011, 2011

2010
Maximal biconnected subgraphs of random planar graphs.
ACM Trans. Algorithms, 2010

On properties of random dissections and triangulations.
Comb., 2010

Synchrony and Asynchrony in Neural Networks.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Vertices of Degree k in Random Maps.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Reliable Broadcasting in Random Networks and the Effect of Density.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Orientability of Random Hypergraphs and the Power of Multiple Choices.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
Vertices of Degree k in Random Unlabeled Trees.
Electron. Notes Discret. Math., 2009

A note on the chromatic number of a dense random graph.
Discret. Math., 2009

The Degree Sequence of Random Graphs from Subcritical Classes.
Comb. Probab. Comput., 2009

Tight Bounds for Quasirandom Rumor Spreading.
Electron. J. Comb., 2009

Optimal Algorithms for <i>k</i>-Search with Application in Option Pricing.
Algorithmica, 2009

Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

2008
On the chromatic number of random graphs.
J. Comb. Theory, Ser. B, 2008

On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs.
Proceedings of the Approximation, 2008

2006
On adequate performance measures for paging.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006


  Loading...