{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,19]],"date-time":"2025-04-19T04:05:30Z","timestamp":1745035530885,"version":"3.40.4"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031845420","type":"print"},{"value":"9783031845437","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-84543-7_1","type":"book-chapter","created":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T06:52:07Z","timestamp":1744959127000},"page":"3-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Rique Number of\u00a0Series-Parallel Graphs and\u00a0Planar Bipartite Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-7388-1670","authenticated-orcid":false,"given":"Sk Ruhul","family":"Azgor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0112-0242","authenticated-orcid":false,"given":"Md. Saidur","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,19]]},"reference":[{"issue":"3","key":"1_CR1","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":"1_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.tcs.2022.09.019","volume":"936","author":"P Angelini","year":"2022","unstructured":"Angelini, P., Bekos, M.A., Kindermann, P., Mchedlidze, T.: On mixed linear layouts of series-parallel graphs. Theoret. Comput. Sci. 936, 129\u2013138 (2022). https:\/\/doi.org\/10.1016\/j.tcs.2022.09.019","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Bekos, M.A., Felsner, S., Kindermann, P., Kobourov, S., Kratochv\u00edl, J., Rutter, I.: The Rique-number of graphs. In: International Symposium on Graph Drawing and Network Visualization, pp. 371\u2013386. Springer (2022)","DOI":"10.1007\/978-3-031-22203-0_27"},{"key":"1_CR4","unstructured":"Bekos, M.A., Kaufmann, M., Pavlidi, M.E., Rieger, X.: On the deque and Rique numbers of complete and complete bipartite graphs. arXiv preprint arXiv:2306.15395 (2023)"},{"issue":"3","key":"1_CR5","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/jgt.3190060302","volume":"6","author":"PZ Chinn","year":"1982","unstructured":"Chinn, P.Z., Chv\u00e1talov\u00e1, J., Dewdney, A.K., Gibbs, N.E.: The bandwidth problem for graphs and matrices-a survey. J. Graph Theory 6(3), 223\u2013254 (1982)","journal-title":"J. Graph Theory"},{"issue":"1","key":"1_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0608002","volume":"8","author":"FRK Chung","year":"1987","unstructured":"Chung, F.R.K., Leighton, F.T., Rosenberg, A.L.: Embedding graphs in books: a layout problem with applications to VLSI design. SIAM J. Algebraic Discrete Methods 8(1), 33\u201358 (1987). https:\/\/doi.org\/10.1137\/0608002","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Pratt, V.R.: Computing permutations with double-ended queues, parallel stacks and parallel queues. In: Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, pp. 268\u2013277 (1973)","DOI":"10.1145\/800125.804058"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Pupyrev, S.: Mixed linear layouts of planar graphs. In: Graph Drawing and Network Visualization: 25th International Symposium, GD 2017, Boston, MA, USA, September 25-27, 2017, Revised Selected Papers 25, pp. 197\u2013209. Springer (2018)","DOI":"10.1007\/978-3-319-73915-1_17"},{"key":"1_CR9","unstructured":"Pupyrev, S.: Linear layouts of graphs (2024). https:\/\/spupyrev.github.io\/linearlayouts.html"},{"key":"1_CR10","series-title":"Undergraduate Topics in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49475-3","volume-title":"Basic Graph Theory","author":"MS Rahman","year":"2017","unstructured":"Rahman, M.S.: Basic Graph Theory. UTCS, Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-49475-3"},{"key":"1_CR11","first-page":"41","volume":"86","author":"M Serna","year":"2005","unstructured":"Serna, M., Thilikos, D.: Parameterized complexity for graph layout problems. Bull. Eur. Assoc. Theor. Comput. Sci. 86, 41\u201365 (2005)","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Applied Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-84543-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T06:52:11Z","timestamp":1744959131000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-84543-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031845420","9783031845437"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-84543-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"19 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaa2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}