{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:12:14Z","timestamp":1725577934665},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642184680"},{"type":"electronic","value":"9783642184697"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18469-7_25","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T05:30:40Z","timestamp":1297315840000},"page":"274-286","source":"Crossref","is-referenced-by-count":6,"title":["On Maximum Differential Graph Coloring"],"prefix":"10.1007","author":[{"given":"Yifan","family":"Hu","sequence":"first","affiliation":[]},{"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[]},{"given":"Sankar","family":"Veeramoni","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Blache, G., Karpinski, M., Wirtgen, J.: On approximation intractability of the bandwidth problem. Technical Report TR98-014, University of Bonn (1998)"},{"key":"25_CR2","unstructured":"Brewer, C.: ColorBrewer - Color Advice for Maps, \n                    \n                      http:\/\/www.colorbrewer.org"},{"key":"25_CR3","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":"25_CR4","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":"25_CR5","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"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Gansner, E.R., Hu, Y.F., Kobourov, S.G.: GMap: Visualizing graphs and clusters as maps. In: IEEE Pacific Visualization Symposium (PacVis), pp. 201\u2013208 (2010)","DOI":"10.1109\/PACIFICVIS.2010.5429590"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Gansner, E.R., Hu, Y.F., Kobourov, S.G., Volinsky, C.: Putting recommendations on the map: visualizing clusters and relations. In: 3rd ACM Conference on Recommender Systems (RecSys), pp. 345\u2013348 (2009)","DOI":"10.1145\/1639714.1639784"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"1352","DOI":"10.1137\/S1064827500377733","volume":"23","author":"Y.F. Hu","year":"2001","unstructured":"Hu, Y.F., Scott, J.A.: A multilevel algorithm for wavefront reduction. SIAM Journal on Scientific Computing\u00a023, 1352\u20131375 (2001)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"25_CR9","first-page":"1","volume":"35","author":"G. Kumfert","year":"1997","unstructured":"Kumfert, G., Pothen, A.: Two improved algorithms for envelope and wavefront reduction. BIT\u00a035, 1\u201332 (1997)","journal-title":"BIT"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1137\/0213040","volume":"13","author":"J. Leung","year":"1984","unstructured":"Leung, J., Vornberger, O., Witthoff, J.: On some variants of the bandwidth minimization problem. SIAM Journal on Computing\u00a013, 650 (1984)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR11","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":"11","key":"25_CR12","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 Mathematics\u00a0309(11), 3541\u20133552 (2009)","journal-title":"Discrete Mathematics"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1002\/nme.1620230208","volume":"23","author":"S.W. Sloan","year":"1986","unstructured":"Sloan, S.W.: An algorithm for profile and wavefront reduction of sparse matrices. International Journal for Numerical Methods in Engineering\u00a023, 239\u2013251 (1986)","journal-title":"International Journal for Numerical Methods in Engineering"},{"issue":"3","key":"25_CR14","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/j.disc.2009.03.029","volume":"310","author":"L. T\u00f6r\u00f6k","year":"2010","unstructured":"T\u00f6r\u00f6k, L., Vrt\u2019o, I.: Antibandwidth of three-dimensional meshes. Discrete Mathematics\u00a0310(3), 505\u2013510 (2010)","journal-title":"Discrete Mathematics"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Unger, W.: The complexity of the approximation of the bandwidth problem. In: Proceedings of the 39th Symposium on Foundations of Computer Science (FOCS), pp. 82\u201391 (1998)","DOI":"10.1109\/SFCS.1998.743431"},{"issue":"8","key":"25_CR16","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"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1002\/jgt.3190080118","volume":"8","author":"W.W. Wong","year":"2006","unstructured":"Wong, W.W., Wong, C.K.: Minimum K-Hamiltonian graphs. Journal of Graph Theory\u00a08, 155\u2013165 (2006)","journal-title":"Journal of Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18469-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T07:56:54Z","timestamp":1553414214000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}