@inproceedings{Conte2019, 
     address = "New York, New York, USA", 
     author = "Conte, Alessio and Uno, Takeaki", 
     booktitle = "Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019", 
     doi = "10.1145/3313276.3316402", 
     isbn = "9781450367059", 
     pages = "1179--1190", 
     publisher = "ACM Press", 
     title = "{New polynomial delay bounds for maximal subgraph enumeration by proximity search}", 
     year = "2019", 
}

Problems: 503 504 505 506 507 508 509 510 511 512