{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:30:06Z","timestamp":1725456606355},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642346101"},{"type":"electronic","value":"9783642346118"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34611-8_30","type":"book-chapter","created":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T04:42:25Z","timestamp":1350880945000},"page":"297-307","source":"Crossref","is-referenced-by-count":0,"title":["Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle Graphs"],"prefix":"10.1007","author":[{"given":"Fanica","family":"Gavril","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10107-005-0649-5","volume":"105","author":"K. Cameron","year":"2006","unstructured":"Cameron, K., Hell, P.: Independent Packings in Structured Graphs. Math. Program. Ser. B\u00a0105, 201\u2013213 (2006)","journal-title":"Math. Program. Ser. B"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1137\/060666238","volume":"21","author":"K. Cameron","year":"2007","unstructured":"Cameron, K., Eschen, E.M., Hoang, C.T., Sritharan, R.: The Complexity of the List Partition Problem of Graphs. SIAM J. Discrete Math.\u00a021, 900\u2013929 (2007)","journal-title":"SIAM J. Discrete Math."},{"key":"30_CR3","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/B978-0-12-417750-5.50011-7","volume-title":"Theory of Machines and Computations","author":"S. Even","year":"1971","unstructured":"Even, S., Itai, A.: Queues, Stacks and Graphs. In: Kohavi, Z., Paz, A. (eds.) Theory of Machines and Computations, pp. 71\u201386. Academic Press, New York (1971)"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T. Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv Orientirbare Graphen. Acta Math. Acad. Sci. Hungar\u00a018, 25\u201326 (1967)","journal-title":"Acta Math. Acad. Sci. Hungar"},{"key":"30_CR5","volume-title":"Computers and Intractability: A Guide to the Theory NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory NP-Completeness. W. H. Freeman and Co., San Francisco (1979)"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/net.3230030305","volume":"3","author":"F. Gavril","year":"1973","unstructured":"Gavril, F.: Algorithms for a Maximum Clique and a Maximum Independent Set of a Circle Graph. Networks\u00a03, 261\u2013273 (1973)","journal-title":"Networks"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0020-0190(00)00025-9","volume":"73","author":"F. Gavril","year":"2000","unstructured":"Gavril, F.: Maximum Weight Independent Sets and Cliques in Intersection Graphs of Filaments. Inform. Proc. Lett.\u00a073, 181\u2013188 (2000)","journal-title":"Inform. Proc. Lett."},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"2625","DOI":"10.1016\/j.dam.2007.08.006","volume":"155","author":"F. Gavril","year":"2007","unstructured":"Gavril, F.: 3D-Interval-Filament Gaphs. Discrete Appl. Math.\u00a0155, 2625\u20132636 (2007)","journal-title":"Discrete Appl. Math."},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-02029-2_3","volume-title":"Graph Theory, Computational Intelligence and Thought","author":"F. Gavril","year":"2009","unstructured":"Gavril, F.: Algorithms on Subtree Filament Graphs. In: Lipshteyn, M., Levit, V.E., McConnell, R.M. (eds.) Graph Theory, Computational Intelligence and Thought. LNCS, vol.\u00a05420, pp. 27\u201335. Springer, Heidelberg (2009)"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/j.ipl.2011.02.005","volume":"111","author":"F. Gavril","year":"2011","unstructured":"Gavril, F.: Algorithms for Induced Biclique Optimization Problems. Inform. Proc. Lett.\u00a0111, 469\u2013473 (2011)","journal-title":"Inform. Proc. Lett."},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1142\/S1793830911001243","volume":"3","author":"F. Gavril","year":"2011","unstructured":"Gavril, F.: Minimum Weight Feedback Vertex Sets in Circle n-Gon Graphs and Circle Trapezoid Graphs. Discrete Math., Algorithms and Applications\u00a03, 323\u2013336 (2011)","journal-title":"Discrete Math., Algorithms and Applications"},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0012-365X(83)90019-5","volume":"43","author":"M.C. Golumbic","year":"1983","unstructured":"Golumbic, M.C., Rotem, D., Urrutia, J.: Comparability Graphs and Intersection Graphs. Discrete Math.\u00a043, 37\u201346 (1983)","journal-title":"Discrete Math."},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0166-218X(03)00371-8","volume":"141","author":"P. Hell","year":"2004","unstructured":"Hell, P., Klein, S., Nogueira, L.T., Protti, F.: Partitioning Chordal Graphs into Independent Sets and Cliques. Discrete Appl. Math.\u00a0141, 185\u2013194 (2004)","journal-title":"Discrete Appl. Math."},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.bbrc.2009.09.130","volume":"390","author":"L. Holm","year":"2009","unstructured":"Holm, L.: Evaluation of Different Domain-based Methods in Protein Interaction Prediction. Biochem. Biophys. Res. Commun.\u00a0390, 357\u2013362 (2009)","journal-title":"Biochem. Biophys. Res. Commun."},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0012-365X(96)00344-5","volume":"163","author":"J. Kratochvil","year":"1997","unstructured":"Kratochvil, J., Kostochka, A.: Covering and Coloring Polygon-Circle Graphs. Discrete Math.\u00a0163, 299\u2013305 (1997)","journal-title":"Discrete Math."},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1109\/TCBB.2008.61","volume":"7","author":"X. Liu","year":"2010","unstructured":"Liu, X., Li, J., Wang, L.: Modeling Protein Interacting Groups by Quasi-Multicliques: Complexity, Algorithm and Application. IEEE\/ACM Trans. on Comp. Biology and Bioinf.\u00a07, 354\u2013364 (2010)","journal-title":"IEEE\/ACM Trans. on Comp. Biology and Bioinf."},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"2012","DOI":"10.1093\/bioinformatics\/btl338","volume":"22","author":"J.L. Morrison","year":"2006","unstructured":"Morrison, J.L., Breitling, R., Higham, D.J., Gilbert, D.R.: A Lock-and-Key Model for Protein-Protein Interactions. Bioinformatics\u00a022, 2012\u20132019 (2006)","journal-title":"Bioinformatics"},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-540-74839-7_23","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Pergel","year":"2007","unstructured":"Pergel, M.: Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete. In: Brandst\u00e4dt, A., Kratsch, D., M\u00fcller, H. (eds.) WG 2007. LNCS, vol.\u00a04769, pp. 238\u2013247. Springer, Heidelberg (2007)"},{"key":"30_CR19","series-title":"Fields Institute Monographs","volume-title":"Efficient Graph Representations","author":"J.P. Spinrad","year":"2003","unstructured":"Spinrad, J.P.: Efficient Graph Representations. Fields Institute Monographs. The American Mathematical Society, USA (2003)"},{"key":"30_CR20","first-page":"181","volume":"19","author":"J.P. Spinrad","year":"1995","unstructured":"Spinrad, J.P., Sritharan, R.: Algorithms for weakly triangulated graphs. DAM\u00a019, 181\u2013191 (1995)","journal-title":"DAM"},{"key":"30_CR21","doi-asserted-by":"publisher","first-page":"1491","DOI":"10.1042\/BST0311491","volume":"31","author":"A. Thomas","year":"2003","unstructured":"Thomas, A., Cannings, R., Monk, N.A.M., Cannings, C.: On the Structure of Protein-Protein Interaction Networks. Biochem. Soc. Trans.\u00a031, 1491\u20131496 (2003)","journal-title":"Biochem. Soc. Trans."},{"key":"30_CR22","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1137\/0210022","volume":"10","author":"M. Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Node-Deletion Problems in Bipartite Graphs. SIAM J. Computing\u00a010, 310\u2013327 (1981)","journal-title":"SIAM J. Computing"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34611-8_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T09:00:48Z","timestamp":1620118848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34611-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642346101","9783642346118"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34611-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}