{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T23:40:08Z","timestamp":1745192408704},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540427339"},{"type":"electronic","value":"9783540454960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45496-9_12","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T13:08:40Z","timestamp":1178370520000},"page":"157-168","source":"Crossref","is-referenced-by-count":68,"title":["A Graph Theoretic Approach to Software Watermarking"],"prefix":"10.1007","author":[{"given":"Ramarathnam","family":"Venkatesan","sequence":"first","affiliation":[]},{"given":"Vijay","family":"Vazirani","sequence":"additional","affiliation":[]},{"given":"Saurabh","family":"Sinha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,24]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Ross J. Anderson and Fabien A. P. Petitcolas. On the limits of Steganography. IEEE J-SAC, 16(4), May 1998.","DOI":"10.1109\/49.668971"},{"key":"12_CR2","unstructured":"U. Assmann. OPTIMIX optimizer generator. http:\/\/i44www.info.uni-karlsruhe.de\/assmann\/optimix.html"},{"key":"12_CR3","unstructured":"Council for IBM Corporation Software birthmarks. Talk to BCS Technology of Software Protection Special Interest Interest Group. Reported in [AP]."},{"key":"12_CR4","unstructured":"Bella Bollobas. 1985. Random Graphs. Academic Press."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"C. Collberg and C. Thomborson. Software Watermarking: Models and Dynamic Embeddings. Principles of Programming Languages 1999, POPL\u201999.","DOI":"10.1145\/292540.292569"},{"key":"12_CR6","unstructured":"R. L. Davidson and N. Myhrvold Method and system for generating and auditing a signature for a computer program.US Patent 5559884, September 1996. Assignee: Microsoft Corporation"},{"key":"12_CR7","unstructured":"Reinhard Diestel. 2000. Graph Theory Springer-Verlag, second edition."},{"key":"12_CR8","unstructured":"William Feller. 1993. An Introduction To Probability Theory And Its Applications, volume 1. Wiley Easter Limited, third edition."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"A. Frieze and R. Kannan. The Regularity lemma and approximation schemes for dense problems. 37th Annual Symposium on Foundations of Computer Science, 2\u201311, October 1996. IEEE.","DOI":"10.1109\/SFCS.1996.548459"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"S. Guattery and G. L. Miller. On the Performance of Spectral Graph Partitioning Methods. Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 233\u2013242, ACM-SIAM, 1995.","DOI":"10.21236\/ADA292214"},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1137\/S0097539794271692","volume":"29","author":"N. Garg","year":"1999","unstructured":"N. Garg, H. Saran and V. V. Vazirani. Finding Separator Cuts in Planar Graphs within Twice the Optimal. SI AM J. Computing, vol 29, No. 1, 159\u2013179 (1999).","journal-title":"SI AM J. Computing"},{"key":"12_CR12","unstructured":"G. Holloway. The Data Flow Analysis Library of Machine SUIF. http:\/\/www.eecs.harvard.edu\/hube\/software\/v130\/dfa.html"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Norman L. Johnson and Samuel Kotz. Discrete Distributions. Wiley Series in Probability and Statistics, 1999.","DOI":"10.1016\/S0167-7152(98)00204-1"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"G. Karypis and V. Kumar. Multilevel k-way Hypergraph Partitioning. DAC 1999, 343\u2013348.","DOI":"10.1145\/309847.309954"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01200757","volume":"15","author":"N. Linial","year":"1995","unstructured":"N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15:215\u2013245, 1995.","journal-title":"Combinatorica"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proc. 29th Ann. IEEE Symp. on Foundations of Comput. Sci., pages 422\u2013431, 1988.","DOI":"10.1109\/SFCS.1988.21958"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R. J. Lipton","year":"1979","unstructured":"R. J. Lipton and R. E. Tarjan. A Separator Theorem for Planar Graphs. SIAM J. Appl. Math., 36 (1979), 177\u2013189.","journal-title":"SIAM J. Appl. Math."},{"key":"12_CR18","unstructured":"V Communications. Sourcer: Advanced Commenting Disassembler. http:\/\/www.v-com.com\/products\/sourcer.html ."},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"D. A. Spielman and S. Teng. Spectral Partitioning works: Planar graphs and finite element meshes. Technical Report CSD-96-989, U. C. Berkley, February 1996. extended abstract in Proc. 37. IEEE Conf. Foundations of Comp. Sci., 1996.","DOI":"10.1109\/SFCS.1996.548468"},{"key":"12_CR20","unstructured":"Amitabha Srivastava Vulcan Tech Report Technical Report Vol TR99, No 76, Microsoft Research Technical Reports, 1999."}],"container-title":["Lecture Notes in Computer Science","Information Hiding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45496-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T03:35:32Z","timestamp":1707881732000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45496-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540427339","9783540454960"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45496-9_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}