@article{Alon1997, 
     author = "Alon, N and Yuster, R. and Zwick, U.", 
     doi = "10.1007/BF02523189", 
     issn = "0178-4617", 
     journal = "Algorithmica", 
     keyword = "1,a i n s,a simple cycle of,c o n t,clearly np-,cycles,d e c i,d i n g,e,e m o f,easily stated algorithmic graph,g i v e,graph algorithms,h e r a,i n t r,if the cycle length,k is part of,length k is among,n g r a,o d u c,p h g,problems,r o b l,t h e p,t i o n,the input,the most natural and,then the problem is,v,w h e t", 
     link = "http://link.springer.com/10.1007/BF02523189", 
     month = "mar", 
     number = "3", 
     pages = "209--223", 
     title = "Finding and counting given length cycles", 
     uri = "http://link.springer.com/10.1007/BF02523189", 
     volume = "17", 
     year = "1997", 
}

Problems: 317