On distance graph coloring problems

[1]  F'abio Protti,et al.  New algorithms for the Minimum Coloring Cut Problem , 2017, Int. Trans. Oper. Res..

[2]  Rosa Figueiredo,et al.  Feasibility check for the distance geometry problem: an application to molecular conformations , 2017, Int. Trans. Oper. Res..

[3]  Antonio Mucherino,et al.  Optimal partial discretization orders for discretizable distance geometry , 2016, Int. Trans. Oper. Res..

[4]  Jayme Luiz Szwarcfiter,et al.  Distance geometry approach for special graph coloring problems , 2016, ArXiv.

[5]  Leo Liberti,et al.  Euclidean Distance Geometry and Applications , 2012, SIAM Rev..

[6]  Zhipeng Lü,et al.  Multistart Iterated Tabu Search for Bandwidth Coloring Problem , 2013, Comput. Oper. Res..

[7]  Leo Liberti,et al.  Distance Geometry: Theory, Methods, and Applications , 2013, Distance Geometry.

[8]  Leo Liberti,et al.  Noname manuscript No. (will be inserted by the editor) The Discretizable Distance Geometry Problem , 2022 .

[9]  Leo Liberti,et al.  Recent advances on the Discretizable Molecular Distance Geometry Problem , 2012, Eur. J. Oper. Res..

[10]  Leo Liberti,et al.  The discretizable molecular distance geometry problem , 2006, Computational Optimization and Applications.

[11]  Bhabani P. Sinha,et al.  A survey on the channel assignment problem in wireless networks , 2011, Wirel. Commun. Mob. Comput..

[12]  Xavier Muñoz,et al.  Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless and Ad Hoc Networks , 2010, Texts in Theoretical Computer Science. An EATCS Series.

[13]  Paolo Toth,et al.  A survey on vertex coloring problems , 2010, Int. Trans. Oper. Res..

[14]  Leo Liberti,et al.  A Branch-and-Prune algorithm for the Molecular Distance Geometry Problem , 2008, Int. Trans. Oper. Res..

[15]  Hamid Aghvami,et al.  Multiple Access Protocols For Mobile Communications , 2002 .

[16]  Ito Hiro,et al.  A Coloring Problem With Restrictions of Adjacent Colors , 2002 .

[17]  David Aldous,et al.  The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees , 1990, SIAM J. Discret. Math..

[18]  W. K. Hale.  Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.

[19]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.