Improved bounds on coloring of graphs (2010)
Ndreca, Sokol, Procacci, Aldo, Scoppola, Benedetto
Given a graph $G$ with maximum degree $\Delta$, we prove that the acyclic edge chromatic number $a'(G)$ of $G$ is such that $a'(G)\le 9.62 \Delta$. Moreover we prove that $a'(G)\le 6.3 \Delta$ if $G$...
Discrete time GI/Geom/1 queueing system with priority
Ndreca, Sokol, Scoppola, Benedetto
We study a discrete time single server system with generic distribution of the number of arrivals in a time slot, geometric distribution of the service time and two classes of customers. The...