首页 > 最新文献

Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX最新文献

英文 中文
Recognizing Bundles in Time Table Graphs - A Structural Approach 识别时间表图中的束-一种结构方法
A. Liebers, K. Weihe
{"title":"Recognizing Bundles in Time Table Graphs - A Structural Approach","authors":"A. Liebers, K. Weihe","doi":"10.1007/3-540-44691-5_8","DOIUrl":"https://doi.org/10.1007/3-540-44691-5_8","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"19 6-7 1","pages":"87-98"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75019106","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}
引用次数: 4
New Algorithms for Examination Timetabling 考试排课的新算法
Pub Date : 2000-09-05 DOI: 10.1007/3-540-44691-5_20
M. Caramia, P. Dell’Olmo, G. Italiano
{"title":"New Algorithms for Examination Timetabling","authors":"M. Caramia, P. Dell’Olmo, G. Italiano","doi":"10.1007/3-540-44691-5_20","DOIUrl":"https://doi.org/10.1007/3-540-44691-5_20","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"7 1","pages":"230-242"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82962081","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}
引用次数: 134
Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms 实验的渐近复杂性?随机算法的案例研究
Pub Date : 2000-09-05 DOI: 10.1007/3-540-44691-5_12
P. Sanders, R. Fleischer
{"title":"Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms","authors":"P. Sanders, R. Fleischer","doi":"10.1007/3-540-44691-5_12","DOIUrl":"https://doi.org/10.1007/3-540-44691-5_12","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"6 1","pages":"135-146"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87885136","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}
引用次数: 9
Clustering Data without Prior Knowledge 无先验知识聚类数据
J. Aslam, Alain Leblanc, C. Stein
{"title":"Clustering Data without Prior Knowledge","authors":"J. Aslam, Alain Leblanc, C. Stein","doi":"10.1007/3-540-44691-5_7","DOIUrl":"https://doi.org/10.1007/3-540-44691-5_7","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"39 1","pages":"74-86"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77663935","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}
引用次数: 4
Pushing the Limits in Sequential Sorting 推进顺序排序的极限
S. Edelkamp, Patrick Stiegeler
{"title":"Pushing the Limits in Sequential Sorting","authors":"S. Edelkamp, Patrick Stiegeler","doi":"10.1007/3-540-44691-5_4","DOIUrl":"https://doi.org/10.1007/3-540-44691-5_4","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"20 1","pages":"39-50"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80282660","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}
引用次数: 3
Visualizing Algorithms over the Web with the Publication-Driven Approach 基于发布驱动方法的网络可视化算法
Pub Date : 2000-09-05 DOI: 10.1007/3-540-44691-5_13
C. Demetrescu, Irene Finocchi, G. Liotta
{"title":"Visualizing Algorithms over the Web with the Publication-Driven Approach","authors":"C. Demetrescu, Irene Finocchi, G. Liotta","doi":"10.1007/3-540-44691-5_13","DOIUrl":"https://doi.org/10.1007/3-540-44691-5_13","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"1 1","pages":"147-158"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80145819","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}
引用次数: 16
Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures 一般图中O (nm log n)加权匹配的实现。数据结构的力量
K. Mehlhorn, G. Schäfer
{"title":"Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures","authors":"K. Mehlhorn, G. Schäfer","doi":"10.1007/3-540-44691-5_3","DOIUrl":"https://doi.org/10.1007/3-540-44691-5_3","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"23 1","pages":"23-38"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87300173","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}
引用次数: 24
Algorithm Engineering: 3rd International Workshop, WAE’99 London, UK, July 19–21, 1999 Proceedings 算法工程:第三届国际研讨会,英国伦敦,1999年7月19-21日
J. Vitter, Christos D. Zaloliagis
{"title":"Algorithm Engineering: 3rd International Workshop, WAE’99 London, UK, July 19–21, 1999 Proceedings","authors":"J. Vitter, Christos D. Zaloliagis","doi":"10.1007/3-540-48318-7","DOIUrl":"https://doi.org/10.1007/3-540-48318-7","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"9 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"1999-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89782035","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}
引用次数: 2
Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA 利用LEDA实现图连通性算法的实验评估
Pub Date : 1999-07-19 DOI: 10.1007/3-540-48318-7_12
P. Fatourou, P. Spirakis, P. Zarafidis, A. Zoura
{"title":"Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA","authors":"P. Fatourou, P. Spirakis, P. Zarafidis, A. Zoura","doi":"10.1007/3-540-48318-7_12","DOIUrl":"https://doi.org/10.1007/3-540-48318-7_12","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"34 1","pages":"124-138"},"PeriodicalIF":0.0,"publicationDate":"1999-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77501879","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}
引用次数: 4
Ten Years of LEDA Some Thoughts (Abstract) LEDA十年的几点思考(摘要)
K. Mehlhorn
{"title":"Ten Years of LEDA Some Thoughts (Abstract)","authors":"K. Mehlhorn","doi":"10.1007/3-540-48318-7_3","DOIUrl":"https://doi.org/10.1007/3-540-48318-7_3","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"29 1","pages":"14"},"PeriodicalIF":0.0,"publicationDate":"1999-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84233714","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}
引用次数: 0
期刊
Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1