{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T22:31:01Z","timestamp":1717194661466},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,8,27]],"date-time":"2013-08-27T00:00:00Z","timestamp":1377561600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s00453-013-9821-0","type":"journal-article","created":{"date-parts":[[2013,8,27]],"date-time":"2013-08-27T06:59:19Z","timestamp":1377586759000},"page":"517-538","source":"Crossref","is-referenced-by-count":5,"title":["Using Patterns to Form Homogeneous Teams"],"prefix":"10.1007","volume":"71","author":[{"given":"Robert","family":"Bredereck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"K\u00f6hler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Nichterlein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geevarghese","family":"Philip","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,8,27]]},"reference":[{"issue":"1","key":"9821_CR1","doi-asserted-by":"crossref","first-page":"171","DOI":"10.2466\/pr0.1982.50.1.171","volume":"50","author":"M.G. Aamodt","year":"1982","unstructured":"Aamodt, M.G., Kimbrough, W.W.: Effect of group heterogeneity on quality of task solutions. Psychol. Rep. 50(1), 171\u2013174 (1982)","journal-title":"Psychol. Rep."},{"key":"9821_CR2","series-title":"Studies in Computational Intelligence","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/978-3-642-01085-9_15","volume-title":"Foundations of Computational Intelligence, Volume 3","author":"H. Abdelsalam","year":"2009","unstructured":"Abdelsalam, H.: Multi-objective team forming optimization for integrated product development projects. In: Foundations of Computational Intelligence, Volume 3. Studies in Computational Intelligence, vol. 203, pp. 461\u2013478. Springer, Berlin (2009)"},{"issue":"3","key":"9821_CR3","first-page":"48","volume":"3","author":"S.O. Adodo","year":"2011","unstructured":"Adodo, S.O., Agbayewa, J.O.: Effect of homogeneous and heterogeneous ability grouping class teaching on student\u2019s interest, attitude and achievement in integrated science. Int. J. Psychol. Couns. 3(3), 48\u201354 (2011)","journal-title":"Int. J. Psychol. Couns."},{"issue":"3","key":"9821_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1798596.1798602","volume":"6","author":"G. Aggarwal","year":"2010","unstructured":"Aggarwal, G., Feder, T., Kenthapadi, K., Khuller, S., Panigrahy, R., Thomas, D., Zhu, A.: Achieving anonymity via clustering. ACM Trans. Algorithms 6(3), 1\u201319 (2010)","journal-title":"ACM Trans. Algorithms"},{"key":"9821_CR5","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, New York (1993)"},{"issue":"2","key":"9821_CR6","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1080\/01969720601139041","volume":"38","author":"A. Baykasoglu","year":"2007","unstructured":"Baykasoglu, A., Dereli, T., Das, S.: Project team selection using fuzzy optimization approach. Cybern. Syst. 38(2), 155\u2013185 (2007)","journal-title":"Cybern. Syst."},{"key":"9821_CR7","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/978-3-642-14162-1_33","volume-title":"Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP\u201910)","author":"J. Blocki","year":"2010","unstructured":"Blocki, J., Williams, R.: Resolving the complexity of some data privacy problems. In: Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP\u201910). LNCS, vol. 6199, pp. 393\u2013404. Springer, Berlin (2010)"},{"key":"9821_CR8","series-title":"LNCS","first-page":"17","volume-title":"Proceedings of the 4th International Workshop on Parameterized and Exact Computation (IWPEC\u201909)","author":"H.L.B. Kernelization","year":"2009","unstructured":"Kernelization, H.L.B.: New upper and lower bound techniques. In: Proceedings of the 4th International Workshop on Parameterized and Exact Computation (IWPEC\u201909). LNCS, vol. 5917, pp. 17\u201337. Springer, Berlin (2009)"},{"issue":"35","key":"9821_CR9","doi-asserted-by":"crossref","first-page":"4570","DOI":"10.1016\/j.tcs.2011.04.039","volume":"412","author":"H.L. Bodlaender","year":"2011","unstructured":"Bodlaender, H.L., Thomass\u00e9, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci. 412(35), 4570\u20134578 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"9821_CR10","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Nichterlein, A., Niedermeier, R., Philip, G.: The effect of homogeneity on the computational complexity of combinatorial data anonymization. Data Min. Knowl. Discov. (2012). Online available","DOI":"10.1007\/s10618-012-0293-7"},{"key":"9821_CR11","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/978-3-642-38756-2_35","volume-title":"Proceedings of the Joint Conference of the 7th International Frontiers of Algorithmics Workshop and the 9th International Conference on Algorithmic Aspects of Information and Management (FAW-AAIM\u201913)","author":"R. Bredereck","year":"2013","unstructured":"Bredereck, R., Nichterlein, A., Niedermeier, R.: Pattern-guided k-anonymity. In: Proceedings of the Joint Conference of the 7th International Frontiers of Algorithmics Workshop and the 9th International Conference on Algorithmic Aspects of Information and Management (FAW-AAIM\u201913). LNCS, vol.\u00a07924, pp. 350\u2013361. Springer, Berlin (2013)"},{"key":"9821_CR12","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-3-642-29344-3_17","volume-title":"Proceedings of the 10th Latin American Symposium on Theoretical Informatics (LATIN\u201912)","author":"M. Cygan","year":"2012","unstructured":"Cygan, M., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.: Solving the 2-disjoint connected subgraphs problem faster than 2 n . In: Proceedings of the 10th Latin American Symposium on Theoretical Informatics (LATIN\u201912). LNCS, vol. 7256, pp. 195\u2013206. Springer, Berlin (2012)"},{"key":"9821_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Berlin (1999)"},{"key":"9821_CR14","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1016\/j.ejc.2012.04.008","volume":"34","author":"M.R. Fellows","year":"2013","unstructured":"Fellows, M.R., Jansen, B.M., Rosamond, F.: Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity. Eur. J. Comb. 34, 541\u2013566 (2013)","journal-title":"Eur. J. Comb."},{"key":"9821_CR15","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)"},{"issue":"4","key":"9821_CR16","first-page":"14:1","volume":"42","author":"B.C.M. Fung","year":"2010","unstructured":"Fung, B.C.M., Wang, K., Chen, R., Yu, P.S.: Privacy-preserving data publishing: a survey of recent developments. ACM Comput. Surv. 42(4), 14:1\u201314:53 (2010)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"9821_CR17","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J. Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Invitation to data reduction and problem Kernelization. SIGACT News 38(1), 31\u201345 (2007)","journal-title":"SIGACT News"},{"key":"9821_CR18","unstructured":"K\u00f6hler, T.: Benutzergef\u00fchrtes Anonymisieren von Daten mit Pattern Clustering: Algorithmen und Komplexit\u00e4t (in German, English title: User-guided data anonymization with pattern clustering: Algorithms and complexity). Diploma thesis, Friedrich-Schiller-Universit\u00e4t Jena (2011). Available at http:\/\/fpt.akt.tu-berlin.de\/publications\/pattern_D.pdf"},{"issue":"1","key":"9821_CR19","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/MDT.1987.295111","volume":"4","author":"S. Kuo","year":"1987","unstructured":"Kuo, S., Fuchs, W.: Efficient spare allocation for reconfigurable arrays. IEEE Des. Test Comput. 4(1), 24\u201331 (1987)","journal-title":"IEEE Des. Test Comput."},{"key":"9821_CR20","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1145\/1557019.1557074","volume-title":"Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201909)","author":"T. Lappas","year":"2009","unstructured":"Lappas, T., Liu, K., Terzi, E.: Finding a team of experts in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201909), pp. 467\u2013476. ACM, New York (2009)"},{"key":"9821_CR21","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-642-30891-8_10","volume-title":"The Multivariate Algorithmic Revolution and Beyond","author":"D. Lokshtanov","year":"2012","unstructured":"Lokshtanov, D., Misra, N., Saurabh, S.: Kernelization\u2014preprocessing with a guarantee. In: The Multivariate Algorithmic Revolution and Beyond. LNCS, vol. 7370, pp. 129\u2013161. Springer, Berlin (2012)"},{"key":"9821_CR22","doi-asserted-by":"crossref","first-page":"1005","DOI":"10.1145\/2339530.2339690","volume-title":"Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201912)","author":"A. Majumder","year":"2012","unstructured":"Majumder, A., Datta, S., Naidu, K.: Capacitated team formation problem on social networks. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201912), pp. 1005\u20131013. ACM, New York (2012)"},{"key":"9821_CR23","first-page":"223","volume-title":"Proceedings of the 23rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS\u201904)","author":"A. Meyerson","year":"2004","unstructured":"Meyerson, A., Williams, R.: On the complexity of optimal k-anonymity. In: Proceedings of the 23rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS\u201904), pp.\u00a0223\u2013228. ACM, New York (2004)"},{"key":"9821_CR24","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"key":"9821_CR25","series-title":"Leibniz International Proceedings in Informatics (LIPIcs)","first-page":"17","volume-title":"Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS\u201910)","author":"R. Niedermeier","year":"2010","unstructured":"Niedermeier, R.: Reflections on multivariate algorithmics and problem parameterization. In: Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS\u201910). Leibniz International Proceedings in Informatics (LIPIcs), vol. 5, pp. 17\u201332. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, Wadern (2010)"},{"key":"9821_CR26","first-page":"377","volume-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC\u201988)","author":"J. Orlin","year":"1988","unstructured":"Orlin, J.: A faster strongly polynomial minimum cost flow algorithm. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC\u201988), pp. 377\u2013387. ACM, New York (1988)"},{"issue":"6","key":"9821_CR27","doi-asserted-by":"crossref","first-page":"1010","DOI":"10.1109\/69.971193","volume":"13","author":"P. Samarati","year":"2001","unstructured":"Samarati, P.: Protecting respondents identities in microdata release. IEEE Trans. Knowl. Data Eng. 13(6), 1010\u20131027 (2001)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9821_CR28","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1145\/275487.275508","volume-title":"Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS\u201998)","author":"P. Samarati","year":"1998","unstructured":"Samarati, P., Sweeney, L.: Generalizing data to provide anonymity when disclosing information. In: Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS\u201998), p.\u00a0188. ACM, New York (1998)"},{"key":"9821_CR29","unstructured":"Sweeney, L.: Uniqueness of simple demographics in the U.S. population. Technical report, Carnegie Mellon University, School of Computer Science, Laboratory for International Data Privacy (2000)"},{"issue":"5","key":"9821_CR30","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L. Sweeney","year":"2002","unstructured":"Sweeney, L.: k-Anonymity: a model for protecting privacy. Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 10(5), 557\u2013570 (2002)","journal-title":"Int. J. Uncertain. Fuzziness Knowl.-Based Syst."},{"issue":"6","key":"9821_CR31","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0378-7206(84)90028-4","volume":"7","author":"K.B. White","year":"1984","unstructured":"White, K.B.: A preliminary investigation of information systems team structures. Inf. Manag. 7(6), 331\u2013335 (1984)","journal-title":"Inf. Manag."},{"issue":"5","key":"9821_CR32","doi-asserted-by":"crossref","first-page":"9121","DOI":"10.1016\/j.eswa.2008.12.031","volume":"36","author":"H. Wi","year":"2009","unstructured":"Wi, H., Oh, S., Mun, J., Jung, M.: A team formation model based on knowledge and collaboration. Expert Syst. Appl. 36(5), 9121\u20139134 (2009)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"9821_CR33","first-page":"85","volume":"31","author":"A. Zzkarian","year":"1999","unstructured":"Zzkarian, A., Kusiak, A.: Forming teams: an analytical approach. IIE Trans. 31(1), 85\u201397 (1999)","journal-title":"IIE Trans."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9821-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9821-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9821-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T03:44:44Z","timestamp":1688442284000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9821-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,27]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["9821"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9821-0","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,27]]}}}