default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKonstantinos Panagiotou
Person information
- affiliation: Ludwig Maximilian University of Munich, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j36]Umberto De Ambroggio, Tamás Makai, Konstantinos Panagiotou
:
Dispersion on the Complete Graph. Random Struct. Algorithms 66(1) (2025)- 2024
- [j35]Konstantinos Panagiotou, Simon Reisser:
The effect of iterativity on adversarial opinion forming. Inf. Process. Lett. 185: 106453 (2024) - [c36]Umberto De Ambroggio, Tamás Makai, Konstantinos Panagiotou, Annika Steibel:
Limit Laws for Critical Dispersion on Complete Graphs. AofA 2024: 26:1-26:12 - [i18]Spyros Angelopoulos, Thomas Lidbetter, Konstantinos Panagiotou:
Search Games with Predictions. CoRR abs/2401.01149 (2024) - [i17]Umberto De Ambroggio, Tamás Makai, Konstantinos Panagiotou, Annika Steibel:
Limit Laws for Critical Dispersion on Complete Graphs. CoRR abs/2403.05372 (2024) - 2023
- [j34]Spyros Angelopoulos, Konstantinos Panagiotou:
Weighted online search. J. Comput. Syst. Sci. 138: 103457 (2023) - [j33]Konstantinos Panagiotou, Leon Ramzews, Benedikt Stufler:
Exact-Size Sampling of Enriched Trees in Linear Time. SIAM J. Comput. 52(5): 1097-1131 (2023) - [i16]Umberto De Ambroggio, Tamás Makai, Konstantinos Panagiotou:
Dispersion on the Complete Graph. CoRR abs/2306.02474 (2023) - 2022
- [j32]Nils Detering, Thilo Meyer-Brandis, Konstantinos Panagiotou, Daniel Ritter:
Suffocating Fire Sales. SIAM J. Financial Math. 13(1): 70-108 (2022) - 2021
- [j31]Rami Daknama, Konstantinos Panagiotou, Simon Reisser:
Robustness of randomized rumour spreading. Comb. Probab. Comput. 30(1): 37-78 (2021) - [c35]Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, Noëla Müller, Konstantinos Panagiotou, Matija Pasch:
Inference and Mutual Information on Random Factor Graphs. STACS 2021: 24:1-24:15 - [i15]Konstantinos Panagiotou, Simon Reisser:
The Effect of Iterativity on Adversarial Opinion Forming. CoRR abs/2111.15445 (2021) - 2020
- [c34]Rami Daknama, Konstantinos Panagiotou, Simon Reisser:
Asymptotics for Push on the Complete Graph. LATIN 2020: 451-463 - [i14]Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, Noëla Müller, Konstantinos Panagiotou, Matija Pasch:
Inference and mutual information on random factor graphs. CoRR abs/2007.07494 (2020)
2010 – 2019
- 2019
- [j30]Thilo Meyer-Brandis, Nils Detering, Konstantinos Panagiotou:
Bootstrap Percolation in Directed Inhomogeneous Random Graphs. Electron. J. Comb. 26(3): 3 (2019) - [j29]Hafsteinn Einarsson, Johannes Lengler, Frank Mousset, Konstantinos Panagiotou, Angelika Steger:
Bootstrap percolation with inhibition. Random Struct. Algorithms 55(4): 881-925 (2019) - [j28]Nils Detering, Thilo Meyer-Brandis, Konstantinos Panagiotou, Daniel Ritter:
Managing Default Contagion in Inhomogeneous Financial Networks. SIAM J. Financial Math. 10(2): 578-614 (2019) - [j27]Leslie Ann Goldberg, John Lapinskas, Johannes Lengler, Florian Meier, Konstantinos Panagiotou, Pascal Pfister:
Asymptotically optimal amplifiers for the Moran process. Theor. Comput. Sci. 758: 73-93 (2019) - [c33]Rami Daknama, Konstantinos Panagiotou, Simon Reisser:
Robustness of Randomized Rumour Spreading. ESA 2019: 36:1-36:15 - [c32]Konstantinos Panagiotou, Matija Pasch:
Satisfiability Thresholds for Regular Occupation Problems. ICALP 2019: 90:1-90:14 - [i13]Rami Daknama, Konstantinos Panagiotou, Simon Reisser:
Robustness of Randomized Rumour Spreading. CoRR abs/1902.07618 (2019) - 2018
- [c31]Konstantinos Panagiotou, Leon Ramzews:
Asymptotic Enumeration of Graph Classes with Many Components. ANALCO 2018: 133-142 - [c30]Pawel Gawrychowski, Fabian Kuhn, Jakub Lopuszanski, Konstantinos Panagiotou, Pascal Su:
Labeling Schemes for Nearest Common Ancestors through Minor-Universal Trees. SODA 2018: 2604-2619 - [c29]Michael Mitzenmacher, Konstantinos Panagiotou, Stefan Walzer:
Load Thresholds for Cuckoo Hashing with Double Hashing. SWAT 2018: 29:1-29:9 - 2017
- [j26]Konstantinos Panagiotou, Leo Speidel:
Asynchronous Rumor Spreading on Random Graphs. Algorithmica 78(3): 968-989 (2017) - [j25]Karl Bringmann, Konstantinos Panagiotou:
Efficient Sampling Methods for Discrete Distributions. Algorithmica 79(2): 484-508 (2017) - [i12]Spyros Angelopoulos, Konstantinos Panagiotou:
Optimal strategies for weighted ray search. CoRR abs/1704.03777 (2017) - [i11]Fabian Kuhn, Konstantinos Panagiotou, Pascal Su:
Nearest Common Ancestors: Universal Trees and Improved Labeling Schemes. CoRR abs/1707.08807 (2017) - 2016
- [b1]Michael Krivelevich, Konstantinos Panagiotou, Mathew D. Penrose, Colin J. H. McDiarmid:
Random Graphs, Geometry and Asymptotic Structure. London Mathematical Society student texts 84, Cambridge University Press 2016, ISBN 978-1-316-50191-7, pp. 1-122 - [j24]Nikolaos Fountoulakis, Megha Khosla, Konstantinos Panagiotou:
The Multiple-Orientability Thresholds for Random Hypergraphs. Comb. Probab. Comput. 25(6): 870-908 (2016) - [i10]Konstantinos Panagiotou, Leo Speidel:
Asynchronous Rumor Spreading on Random Graphs. CoRR abs/1608.01766 (2016) - [i9]Leslie Ann Goldberg, John Lapinskas, Johannes Lengler, Florian Meier, Konstantinos Panagiotou, Pascal Pfister:
Asymptotically Optimal Amplifiers for the Moran Process. CoRR abs/1611.04209 (2016) - 2015
- [j23]Konstantinos Panagiotou, Ali Pourmiri, Thomas Sauerwald:
Faster Rumor Spreading With Multiple Calls. Electron. J. Comb. 22(1): 1 (2015) - [j22]Konstantinos Panagiotou, Xavier Pérez-Giménez, Thomas Sauerwald, He Sun:
Randomized Rumour Spreading: The Effect of the Network Topology. Comb. Probab. Comput. 24(2): 457-479 (2015) - [j21]Stefanie Gerke, Konstantinos Panagiotou, Justus Schwartz, Angelika Steger:
Maximizing the Minimum Load for Random Processing Times. ACM Trans. Algorithms 11(3): 17:1-17:19 (2015) - 2014
- [j20]Carl Georg Heise, Konstantinos Panagiotou, Oleg Pikhurko, Anusch Taraz:
Coloring d-Embeddable k-Uniform Hypergraphs. Discret. Comput. Geom. 52(4): 663-679 (2014) - [j19]Spyros Angelopoulos, Alejandro López-Ortiz, Konstantinos Panagiotou:
Multi-target ray searching problems. Theor. Comput. Sci. 540: 2-12 (2014) - [c28]Karl Bringmann, Fabian Kuhn, Konstantinos Panagiotou, Ueli Peter, Henning Thomas:
Internal DLA: Efficient Simulation of a Physical Growth Model - (Extended Abstract). ICALP (1) 2014: 247-258 - 2013
- [j18]Michael Drmota, Konstantinos Panagiotou:
A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps. Algorithmica 66(4): 741-761 (2013) - [j17]Konstantinos Panagiotou, Reto Spöhel, Angelika Steger, Henning Thomas:
Explosive Percolation in Erdős-Rényi-Like Random Graph Processes. Comb. Probab. Comput. 22(1): 133-145 (2013) - [j16]Mihyun Kang, Konstantinos Panagiotou:
On the connectivity of random graphs from addable classes. J. Comb. Theory B 103(2): 306-312 (2013) - [j15]Nikolaos Fountoulakis, Konstantinos Panagiotou:
Rumor spreading on random regular graphs and expanders. Random Struct. Algorithms 43(2): 201-220 (2013) - [j14]Nikolaos Fountoulakis, Konstantinos Panagiotou, Angelika Steger:
On the Insertion Time of Cuckoo Hashing. SIAM J. Comput. 42(6): 2156-2181 (2013) - [c27]Konstantinos Panagiotou, Leo Speidel:
Asynchronous Rumor Spreading on Random Graphs. ISAAC 2013: 424-434 - [c26]Konstantinos Panagiotou, Ali Pourmiri, Thomas Sauerwald:
Faster Rumor Spreading with Multiple Calls. ISAAC 2013: 446-456 - [c25]Amin Coja-Oghlan, Konstantinos Panagiotou:
Going after the k-SAT threshold. STOC 2013: 705-714 - [i8]Nikolaos Fountoulakis, Megha Khosla, Konstantinos Panagiotou:
The Multiple-orientability Thresholds for Random Hypergraphs. CoRR abs/1309.6772 (2013) - 2012
- [j13]Konstantinos Panagiotou, Makrand Sinha:
Vertices of degree k in random unlabeled trees. J. Graph Theory 69(2): 114-130 (2012) - [j12]Graham R. Brightwell, Konstantinos Panagiotou, Angelika Steger:
Extremal subgraphs of random graphs. Random Struct. Algorithms 41(2): 147-178 (2012) - [j11]Nikolaos Fountoulakis, Konstantinos Panagiotou:
Sharp load thresholds for cuckoo hashing. Random Struct. Algorithms 41(3): 306-333 (2012) - [c24]Michael Drmota, Konstantinos Panagiotou:
A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps. ANALCO 2012: 9-15 - [c23]Karl Bringmann, Konstantinos Panagiotou:
Efficient Sampling Methods for Discrete Distributions. ICALP (1) 2012: 133-144 - [c22]Luca Gugelmann, Konstantinos Panagiotou, Ueli Peter:
Random Hyperbolic Graphs: Degree Sequence and Clustering - (Extended Abstract). ICALP (2) 2012: 573-585 - [c21]Michael Drmota, Omer Giménez, Marc Noy, Konstantinos Panagiotou, Angelika Steger:
The maximum degree of random planar graphs. SODA 2012: 281-287 - [c20]Nikolaos Fountoulakis, Konstantinos Panagiotou, Thomas Sauerwald:
Ultra-fast rumor spreading in social networks. SODA 2012: 1642-1660 - [c19]Amin Coja-Oghlan, Konstantinos Panagiotou:
Catching the k-NAESAT threshold. STOC 2012: 899-908 - [c18]Markus Bläser, Konstantinos Panagiotou, B. V. Raghavendra Rao:
A Probabilistic Analysis of Christofides' Algorithm. SWAT 2012: 225-236 - [i7]Luca Gugelmann, Konstantinos Panagiotou, Ueli Peter:
Random Hyperbolic Graphs: Degree Sequence and Clustering. CoRR abs/1205.1470 (2012) - [i6]Amin Coja-Oghlan, Konstantinos Panagiotou:
Going after the k-SAT Threshold. CoRR abs/1212.1682 (2012) - 2011
- [j10]Nikolaos Fountoulakis, Konstantinos Panagiotou:
3-Connected Cores In Random Planar Graphs. Comb. Probab. Comput. 20(3): 381-412 (2011) - [j9]Konstantinos Panagiotou, Reto Spöhel, Angelika Steger, Henning Thomas:
Explosive Percolation in Erdős-Rényi-Like Random Graph Processes. Electron. Notes Discret. Math. 38: 699-704 (2011) - [c17]Madhusudan Manjunath, Kurt Mehlhorn, Konstantinos Panagiotou, He Sun:
Approximate Counting of Cycles in Streams. ESA 2011: 677-688 - [c16]Konstantinos Panagiotou, Angelika Steger:
On the Degree Distribution of Random Planar Graphs. SODA 2011: 1198-1210 - [c15]Nikolaos Fountoulakis, Megha Khosla, Konstantinos Panagiotou:
The Multiple-Orientability Thresholds for Random Hypergraphs. SODA 2011: 1222-1236 - [c14]Spyros Angelopoulos, Alejandro López-Ortiz, Konstantinos Panagiotou:
Multi-target Ray Searching Problems. WADS 2011: 37-48 - [i5]Konstantinos Panagiotou, Reto Spöhel, Angelika Steger, Henning Thomas:
Explosive Percolation in Erdös-Rényi-Like Random Graph Processes. CoRR abs/1104.1309 (2011) - [i4]Amin Coja-Oghlan, Konstantinos Panagiotou:
Catching the k-NAESAT Threshold. CoRR abs/1111.1274 (2011) - 2010
- [j8]Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger:
On properties of random dissections and triangulations. Comb. 30(6): 627-654 (2010) - [j7]Konstantinos Panagiotou, Angelika Steger:
Maximal biconnected subgraphs of random planar graphs. ACM Trans. Algorithms 6(2): 31:1-31:21 (2010) - [c13]Nikolaos Fountoulakis, Konstantinos Panagiotou:
Rumor Spreading on Random Regular Graphs and Expanders. APPROX-RANDOM 2010: 560-573 - [c12]Nikolaos Fountoulakis, Konstantinos Panagiotou:
Orientability of Random Hypergraphs and the Power of Multiple Choices. ICALP (1) 2010: 348-359 - [c11]Nikolaos Fountoulakis, Anna Huber, Konstantinos Panagiotou:
Reliable Broadcasting in Random Networks and the Effect of Density. INFOCOM 2010: 2552-2560 - [c10]Fabian Kuhn, Konstantinos Panagiotou, Joel Spencer, Angelika Steger:
Synchrony and Asynchrony in Neural Networks. SODA 2010: 949-964 - [c9]Daniel Johannsen, Konstantinos Panagiotou:
Vertices of Degree k in Random Maps. SODA 2010: 1436-1447 - [i3]Nikolaos Fountoulakis, Konstantinos Panagiotou:
Rumor Spreading on Random Regular Graphs and Expanders. CoRR abs/1002.3518 (2010) - [i2]Nikolaos Fountoulakis, Konstantinos Panagiotou, Angelika Steger:
On the Insertion Time of Cuckoo Hashing. CoRR abs/1006.1231 (2010)
2000 – 2009
- 2009
- [j6]Julian Lorenz, Konstantinos Panagiotou, Angelika Steger:
Optimal Algorithms for k-Search with Application in Option Pricing. Algorithmica 55(2): 311-328 (2009) - [j5]Spyros Angelopoulos, Benjamin Doerr, Anna Huber, Konstantinos Panagiotou:
Tight Bounds for Quasirandom Rumor Spreading. Electron. J. Comb. 16(1) (2009) - [j4]Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger:
The Degree Sequence of Random Graphs from Subcritical Classes. Comb. Probab. Comput. 18(5): 647-681 (2009) - [j3]Konstantinos Panagiotou, Angelika Steger:
A note on the chromatic number of a dense random graph. Discret. Math. 309(10): 3420-3423 (2009) - [j2]Konstantinos Panagiotou, Makrand Sinha:
Vertices of Degree k in Random Unlabeled Trees. Electron. Notes Discret. Math. 34: 41-45 (2009) - [c8]Konstantinos Panagiotou, Angelika Steger:
Maximal biconnected subgraphs of random planar graphs. SODA 2009: 432-440 - [c7]Nikolaos Fountoulakis, Anna Huber, Konstantinos Panagiotou:
Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter. DISC 2009: 529-530 - [i1]Nikolaos Fountoulakis, Konstantinos Panagiotou:
Sharp Load Thresholds for Cuckoo Hashing. CoRR abs/0910.5147 (2009) - 2008
- [j1]Amin Coja-Oghlan, Konstantinos Panagiotou, Angelika Steger:
On the chromatic number of random graphs. J. Comb. Theory B 98(5): 980-993 (2008) - [c6]Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger:
On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs. APPROX-RANDOM 2008: 303-316 - [c5]Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger:
On properties of random dissections and triangulations. SODA 2008: 132-141 - 2007
- [c4]Julian Lorenz, Konstantinos Panagiotou, Angelika Steger:
Optimal Algorithms for k -Search with Application in Option Pricing. ESA 2007: 275-286 - [c3]Amin Coja-Oghlan, Konstantinos Panagiotou, Angelika Steger:
On the Chromatic Number of Random Graphs. ICALP 2007: 777-788 - [c2]Graham R. Brightwell, Konstantinos Panagiotou, Angelika Steger:
On extremal subgraphs of random graphs. SODA 2007: 477-485 - 2006
- [c1]Konstantinos Panagiotou, Alexander Souza:
On adequate performance measures for paging. STOC 2006: 487-496
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
