@inproceedings{Golovach2013a, 
     address = "Riga, Latvia", 
     author = "Golovach, PA and Heggernes, Pinar", 
     booktitle = "ICALP 2013: the 40th International Colloquium on Automata, Languages, and Programming", 
     doi = "10.1007/978-3-642-39206-1_41", 
     editor = "Fomin, Fedor V. and Freivalds, Rūsiņ\v{s} and Kwiatkowska, Marta and Peleg, David", 
     link = "http://link.springer.com/chapter/10.1007/978-3-642-39206-1_41", 
     month = "jul", 
     pages = "485--496", 
     publisher = "Springer Berlin Heidelberg", 
     series = "Lecture Notes in Computer Science", 
     title = "An incremental polynomial time algorithm to enumerate all minimal edge dominating sets", 
     uri = "http://link.springer.com/chapter/10.1007/978-3-642-39206-1_41", 
     volume = "7965", 
     year = "2013", 
}

Problems: 124 125 126 127 128