Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/1212
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBrankovic, Ljiljana. ;en_US
dc.contributor.authorRyan, Joe. ;en_US
dc.contributor.authorSmyth, William F. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:26:32Z-
dc.date.available2020-05-17T08:26:32Z-
dc.date.issued2018en_US
dc.identifier.isbn9783319788258 ;en_US
dc.identifier.isbn9783319788241 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/1212-
dc.descriptionPrinted edition: ; 9783319788241. ;en_US
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis book constitutes the refereed post-conference proceedings of the 28th International Workshop on Combinatorial Algorithms, IWOCA 2017, held in Newcastle, NSW, Australia, in July 2017. The 30 regular papers presented in this volume together with 5 invited talks were carefully reviewed and selected from 55 submissions. They were organized in topical sessions named: approximation algorithms and hardness; computational complexity; computational geometry; graphs and combinatorics; graph colourings, labellings and power domination; heuristics; mixed integer programming; polynomial algorithms; privacy; and string algorithms. ;en_US
dc.description.statementofresponsibilityedited by Ljiljana Brankovic, Joe Ryan, William F. Smyth.en_US
dc.description.tableofcontentsApproximation algorithms and hardness -- Computational complexity -- Computational geometry -- Graphs and combinatorics -- Graph colourings, labellings and power domination -- Heuristics -- Mixed integer programming -- Polynomial algorithms -- Privacy -- String algorithms. ;en_US
dc.format.extentXII, 434 p. 80 illus. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10765. ;en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10765. ;en_US
dc.relation.haspart9783319788258.pdfen_US
dc.subjectComputer Scienceen_US
dc.subjectComputer Securityen_US
dc.subjectData structures (Computer science). ;en_US
dc.subjectAlgorithmsen_US
dc.subjectNumerical analysis. ;en_US
dc.subjectComputer Science and Mathematicsen_US
dc.subjectArtificial Intelligenceen_US
dc.subjectComputer Scienceen_US
dc.subjectDiscrete Mathematics in Computer Science. ;en_US
dc.subjectAlgorithm Analysis and Problem Complexity. ;en_US
dc.subjectData Structures. ;en_US
dc.subjectArtificial Intelligence and Roboticsen_US
dc.subjectNumeric Computing. ;en_US
dc.subjectSystems and Data Securityen_US
dc.subject.ddc004.0151 ; 23 ;en_US
dc.subject.lccQA76.9.M35 ;en_US
dc.titleCombinatorial Algorithmsen_US
dc.title.alternative28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
Appears in Collections:مدیریت فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319788258.pdf14.13 MBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBrankovic, Ljiljana. ;en_US
dc.contributor.authorRyan, Joe. ;en_US
dc.contributor.authorSmyth, William F. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:26:32Z-
dc.date.available2020-05-17T08:26:32Z-
dc.date.issued2018en_US
dc.identifier.isbn9783319788258 ;en_US
dc.identifier.isbn9783319788241 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/1212-
dc.descriptionPrinted edition: ; 9783319788241. ;en_US
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis book constitutes the refereed post-conference proceedings of the 28th International Workshop on Combinatorial Algorithms, IWOCA 2017, held in Newcastle, NSW, Australia, in July 2017. The 30 regular papers presented in this volume together with 5 invited talks were carefully reviewed and selected from 55 submissions. They were organized in topical sessions named: approximation algorithms and hardness; computational complexity; computational geometry; graphs and combinatorics; graph colourings, labellings and power domination; heuristics; mixed integer programming; polynomial algorithms; privacy; and string algorithms. ;en_US
dc.description.statementofresponsibilityedited by Ljiljana Brankovic, Joe Ryan, William F. Smyth.en_US
dc.description.tableofcontentsApproximation algorithms and hardness -- Computational complexity -- Computational geometry -- Graphs and combinatorics -- Graph colourings, labellings and power domination -- Heuristics -- Mixed integer programming -- Polynomial algorithms -- Privacy -- String algorithms. ;en_US
dc.format.extentXII, 434 p. 80 illus. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10765. ;en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10765. ;en_US
dc.relation.haspart9783319788258.pdfen_US
dc.subjectComputer Scienceen_US
dc.subjectComputer Securityen_US
dc.subjectData structures (Computer science). ;en_US
dc.subjectAlgorithmsen_US
dc.subjectNumerical analysis. ;en_US
dc.subjectComputer Science and Mathematicsen_US
dc.subjectArtificial Intelligenceen_US
dc.subjectComputer Scienceen_US
dc.subjectDiscrete Mathematics in Computer Science. ;en_US
dc.subjectAlgorithm Analysis and Problem Complexity. ;en_US
dc.subjectData Structures. ;en_US
dc.subjectArtificial Intelligence and Roboticsen_US
dc.subjectNumeric Computing. ;en_US
dc.subjectSystems and Data Securityen_US
dc.subject.ddc004.0151 ; 23 ;en_US
dc.subject.lccQA76.9.M35 ;en_US
dc.titleCombinatorial Algorithmsen_US
dc.title.alternative28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
Appears in Collections:مدیریت فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319788258.pdf14.13 MBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBrankovic, Ljiljana. ;en_US
dc.contributor.authorRyan, Joe. ;en_US
dc.contributor.authorSmyth, William F. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:26:32Z-
dc.date.available2020-05-17T08:26:32Z-
dc.date.issued2018en_US
dc.identifier.isbn9783319788258 ;en_US
dc.identifier.isbn9783319788241 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/1212-
dc.descriptionPrinted edition: ; 9783319788241. ;en_US
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis book constitutes the refereed post-conference proceedings of the 28th International Workshop on Combinatorial Algorithms, IWOCA 2017, held in Newcastle, NSW, Australia, in July 2017. The 30 regular papers presented in this volume together with 5 invited talks were carefully reviewed and selected from 55 submissions. They were organized in topical sessions named: approximation algorithms and hardness; computational complexity; computational geometry; graphs and combinatorics; graph colourings, labellings and power domination; heuristics; mixed integer programming; polynomial algorithms; privacy; and string algorithms. ;en_US
dc.description.statementofresponsibilityedited by Ljiljana Brankovic, Joe Ryan, William F. Smyth.en_US
dc.description.tableofcontentsApproximation algorithms and hardness -- Computational complexity -- Computational geometry -- Graphs and combinatorics -- Graph colourings, labellings and power domination -- Heuristics -- Mixed integer programming -- Polynomial algorithms -- Privacy -- String algorithms. ;en_US
dc.format.extentXII, 434 p. 80 illus. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10765. ;en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10765. ;en_US
dc.relation.haspart9783319788258.pdfen_US
dc.subjectComputer Scienceen_US
dc.subjectComputer Securityen_US
dc.subjectData structures (Computer science). ;en_US
dc.subjectAlgorithmsen_US
dc.subjectNumerical analysis. ;en_US
dc.subjectComputer Science and Mathematicsen_US
dc.subjectArtificial Intelligenceen_US
dc.subjectComputer Scienceen_US
dc.subjectDiscrete Mathematics in Computer Science. ;en_US
dc.subjectAlgorithm Analysis and Problem Complexity. ;en_US
dc.subjectData Structures. ;en_US
dc.subjectArtificial Intelligence and Roboticsen_US
dc.subjectNumeric Computing. ;en_US
dc.subjectSystems and Data Securityen_US
dc.subject.ddc004.0151 ; 23 ;en_US
dc.subject.lccQA76.9.M35 ;en_US
dc.titleCombinatorial Algorithmsen_US
dc.title.alternative28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
Appears in Collections:مدیریت فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319788258.pdf14.13 MBAdobe PDFThumbnail
Preview File