{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T02:38:49Z","timestamp":1725849529381},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319295152"},{"type":"electronic","value":"9783319295169"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-29516-9_15","type":"book-chapter","created":{"date-parts":[[2016,2,19]],"date-time":"2016-02-19T05:05:19Z","timestamp":1455858319000},"page":"173-184","source":"Crossref","is-referenced-by-count":1,"title":["Algorithmic Aspects of the S-Labeling Problem"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Fertin","sequence":"first","affiliation":[]},{"given":"Irena","family":"Rusu","sequence":"additional","affiliation":[]},{"given":"St\u00e9phane","family":"Vialette","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,20]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1137\/0206002","volume":"6","author":"D Adolphson","year":"1977","unstructured":"Adolphson, D.: Single machine job sequencing with precedence constraints. SIAM J. Comput. 6, 40\u201354 (1977)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"15_CR2","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/0125042","volume":"25","author":"D Adolphson","year":"1973","unstructured":"Adolphson, D., Hu, T.C.: Optimal linear ordering. SIAM J. Appl. Math. 25(3), 403\u2013423 (1973)","journal-title":"SIAM J. Appl. Math."},{"key":"15_CR3","first-page":"157","volume-title":"Graph Theory and Combinatorial Biology","author":"S Bezrukov","year":"1999","unstructured":"Bezrukov, S.: Edge isoperimetric problems on graphs. In: Lovasz, L., Gy\u00e1rf\u00e1s, A., Katona, B.O.H., Recski, A., Szekely, L. (eds.) Graph Theory and Combinatorial Biology, pp. 157\u2013197. Janos Bolyai Mathematical Society, Budapest (1999)"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","volume":"28","author":"SN Bhatt","year":"1984","unstructured":"Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci. 28, 300\u2013343 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR5","first-page":"151","volume-title":"Selected Topics in Graph Theory","author":"FRK Chung","year":"1988","unstructured":"Chung, F.R.K.: Labeling of graphs. In: Wilson, R.J., Beineke, L.W. (eds.) Selected Topics in Graph Theory, vol. 3, pp. 151\u2013168. Academic Press, London (1988)"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF02124750","volume":"5","author":"RM Corless","year":"1996","unstructured":"Corless, R.M., Gonnet, G.H., Hare, D.E.G., Jeffrey, D.J., Knuth, D.E.: On the Lambert W function. Adv. Comput. Math. 5, 329\u2013359 (1996)","journal-title":"Adv. Comput. Math."},{"key":"15_CR7","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"issue":"3","key":"15_CR8","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J D\u00ecaz","year":"2002","unstructured":"D\u00ecaz, J., Petit, J., Serna, M.: A survey on graph layout problems. J. ACM Comput. Surv. (CSUR) 34(3), 313\u2013356 (2002)","journal-title":"J. ACM Comput. Surv. (CSUR)"},{"doi-asserted-by":"crossref","unstructured":"Fertin, G., Vialette, S.: On the \n \n \n \n $${S}$$\n -labeling problem. In: Proceedings of the 5th European Conference on Combinatorics, Graph Theory and Applications (EuroComb). Electronic Notes on Discrete Mathematics, vol. 34, pp. 273\u2013277 (2009)","key":"15_CR9","DOI":"10.1016\/j.endm.2009.07.044"},{"key":"15_CR10","volume-title":"Matrix Computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins University Press, Baltimore, London (1996)","edition":"3"},{"issue":"3","key":"15_CR11","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s00224-007-1330-6","volume":"41","author":"G Gutin","year":"2007","unstructured":"Gutin, G., Rafiey, A., Szeider, S., Yeo, A.: The linear arrangement problem parameterized above guaranteed value. Theor. Comput. Syst. 41(3), 521\u2013538 (2007). Erratum-ibid [12]","journal-title":"Theor. Comput. Syst."},{"issue":"4","key":"15_CR12","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/s00224-007-9037-2","volume":"53","author":"G Gutin","year":"2013","unstructured":"Gutin, G., Rafiey, A., Szeider, S., Yeo, A.: Corrigendum. the linear arrangement problem parameterized above guaranteed value. Theor. Comput. Syst. 53(4), 690\u2013691 (2013)","journal-title":"Theor. Comput. Syst."},{"issue":"1","key":"15_CR13","first-page":"131","volume":"12","author":"LH Harper","year":"1964","unstructured":"Harper, L.H.: Optimal numberings and isoperimetric problems on graphs. SIAM J. 12(1), 131\u2013135 (1964)","journal-title":"SIAM J."},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"DS Johnson","year":"1988","unstructured":"Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Inf. Process. Lett. 27, 119\u2013123 (1988)","journal-title":"Inf. Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"Karger, D.R.: A randomized fully polynomial approximation scheme for all terminal network reliability problem. In: 27th ACM Symposium on Theory of Computing (STOC), pp. 11\u201317 (1995)","key":"15_CR15","DOI":"10.1145\/225058.225069"},{"doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Mapping the genome: some combinatorial problem arising in molecular biology. In: 24th ACM Symposium on Theory of Computing (STOC), pp. 278\u2013285 (1993)","key":"15_CR16","DOI":"10.1145\/167088.167170"},{"key":"15_CR17","volume-title":"Iterative Methods for Sparse Linear Systems","author":"S Kitaev","year":"2003","unstructured":"Kitaev, S.: Iterative Methods for Sparse Linear Systems, 2nd edn. Society for Industrial and Applied Mathematics, Philadelphia (2003)","edition":"2"},{"volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","year":"1993","author":"FT Leighton","unstructured":"Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo (1993)","key":"15_CR18"},{"issue":"2","key":"15_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"RJ Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Appl. Math. 36(2), 177\u2013189 (1979)","journal-title":"SIAM J. Appl. Math."},{"issue":"2","key":"15_CR20","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1006\/jagm.1998.0996","volume":"31","author":"M Mahajan","year":"1999","unstructured":"Mahajan, M., Raman, V.: Parameterizing above guaranteed values: MaxSat and MaxCut. J. Algorithms 31(2), 335\u2013354 (1999)","journal-title":"J. Algorithms"},{"key":"15_CR21","series-title":"Lecture Series in Mathematics and Its Applications","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed Parameter Algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Lecture Series in Mathematics and Its Applications. Oxford University Press, Oxford (2006)"},{"issue":"4","key":"15_CR22","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1051\/ita:2006037","volume":"40","author":"S Vialette","year":"2006","unstructured":"Vialette, S.: Packing of \n \n \n \n $$(0, 1)$$\n -matrices. Theor. Inform. Appl. RAIRO 40(4), 519\u2013536 (2006)","journal-title":"Theor. Inform. Appl. RAIRO"},{"issue":"1","key":"15_CR23","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1137\/0607015","volume":"7","author":"HS Wilf","year":"1986","unstructured":"Wilf, H.S.: On the number of maximal independent sets in a tree. SIAM J. Algebraic Discrete Methods 7(1), 125\u2013130 (1986)","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29516-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:44:56Z","timestamp":1559400296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29516-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319295152","9783319295169"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29516-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}
