{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:11:40Z","timestamp":1762297900068},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325885"},{"type":"electronic","value":"9783642325892"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32589-2_28","type":"book-chapter","created":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T08:44:32Z","timestamp":1343810672000},"page":"296-307","source":"Crossref","is-referenced-by-count":17,"title":["Sitting Closer to Friends Than Enemies, Revisited"],"prefix":"10.1007","author":[{"given":"Marek","family":"Cygan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Pilipczuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Pilipczuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub Onufry","family":"Wojtaszczyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"28_CR1","doi-asserted-by":"crossref","first-page":"036121","DOI":"10.1103\/PhysRevE.72.036121","volume":"72","author":"T. Antal","year":"2005","unstructured":"Antal, T., Krapivsky, P.L., Redner, S.: Dynamics of social balance on networks. Phys. Rev. E\u00a072(3), 036121 (2005)","journal-title":"Phys. Rev. E"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-642-25870-1_6","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"R. Belmonte","year":"2011","unstructured":"Belmonte, R., Vatshelle, M.: Graph Classes with Structured Neighborhoods and Algorithmic Applications. In: Kolman, P., Kratochv\u00edl, J. (eds.) WG 2011. LNCS, vol.\u00a06986, pp. 47\u201358. Springer, Heidelberg (2011)"},{"issue":"5","key":"28_CR3","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1037\/h0046049","volume":"63","author":"D. Cartwright","year":"1956","unstructured":"Cartwright, D., Harary, F.: Structural balance: a generalization of heider\u2019s theory. Psychological Review\u00a063(5), 277\u2013293 (1956)","journal-title":"Psychological Review"},{"issue":"2","key":"28_CR4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0020-0190(95)00046-F","volume":"55","author":"D.G. Corneil","year":"1995","unstructured":"Corneil, D.G., Kim, H., Natarajan, S., Olariu, S., Sprague, A.P.: Simple linear time recognition of unit interval graphs. Inf. Process. Lett.\u00a055(2), 99\u2013104 (1995)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"28_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1177\/001872676702000206","volume":"20","author":"J.A. Davis","year":"1967","unstructured":"Davis, J.A.: Clustering and structural balance in graphs. Human Relations\u00a020(2), 181 (1967)","journal-title":"Human Relations"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Mumford, E.: Self-overlapping curves revisited. In: Mathieu, C. (ed.) SODA, pp. 160\u2013169. SIAM (2009)","DOI":"10.1137\/1.9781611973068.19"},{"key":"28_CR7","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, New York (1979)"},{"issue":"4","key":"28_CR8","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1109\/TCBB.2010.77","volume":"8","author":"S. Guillemot","year":"2011","unstructured":"Guillemot, S., Jansson, J., Sung, W.K.: Computing a smallest multilabeled phylogenetic tree from rooted triplets. IEEE\/ACM Trans. Comput. Biology Bioinform.\u00a08(4), 1141\u20131147 (2011)","journal-title":"IEEE\/ACM Trans. Comput. Biology Bioinform."},{"issue":"18","key":"28_CR9","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1016\/j.ipl.2009.07.010","volume":"109","author":"L. Ibarra","year":"2009","unstructured":"Ibarra, L.: A simple algorithm to find hamiltonian cycles in proper interval graphs. Inf. Process. Lett.\u00a0109(18), 1105\u20131108 (2009)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"28_CR10","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. J. Comput. Syst. Sci.\u00a062(2), 367\u2013375 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"28_CR11","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci.\u00a063(4), 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-03816-7_35","volume-title":"Mathematical Foundations of Computer Science 2009","author":"K. Ioannidou","year":"2009","unstructured":"Ioannidou, K., Mertzios, G.B., Nikolopoulos, S.D.: The Longest Path Problem Is Polynomial on Interval Graphs. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol.\u00a05734, pp. 403\u2013414. Springer, Heidelberg (2009)"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-642-22993-0_36","volume-title":"Mathematical Foundations of Computer Science 2011","author":"A.M. Kermarrec","year":"2011","unstructured":"Kermarrec, A.M., Thraves, C.: Can Everybody Sit Closer to Their Friends Than Their Enemies? In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol.\u00a06907, pp. 388\u2013399. Springer, Heidelberg (2011)"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Kunegis, J., Schmidt, S., Lommatzsch, A., Lerner, J., Luca, E.W.D., Albayrak, S.: Spectral analysis of signed graphs for clustering, prediction and visualization. In: SDM, p. 559\u2013570. SIAM (2010)","DOI":"10.1137\/1.9781611972801.49"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D.P., Kleinberg, J.M.: Governance in social media: A case study of the wikipedia promotion process. In: Cohen, W.W., Gosling, S. (eds.) ICWSM. The AAAI Press (2010)","DOI":"10.1609\/icwsm.v4i1.14013"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D.P., Kleinberg, J.M.: Predicting positive and negative links in online social networks. In: Rappa, M., Jones, P., Freire, J., Chakrabarti, S. (eds.) WWW, pp. 641\u2013650. ACM (2010)","DOI":"10.1145\/1772690.1772756"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D.P., Kleinberg, J.M.: Signed networks in social media. In: Mynatt, E.D., Schoner, D., Fitzpatrick, G., Hudson, S.E., Edwards, W.K., Rodden, T. (eds.) CHI, pp. 1361\u20131370. ACM (2010)","DOI":"10.1145\/1753326.1753532"},{"key":"28_CR18","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.endm.2006.08.020","volume":"26","author":"G.B. Mertzios","year":"2006","unstructured":"Mertzios, G.B.: A polynomial algorithm for the k-cluster problem on the interval graphs. Electronic Notes in Discrete Mathematics\u00a026, 111\u2013118 (2006)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"31","key":"28_CR19","doi-asserted-by":"publisher","first-page":"13636","DOI":"10.1073\/pnas.1004008107","volume":"107","author":"M. Szell","year":"2010","unstructured":"Szell, M., Lambiotte, R., Thurner, S.: Multirelational organization of large-scale social networks in an online world. PNAS\u00a0107(31), 13636\u201313641 (2010)","journal-title":"PNAS"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32589-2_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T01:54:08Z","timestamp":1687658048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32589-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325885","9783642325892"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32589-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}