{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T13:32:04Z","timestamp":1772717524858,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031435867","type":"print"},{"value":"9783031435874","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43587-4_22","type":"book-chapter","created":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T01:02:10Z","timestamp":1695258130000},"page":"304-317","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Vertex Ordering with\u00a0Precedence Constraints"],"prefix":"10.1007","author":[{"given":"Jeff","family":"Kinne","sequence":"first","affiliation":[]},{"given":"Akbar","family":"Rafiey","sequence":"additional","affiliation":[]},{"given":"Arash","family":"Rafiey","sequence":"additional","affiliation":[]},{"given":"Mohammad","family":"Sorkhpar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,21]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Amb\u00fchl, C., Mastrolilli, M., Mutsanas, N., Svensson, O.: On the approximability of single-machine scheduling with precedence constraints. Math. Oper. Res., 653\u2013669 (2011)","DOI":"10.1287\/moor.1110.0512"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Ambuhl, C., Mastrolilli, M., Svensson, O.: Inapproximability results for sparsest cut, optimal linear arrangement, and precedence constrained scheduling. In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), pp. 329\u2013337. IEEE (2007)","DOI":"10.1109\/FOCS.2007.40"},{"issue":"2","key":"22_CR3","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.orl.2014.01.008","volume":"42","author":"A Berger","year":"2014","unstructured":"Berger, A., Grigoriev, A., Heggernes, P., van der Zwaan, R.: Scheduling unit-length jobs with precedence constraints of small height. Oper. Res. Lett. 42(2), 166\u2013172 (2014)","journal-title":"Oper. Res. Lett."},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-40450-4_27","volume-title":"Algorithms \u2013 ESA 2013","author":"R Chitnis","year":"2013","unstructured":"Chitnis, R., Egri, L., Marx, D.: List H-coloring a graph by removing few vertices. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 313\u2013324. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40450-4_27"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Egri, L., Krokhin, A., Larose, B., Tesson, P.: The complexity of the list homomorphism problem for graphs. In: Theory of Computing Systems, pp. 143\u2013178 (2012)","DOI":"10.1007\/s00224-011-9333-8"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Flamm, C., Hofacker, I.L., Maurer-Stroh, S., Stadler, P.F., Zehl, M.: Design of multistable rna molecules. Rna, pp. 254\u2013265 (2001)","DOI":"10.1017\/S1355838201000863"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Geis, M., et al.: Folding kinetics of large rnas. J. Mol. Biol., 160\u2013173 (2008)","DOI":"10.1016\/j.jmb.2008.02.064"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Giakoumakis, V., Vanherpe, J.-M.: Bi-complement reducible graphs. Advances in Applied Mathematics, pp. 389\u2013402 (1997)","DOI":"10.1006\/aama.1996.0519"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Gutin, G., Hell, P., Rafiey, A., Yeo, A.: A dichotomy for minimum cost graph homomorphisms. Eur. J. Combinatorics, pp. 900\u2013911 (2008)","DOI":"10.1016\/j.ejc.2007.11.012"},{"issue":"6","key":"22_CR10","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/j.orl.2004.11.009","volume":"33","author":"B Johannes","year":"2005","unstructured":"Johannes, B.: On the complexity of scheduling unit-time jobs with or-precedence constraints. Oper. Res. Lett. 33(6), 587\u2013596 (2005)","journal-title":"Oper. Res. Lett."},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-642-10604-0_11","volume-title":"DNA Computing and Molecular Programming","author":"J Ma\u0148uch","year":"2009","unstructured":"Ma\u0148uch, J., Thachuk, C., Stacho, L., Condon, A.: NP-completeness of the direct energy barrier problem without pseudoknots. In: Deaton, R., Suyama, A. (eds.) DNA 2009. LNCS, vol. 5877, pp. 106\u2013115. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10604-0_11"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-32241-9_9","volume-title":"Computing and Combinatorics","author":"M Mastrolilli","year":"2012","unstructured":"Mastrolilli, M., Stamoulis, G.: Restricted max-min fair allocations with inclusion-free intervals. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol. 7434, pp. 98\u2013108. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32241-9_9"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"M\u00f6hring, R.H., Skutella, M., Stork, F.: Scheduling with and\/or precedence constraints. SIAM J. Comput., 393\u2013415 (2004)","DOI":"10.1137\/S009753970037727X"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Morgan, S.R., Higgs, P.G.: Barrier heights between ground states in a model of rna secondary structure. J. Phys. A Math. General, 3153 (1998)","DOI":"10.1088\/0305-4470\/31\/14\/005"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Muratore, G., Schwarz, U.M., Woeginger, G.J.: Parallel machine scheduling with nested job assignment restrictions. Oper. Res. Lett., 47\u201350 (2010)","DOI":"10.1016\/j.orl.2009.09.010"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Spinrad, J., Brandst\u00e4dt, A., Stewart, L.: Bipartite permutation graphs. Discrete Appl. Math., 279\u2013292 (1987)","DOI":"10.1016\/S0166-218X(87)80003-3"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Takizawa, H., Iwakiri, J., Terai, G., Asai, K.: Finding the direct optimal rna barrier energy and improving pathways with an arbitrary energy model. Bioinformatics 36, 227\u2013235 (2020)","DOI":"10.1093\/bioinformatics\/btaa469"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Thachuk, C., Ma\u0148uch, J., Rafiey, A., Mathieson, L.-A., Stacho, L., Condon, A.: An algorithm for the energy barrier problem without pseudoknots and temporary arcs. In: Biocomputing 2010, pages 108\u2013119. World Scientific (2010)","DOI":"10.1142\/9789814295291_0013"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Woeginger, G.J.: On the approximability of average completion time scheduling under precedence constraints. Discrete Appl. Math., 237\u2013252 (2003)","DOI":"10.1016\/S0166-218X(02)00427-4"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43587-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T21:37:16Z","timestamp":1699911436000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43587-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031435867","9783031435874"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43587-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"21 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=71937&L=2","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"69","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}