{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T07:17:16Z","timestamp":1782371836607,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":[""],"award-info":[{"award-number":[""]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,8]]},"DOI":"10.1145\/3734436.3734442","type":"proceedings-article","created":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T17:32:44Z","timestamp":1751563964000},"page":"4-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Minimizing the Number of Roles in Bottom-Up Role-Mining using Maximal Biclique Enumeration"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3615-9393","authenticated-orcid":false,"given":"Mahesh","family":"Tripunitara","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5220\/0012153000003595"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5220\/0010025401550166"},{"key":"e_1_3_2_1_4_1","unstructured":"Simon Anderer Bernd Scheuermann Sanaz Mostaghim Patrick Bauerle and Matthias Beil. 2021a. RMPlib. https:\/\/github.com\/RMPlib\/RMPlib\/."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3450569.3463566"},{"key":"e_1_3_2_1_6_1","volume-title":"Vance","author":"Barnhart Cynthia","year":"1998","unstructured":"Cynthia Barnhart, Ellis L. Johnson, George L. Nemhauser, Martin W. P. Savelsbergh, and Pamela H. Vance. 1998. Branch-and-price: Column generation for solving huge integer programs. Operations research, Vol. 46, 3 (May 1998), 316--329."},{"key":"e_1_3_2_1_7_1","unstructured":"James Bonifield. 2020. RoleMiner. https:\/\/github.com\/jbonifield3\/RoleMiner."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.05.010"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/3529337.3529341"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/270152.270159"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3532105.3535024"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1377836.1377838"},{"key":"e_1_3_2_1_13_1","unstructured":"M. P. Gallagher A.C. O'Connor and B. Kropp. 2002. The economic impact of role-based access control. Planning report 02--1 National Institute of Standards and Technology https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Role-Based-Access-Control\/documents\/report02-1.pdf."},{"key":"e_1_3_2_1_14_1","volume-title":"Johnson","author":"Garey Michael R.","year":"1979","unstructured":"Michael R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3532105.3535030"},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the 7th Python in Science Conference (SciPy2008)","author":"Hagberg Aric A.","unstructured":"Aric A. Hagberg, Daniel A. Schult, and Pieter J. Swart. 2008. Exploring network structure, dynamics, and function using NetworkX. https:\/\/networkx.org\/. In Proceedings of the 7th Python in Science Conference (SciPy2008). 11--15."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/360303.360333"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3533767.3534372"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497438"},{"key":"e_1_3_2_1_20_1","unstructured":"Brendan McKay. 2021. Why is this SAT problem hard and what can I do about it? https:\/\/cs.stackexchange.com\/questions\/147754\/why-is-this-sat-problem-hard-and-what-can-i-do-about-it."},{"key":"e_1_3_2_1_21_1","article-title":"A Column Generation Approach for Graph Coloring","volume":"8","author":"Mehrotra Anuj","year":"1996","unstructured":"Anuj Mehrotra and Michael A. Trick. 1996. A Column Generation Approach for Graph Coloring. INFORMS Journal on Computing, Vol. 8, 4 (1996).","journal-title":"INFORMS Journal on Computing"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2871148"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1377836.1377840"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1880022.1880030"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542207.1542224"},{"key":"e_1_3_2_1_26_1","unstructured":"Gurobi Optimization. 2024. Gurobi 11.0. https:\/\/www.gurobi.com\/."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.485845"},{"key":"e_1_3_2_1_28_1","unstructured":"Mahesh Tripunitara. 2024. minrolemining. https:\/\/github.com\/tripunit\/minrolemining."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1266840.1266870"},{"key":"e_1_3_2_1_30_1","first-page":"2","article-title":"Edge-RMP: Minimizing Administrative Assignments for Role-Based Access Control","volume":"17","author":"Vaidya Jaideep","year":"2009","unstructured":"Jaideep Vaidya, Vijayalakshmi Atluri, Qi Guo, and Haibing Lu. 2009. Edge-RMP: Minimizing Administrative Assignments for Role-Based Access Control. Journal of Computer Security, Vol. 17, 2 (apr 2009), 211--235.","journal-title":"Journal of Computer Security"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180424"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1266840.1266862"},{"key":"e_1_3_2_1_33_1","first-page":"15","volume-title":"BMC Bioinformatics","volume":"15","author":"Zhang Yun","year":"2014","unstructured":"Yun Zhang, Charles A. Phillips, Gary L. Rogers, Erich J. Baker, Elissa J. Chesler, and Michael A. Langston. 2014. On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types. BMC Bioinformatics, Vol. 15, 110 (2014). https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-15-110"}],"event":{"name":"SACMAT '25:SACMAT '25","location":"Stony Brook NY USA","sponsor":["sigsac ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 30th ACM Symposium on Access Control Models and Technologies"],"original-title":[],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T17:34:47Z","timestamp":1751564087000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3734436.3734442"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,7]]},"references-count":33,"alternative-id":["10.1145\/3734436.3734442","10.1145\/3734436"],"URL":"https:\/\/doi.org\/10.1145\/3734436.3734442","relation":{},"subject":[],"published":{"date-parts":[[2025,7,7]]},"assertion":[{"value":"2025-07-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}