1. L(h,1)-labeling subclasses of planar graphs;Calamoneri;J. Parallel Distrib. Comput.,2004
2. Optimal L(h,k)-labeling of regular grids;Calamoneri;Discrete Math. Theor. Comput. Sci.,2006
3. New bounds for the L(h,k)-number of regular grids;Calamoneri;Int. J. Mob. Netw. Des. Innovat.,2006
4. The L(h,k)-labeling problem: an updated survey and annotated bibliography;Calamoneri;Comput. J.,2011
5. B. Dai, W. Lin, On (s,t)-relaxed L(2,1)-labelings of the hexagonal lattice, 2012, manuscript.