Pub Date : 2020-04-30DOI: 10.1007/978-3-030-48966-3_31
B. S. Panda, Juhi Chaudhary
{"title":"Acyclic Matching in Some Subclasses of Graphs","authors":"B. S. Panda, Juhi Chaudhary","doi":"10.1007/978-3-030-48966-3_31","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_31","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116892810","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-04-30DOI: 10.1007/978-3-030-48966-3_2
V. Acuña, Leandro Lima, G. Italiano, Luca Pepè Sciarria, M. Sagot, B. Sinaimeri
{"title":"A Family of Tree-Based Generators for Bubbles in Directed Graphs","authors":"V. Acuña, Leandro Lima, G. Italiano, Luca Pepè Sciarria, M. Sagot, B. Sinaimeri","doi":"10.1007/978-3-030-48966-3_2","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_2","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124839588","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-04-30DOI: 10.1007/978-3-030-48966-3_3
Bogdan Alecu, V. Lozin, D. Werra
{"title":"The Micro-world of Cographs","authors":"Bogdan Alecu, V. Lozin, D. Werra","doi":"10.1007/978-3-030-48966-3_3","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_3","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128399618","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-04-30DOI: 10.1007/978-3-030-48966-3_11
Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, P. Rossmanith
{"title":"Further Results on Online Node- and Edge-Deletion Problems with Advice","authors":"Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, P. Rossmanith","doi":"10.1007/978-3-030-48966-3_11","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_11","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114191101","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-04-30DOI: 10.1007/978-3-030-48966-3_16
P. Damaschke
{"title":"Two Robots Patrolling on a Line: Integer Version and Approximability","authors":"P. Damaschke","doi":"10.1007/978-3-030-48966-3_16","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_16","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134370511","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-04-30DOI: 10.1007/978-3-030-48966-3_14
Ananya D. Christman, Christine Chung, Nicholas Jaczko, Tianzhi Li, Scott Westvold, Xinyue Xu, David S. Yuen
{"title":"New Bounds for Maximizing Revenue in Online Dial-a-Ride","authors":"Ananya D. Christman, Christine Chung, Nicholas Jaczko, Tianzhi Li, Scott Westvold, Xinyue Xu, David S. Yuen","doi":"10.1007/978-3-030-48966-3_14","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_14","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123925010","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-04-30DOI: 10.1007/978-3-030-48966-3_17
P. Damaschke
{"title":"Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges","authors":"P. Damaschke","doi":"10.1007/978-3-030-48966-3_17","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_17","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"485 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123060570","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-04-30DOI: 10.1007/978-3-030-48966-3_7
Toni Böhnlein, Oliver Schaudt
{"title":"On the Complexity of Stackelberg Matroid Pricing Problems","authors":"Toni Böhnlein, Oliver Schaudt","doi":"10.1007/978-3-030-48966-3_7","DOIUrl":"https://doi.org/10.1007/978-3-030-48966-3_7","url":null,"abstract":"","PeriodicalId":118806,"journal":{"name":"Combinatorial Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123683907","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：