For a family $\cF$ of graphs, a graph $U$ is said to be $\cF$-induced-universal if every graph of $\cF$ is an induced subgraph of $U$. We give a construction for an induced-universal graph for the family of graphs on $n$ vertices with degree at most $k$. For $k$ even, our induced-universal graph has $O(n^{k/2})$ vertices and for $k$ odd it has $O(n^{\ceil{k/2}-1/k}\log^{2+2/k}n)$ vertices. This construction improves a result of Butler by a multiplicative constant factor for even case and by almost amultiplicative $n^{1/k}$ factor for odd case. We also construct induced-universal graphs for the class of oriented graphs with bounded incoming and outgoing degree, slightly improving another result of Butler.