PS
Paul G. Spirakis
cs.DCcs.DScs.DMcs.GTcs.CCmath.COcs.AIcs.CRcs.LGmath.PR
On Valency
published · living versionsW_dqvfa3vp·v1 · currentpublished
Recognizing Label-Connected Graphs
with Ralf Klasing, George B. Mertzios, Hendrik Molter, Nils Morawietz
1 version
Preprints & journals
88 papers in the corpus · 2008–2026Round-Delayed Amnesiac Flooding2604.04260v1 · Oluwatobi Alafin, George B. Mertzios, Paul G. Spirakis2026 · 0 citationsarXiv
Exploration of Always -Connected Temporal Graphs2602.19657v2 · Duncan Adamson, Paul G Spirakis2026 · 0 citationsarXiv
Distributed Triangle and Simplex Enumeration in Hypergraphs2602.17834v2 · Duncan Adamson, Will Rosenbaum, Paul G. Spirakis2026 · 0 citationsarXiv
Sharp Thresholds for Temporal Motifs and Doubling Time in Random Temporal Graphs2602.01847v3 · Henry Austin, George B. Mertzios, Paul G. Spirakis2026 · 0 citationsarXiv
Towards Scalable Proteomics: Opportunistic SMC Samplers on HTCondor2509.08020v1 · Matthew Carter, Lee Devlin, Alexander Philips et al.2025 · 0 citationsarXiv
MACS: Multi-Agent Reinforcement Learning for Optimization of Crystal Structures2506.04195v1 · Elena Zamaraeva, Christopher M. Collins, George R. Darling et al.2025 · 0 citationsarXiv
Temporal Graph Realization With Bounded Stretch2504.14258v1 · George B. Mertzios, Hendrik Molter, Nils Morawietz et al.2025 · 0 citationsarXiv
Fast and Near-Optimal Collision-Free Robot Scheduling On Paths2502.07851v2 · Duncan Adamson, Nathan Flaherty, Igor Potapov et al.2025 · 0 citationsarXiv
Distributed weak independent sets in hypergraphs: Upper and lower bounds2411.13377v1 · Duncan Adamson, Will Rosenbaum, Paul G. Spirakis2024 · 1 citationarXiv
On the existence of -temporal cliques in random simple temporal graphs2404.07147v1 · George B. Mertzios, Sotiris Nikoletseas, Christoforos Raptopoulos et al.2024 · 0 citationsarXiv
Realizing temporal transportation trees2403.18513v3 · George B. Mertzios, Hendrik Molter, Nils Morawietz et al.2024 · 1 citationarXiv
Collision-Free Robot Scheduling2402.12019v3 · Duncan Adamson, Nathan Flaherty, Igor Potapov et al.2024 · 0 citationsInformation and Computation, Volume 304, 2025, 105294
Structural and Combinatorial Properties of 2-swap Word Permutation Graphs2307.01648v3 · Duncan Adamson, Nathan Flaherty, Igor Potapov et al.2023 · 2 citationsarXiv
Optimality guarantees for crystal structure prediction.37407679 · Gusev, Vladimir V, Adamson, Duncan, Deligkas, Argyrios et al.2023 · 55 citationsNature. 2023;619(7968):68-72
Bayesian Decision Trees Inspired from Evolutionary Algorithms2305.18774v1 · Efthyvoulos Drousiotis, Alexander M. Phillips, Paul G. Spirakis et al.2023 · 2 citationsarXiv
On the existence of highly organized communities in networks of locally interacting agents2304.04480v1 · V. Liagkou, P.E. Nastou, P. Spirakis et al.2023 · 1 citationarXiv
Reinforcement Learning in Crystal Structure Prediction10.26434/chemrxiv-2023-4fn8j · Elena Zamaraeva, Christopher M. Collins, Dmytro Antypov et al.2023 · 13 citationsChemRxiv
The Contest Game for Crowdsourcing Reviews2302.14701v2 · Marios Mavronicolas, Paul G. Spirakis2023 · 1 citationarXiv
Realizing temporal graphs from fastest travel times2302.08860v4 · Nina Klobas, George B. Mertzios, Hendrik Molter et al.2023 · 1 citationarXiv
Parallel Approaches to Accelerate Bayesian Decision Trees2301.09090v1 · Efthyvoulos Drousiotis, Paul G. Spirakis, Simon Maskell2023 · 1 citationarXiv
A spectral algorithm for finding maximum cliques in dense random intersection graphs2210.02121v1 · Filippos Christodoulou, Sotiris Nikoletseas, Christoforos Raptopoulos et al.2022 · 1 citationarXiv
Single MCMC Chain Parallelisation on Decision Trees2207.12688v1 · Efthyvoulos Drousiotis, Paul G. Spirakis2022 · 4 citationsarXiv
The Complexity of Temporal Vertex Cover in Small-Degree Graphs2204.04832v2 · Thekla Hamm, Nina Klobas, George B. Mertzios et al.2022 · 15 citationsarXiv
The complexity of computing optimum labelings for temporal connectivity2202.05880v2 · Nina Klobas, George B. Mertzios, Hendrik Molter et al.2022 · 7 citationsarXiv
New Clocks, Optimal Line Formation and Self-Replication Population Protocols2111.10822v4 · Leszek Gasieniec, Paul Spirakis, Grzegorz Stachowiak2021 · 1 citationarXiv
The Complexity of Growing a Graph2107.14126v5 · George B. Mertzios, Othon Michail, George Skretas et al.2021 · 5 citationsarXiv
On the undecidability of the Panopticon detection problem2107.05220v1 · Vasiliki Liagkou, Panayotis Nastou, Paul Spirakis et al.2021 · 2 citationsarXiv
Threshold-based Network Structural Dynamics2103.04955v3 · Evangelos Kipouridis, Paul G. Spirakis, Kostas Tsichlas2021 · 0 citationsarXiv
The Complexity of Transitively Orienting Temporal Graphs2102.06783v3 · George B. Mertzios, Hendrik Molter, Malte Renken et al.2021 · 4 citationsarXiv
MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems2009.01567v2 · Sotiris Nikoletseas, Christoforos Raptopoulos, Paul Spirakis2020 · 0 citationsarXiv
Gathering in 1-Interval Connected Graphs2008.07455v1 · Othon Michail, Paul G. Spirakis, Michail Theofilatos2020 · 0 citationsarXiv
On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time2007.00625v1 · Matthew Connor, Othon Michail, Paul Spirakis2020 · 0 citationsarXiv
Walrasian Equilibria in Markets with Small Demands2005.11796v3 · Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis2020 · 0 citationsarXiv
Matching in Stochastically Evolving Graphs2005.08263v1 · Eleni C. Akrida, Argyrios Deligkas, George B. Mertzios et al.2020 · 1 citationarXiv
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle2004.06036v2 · Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis et al.2020 · 0 citationsarXiv
Crystal Structure Prediction via Oblivious Local Search2003.12442v1 · Dmytro Antypov, Argyrios Deligkas, Vladimir Gusev et al.2020 · 3 citationsarXiv
Distributed Computation and Reconfiguration in Actively Dynamic Networks2003.03355v1 · Othon Michail, George Skretas, Paul G. Spirakis (12020 · 11 citationsarXiv
Connected Subgraph Defense Games1906.02774v1 · Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos et al.2019 · 2 citationsarXiv
Fault Tolerant Network Constructors1903.05992v2 · Othon Michail, Paul G. Spirakis, Michail Theofilatos2019 · 0 citationsarXiv
How fast can we reach a target vertex in stochastic temporal graphs?1903.03636v1 · Eleni C. Akrida, George B. Mertzios, Sotiris Nikoletseas et al.2019 · 21 citationsarXiv
Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem1903.03101v2 · Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos et al.2019 · 24 citationsarXiv
Strategic Contention Resolution in Multiple Channels1810.04565v1 · George Christodoulou, Themistoklis Melissourgos, Paul G. Spirakis2018 · 2 citationsarXiv
Approximating the Existential Theory of the Reals1810.01393v3 · Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos et al.2018 · 9 citationsarXiv
Fast Approximate Counting and Leader Election in Populations1806.02638v1 · Othon Michail, Paul G. Spirakis, Michail Theofilatos2018 · 0 citationsarXiv
Exact size counting in uniform population protocols in nearly logarithmic time1805.04832v1 · David Doty, Mahsa Eftekhari, Othon Michail et al.2018 · 5 citationsarXiv
The temporal explorer who returns to the base1805.04713v1 · Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis2018 · 38 citationsarXiv
The Price of Stability of Weighted Congestion Games1802.09952v4 · George Christodoulou, Martin Gairing, Yiannis Giannakopoulos et al.2018 · 30 citationsarXiv
Temporal Vertex Cover with a Sliding Time Window1802.07103v3 · Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis et al.2018 · 64 citationsarXiv
An extension of the Moran process using type-specific connection graphs1710.07365v3 · Themistoklis Melissourgos, Sotiris Nikoletseas, Christoforos Raptopoulos et al.2017 · 5 citationsarXiv
Learning Powers of Poisson Binomial Distributions1707.05662v1 · Dimitris Fotakis, Vasilis Kontonis, Piotr Krysta et al.2017 · 0 citationsarXiv
Career total: 699 works. 88 are in this corpus.Showing the 50 most recent.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.