Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
![]() |
Aggregating Inconsistent Information : Ranking and ClusteringAILON, Nir ; CHARIKAR, Moses ; NEWMAN, AlanthaJournal of the ACM, 2008-10, Vol.55 (5), p.1-27 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
2 |
Material Type: Artigo
|
![]() |
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive QueriesMARX, DanielJournal of the ACM, 2013-11, Vol.60 (6), p.1-51 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
3 |
Material Type: Artigo
|
![]() |
Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via FlowsBISWAL, Punyashloka ; LEE, James R ; RAO, SatishJournal of the ACM, 2010-03, Vol.57 (3), p.1-23 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
4 |
Material Type: Artigo
|
![]() |
Finding Maximal Cliques in Massive NetworksCHENG, James ; YIPING KE ; ADA WAI-CHEE FU ; JEFFREY XU YU ; LINHONG ZHUACM transactions on database systems, 2011-12, Vol.36 (4), p.1-34 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
5 |
Material Type: Artigo
|
![]() |
A survey of graph layout problemsDIAZ, Josep ; PETIT, Jordi ; SERNA, MariaACM computing surveys, 2002-09, Vol.34 (3), p.313-356 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
6 |
Material Type: Artigo
|
![]() |
Fixed-Point Definability and Polynomial Time on Graphs with Excluded MinorsGROHE, MartinJournal of the ACM, 2012-10, Vol.59 (5), p.1-64 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
7 |
Material Type: Artigo
|
![]() |
Toward inference attacks for k-anonymitySun, Yan ; Yin, Lihua ; Liu, Licai ; Xin, ShuangPersonal and ubiquitous computing, 2014-12, Vol.18 (8), p.1871-1880 [Periódico revisado por pares]London: Springer LondonTexto completo disponível |
8 |
Material Type: Artigo
|
![]() |
Decomposing Combinatorial Auctions and Set Packing ProblemsGOTTLOB, Georg ; GRECO, GianluigiJournal of the ACM, 2013-08, Vol.60 (4), p.1-39 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
9 |
Material Type: Artigo
|
![]() |
Faster scaling algorithms for general graph-matching problemsGABOW, H. N ; TARJAN, R. EJournal of the ACM, 1991-10, Vol.38 (4), p.815-853 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
10 |
Material Type: Artigo
|
![]() |
Asymmetric k-center is log n-hard to approximateCHUZHOY, Julia ; KORTSARZ, Guy ; GUHA, Sudipto ; KRAUTHGAMER, Robert ; HALPERIN, Eran ; NAOR, Joseph ; KHANNA, SanjeevJournal of the ACM, 2005-07, Vol.52 (4), p.538-551 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |