{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:51:24Z","timestamp":1725501084289},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744498"},{"type":"electronic","value":"9783540744504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74450-4_11","type":"book-chapter","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T05:49:24Z","timestamp":1189748964000},"page":"116-127","source":"Crossref","is-referenced-by-count":1,"title":["On the L(h,k)-Labeling of Co-comparability Graphs"],"prefix":"10.1007","author":[{"given":"Tiziana","family":"Calamoneri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saverio","family":"Caminiti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephan","family":"Olariu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rossella","family":"Petreschi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","first-page":"392","volume-title":"Proc. IEEE INFOCOM","author":"K.A. Aly","year":"1994","unstructured":"Aly, K.A., Dowd, P.W.: A class of scalable optical interconnection networks through discrete broadcast-select multi-domain WDM. In: Proc. IEEE INFOCOM, pp. 392\u2013399. IEEE Computer Society Press, Los Alamitos (1994)"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1002\/net.3230020103","volume":"2","author":"K.A. Baker","year":"1971","unstructured":"Baker, K.A., Fishburn, P.C., Roberts, F.S.: Partial orders of dimension two. Networks\u00a02, 11\u201328 (1971)","journal-title":"Networks"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Bertossi, A.A., Pinotti, C.M., Rizzi, R.: Channel assignment on strongly-simplicial graphs. In: IPDPS 2003. Proc. of Int. l Parallel and Distributed Processing Symposium, 222b (2003)","DOI":"10.1109\/IPDPS.2003.1213408"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1109\/71.615440","volume":"8","author":"G.E. Blelloch","year":"1997","unstructured":"Blelloch, G.E., Gibbons, P.B., Mattias, Y., Zagha, M.: Accounting for memory bank contentions and delay in high-bandwidth multiprocessors. IEEE Trans. on Parallel and Distributed Systems\u00a08, 943\u2013958 (1997)","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"11_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. North-Holland, Amsterdam (1976)"},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. Journal of Comput. Syst. Sci.\u00a013, 335\u2013379 (1976)","journal-title":"Journal of Comput. Syst. Sci."},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1145\/322123.322125","volume":"26","author":"K.S. Booth","year":"1979","unstructured":"Booth, K.S., Lueker, G.S.: A linear time algorithm for deciding interval graph isomorphism. Journal of the ACM\u00a026, 183\u2013195 (1979)","journal-title":"Journal of the ACM"},{"key":"11_CR8","doi-asserted-by":"crossref","first-page":"141","DOI":"10.46298\/dmtcs.361","volume":"8","author":"T. Calamoneri","year":"2006","unstructured":"Calamoneri, T.: Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks and Other Regular Grids. Discrete Mathematics & Theoretical Computer Science\u00a08, 141\u2013158 (2006)","journal-title":"Discrete Mathematics & Theoretical Computer Science"},{"issue":"5","key":"11_CR9","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1093\/comjnl\/bxl018","volume":"49","author":"T. Calamoneri","year":"2006","unstructured":"Calamoneri, T.: The L(h,k)-labelling problem: a survey. The Computer Journal\u00a049(5), 585\u2013608 (2006), A continuously updated version is available on http:\/\/www.dsi.uniroma1.it\/~calamo\/survey.html","journal-title":"The Computer Journal"},{"key":"11_CR10","unstructured":"Corneil, D.G., Kamula, P.A.: Extensions of permutation and interval graphs. In: Proceedings 18th Southeastern Conference on Combinatorics, Graph Theory and Computing, pp. 267\u2013276 (1987)"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1137\/S0895480193250125","volume":"10","author":"D.G. Corneil","year":"1997","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: Asteroidal triple-free graphs. SIAM Journal on Discrete Mathematics\u00a010, 399\u2013430 (1997)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"11_CR12","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1137\/S0895480104445307","volume":"20","author":"D.G. Corneil","year":"2006","unstructured":"Corneil, D.G., Koehler, E., Olariu, S., Stewart, L.: On Subfamilies of AT-Free Graphs. SIAM Journal on Discrete Mathematics\u00a020(1), 241\u2013253 (2006)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0166-218X(92)90296-M","volume":"35","author":"P. Damaschke","year":"1992","unstructured":"Damaschke, P.: Distance in cocomparability graphs and their powers. Disc. Applied Math.\u00a035, 67\u201372 (1992)","journal-title":"Disc. Applied Math."},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0166-218X(88)90032-7","volume":"21","author":"I. Degan","year":"1988","unstructured":"Degan, I., Golumbic, M.C., Pinter, R.Y.: Trapezoid graphs and their coloring. Discrete Applied Mathematics\u00a021, 35\u201346 (1988)","journal-title":"Discrete Applied Mathematics"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1145\/321707.321710","volume":"19","author":"S. Even","year":"1972","unstructured":"Even, S., Pnueli, A., Lempel, A.: Permutation graphs and transitive graphs. Journal of the ACM\u00a019, 400\u2013410 (1972)","journal-title":"Journal of the ACM"},{"key":"11_CR16","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 and Co., San Francisco (1979)"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1089\/cmb.1995.2.139","volume":"2","author":"P.W. Goldberg","year":"1995","unstructured":"Goldberg, P.W., Golumbic, M.C., Kaplan, H., Shamir, R.: Four strikes against physical mapping of DNA. Journal of Computational Biology\u00a02, 139\u2013152 (1995)","journal-title":"Journal of Computational Biology"},{"key":"11_CR18","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0166-218X(84)90016-7","volume":"9","author":"M.C. Golumbic","year":"1984","unstructured":"Golumbic, M.C., Monma, C.L., Trotter Jr., W.T.: Tolerance graphs. Discrete Applied Mathematics\u00a09, 157\u2013170 (1984)","journal-title":"Discrete Applied Mathematics"},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"J.R. Griggs","year":"1992","unstructured":"Griggs, J.R., Yeh, R.K.: Labeling graphs with a condition at distance 2. SIAM Journal of Discrete Mathematics\u00a05, 586\u2013595 (1992)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1002\/(SICI)1097-0118(199812)29:4<263::AID-JGT5>3.0.CO;2-V","volume":"29","author":"J. Heuvel van den","year":"1998","unstructured":"van den Heuvel, J., Leese, R.A., Shepherd, M.A.: Graph Labelling and Radio Channel Assignment. Journal of Graph Theory\u00a029, 263\u2013283 (1998)","journal-title":"Journal of Graph Theory"},{"key":"11_CR22","volume-title":"Graph Coloring Problems","author":"T.R. Jensen","year":"1995","unstructured":"Jensen, T.R., Toft, B.: Graph Coloring Problems. John Wiley & Sons, New York (1995)"},{"key":"11_CR23","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1145\/167088.167170","volume-title":"STOC 1993","author":"R.M. Karp","year":"1993","unstructured":"Karp, R.M.: Mapping the genome: some combinatorial problems arising in molecular biology. In: STOC 1993. Proc. 25th Ann. ACM Symp. on Theory of Comp., pp. 278\u2013285. ACM Press, New York (1993)"},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1137\/0406032","volume":"6","author":"D. Kratsch","year":"1993","unstructured":"Kratsch, D., Stewart, L.: Domination on cocomparability graphs. SIAM Journal on Discrete Mathematics\u00a06, 400\u2013417 (1993)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"11_CR25","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","volume":"51","author":"C.G. Lekkerkerker","year":"1962","unstructured":"Lekkerkerker, C.G., Boland, J.C.: Representation of a finite graph by a set of intervals on the real line. Fundamenta Mathematicae\u00a051, 45\u201364 (1962)","journal-title":"Fundamenta Mathematicae"},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0898-1221(93)90308-I","volume":"25","author":"P. Looges","year":"1993","unstructured":"Looges, P., Olariu, S.: Optimal Greedy Algorithms for Indifference Graphs. Computers and Mathematics with Application\u00a025, 15\u201325 (1993)","journal-title":"Computers and Mathematics with Application"},{"key":"11_CR27","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF02592052","volume":"26","author":"S.T. McCormick","year":"1983","unstructured":"McCormick, S.T.: Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem. Mathematical Programming\u00a026, 153\u2013171 (1983)","journal-title":"Mathematical Programming"},{"issue":"1","key":"11_CR28","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0020-0190(91)90245-D","volume":"37","author":"S. Olariu","year":"1991","unstructured":"Olariu, S.: An optimal greedy heuristic to color interval graphs. Information Processing Letters\u00a037(1), 21\u201325 (1991)","journal-title":"Information Processing Letters"},{"key":"11_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/3-540-60313-1_140","volume-title":"Algorithms - ESA \u201995","author":"I. Pe\u2019er","year":"1995","unstructured":"Pe\u2019er, I., Shamir, R.: Interval graphs with side (and size) constraints. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol.\u00a0979, pp. 142\u2013154. Springer, Heidelberg (1995)"},{"key":"11_CR30","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1137\/S0895480196306373","volume":"10","author":"I. Pe\u2019er","year":"1997","unstructured":"Pe\u2019er, I., Shamir, R.: Realizing interval graphs with side and distance constraints. SIAM Journal of Discrete Mathematics\u00a010, 662\u2013687 (1997)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"11_CR31","first-page":"235","volume":"59","author":"A. Raychauduri","year":"1987","unstructured":"Raychauduri, A.: On powers of interval and unit interval graphs. Conressus Numererantium\u00a059, 235\u2013242 (1987)","journal-title":"Conressus Numererantium"},{"key":"11_CR32","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D.J. Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM Journal on Computing\u00a05, 266\u2013283 (1976)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR33","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1137\/S0895480191223178","volume":"7","author":"D. Sakai","year":"1994","unstructured":"Sakai, D.: Labeling chordal graphs: distance two condition. SIAM Journal of Discrete Mathematics\u00a07, 133\u2013140 (1994)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"11_CR34","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1109\/TC.1978.1675122","volume":"17","author":"H.D. Shapiro","year":"1978","unstructured":"Shapiro, H.D.: Theoretical limitations on the efficient use of parallel memories. IEEE Transactions on Computers\u00a017, 421\u2013428 (1978)","journal-title":"IEEE Transactions on Computers"},{"key":"11_CR35","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R.E. Tarjan","year":"1984","unstructured":"Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs. SIAM Journal on Computing\u00a013, 566\u2013579 (1984)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR36","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/A:1009759916586","volume":"1","author":"P.J. Wan","year":"1997","unstructured":"Wan, P.J.: Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network. Journal of Combinatorial Optimization\u00a01, 179\u2013186 (1997)","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Lecture Notes in Computer Science","Combinatorics, Algorithms, Probabilistic and Experimental Methodologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74450-4_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T04:13:40Z","timestamp":1684037620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74450-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744498","9783540744504"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74450-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}