{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:13:10Z","timestamp":1726409590936},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228493"},{"type":"electronic","value":"9783540278368"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_86","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T22:53:21Z","timestamp":1284591201000},"page":"1029-1040","source":"Crossref","is-referenced-by-count":17,"title":["The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs"],"prefix":"10.1007","author":[{"given":"S.","family":"Nikoletseas","sequence":"first","affiliation":[]},{"given":"C.","family":"Raptopoulos","sequence":"additional","affiliation":[]},{"given":"P.","family":"Spirakis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"86_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method, 2nd edn. John Wiley & Sons, Inc., Chichester (2000)","edition":"2"},{"key":"86_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, Heidelberg (1999)"},{"key":"86_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"key":"86_CR4","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1006\/jagm.2000.1149","volume":"39","author":"J. D\u00edaz","year":"2001","unstructured":"D\u00edaz, J., Penrose, M.D., Petit, J., Serna, M.: Approximating Layout Problems on Random Geometric Graphs. Journal of Algorithms\u00a039, 78\u2013116 (2001)","journal-title":"Journal of Algorithms"},{"key":"86_CR5","doi-asserted-by":"crossref","unstructured":"D\u00edaz, J., Petit, J., Serna, M.: Chapter titled \u201cA Guide to Concentration Bounds. In: Handbook of Randomized Computing - Volumes I & II (Combinatorial Optimization 9), vol.\u00a0I, pp. 457\u2013507. Kluwer Academic Publishers, Dordrecht (2001)","DOI":"10.1007\/978-1-4615-0013-1_12"},{"key":"86_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44867-5_8","volume-title":"Experimental and Efficient Algorithms","author":"J. D\u00edaz","year":"2003","unstructured":"D\u00edaz, J., Petit, J., Serna, M.: A Random Graph Model for Optical Networks of Sensors. In: Jansen, K., Margraf, M., Mastrolli, M., Rolim, J.D.P. (eds.) WEA 2003. LNCS, vol.\u00a02647, Springer, Heidelberg (2003); Also in the IEEE Transactions on Mobile Computing Journal 2(3),186\u2013196 (2003)"},{"key":"86_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/3-540-49543-6_23","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"J. D\u00edaz","year":"1998","unstructured":"D\u00edaz, J., Petit, J., Serna, M.: Random Geometric Problems on [0, 1]2. In: Rolim, J.D.P., Serna, M., Luby, M. (eds.) RANDOM 1998. LNCS, vol.\u00a01518, pp. 294\u2013306. Springer, Heidelberg (1998)"},{"key":"86_CR8","unstructured":"Fill, J.A., Sheinerman, E.R., Singer-Cohen, K.B.: Random Intersection Graphs when m = \u03c9(n): An Equivalence Theorem Relating the Evolution of the G(n, m, p) and G(n, p) models, http:\/\/citeseer.nj.nec.com\/fill98random.html"},{"key":"86_CR9","first-page":"67","volume-title":"Studies in Classification, Data Analysis and Knowledge Organisation","author":"E. Godehardt","year":"2002","unstructured":"Godehardt, E., Jaworski, J.: Two models of Random Intersection Graphs for Classification. In: Opitz, O., Schwaiger, M. (eds.) Studies in Classification, Data Analysis and Knowledge Organisation, pp. 67\u201382. Springer, Heidelberg (2002)"},{"key":"86_CR10","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1017\/S0963548398003459","volume":"8","author":"M. Karo\u0144ski","year":"1999","unstructured":"Karo\u0144ski, M., Scheinerman, E.R., Singer- Cohen, K.B.: On Random Intersection Graphs: The Subgraph Problem. Combinatorics, Probability and Computing journal\u00a08, 131\u2013159 (1999)","journal-title":"Combinatorics, Probability and Computing journal"},{"key":"86_CR11","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.: \u201cSur deux propri\u00e9t\u00e9s des classes d\u2019 ensembles\u201d. Fund. Math.\u00a033, 303\u2013307 (1945)","journal-title":"Fund. Math."},{"key":"86_CR12","unstructured":"Nikoletseas, S., Raptopoulos, C., Spirakis, P.: The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs, http:\/\/www.cti.gr\/RD1\/nikole\/english\/psfiles\/paper.ps"},{"key":"86_CR13","doi-asserted-by":"crossref","unstructured":"Penrose, M.: Random Geometric Graphs. Oxford Studies in Probability (2003)","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"key":"86_CR14","volume-title":"Stochastic Processes","author":"S.M. Ross","year":"1996","unstructured":"Ross, S.M.: Stochastic Processes, 2nd edn. John Wiley & Sons, Chichester (1996)","edition":"2"},{"key":"86_CR15","unstructured":"Singer-Cohen, K.B.: Random Intersection Graphs, PhD thesis, John Hopkins University (1995)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_86.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:24:08Z","timestamp":1605759848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_86"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_86","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}