{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:07:06Z","timestamp":1725815226250},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662460771"},{"type":"electronic","value":"9783662460788"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46078-8_10","type":"book-chapter","created":{"date-parts":[[2015,1,14]],"date-time":"2015-01-14T09:54:29Z","timestamp":1421229269000},"page":"115-127","source":"Crossref","is-referenced-by-count":0,"title":["The Maximum k-Differential Coloring Problem"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sankar","family":"Veeramoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10732-010-9124-4","volume":"17","author":"R. Bansal","year":"2011","unstructured":"Bansal, R., Srivastava, K.: Memetic algorithm for the antibandwidth maximization problem. Journal of Heuristics\u00a017, 39\u201360 (2011)","journal-title":"Journal of Heuristics"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Bekos, M., Kaufmann, M., Kobourov, S., Veeramoni, S.: A note on maximum differential coloring of planar graphs. Journal of Discrete Algorithms (2014)","DOI":"10.1016\/j.jda.2014.06.004"},{"key":"10_CR3","unstructured":"Bekos, M., Kobourov, S., Kaufmann, M., Veeramoni, S.: The maximum k-differential coloring problem. Arxiv report (2014), http:\/\/arxiv.org\/abs\/1409.8133"},{"key":"10_CR4","unstructured":"Brewer, C.: ColorBrewer - Color Advice for Maps, http:\/\/www.colorbrewer.org"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.endm.2006.06.028","volume":"24","author":"T. Calamoneri","year":"2006","unstructured":"Calamoneri, T., Massini, A., T\u00f6r\u00f6k, L., Vrt\u2019o, I.: Antibandwidth of complete k-ary trees. Electronic Notes in Discrete Mathematics\u00a024, 259\u2013266 (2006)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-70904-6_29","volume-title":"Graph Drawing","author":"M.B. Dillencourt","year":"2007","unstructured":"Dillencourt, M.B., Eppstein, D., Goodrich, M.T.: Choosing colors for geometric graphs via color space embeddings. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 294\u2013305. Springer, Heidelberg (2007)"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.endm.2009.07.048","volume":"34","author":"S. Dobrev","year":"2009","unstructured":"Dobrev, S., Kr\u00e1lovic, R., Pardubsk\u00e1, D., T\u00f6r\u00f6k, L., Vrt\u2019o, I.: Antibandwidth and cyclic antibandwidth of hamming graphs. Electronic Notes in Discrete Mathematics\u00a034, 295\u2013300 (2009)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1002\/net.20418","volume":"58","author":"A. Duarte","year":"2011","unstructured":"Duarte, A., Mart\u00ed, R., Resende, M., Silva, R.: Grasp with path relinking heuristics for the antibandwidth problem. Networks\u00a058(3), 171\u2013189 (2011)","journal-title":"Networks"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-642-18638-7_6","volume-title":"Graph Drawing Software","author":"J. Ellson","year":"2004","unstructured":"Ellson, J., Gansner, E., Koutsofios, E., North, S., Woodhull, G.: Graphviz and dynagraph static and dynamic graph drawing tools. In: J\u00fcnger, M., Mutzel, P. (eds.) Graph Drawing Software, pp. 127\u2013148. Springer, Heidelberg (2004)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Gansner, E., Hu, Y., Kobourov, S.: Gmap: Visualizing graphs and clusters as maps. In: 2010 IEEE Pacific Visualization Symposium (PacificVis), pp. 201\u2013208 (2010)","DOI":"10.1109\/PACIFICVIS.2010.5429590"},{"key":"10_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"12","key":"10_CR12","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"W. Hale","year":"1980","unstructured":"Hale, W.: Frequency assignment: Theory and applications. Proceedings of the IEEE\u00a068(12), 1497\u20131514 (1980)","journal-title":"Proceedings of the IEEE"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-642-18469-7_25","volume-title":"Graph Drawing","author":"Y. Hu","year":"2011","unstructured":"Hu, Y., Kobourov, S., Veeramoni, S.: On maximum differential graph coloring. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 274\u2013286. Springer, Heidelberg (2011)"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1002\/(SICI)1097-0118(199805)28:1<31::AID-JGT3>3.0.CO;2-G","volume":"27","author":"G. Isaak","year":"1998","unstructured":"Isaak, G.: Powers of hamiltonian paths in interval graphs. Journal of Graph Theory\u00a027, 31\u201338 (1998)","journal-title":"Journal of Graph Theory"},{"issue":"3","key":"10_CR15","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1137\/0213040","volume":"13","author":"J.Y.-T. Leung","year":"1984","unstructured":"Leung, J.Y.-T., Vornberger, O., Witthoff, J.D.: On some variants of the bandwidth minimization problem. SIAM Journal on Computing\u00a013(3), 650\u2013667 (1984)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"10_CR16","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1002\/net.3230190604","volume":"19","author":"Z. Miller","year":"1989","unstructured":"Miller, Z., Pritikin, D.: On the separation number of a graph. Networks\u00a019(6), 651\u2013666 (1989)","journal-title":"Networks"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02280884","volume":"16","author":"C. Papadimitriou","year":"1975","unstructured":"Papadimitriou, C.: The NP-Completeness of the bandwidth minimization problem. Computing\u00a016, 263\u2013270 (1975)","journal-title":"Computing"},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0607016","volume":"7","author":"A. Proskurowski","year":"1986","unstructured":"Proskurowski, A., Syso, M.: Efficient vertex- and edge-coloring of outerplanar graphs. SIAM Journal on Algebraic Discrete Methods\u00a07(1), 131\u2013136 (1986)","journal-title":"SIAM Journal on Algebraic Discrete Methods"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Purves, D., Lotto, R.B.: Why we see what we do: An empirical theory of vision. Sinauer Associates (2003)","DOI":"10.1511\/2002.9.236"},{"issue":"11","key":"10_CR20","doi-asserted-by":"publisher","first-page":"3541","DOI":"10.1016\/j.disc.2007.12.058","volume":"309","author":"A. Raspaud","year":"2009","unstructured":"Raspaud, A., Schr\u00f6der, H., S\u00fdkora, O., T\u00f6r\u00f6k, L., Vrt\u2019o, I.: Antibandwidth and cyclic antibandwidth of meshes and hypercubes. Discrete Math.\u00a0309(11), 3541\u20133552 (2009)","journal-title":"Discrete Math."},{"issue":"8","key":"10_CR21","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1016\/j.dam.2008.12.004","volume":"157","author":"X. Wang","year":"2009","unstructured":"Wang, X., Wu, X., Dumitrescu, S.: On explicit formulas for bandwidth and antibandwidth of hypercubes. Discrete Applied Mathematics\u00a0157(8), 1947\u20131952 (2009)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"10_CR22","first-page":"16","volume":"35","author":"Y. Weili","year":"2003","unstructured":"Weili, Y., Xiaoxu, L., Ju, Z.: Dual bandwidth of some special trees. Journal of Zhengzhou University (Natural Science)\u00a035(3), 16\u201319 (2003)","journal-title":"Journal of Zhengzhou University (Natural Science)"},{"issue":"1","key":"10_CR23","first-page":"1","volume":"35","author":"L. Yixun","year":"2003","unstructured":"Yixun, L., Jinjiang, Y.: The dual bandwidth problem for graphs. Journal of Zhengzhou University (Natural Science)\u00a035(1), 1\u20135 (2003)","journal-title":"Journal of Zhengzhou University (Natural Science)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2015: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46078-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T19:50:58Z","timestamp":1690833058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46078-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662460771","9783662460788"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46078-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}