{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:54:56Z","timestamp":1781463296017,"version":"3.54.1"},"reference-count":30,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001665","name":"French National Research Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.dam.2026.05.008","type":"journal-article","created":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T07:13:20Z","timestamp":1779261200000},"page":"328-340","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Kernelization of compressing two-dimensional routing tables with order"],"prefix":"10.1016","volume":"391","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Giroire","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Havet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joanna","family":"Moulierac","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.05.008_b1","series-title":"ACM-SIAM Symposium on Discrete Algorithms","first-page":"1066","article-title":"Compressing rectilinear pictures and minimizing access control lists","author":"Applegate","year":"2007"},{"key":"10.1016\/j.dam.2026.05.008_b2","series-title":"International Symposium on Parameterized and Exact Computation","first-page":"1","article-title":"Lower bounds for kernelization","author":"Bodlaender","year":"2014"},{"issue":"8","key":"10.1016\/j.dam.2026.05.008_b3","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","article-title":"On problems without polynomial kernels","volume":"75","author":"Bodlaender","year":"2009","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.dam.2026.05.008_b4","series-title":"International Symposium on Theoretical Aspects of Computer Science","first-page":"165","article-title":"Cross-Composition: A New Technique for Kernelization Lower Bounds","volume":"vol. 9","author":"Bodlaender","year":"2011"},{"issue":"1","key":"10.1016\/j.dam.2026.05.008_b5","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/120880240","article-title":"Kernelization lower bounds by cross-composition","volume":"28","author":"Bodlaender","year":"2014","journal-title":"SIAM J. Discrete Math."},{"issue":"35","key":"10.1016\/j.dam.2026.05.008_b6","doi-asserted-by":"crossref","first-page":"4570","DOI":"10.1016\/j.tcs.2011.04.039","article-title":"Kernel bounds for disjoint cycles and disjoint paths","volume":"412","author":"Bodlaender","year":"2011","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.dam.2026.05.008_b7","article-title":"Graph theory","author":"Bondy","year":"2011"},{"key":"10.1016\/j.dam.2026.05.008_b8","doi-asserted-by":"crossref","unstructured":"Rami Cohen, Liane Lewin-Eytan, Joseph\u00a0Seffi Naor, Danny Raz, On the effect of forwarding table size on SDN network utilization, in: IEEE Conference on Computer Communications, INFOCOM, 2014, pp. 1734\u20131742.","DOI":"10.1109\/INFOCOM.2014.6848111"},{"issue":"4","key":"10.1016\/j.dam.2026.05.008_b9","doi-asserted-by":"crossref","DOI":"10.1145\/2629620","article-title":"Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses","volume":"61","author":"Dell","year":"2014","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/j.dam.2026.05.008_b10","doi-asserted-by":"crossref","first-page":"13:1","DOI":"10.1145\/2650261","article-title":"Kernelization lower bounds through colors and IDs","volume":"11","author":"Dom","year":"2014","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.dam.2026.05.008_b11","series-title":"Parameterized Complexity","author":"Downey","year":"2012"},{"key":"10.1016\/j.dam.2026.05.008_b12","series-title":"International Symposium on Theoretical Aspects of Computer Science","first-page":"421","article-title":"Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves","author":"Fernau","year":"2009"},{"key":"10.1016\/j.dam.2026.05.008_b13","series-title":"Parameterized Complexity Theory","author":"Flum","year":"2006"},{"issue":"1","key":"10.1016\/j.dam.2026.05.008_b14","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.jcss.2010.06.007","article-title":"Infeasibility of instance compression and succinct PCPs for NP","volume":"77","author":"Fortnow","year":"2011","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/j.dam.2026.05.008_b15","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s00453-016-0243-7","article-title":"On the complexity of compressing two dimensional routing tables with order","volume":"80","author":"Giroire","year":"2018","journal-title":"Algorithmica"},{"issue":"4","key":"10.1016\/j.dam.2026.05.008_b16","doi-asserted-by":"crossref","first-page":"900","DOI":"10.1007\/s00453-012-9619-5","article-title":"On the (non-)existence of polynomial kernels for pl-free edge modification problems","volume":"65","author":"Guillemot","year":"2013","journal-title":"Algorithmica"},{"key":"10.1016\/j.dam.2026.05.008_b17","series-title":"ACM-SIAM Symposium on Discrete Algorithms","first-page":"104","article-title":"Weak compositions and their applications to polynomial lower bounds for kernelization","author":"Hermelin","year":"2012"},{"issue":"4","key":"10.1016\/j.dam.2026.05.008_b18","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n5\/2 algorithm for maximum matchings in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.dam.2026.05.008_b19","series-title":"CoNEXT","first-page":"13","article-title":"Optimizing the \u201cOne Big Switch Abstraction\u201d in software-defined networks","author":"Kang","year":"2013"},{"key":"10.1016\/j.dam.2026.05.008_b20","doi-asserted-by":"crossref","unstructured":"Y. Kanizo, D. Hay, I. Keslassy, Palette: Distributing tables in software-defined networks, in: IEEE Conference on Computer Communications, INFOCOM, (ISSN: 0743-166X) 2013, pp. 545\u2013549.","DOI":"10.1109\/INFCOM.2013.6566832"},{"issue":"2","key":"10.1016\/j.dam.2026.05.008_b21","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1109\/MCOM.2013.6461195","article-title":"Improving network management with software defined networking","volume":"51","author":"Kim","year":"2013","journal-title":"IEEE Commun. Mag."},{"issue":"3","key":"10.1016\/j.dam.2026.05.008_b22","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/j.disopt.2013.02.001","article-title":"Two edge modification problems without polynomial kernels","volume":"10","author":"Kratsch","year":"2013","journal-title":"Discrete Optim."},{"issue":"1","key":"10.1016\/j.dam.2026.05.008_b23","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/JPROC.2014.2371999","article-title":"Software-defined networking: A comprehensive survey","volume":"103","author":"Kreutz","year":"2014","journal-title":"Proc. IEEE"},{"issue":"1","key":"10.1016\/j.dam.2026.05.008_b24","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/JPROC.2014.2371999","article-title":"Software-defined networking: A comprehensive survey","volume":"103","author":"Kreutz","year":"2015","journal-title":"Proc. IEEE"},{"issue":"2","key":"10.1016\/j.dam.2026.05.008_b25","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/1355734.1355746","article-title":"OpenFlow: Enabling innovation in campus networks","volume":"38","author":"McKeown","year":"2008","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"10.1016\/j.dam.2026.05.008_b26","doi-asserted-by":"crossref","unstructured":"R. Narayanan, S. Kotha, G. Lin, A. Khan, S. Rizvi, W. Javed, H. Khan, S.A. Khayam, Macroflows and Microflows: Enabling Rapid Network Innovation through a Split SDN Data Plane, in: European Workshop on Software Defined Networking, EWSDN, 2012, pp. 79\u201384.","DOI":"10.1109\/EWSDN.2012.16"},{"key":"10.1016\/j.dam.2026.05.008_b27","series-title":"Invitation to Fixed-Parameter Algorithms","author":"Niedermeier","year":"2006"},{"key":"10.1016\/j.dam.2026.05.008_b28","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.comnet.2017.04.026","article-title":"Minnie: An SDN world with few compressed forwarding rules","volume":"121","author":"Rifai","year":"2017","journal-title":"Comput. Netw."},{"key":"10.1016\/j.dam.2026.05.008_b29","series-title":"Proceedings of the 8th International Conference on Emerging Networking Experiments and Technologies","first-page":"49","article-title":"PAST: Scalable ethernet for data centers","author":"Stephens","year":"2012"},{"issue":"4","key":"10.1016\/j.dam.2026.05.008_b30","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s00453-002-1000-7","article-title":"Compressing two-dimensional routing tables","volume":"35","author":"Suri","year":"2003","journal-title":"Algorithmica"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002921?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002921?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:06:52Z","timestamp":1781460412000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26002921"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":30,"alternative-id":["S0166218X26002921"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.05.008","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Kernelization of compressing two-dimensional routing tables with order","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.05.008","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}