Pub Date : 2008-07-02DOI: 10.1007/978-3-540-69903-3_17
Arash Farzan, J. Munro
{"title":"A Uniform Approach Towards Succinct Representation of Trees","authors":"Arash Farzan, J. Munro","doi":"10.1007/978-3-540-69903-3_17","DOIUrl":"https://doi.org/10.1007/978-3-540-69903-3_17","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123660864","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 : 2008-07-02DOI: 10.1007/978-3-540-69903-3_6
L. Addario-Berry, O. Amini, Jean-Sébastien Sereni, Stéphan Thomassé
{"title":"Guarding Art Galleries: The Extra Cost for Sculptures Is Linear","authors":"L. Addario-Berry, O. Amini, Jean-Sébastien Sereni, Stéphan Thomassé","doi":"10.1007/978-3-540-69903-3_6","DOIUrl":"https://doi.org/10.1007/978-3-540-69903-3_6","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"226 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122832070","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 : 2008-07-02DOI: 10.1007/978-3-540-69903-3_12
S. Fekete, Alexander Hall, Ekkehard Köhler, A. Kröller
{"title":"The Maximum Energy-Constrained Dynamic Flow Problem","authors":"S. Fekete, Alexander Hall, Ekkehard Köhler, A. Kröller","doi":"10.1007/978-3-540-69903-3_12","DOIUrl":"https://doi.org/10.1007/978-3-540-69903-3_12","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127568964","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 : 2008-07-02DOI: 10.1007/978-3-540-69903-3_28
Rolf Harren, R. V. Stee
{"title":"Packing Rectangles into 2OPT Bins Using Rotations","authors":"Rolf Harren, R. V. Stee","doi":"10.1007/978-3-540-69903-3_28","DOIUrl":"https://doi.org/10.1007/978-3-540-69903-3_28","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114746745","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 : 2008-07-02DOI: 10.1007/978-3-540-69903-3_21
Miroslaw Kowaluk, A. Lingas, Johannes Nowak
{"title":"A Path Cover Technique for LCAs in Dags","authors":"Miroslaw Kowaluk, A. Lingas, Johannes Nowak","doi":"10.1007/978-3-540-69903-3_21","DOIUrl":"https://doi.org/10.1007/978-3-540-69903-3_21","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131444608","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 : 2008-07-02DOI: 10.1007/978-3-540-69903-3_8
Beat Gfeller, Matús Mihalák, S. Suri, Elias Vicari, P. Widmayer
{"title":"Angle Optimization in Target Tracking","authors":"Beat Gfeller, Matús Mihalák, S. Suri, Elias Vicari, P. Widmayer","doi":"10.1007/978-3-540-69903-3_8","DOIUrl":"https://doi.org/10.1007/978-3-540-69903-3_8","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123332976","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 : 2008-07-02DOI: 10.1007/978-3-540-69903-3_32
Min Chih Lin, Francisco J. Soulignac, J. Szwarcfiter
{"title":"A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs","authors":"Min Chih Lin, Francisco J. Soulignac, J. Szwarcfiter","doi":"10.1007/978-3-540-69903-3_32","DOIUrl":"https://doi.org/10.1007/978-3-540-69903-3_32","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116149262","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 : 2008-07-02DOI: 10.1007/978-3-540-69903-3_20
Ernst Althaus, S. Canzar, Khaled M. Elbassioni, A. Karrenbauer, Julián Mestre
{"title":"Approximating the Interval Constrained Coloring Problem","authors":"Ernst Althaus, S. Canzar, Khaled M. Elbassioni, A. Karrenbauer, Julián Mestre","doi":"10.1007/978-3-540-69903-3_20","DOIUrl":"https://doi.org/10.1007/978-3-540-69903-3_20","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121756451","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
扫码关注我们
求助内容：
应助结果提醒方式：