{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:47:08Z","timestamp":1725536828800},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03816-7_51","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T10:43:03Z","timestamp":1250678583000},"page":"600-611","source":"Crossref","is-referenced-by-count":3,"title":["Colouring Non-sparse Random Intersection Graphs"],"prefix":"10.1007","author":[{"given":"Sotiris","family":"Nikoletseas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoforos","family":"Raptopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"51_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"\u201cThe Probabilistic Method\u201d","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.: \u201cThe Probabilistic Method\u201d. John Wiley & Sons, Inc., Chichester (2000)"},{"key":"51_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Kahale, N.: A spectral technique for colouring random 3-colourable graphs. In: The Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pp. 346\u2013355 (1994)","DOI":"10.1145\/195058.195187"},{"key":"51_CR3","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1002\/rsa.3240020402","volume":"2","author":"J. Beck","year":"1991","unstructured":"Beck, J.: An Algorithmic Approach to the Lov\u00e1sz Local Lemma. Random Structures & Algorithms\u00a02, 343\u2013365 (1991)","journal-title":"Random Structures & Algorithms"},{"issue":"1","key":"51_CR4","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1137\/050647153","volume":"23","author":"M. Behrisch","year":"2009","unstructured":"Behrisch, M., Taraz, A., Ueckerdt, M.: Colouring random intersection graphs and complex networks. SIAM J. Discrete Math.\u00a023(1), 288\u2013299 (2009)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"51_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02122551","volume":"8","author":"B. Bollob\u00e1s","year":"1988","unstructured":"Bollob\u00e1s, B.: \u201cThe chromatic number of random graphs\u201d. Combinatorica\u00a08(1), 49\u201355 (1988)","journal-title":"Combinatorica"},{"issue":"1","key":"51_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s00446-007-0053-x","volume":"21","author":"C. Busch","year":"2008","unstructured":"Busch, C., Magdon-Ismail, M., Sivrikaya, F., Yener, B.: Contention-free MAC Protocols for Asynchronous Wireless Sensor Networks. Distributed Computing\u00a021(1), 23\u201342 (2008)","journal-title":"Distributed Computing"},{"key":"51_CR7","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kaklamanis, C., Kranakis, E., Krizanc, D., Wiese, A.: Communication in Wireless Networks with Directional Antennas. In: The Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2008), pp. 344\u2013351 (2008)","DOI":"10.1145\/1378533.1378592"},{"key":"51_CR8","doi-asserted-by":"crossref","unstructured":"Deijfen, M., Kets, W.: Random Intersection Graphs With Tunable Degree Distribution and Clustering. CentER Discussion Paper Series No. 2007-08, http:\/\/ssrn.com\/abstract=962359","DOI":"10.2139\/ssrn.962359"},{"issue":"4","key":"51_CR9","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.ipl.2007.10.015","volume":"106","author":"J. Diaz","year":"2008","unstructured":"Diaz, J., Lotker, Z., Serna, M.J.: The Distant-2 Chromatic Number of Random Proximity and Random Geometric Graphs. Inf. Process. Lett.\u00a0106(4), 144\u2013148 (2008)","journal-title":"Inf. Process. Lett."},{"key":"51_CR10","doi-asserted-by":"crossref","unstructured":"Dolev, S., Gilbert, S., Guerraoui, R., Newport, C.C.: Secure Communication over Radio Channels. In: The ACM Symposium on Principles of Distributed Computing (PODC), pp. 105\u2013114 (2008)","DOI":"10.1145\/1400751.1400767"},{"key":"51_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-77026-8_10","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2007","author":"S. Dolev","year":"2007","unstructured":"Dolev, S., Lahiani, L., Yung, M.: secret swarm unit reactive k \u2212Secret sharing. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol.\u00a04859, pp. 123\u2013137. Springer, Heidelberg (2007)"},{"key":"51_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/11523468_56","volume-title":"Automata, Languages and Programming","author":"C. Efthymiou","year":"2005","unstructured":"Efthymiou, C., Spirakis, P.G.: On the existence of hamiltonian cycles in random intersection graphs. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 690\u2013701. Springer, Heidelberg (2005)"},{"key":"51_CR13","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/0097-3165(73)90005-8","volume":"14","author":"P. Erd\u00f6s","year":"1973","unstructured":"Erd\u00f6s, P., Selfridge, J.: On a Combinatorial Game. J. Combinatorial Th (A)\u00a014, 298\u2013301 (1973)","journal-title":"J. Combinatorial Th. (A)"},{"key":"51_CR14","unstructured":"Fill, J.A., Sheinerman, E.R., Singer-Cohen, K.B.: Random Intersection Graphs when m\u2009=\u2009\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":"51_CR15","unstructured":"Frieze, A., Mubayi, D.: Colouring Simple Hypergraphs, arXiv:0901.3699v1 (2008)"},{"key":"51_CR16","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0012-365X(90)90149-C","volume":"81","author":"A. Frieze","year":"1990","unstructured":"Frieze, A.: On the Independence Number of Random Graphs. Disc. Math.\u00a081, 171\u2013175 (1990)","journal-title":"Disc. Math."},{"key":"51_CR17","first-page":"67","volume-title":"Studies in Classification, Data Analysis and Knowledge Organization","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 Organization, pp. 67\u201382. Springer, Heidelberg (2002)"},{"key":"51_CR18","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":"51_CR19","unstructured":"Kothapalli, K., Scheideler, C., Schindelhauer, C., Onus, M.: Distributed Colouring in $O(\\sqrt{\\log{n}})$ bits. In: The 20th IEEE International Parallel & Distributed Processing Symposium (IPDPS) (2006)"},{"key":"51_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/11963271_11","volume-title":"Algorithmic Aspects of Wireless Sensor Networks","author":"P. Leone","year":"2006","unstructured":"Leone, P., Moraru, L., Powell, O., Rolim, J.D.P.: Localization algorithm for wireless ad-hoc sensor networks with traffic overhead minimization by emission inhibition. In: Nikoletseas, S.E., Rolim, J.D.P. (eds.) ALGOSENSORS 2006. LNCS, vol.\u00a04240, pp. 119\u2013129. Springer, Heidelberg (2006)"},{"issue":"1","key":"51_CR21","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01375472","volume":"11","author":"T. \u0141uczak","year":"2005","unstructured":"\u0141uczak, T.: The chromatic number of random graphs. Combinatorica\u00a011(1), 45\u201354 (2005)","journal-title":"Combinatorica"},{"key":"51_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04016-0","volume-title":"Graph Colouring and the Probabilistic Method","author":"M. Molloy","year":"2002","unstructured":"Molloy, M., Reed, B.: Graph Colouring and the Probabilistic Method. Springer, Heidelberg (2002)"},{"key":"51_CR23","doi-asserted-by":"crossref","unstructured":"Molloy, M., Reed, B.: Colouring Graphs whose Chromatic Number is almost their Maximum Degree. In: The Proceedings of Latin American Theoretical Informatics, pp. 216\u2013225 (1998)","DOI":"10.1007\/BFb0054323"},{"key":"51_CR24","doi-asserted-by":"crossref","unstructured":"Molloy, M., Reed, B.: Further Algorithmic Aspects of the Local Lemma. In: The Proceedings of the 30th ACM Symposium on Theory of Computing, pp. 524\u2013529 (1998)","DOI":"10.1145\/276698.276866"},{"key":"51_CR25","unstructured":"Nikoletseas, S., Raptopoulos, C., Spirakis, P.: Colouring Non-Sparse Random Intersection Graphs, http:\/\/wwwhni.uni-paderborn.de\/alg\/mitarbeiter\/raptopox\/"},{"key":"51_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1007\/978-3-540-27836-8_86","volume-title":"Automata, Languages and Programming","author":"S.E. Nikoletseas","year":"2004","unstructured":"Nikoletseas, S.E., Raptopoulos, C., Spirakis, P.G.: The existence and efficient construction of large independent sets in general random intersection graphs. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 1029\u20131040. Springer, Heidelberg (2004)"},{"key":"51_CR27","doi-asserted-by":"crossref","unstructured":"Nikoletseas, S., Raptopoulos, C., Spirakis, P.: Large Independent Sets in General Random Intersection Graphs. Theoretical Computer Science (TCS) Journal, Special Issue on Global Computing (2008)","DOI":"10.1007\/978-0-387-30162-4_187"},{"key":"51_CR28","unstructured":"Nikoletseas, S., Raptopoulos, C., Spirakis, P.: On the Independence Number and Hamiltonicity of Uniform Random Intersection Graphs. In: accepted in the 23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS) (2009)"},{"key":"51_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/11602613_50","volume-title":"Algorithms and Computation","author":"C. Raptopoulos","year":"2005","unstructured":"Raptopoulos, C., Spirakis, P.G.: Simple and efficient greedy algorithms for hamilton cycles in random intersection graphs. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 493\u2013504. Springer, Heidelberg (2005)"},{"key":"51_CR30","volume-title":"\u201cStochastic Processes\u201d","author":"S.M. Ross","year":"2000","unstructured":"Ross, S.M.: \u201cStochastic Processes\u201d, 2nd edn. John Wiley & Sons, Inc., Chichester (2000)","edition":"2"},{"key":"51_CR31","doi-asserted-by":"crossref","unstructured":"Schindelhauer, C., Voss, K.: Oblivious Parallel Probabilistic Channel Utilization without Control Channels. In: The 20th IEEE International Parallel & Distributed Processing Symposium (IPDPS) (2006)","DOI":"10.1109\/IPDPS.2006.1639357"},{"key":"51_CR32","unstructured":"Singer-Cohen, K.B.: Random Intersection Graphs, PhD thesis. John Hopkins University (1995)"},{"issue":"3","key":"51_CR33","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1002\/rsa.20005","volume":"24","author":"D. Stark","year":"2004","unstructured":"Stark, D.: The Vertex Degree Distribution of Random Intersection Graphs. Random Structures & Algorithms\u00a024(3), 249\u2013258 (2004)","journal-title":"Random Structures & Algorithms"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:34:11Z","timestamp":1558478051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}