{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T20:52:25Z","timestamp":1794516745533,"version":"4.9.1"},"publisher-location":"New York, NY","reference-count":11,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_187","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:03:23Z","timestamp":1461269003000},"page":"961-964","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Independent Sets in Random Intersection Graphs"],"prefix":"10.1007","author":[{"given":"Sotiris","family":"Nikoletseas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christoforos L.","family":"Raptopoulos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"187_CR958","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"The probabilistic method","author":"N Alon","year":"2000","unstructured":"Alon N, Spencer H (2000) The probabilistic method. Wiley"},{"key":"187_CR959","doi-asserted-by":"crossref","unstructured":"Efthymiou C, Spirakis P (2005) On the existence of Hamiltonian cycles in random intersection graphs. In: Proceedings of 32nd international colloquium on automata, languages and programming (ICALP). Springer, Berlin\/Heidelberg, pp 690\u2013701","DOI":"10.1007\/11523468_56"},{"issue":"2","key":"187_CR960","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1002\/(SICI)1098-2418(200003)16:2<156::AID-RSA3>3.0.CO;2-H","volume":"16","author":"JA Fill","year":"2000","unstructured":"Fill JA, Sheinerman ER, Singer-Cohen KB (2000) Random intersection graphs when m = \u03c9(n): an equivalence theorem relating the evolution of the g(n, m, p) and g(n, p)models. Random Struct Algorithms 16(2):156\u2013176","journal-title":"Random Struct Algorithms"},{"key":"187_CR961","first-page":"131","volume":"8","author":"M Karo\u0144ski","year":"1999","unstructured":"Karo\u0144ski M, Scheinerman ER, Singer-Cohen KB (1999) On random intersection graphs: the subgraph problem. Adv Appl Math 8:131\u2013159","journal-title":"Adv Appl Math"},{"key":"187_CR962","doi-asserted-by":"crossref","first-page":"303","DOI":"10.4064\/fm-33-1-303-307","volume":"33","author":"E Marczewski","year":"1945","unstructured":"Marczewski E (1945) Sur deux propri\u00e9t\u00e9s des classes d\u2019ensembles. Fundam Math 33:303\u2013307","journal-title":"Fundam Math"},{"key":"187_CR963","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani R, Raghavan P (1995) Randomized algorithms. Cambridge University Press"},{"key":"187_CR964","doi-asserted-by":"crossref","unstructured":"Nikoletseas S, Raptopoulos C, Spirakis P (2004) The existence and efficient construction of large independent sets in general random intersection graphs. In: Proceedings of 31st international colloquium on Automata, Languages and Programming (ICALP). Springer, Berlin\/Heidelberg, pp 1029\u20131040. Also in the Theoretical Computer Science (TCS) Journal, accepted, to appear in 2008","DOI":"10.1007\/978-3-540-27836-8_86"},{"key":"187_CR965","doi-asserted-by":"crossref","unstructured":"Raptopoulos C, Spirakis P (2005) Simple and efficient greedy algorithms for Hamiltonian cycles in random intersection graphs. In: Proceedings of the 16th international symposium on algorithms and computation (ISAAC). Springer, Berlin\/Heidelberg, pp 493\u2013504","DOI":"10.1007\/11602613_50"},{"key":"187_CR966","volume-title":"Stochastic processes","author":"S Ross","year":"1995","unstructured":"Ross S (1995) Stochastic processes. Wiley"},{"key":"187_CR967","unstructured":"Singer-Cohen KB (1995) Random intersection graphs. Ph.D. thesis, John Hopkins University, Baltimore"},{"key":"187_CR968","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1002\/rsa.20005","volume":"24","author":"D Stark","year":"2004","unstructured":"Stark D (2004) The vertex degree distribution of random intersection graphs. Random Struct Algorithms 24:249\u2013258","journal-title":"Random Struct Algorithms"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_187","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:45:07Z","timestamp":1792107907000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_187"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_187","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}