求大小≤k的所有最左分隔符

{"title":"求大小≤k的所有最左分隔符","authors":"Mahdi Belbasi, Martin Fürer","doi":"10.1007/978-3-030-92681-6_23","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Finding All Leftmost Separators of Size ≤k\",\"authors\":\"Mahdi Belbasi, Martin Fürer\",\"doi\":\"10.1007/978-3-030-92681-6_23\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":149649,\"journal\":{\"name\":\"International Conference on Combinatorial Optimization and Applications\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-11-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Combinatorial Optimization and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-92681-6_23\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Combinatorial Optimization and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-92681-6_23","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}