Combinatorial algorithms : 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, revised selected papers / edited by Thierry Lecroq, Laurent Mouchard.Material type: TextSeries: Serienbezeichnung | Lecture notes in computer science ; 8288.Publisher: Heidelberg : Springer, Copyright date: ©2013Description: 1 online resource (xxii, 474 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783642452789; 3642452787Other title: 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, revised selected papersSubject(s): Computer science | Data structures (Computer science) | Computer software | Computational complexity | Algebra -- Data processing | Combinatorial analysis | Algebra -- Data processing | Combinatorial analysis | Computational complexity | Computer science | Computer software | Data structures (Computer science) | computerwetenschappen | computer sciences | wiskunde | mathematics | combinatoriek | combinatorics | algoritmen | algorithms | computeranalyse | computer analysis | algebra | gegevensstructuren | data structures | logica | logic | Information and Communication Technology (General) | Informatie- en communicatietechnologie (algemeen)Genre/Form: Electronic books. | Ebook. Additional physical formats: Printed edition:: No titleDDC classification: 511/.6 | 004.0151 LOC classification: QA164Online resources: Click here to access online
|Item type||Current library||Collection||Call number||Status||Date due||Barcode||Item holds|
Includes bibliographical references and index.
Algorithms on graphs -- Algorithms on strings -- Discrete geometry -- Satisfiability.
This book constitutes the thoroughly refereed post-workshop proceedings of the 24th International Workshop on Combinatorial Algorithms, IWOCA 2013, held in Rouen, France, in July 2013. The 33 revised full papers presented together with 10 short papers and 5 invited talks were carefully reviewed and selected from a total of 91 submissions. The papers are organized in topical sections on algorithms on graphs; algorithms on strings; discrete geometry; and satisfiability.