36 citations · 170 across the 60 of their papers we have counts for
76 papers
Distributed Triangle and Simplex Enumeration in Hypergraphs
Duncan Adamson, Will Rosenbaum, Paul G. Spirakis
In the last decade, subgraph detection and enumeration have emerged as central problems in distributed graph algorithms. This is largely due to the problems' theoretical challenges…
Realizing temporal transportation trees
George B. Mertzios, Hendrik Molter, Nils Morawietz +1
In this paper, we study the complexity of the periodic temporal graph realization problem with respect to upper bounds on the fastest path durations among its vertices. This constr…
Structural and Combinatorial Properties of 2-swap Word Permutation Graphs
Duncan Adamson, Nathan Flaherty, Igor Potapov +1
In this paper, we study the graph induced by the permutation on words with a fixed Parikh vector. A -swap is defined as a pair of positions where…
Bayesian Decision Trees Inspired from Evolutionary Algorithms
Efthyvoulos Drousiotis, Alexander M. Phillips, Paul G. Spirakis +1
Bayesian Decision Trees (DTs) are generally considered a more advanced and accurate model than a regular Decision Tree (DT) because they can handle complex and uncertain data. Exis…
The Contest Game for Crowdsourcing Reviews
Marios Mavronicolas, Paul G. Spirakis
We consider a contest game modelling a contest where reviews for proposals are crowdsourced from strategic agents} players. Player has a skill for reviewing…
Realizing temporal graphs from fastest travel times
Nina Klobas, George B. Mertzios, Hendrik Molter +1
In this paper we initiate the study of the temporal graph realization problem with respect to the fastest path durations among its vertices, while we focus on periodic temporal gra…