@article{Uno2008a, 
     author = "Uno, Takeaki", 
     doi = "10.1007/s00453-008-9238-3", 
     issn = "01784617", 
     journal = "Algorithmica", 
     keyword = "Algorithm,Clustering,Community discovering,Dense structure,Dense subgraph,Enumeration,Maximum subgraph,Mining,Pseudo clique,Quasi clique", 
     link = "http://link.springer.com/10.1007/s00453-008-9238-3", 
     month = "oct", 
     number = "1", 
     pages = "3--16", 
     title = "An efficient algorithm for solving pseudo clique enumeration problem", 
     uri = "http://link.springer.com/10.1007/s00453-008-9238-3", 
     volume = "56", 
     year = "2010", 
}

Problems: 254