Abstract: We introduce algorithms for search and state transfer that utilize discrete-time quantum walks with coins. These algorithms are implemented on hubs within a graph, defined as vertices that have connections to all other vertices. We show that the search algorithm finds multiple marked hubs with a probability close to one. We use the state transfer algorithm to send a walker between multiple senders and multiple receivers. We illustrate that fidelity of the state transfer depends on the number of senders and receivers, and also on the initial state located on sender vertices.