research
∙
07/04/2023
On the structural and combinatorial properties in 2-swap word permutation graphs
In this paper, we study the graph induced by the 2-swap permutation on w...
share
research
∙
05/30/2023
Bayesian Decision Trees Inspired from Evolutionary Algorithms
Bayesian Decision Trees (DTs) are generally considered a more advanced a...
research
∙
02/28/2023
The Contest Game for Crowdsourcing Reviews
We consider a contest game modelling a contest where reviews for m propo...
research
∙
02/17/2023
Realizing temporal graphs from fastest travel times
In this paper we initiate the study of the temporal graph realization pr...
research
∙
01/22/2023
Parallel Approaches to Accelerate Bayesian Decision Trees
Markov Chain Monte Carlo (MCMC) is a well-established family of algorith...
research
∙
07/26/2022
Single MCMC Chain Parallelisation on Decision Trees
Decision trees are highly famous in machine learning and usually acquire...
research
∙
04/11/2022
The Complexity of Temporal Vertex Cover in Small-Degree Graphs
Temporal graphs naturally model graphs whose underlying topology changes...
research
∙
02/11/2022
The complexity of computing optimum labelings for temporal connectivity
A graph is temporally connected if there exists a strict temporal path, ...
research
∙
07/29/2021
The Complexity of Growing a Graph
Motivated by biological processes, we introduce here the model of growin...
research
∙
03/08/2021
Threshold-based Network Structural Dynamics
The interest in dynamic processes on networks is steadily rising in rece...
research
∙
02/12/2021
The Complexity of Transitively Orienting Temporal Graphs
In a temporal network with discrete time-labels on its edges, entities a...
research
∙
08/17/2020
Gathering in 1-Interval Connected Graphs
We examine the problem of gathering k ≥ 2 agents (or multi-agent rendezv...
research
∙
05/24/2020
Walrasian Equilibria in Markets with Small Demands
We study the complexity of finding a Walrasian equilibrium in markets wh...
research
∙
05/17/2020
Matching in Stochastically Evolving Graphs
This paper studies the maximum cardinality matching problem in stochasti...
research
∙
04/13/2020
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle
In this paper we consider the following total functional problem: Given ...
research
∙
03/27/2020
Crystal Structure Prediction via Oblivious Local Search
We study Crystal Structure Prediction, one of the major problems in comp...
research
∙
03/06/2020
Distributed Computation and Reconfiguration in Actively Dynamic Networks
In this paper, we study systems of distributed entities that can activel...
research
∙
06/06/2019
Connected Subgraph Defense Games
We study a security game over a network played between a defender and k ...
research
∙
03/14/2019
Fault Tolerant Network Constructors
In this work we examine what graphs (networks) can be stably and distrib...
research
∙
03/08/2019
How fast can we reach a target vertex in stochastic temporal graphs?
Temporal graphs are used to abstractly model real-life networks that are...
research
∙
03/07/2019
Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem
We study the problem of finding an exact solution to the consensus halvi...
research
∙
10/10/2018
Strategic Contention Resolution in Multiple Channels
We consider the problem of resolving contention in communication network...
research
∙
06/07/2018
Fast Approximate Counting and Leader Election in Populations
We study the problems of leader election and population size counting fo...
research
∙
05/13/2018
Exact size counting in uniform population protocols in nearly logarithmic time
We study population protocols: networks of anonymous agents that interac...
research
∙
05/12/2018
The temporal explorer who returns to the base
In this paper we study the problem of exploring a temporal graph (i.e. a...
research
∙
02/20/2018
