@inproceedings{Conte2017, 
     author = "Conte, Alessio and Kant{\'{e}}, Mamadou Moustapha and Otachi, Yota and Uno, Takeaki and Wasa, Kunihiro", 
     booktitle = "COCOON 2017: the 23rd Annual International Computing and Combinatorics Conference", 
     doi = "10.1007/978-3-319-62389-4_13", 
     editor = "Cao, Yixin and Chen, Jianer", 
     isbn = "978-3-319-62388-7_13", 
     link = "http://link.springer.com/10.1007/978-3-319-62389-4", 
     pages = "150--161", 
     publisher = "Springer International Publishing", 
     series = "Lecture Notes in Computer Science", 
     title = "Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph", 
     uri = "http://link.springer.com/10.1007/978-3-319-62389-4", 
     volume = "10392", 
     year = "2017", 
}

Problems: 439