@article{Katoh2009a, 
     address = "New York, New York, USA", 
     author = "Katoh, Naoki and Tanigawa, Shin-ichi", 
     doi = "10.1007/s00454-009-9164-4", 
     isbn = "9781605580715", 
     issn = "01795376", 
     journal = "Discrete and Computational Geometry", 
     keyword = "Enumeration,Non-crossing geometric graphs,Triangulations", 
     link = "http://link.springer.com/10.1007/s00454-009-9164-4", 
     month = "apr", 
     number = "3", 
     pages = "443--468", 
     publisher = "ACM Press", 
     title = "Fast enumeration algorithms for non-crossing geometric graphs", 
     uri = "http://link.springer.com/10.1007/s00454-009-9164-4", 
     volume = "42", 
     year = "2009", 
}

Problems: 248 249 250 251 252