-
2
-
-
33644914697
-
Chromatic characterization of biclique covers
-
D. Cornaz and J. Fonlupt. Chromatic characterization of biclique covers. Discrete Mathematics, 306(5):495-507, 2006.
-
(2006)
Discrete Mathematics
, vol.306
, Issue.5
, pp. 495-507
-
-
Cornaz, D.1
Fonlupt, J.2
-
5
-
-
4243280162
-
The economic impact of role-based access control
-
02-1, National Institute of Standards and Technology, March
-
M.P. Gallagher, A. O'Connor, and B. Kropp. The economic impact of role-based access control. Technical Report Planning Report 02-1, National Institute of Standards and Technology, March 2002.
-
(2002)
Technical Report Planning Report
-
-
Gallagher, M.P.1
O'Connor, A.2
Kropp, B.3
-
6
-
-
35048813595
-
Tiling databases
-
Discovery Science, of, Springer-Verlag
-
Floris Geerts, Bart Goethals, and Taneli Mielikäinen. Tiling databases. In Discovery Science, volume 3245 of Lecture Notes in Computer Science, pages 278-289. Springer-Verlag, 2004.
-
(2004)
Lecture Notes in Computer Science
, vol.3245
, pp. 278-289
-
-
Geerts, F.1
Goethals, B.2
Mielikäinen, T.3
-
7
-
-
0001009871
-
5/2 algorithm for maximum matchings in bipartite graphs
-
5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 2(4):225-231, 1973.
-
(1973)
SIAM Journal on Computing
, vol.2
, Issue.4
, pp. 225-231
-
-
Hopcroft, J.E.1
Karp, R.M.2
-
8
-
-
0242625194
-
Role mining - revealing business roles for security administration using data mining technology
-
ACM Press
-
M. Kuhlmann, D. Shohat, and G. Schimpf. Role mining - revealing business roles for security administration using data mining technology. In SACMAT 'OS, pages 179-186. ACM Press, 2003.
-
(2003)
SACMAT 'OS
, pp. 179-186
-
-
Kuhlmann, M.1
Shohat, D.2
Schimpf, G.3
-
9
-
-
0942288271
-
Covering rectilinear polygons with axis-parallel rectangles
-
V.S. Anil Kumar and H. Ramesh. Covering rectilinear polygons with axis-parallel rectangles. SIAM Journal on Computing, 32(6):1509-1541, 2003.
-
(2003)
SIAM Journal on Computing
, vol.32
, Issue.6
, pp. 1509-1541
-
-
Anil Kumar, V.S.1
Ramesh, H.2
-
10
-
-
0346673789
-
On the computational complexity of edge concentration
-
X. Lin. On the computational complexity of edge concentration. Discrete Applied Mathematics, 101(1): 197-205, 2000.
-
(2000)
Discrete Applied Mathematics
, vol.101
, Issue.1
, pp. 197-205
-
-
Lin, X.1
-
11
-
-
0028514351
-
On the hardness of approximating minimization problems
-
C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. J ACM, 14(5):960-981, 1994.
-
(1994)
J ACM
, vol.14
, Issue.5
, pp. 960-981
-
-
Lund, C.1
Yannakakis, M.2
-
12
-
-
0001515729
-
A column generation approach for graph coloring
-
A. Mehrotra and M.A, Trick. A column generation approach for graph coloring. INFORMS Journal on Computing, 8(4):344-354, 1996.
-
(1996)
INFORMS Journal on Computing
, vol.8
, Issue.4
, pp. 344-354
-
-
Mehrotra, A.1
Trick, M.A.2
-
13
-
-
0043106179
-
Alternating cycle-free matchings
-
H. Muller. Alternating cycle-free matchings. Order, 7(1):11-21, 1990.
-
(1990)
Order
, vol.7
, Issue.1
, pp. 11-21
-
-
Muller, H.1
-
14
-
-
49349132396
-
Contentment in graph theory: Covering graphs with cliques
-
J.B. Orlin. Contentment in graph theory: covering graphs with cliques. Indagationes Mathematicae, 39:406-424, 1977.
-
(1977)
Indagationes Mathematicae
, vol.39
, pp. 406-424
-
-
Orlin, J.B.1
-
15
-
-
0141998079
-
The maximum edge biclique is NP-complete
-
R. Peeters. The maximum edge biclique is NP-complete. Discrete Applied Mathematics, 131 (3):651-654, 2003.
-
(2003)
Discrete Applied Mathematics
, vol.131
, Issue.3
, pp. 651-654
-
-
Peeters, R.1
-
16
-
-
57349126947
-
Method and apparatus for role grouping by shared resource utilization
-
U.S. Patent Application 20030172161, September
-
R. Rymon. Method and apparatus for role grouping by shared resource utilization. U.S. Patent Application 20030172161, September 2003.
-
(2003)
-
-
Rymon, R.1
-
17
-
-
30644478631
-
Role mining with ORCA
-
ACM Press
-
J. Schlegelmilch and U. Steffens. Role mining with ORCA. In SA CMAT 'O5, pages 168-176. ACM Press, 2005.
-
(2005)
SA CMAT 'O5
, pp. 168-176
-
-
Schlegelmilch, J.1
Steffens, U.2
-
19
-
-
0005258725
-
On approximate solutions for combinatorial optimization problems
-
H.U. Simon. On approximate solutions for combinatorial optimization problems. SIAM J. Disc. Math., 3(2):294-310, 1990.
-
(1990)
SIAM J. Disc. Math
, vol.3
, Issue.2
, pp. 294-310
-
-
Simon, H.U.1
-
20
-
-
57349129050
-
-
U.S. Department of Veteran's Affairs
-
U.S. Department of Veteran's Affairs. Licensed Providers Permission Table. http://www.va.gov/rbac/docs/ 20050120PermissionTablesLicensedProviders.doc.
-
Licensed Providers Permission Table
-
-
-
21
-
-
34548052480
-
The role mining problem: Finding a minimal descriptive set of roles
-
ACM Press
-
J. Vaidya, V. Atluri, and Q. Guo. The role mining problem: Finding a minimal descriptive set of roles. In SACMAT '07, pages 175-184. ACM Press, 2007.
-
(2007)
SACMAT '07
, pp. 175-184
-
-
Vaidya, J.1
Atluri, V.2
Guo, Q.3
-
22
-
-
34547237958
-
Roleminer: Mining roles using subset enumeration
-
ACM Press
-
J. Vaidya, V. Atluri, and J. Warner. Roleminer: Mining roles using subset enumeration. In ACM CCS '06, pages 144-153. ACM Press, 2006.
-
(2006)
ACM CCS '06
, pp. 144-153
-
-
Vaidya, J.1
Atluri, V.2
Warner, J.3
-
23
-
-
34548033731
-
Role engineering using graph optimisation
-
ACM Press
-
D. Zhang, K. Ramamohanarao, and T. Ebringer. Role engineering using graph optimisation. In SACMAT '07, pages 139-144. ACM Press, 2007.
-
(2007)
SACMAT '07
, pp. 139-144
-
-
Zhang, D.1
Ramamohanarao, K.2
Ebringer, T.3
|