Konstantinos Panagiotou

According to our database1, Konstantinos Panagiotou authored at least 48 papers between 2006 and 2018.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

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

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.
Combinatorics, Probability & Computing, 2015

2014
Coloring d-Embeddable k-Uniform Hypergraphs.
Discrete & Computational Geometry, 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

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

Explosive Percolation in Erdős-Rényi-Like Random Graph Processes.
Combinatorics, Probability & Computing, 2013

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

Asynchronous Rumor Spreading on Random Graphs.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Faster Rumor Spreading with Multiple Calls.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

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

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

Vertices of degree k in random unlabeled trees.
Journal of Graph Theory, 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

Efficient Sampling Methods for Discrete Distributions.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps.
Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics, 2012

2011
Explosive Percolation in Erdős-Rényi-Like Random Graph Processes.
Electronic Notes in Discrete Mathematics, 2011

3-Connected Cores In Random Planar Graphs.
Combinatorics, Probability & Computing, 2011

Multi-target Ray Searching Problems.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

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

The Multiple-Orientability Thresholds for Random Hypergraphs.
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
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

Rumor Spreading on Random Regular Graphs and Expanders.
Proceedings of the Approximation, 2010

2009
Vertices of Degree k in Random Unlabeled Trees.
Electronic Notes in Discrete Mathematics, 2009

A note on the chromatic number of a dense random graph.
Discrete Mathematics, 2009

The Degree Sequence of Random Graphs from Subcritical Classes.
Combinatorics, Probability & Computing, 2009

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

Optimal Algorithms for k-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

Maximal biconnected subgraphs of random planar graphs.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008
On properties of random dissections and triangulations.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

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

2007
On extremal subgraphs of random graphs.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

On the Chromatic Number of Random Graphs.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Optimal Algorithms for k -Search with Application in Option Pricing.
Proceedings of the Algorithms, 2007

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


  Loading...