53 citations · 54 across the 2 of their papers we have counts for
2 papers
cs.DM2016★ 1 cited
-supermagic labelings for firecrackers, banana trees and flowers
Rachel Wulan Nirmalasari Wijaya, Andrea Semaničová-Feňovčíková, Joe Ryan +1
A simple graph admits an -covering if every edge in is contained in a subgraph of which is isomorphic to . In this case we say that is -…
cs.DM2013★ 53 cited
Incremental Network Design with Maximum Flows
Thomas Kalinowski, Dmytro Matsypura, Martin W. P. Savelsbergh
We study an incremental network design problem, where in each time period of the planning horizon an arc can be added to the network and a maximum flow problem is solved, and where…