mybib.bib

@article{Alon:1995:COL:210332.210337,
 author = {Alon, Noga and Yuster, Raphael and Zwick, Uri},
 title = {Color-coding},
 journal = {J. ACM},
 issue_date = {July 1995},
 volume = {42},
 number = {4},
 month = jul,
 year = {1995},
 issn = {0004-5411},
 pages = {844--856},
 numpages = {13},
 url = {http://doi.acm.org/10.1145/210332.210337},
 doi = {10.1145/210332.210337},
 acmid = {210337},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {derandomization, perfect hashing, subgraph isomorphism, tree-width},
} 

@article{Facebook,
	author = { Bhagat,Smriti and Burke,Moira and Diuk,Carlos and Onur Filiz,Ismail and Edunov,Sergey },
	title = {Three and a half degrees of separation},
	url = {https://research.fb.com/three-and-a-half-degrees-of-separation},
	journal = {Facebook research},
	year = {2016},
	month = feb
}

@book{legendre1998numerical,
	title={Numerical Ecology},
	author={Legendre, P. and Legendre, L.F.J.},
	isbn={9780080537870},
	series={Developments in Environmental Modelling},
	year={1998},
	publisher={Elsevier Science}
}

@inproceedings{Broder:1998:MIP:276698.276781,
	author = {Broder, Andrei Z. and Charikar, Moses and Frieze, Alan M. and Mitzenmacher, Michael},
	title = {Min-wise Independent Permutations (Extended Abstract)},
	booktitle = {Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing},
	series = {STOC '98},
	year = {1998},
	isbn = {0-89791-962-9},
	location = {Dallas, Texas, USA},
	pages = {327--336},
	numpages = {10},
	url = {http://doi.acm.org/10.1145/276698.276781},
	doi = {10.1145/276698.276781},
	acmid = {276781},
	publisher = {ACM},
	address = {New York, NY, USA},
} 

@inproceedings{Cohen:2007:SDU:1281100.1281133,
	author = {Cohen, Edith and Kaplan, Haim},
	title = {Summarizing Data Using Bottom-k Sketches},
	booktitle = {Proceedings of the Twenty-sixth Annual ACM Symposium on Principles of Distributed Computing},
	series = {PODC '07},
	year = {2007},
	isbn = {978-1-59593-616-5},
	location = {Portland, Oregon, USA},
	pages = {225--234},
	numpages = {10},
	url = {http://doi.acm.org/10.1145/1281100.1281133},
	doi = {10.1145/1281100.1281133},
	acmid = {1281133},
	publisher = {ACM},
	address = {New York, NY, USA},
	keywords = {all-distances sketches, bottom-k sketches, data streams},
} 

@inproceedings{deshpande2007randomized,
	title={Randomized Decoding for Selection-and-Ordering Problems.},
	author={Deshpande, Pawan and Barzilay, Regina and Karger, David R},
	booktitle={HLT-NAACL},
	pages={444--451},
	year={2007}
}

@article{SubSim,
	author = {Conti, Alessio and Ferraro, Gaspare and Grossi, Roberto and Marino, Andrea and Sadakanem, Kunihiko and Uno, Takeaki},
	title = {Subgraph Similarity in Real-World Labeled Networks},
	year = {2017},
	month = oct
}

@misc{alexarank,
	author = "Alexa",
	title = "Website Traffic, Statistics and Analytics",
	howpublished = {\url{https://www.alexa.com/siteinfo/}},
	year = "Accessed October 2017" 
}

@misc{imdb,
	author = "IMDb",
	title = "IMDb Datasets",
	howpublished = {\url{http://www.imdb.com/interfaces/}},
	year = "Accessed October 2017" 
}


@misc{imdbstat,
	author = "IMDb",
	title = "IMDb Statistic",
	howpublished = {\url{http://www.imdb.com/stats}},
	year = "Accessed October 2017" 
}

@misc{netinf,
	author = "SNAP",
	title = "NetInf",
	howpublished = {\url{http://snap.stanford.edu/netinf/}},
	year = "Accessed October 2017" 
}


@misc{openmp,
	author = "OpenMP Architecture Review Board",
	title = "OpenMP 4.5",
	howpublished = {\url{http://www.openmp.org/}},
	year = "Accessed October 2017" 
}

@article{article,
	author = {W. Raymond, J and Gardiner, Eleanor and Willett, Peter and Rascal, P},
	year = {2002},
	month = {06},
	pages = {631 - 644},
	title = {Calculation of Graph Similarity using Maximum Common Edge Subgraphs},
	volume = {45},
	booktitle = {The Computer Journal}
}

@Inbook{Broder2000,
	author="Broder, Andrei Z.",
	editor="Giancarlo, Raffaele
	and Sankoff, David",
	title="Identifying and Filtering Near-Duplicate Documents",
	bookTitle="Combinatorial Pattern Matching: 11th Annual Symposium, CPM 2000 Montreal, Canada, June 21--23, 2000 Proceedings",
	year="2000",
	publisher="Springer Berlin Heidelberg",
	address="Berlin, Heidelberg",
	pages="1--10",
	abstract="The mathematical concept of document resemblance captures well the informal notion of syntactic similarity. The resemblance can be estimated using a fixed size ``sketch'' for each document. For a large collection of documents (say hundreds of millions) the size of this sketch is of the order of a few hundred bytes per document.",
	isbn="978-3-540-45123-5",
	doi="10.1007/3-540-45123-4_1",
	url="https://doi.org/10.1007/3-540-45123-4_1"
}

@article{Bunke:1998:GDM:289720.289729,
	author = {Bunke, Horst and Shearer, Kim},
	title = {A Graph Distance Metric Based on the Maximal Common Subgraph},
	journal = {Pattern Recogn. Lett.},
	issue_date = {March 1998},
	volume = {19},
	number = {3-4},
	month = mar,
	year = {1998},
	issn = {0167-8655},
	pages = {255--259},
	numpages = {5},
	url = {http://dx.doi.org/10.1016/S0167-8655(97)00179-7},
	doi = {10.1016/S0167-8655(97)00179-7},
	acmid = {289729},
	publisher = {Elsevier Science Inc.},
	address = {New York, NY, USA},
	keywords = {distance measure, error-tolerant graph matching, graph edit distance, maximal common subgraph, metric},
} 

@Book{GareyJohnson:1979,
	author =	"Michael R. Garey and David S. Johnson",
	year = 	"1979",
	keywords =	"THEORY COMPLEXITY BOOK OVERVIEW",
	title =	"Computers and intractability : a guide to the theory
	of {NP}-completeness /",
	publisher =	"San Francisco : W. H. Freeman, 1979, 338 p. CALL
	NUMBER: QA76.6 .G35",
}

@article{BATAGELJ2000173,
	title = "Some analyses of Erdos collaboration graph",
	journal = "Social Networks",
	volume = "22",
	number = "2",
	pages = "173 - 186",
	year = "2000",
	issn = "0378-8733",
	doi = "https://doi.org/10.1016/S0378-8733(00)00023-X",
	url = "http://www.sciencedirect.com/science/article/pii/S037887330000023X",
	author = "Vladimir Batagelj and Andrej Mrvar"
}

@article{Dyer:2003:ACD:780542.780643,
	author = "Dyer, Martin",
	title = "Approximate Counting by Dynamic Programming",
	booktitle = "Proceedings of the Thirty-fifth Annual ACM Symposium on Theory of Computing",
	series = "STOC '03",
	year = "2003",
	isbn = "1-58113-674-9",
	location = "San Diego, CA, USA",
	pages = "693--699",
	numpages = "7",
	url = "http://doi.acm.org/10.1145/780542.780643",
	doi = "10.1145/780542.780643",
	acmid = "780643",
	publisher = "ACM",
	address = "New York, NY, USA"
} 

@article{Vigoda2010LectureNO,
	title="Lecture Notes on an FPRAS for KNAPSACK",
	author="Eric Vigoda",
	year="2010"
}