{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:29:36Z","timestamp":1725506976445},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540787723"},{"type":"electronic","value":"9783540787730"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78773-0_17","type":"book-chapter","created":{"date-parts":[[2008,4,3]],"date-time":"2008-04-03T08:38:35Z","timestamp":1207211915000},"page":"194-205","source":"Crossref","is-referenced-by-count":1,"title":["On the Complexity of Reconstructing H-free Graphs from Their Star Systems"],"prefix":"10.1007","author":[{"given":"Fedor V.","family":"Fomin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Lokshtanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Federico","family":"Mancini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1017\/S0963548300000535","volume":"2","author":"M. Aigner","year":"1993","unstructured":"Aigner, M., Triesch, E.: Reconstructing a graph from its neighborhood lists. Combin. Probab. Comput.\u00a02, 103\u2013113 (1993)","journal-title":"Combin. Probab. Comput."},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0012-365X(94)00104-Q","volume":"136","author":"M. Aigner","year":"1994","unstructured":"Aigner, M., Triesch, E.: Realizability and uniqueness in graphs. Discrete Math.\u00a0136, 3\u201320 (1994)","journal-title":"Discrete Math."},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0167-5060(08)70857-4","volume":"8","author":"L. Babai","year":"1980","unstructured":"Babai, L.: Isomorphism testing and symmetry of graphs. Ann. Discrete Math.\u00a08, 101\u2013109 (1980)","journal-title":"Ann. Discrete Math."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Bulatov, A., Dalmau, V.: Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem. In: Proceedings 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003, pp. 562\u2013570 (2003)","DOI":"10.1109\/SFCS.2003.1238229"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D.G. Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Burlingham, L.S.: Complement reducible graphs. Discrete Appl. Math.\u00a03, 163\u2013174 (1981)","journal-title":"Discrete Appl. Math."},{"key":"17_CR6","unstructured":"Boros, E., Gurvich, V., Zverovich, I.: Neighborhood hypergraphs of bipartite graphs, tech. rep., RUTCOR (2006)"},{"key":"17_CR7","first-page":"264","volume":"11","author":"P. Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., Gallai, T.: Graphs with prescribed degrees of vertices (in hungarian). Matematikai Lapok\u00a011, 264\u2013274 (1960)","journal-title":"Matematikai Lapok"},{"key":"17_CR8","volume-title":"Combinatorics. vol. II, vol. 18 of Colloquia Mathematica Societatis J\u00e1nos Bolyai","author":"A. Hajnal","year":"1978","unstructured":"Hajnal, A., S\u00f3s, V.: Combinatorics. vol. II, vol. 18 of Colloquia Mathematica Societatis J\u00e1nos Bolyai. North-Holland, Amsterdam (1978)"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Hell, P., Nesetril, J.: Graphs and homomorphisms. Oxford Lecture Series in Mathematics and its Applications, vol.\u00a028 (2004)","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0012-365X(81)90271-5","volume":"33","author":"F. Lalonde","year":"1981","unstructured":"Lalonde, F.: Le probl\u00e8me d\u2019\u00e9toiles pour graphes est NP-complet. Discrete Math.\u00a033, 271\u2013280 (1981)","journal-title":"Discrete Math."},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1137\/0210002","volume":"10","author":"A. Lubiw","year":"1981","unstructured":"Lubiw, A.: Some NP-complete problems similar to graph isomorphism. SIAM J. Comput.\u00a010, 11\u201321 (1981)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","LATIN 2008: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78773-0_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:21:31Z","timestamp":1619522491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78773-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540787723","9783540787730"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78773-0_17","relation":{},"subject":[]}}