{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:10:18Z","timestamp":1649203818729},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2006,6,23]],"date-time":"2006-06-23T00:00:00Z","timestamp":1151020800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2006,9]]},"DOI":"10.1007\/s10878-006-8904-0","type":"journal-article","created":{"date-parts":[[2006,6,23]],"date-time":"2006-06-23T08:01:19Z","timestamp":1151049679000},"page":"57-70","source":"Crossref","is-referenced-by-count":2,"title":["Combinatorics of TCP reordering"],"prefix":"10.1007","volume":"12","author":[{"given":"Anders","family":"Hansson","sequence":"first","affiliation":[]},{"given":"Gabriel","family":"Istrate","sequence":"additional","affiliation":[]},{"given":"Shiva Prasad","family":"Kasiviswanathan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,6,23]]},"reference":[{"key":"8904_CR1","doi-asserted-by":"crossref","unstructured":"Bellardo J, Savage S (2002) Measuring packet reordering. In Proc. ACM SIGCOMM Internet Measurement Workshop, Marseille, France 97\u2013105","DOI":"10.1145\/637201.637216"},{"issue":"6","key":"8904_CR2","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1109\/90.811445","volume":"7","author":"JCR Bennett","year":"1999","unstructured":"Bennett JCR, Partridge C, Shectman N (1999) Packet reordering is not pathological network behavior. IEEE\/ACM Transactions on Networking, 7(6):789\u2013798","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"8904_CR3","doi-asserted-by":"crossref","unstructured":"Bez\u00e1kova I, \u0160tefankovi\u010d D, Vigoda E, Vazirani VV (2006) Accelerating simulated annealing algorithm for the permanent and combinatorial counting problems. In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA\u201906), 900\u2013907","DOI":"10.1145\/1109557.1109656"},{"issue":"1-2","key":"8904_CR4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0166-218X(00)00221-3","volume":"108","author":"B Courcelle","year":"2001","unstructured":"Courcelle B, Makowsky JA, Rotics U (2001) On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Appl. Math., 108(1-2):23\u201352","journal-title":"Discrete Appl. Math."},{"key":"8904_CR5","doi-asserted-by":"crossref","unstructured":"Downey RG, Fellows MR (1999) Parameterized Complexity. Springer Verlag.","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"8904_CR6","unstructured":"Istrate G, Hansson A (2005) Counting preimages of TCP reordering patterns. Submitted to Discrete Applied Mathematics"},{"key":"8904_CR7","doi-asserted-by":"crossref","unstructured":"Istrate G, Hansson A, Thulasidasan S, Marathe M, Barrett C (2006) Semantic compression of TCP traces. In Proceedings of the IFIP NETWORKING Conference, F. Boavida (editor), volume 3976 of Lecture Notes in Computer Science, Springer Verlag, 123\u2013135","DOI":"10.1007\/11753810_11"},{"key":"8904_CR8","doi-asserted-by":"crossref","unstructured":"Jaiswal S, Iannacone G, Diot C, Kurose J, Towsley D (2004) Inferring TCP connection characteristics through passive measurements. In Proceedings of INFOCOM\u2019;04, volume 3, Hong Kong, China, 1582\u20131592","DOI":"10.1109\/INFCOM.2004.1354571"},{"issue":"4","key":"8904_CR9","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1145\/1008731.1008738","volume":"51","author":"M Jerrum","year":"2004","unstructured":"Jerrum M, Sinclair A, Vigoda E (2004) A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. Journal of the ACM, 51(4):671\u2013697","journal-title":"Journal of the ACM"},{"key":"8904_CR10","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","volume":"43","author":"M Jerrum","year":"1986","unstructured":"Jerrum M, Valiant LG, Vazirani VV (1986) Random generation of combinatorial structures from a uniform distribution. Theor. Comput. Sci., 43:169\u2013188","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"8904_CR11","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/MNET.2002.1035115","volume":"16","author":"M Laor","year":"2002","unstructured":"Laor M, Gendel L (2002) The effect of packet reordering in a backbone link on application throughput. IEEE Network, 16(5):28\u201336","journal-title":"IEEE Network"},{"key":"8904_CR12","unstructured":"Lov\u00e1sz L, Plummer M (1986) Matching Theory. Number 29 in Annals of Discrete Mathematics. North Holland"},{"key":"8904_CR13","unstructured":"Peterson L, Davie BS (2000) Computer Networks. A Systems Approach. Morgan Kauffman, San Francisco, CA, 2nd edition"},{"key":"8904_CR14","unstructured":"Piratla NM, Jayasumana AP, Bare AA (2005) RD: A formal, comprehensive metric for packet reordering. In Proc. IFIP Networking Conference 2005, volume 3462 of Lecture Notes in Computer Science, Springer Verlag, 78\u201389"},{"key":"8904_CR15","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N Robertson","year":"1986","unstructured":"Robertson N, Seymour PD (1986) Graph minors II, algorithmic aspects of tree-width. Journal of Algorithms, 7:309\u2013322","journal-title":"Journal of Algorithms"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-8904-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-006-8904-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-8904-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T18:50:46Z","timestamp":1627498246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-006-8904-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,23]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["8904"],"URL":"https:\/\/doi.org\/10.1007\/s10878-006-8904-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6,23]]}}}