In this paper, we study the graph induced by the 2-swap
permutation on w...
Bayesian Decision Trees (DTs) are generally considered a more advanced a...
We consider a contest game modelling a contest where reviews for m
propo...
In this paper we initiate the study of the temporal graph realization
pr...
Markov Chain Monte Carlo (MCMC) is a well-established family of algorith...
Decision trees are highly famous in machine learning and usually acquire...
Temporal graphs naturally model graphs whose underlying topology changes...
A graph is temporally connected if there exists a strict temporal path, ...
Motivated by biological processes, we introduce here the model of growin...
The interest in dynamic processes on networks is steadily rising in rece...
In a temporal network with discrete time-labels on its edges, entities a...
We examine the problem of gathering k ≥ 2 agents (or multi-agent
rendezv...
We study the complexity of finding a Walrasian equilibrium in markets wh...
This paper studies the maximum cardinality matching problem in stochasti...
In this paper we consider the following total functional problem: Given ...
We study Crystal Structure Prediction, one of the major problems in
comp...
In this paper, we study systems of distributed entities that can activel...
We study a security game over a network played between a defender and k
...
In this work we examine what graphs (networks) can be stably and
distrib...
Temporal graphs are used to abstractly model real-life networks that are...
We study the problem of finding an exact solution to the consensus halvi...
We consider the problem of resolving contention in communication network...
We study the problems of leader election and population size counting fo...
We study population protocols: networks of anonymous agents that interac...
In this paper we study the problem of exploring a temporal graph (i.e. a...
Modern, inherently dynamic systems are usually characterized by a networ...