Bibtex of Survey


@article{Eppstein2014, 
     address = "USA", 
     arxivid = "1412.5075", 
     author = "Eppstein, David", 
     booktitle = "arXiv", 
     eprint = "1412.5075", 
     institution = "Cornell University", 
     link = "http://arxiv.org/abs/1412.5075", 
     month = "dec", 
     number = "arXiv ID: 1412.5075", 
     title = "$K$-Best Enumeration", 
     uri = "http://arxiv.org/abs/1412.5075", 
     year = "2014", 
     zzzdoi = "MY/arxiv_1412.5075", 
}

@article{Mateti1976a, 
     author = "Mateti, Prabhaker and Deo, Narsingh", 
     doi = "10.1137/0205007", 
     issn = "0097-5397", 
     journal = "SIAM Journal on Computing", 
     keyword = "adjacency matrix,algorithms,backtrack,circuit vector space,circuit-graph,circuits,cycles,dicircuits,graph search,graph theory", 
     language = "en", 
     link = "http://epubs.siam.org/doi/abs/10.1137/0205007", 
     month = "mar", 
     number = "1", 
     pages = "90--99", 
     publisher = "Society for Industrial and Applied Mathematics", 
     title = "On Algorithms for Enumerating All Circuits of a Graph", 
     uri = "http://epubs.siam.org/doi/abs/10.1137/0205007", 
     volume = "5", 
     year = "1976", 
}

@article{Pardalos1994, 
     author = "Pardalos, Panos M. and Xue, Jue", 
     doi = "10.1007/BF01098364", 
     isbn = "978-0-7923-5924-1", 
     issn = "09255001", 
     journal = "Journal of Global Optimization", 
     keyword = "Maximum clique problem,NP-hard,algorithms,bibliography,graph coloring,heuristics,survey", 
     link = "http://link.springer.com/10.1007/BF01098364", 
     month = "apr", 
     number = "3", 
     pages = "301--328", 
     title = "The maximum clique problem", 
     uri = "http://link.springer.com/10.1007/BF01098364", 
     volume = "4", 
     year = "1994", 
}

@article{Savage1997, 
     author = "Savage, Carla", 
     doi = "10.1137/S0036144595295272", 
     issn = "0036-1445", 
     journal = "SIAM Review", 
     keyword = "acyclic orientations,binary strings,boolean lattice,catalan families,cayley graphs,combinations,compositions,de bruijn sequences,gray codes,hamilton cycles,integer parti-,linear extensions,necklaces,permutations,restricted growth functions,set partitions,tions,vertex-", 
     link = "http://epubs.siam.org/doi/abs/10.1137/S0036144595295272", 
     month = "jan", 
     number = "4", 
     pages = "605--629", 
     title = "A Survey of Combinatorial Gray Codes", 
     uri = "http://epubs.siam.org/doi/abs/10.1137/S0036144595295272", 
     volume = "39", 
     year = "1997", 
}

@inproceedings{Segoufin2013, 
     address = "Genoa, Italy", 
     author = "Segoufin, Luc", 
     booktitle = "ICDT 2013: the 16th International Conference on Database Theory", 
     doi = "10.1145/2448496.2448498", 
     editor = "Tan, Wang Chiew", 
     isbn = "9781450315982", 
     keyword = "algorithmic,databases,logic", 
     link = "http://dl.acm.org/citation.cfm?id=2448496.2448498 http://dl.acm.org/citation.cfm?doid=2448496.2448498", 
     month = "mar", 
     pages = "10--20", 
     publisher = "ACM Press", 
     title = "Enumerating with constant delay the answers to a query", 
     uri = "http://dl.acm.org/citation.cfm?id=2448496.2448498", 
     year = "2013", 
}