國立虎尾科技大學 |

WALCOM: Algorithms and Computation = 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	WALCOM: Algorithms and Computation/ edited by M. Sohel Rahman, Etsuji Tomita.
Reminder of title:	9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015, Proceedings /
other author:	Rahman, M. Sohel.
Description:	XXIV, 336 p. 110 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Algorithms. -
Online resource:	https://doi.org/10.1007/978-3-319-15612-5
ISBN:	9783319156125

WALCOM: Algorithms and Computation = 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015, Proceedings /
WALCOM: Algorithms and Computation9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015, Proceedings /[electronic resource] :edited by M. Sohel Rahman, Etsuji Tomita. - 1st ed. 2015. - XXIV, 336 p. 110 illus.online resource. - Theoretical Computer Science and General Issues ;8973. - Theoretical Computer Science and General Issues ;9163.

Encoding Data Structures -- Fast Algorithms for Constrained Graph Density Problems -- The Directed Ring Loading with Penalty Cost -- Edge-Colorings of Weighted Graphs (Extended Abstract) -- Unit Covering in Color-Spanning Set Model -- Compact Encodings and Indexes for the Nearest Larger Neighbor Problem -- A Practical Succinct Data Structure for Tree-Like Graphs -- Forming Plurality at Minimum Cost -- Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs -- Straight-Path Queries in Trajectory Data -- Folding a Paper Strip to Minimize Thickness -- An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments (Extended Abstract) -- PTAS’s for Some Metric p-source Communication Spanning Tree Problems -- Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement -- Enumerating Eulerian Trails via Hamiltonian Path Enumeration -- The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Trees -- An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks -- Dynamic Online Multiselection in Internal and External Memory -- Competitive Analysis for Multi-objective Online Algorithms -- Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends -- An Improved Algorithm for Parameterized Edge Dominating Set Problem -- On Bar (1, j)-Visibility Graphs (Extended Abstract) -- Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs -- Non-repetitive Strings over Alphabet Lists -- Dichotomy Theorems for Homomorphism Polynomials of Graph Classes -- Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid -- Threshold Circuits for Global Patterns in 2-Dimensional Maps -- Superset Generation on Decision Diagrams -- On Triangle Cover Contact Graphs -- Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs.

This book constitutes the thoroughly refereed conference proceedings of the 9th International Workshop on Algorithms and Computation, WALCOM 2015, held in Dhaka, Bangladesh, in February 2015. The 26 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 85 submissions. The papers are organized in topical sections on approximation algorithms, data structures and algorithms, computational geometry, combinatorial algorithms, distributed and online algorithms, graph drawing and algorithms, combinatorial problems and complexity, and graph enumeration and algorithms.

ISBN: 9783319156125

Standard No.: 10.1007/978-3-319-15612-5doiSubjects--Topical Terms:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

WALCOM: Algorithms and Computation = 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015, Proceedings /
LDR:04020nam a22004095i 4500 001 969251
003 DE-He213
005 20200703133333.0
007 cr nn 008mamaa
008 201211s2015 gw | s |||| 0|eng d
020 $a 9783319156125 $9 978-3-319-15612-5
024 7 $a 10.1007/978-3-319-15612-5 $2 doi
035 $a 978-3-319-15612-5
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
245 1 0 $a WALCOM: Algorithms and Computation $h [electronic resource] : $b 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015, Proceedings / $c edited by M. Sohel Rahman, Etsuji Tomita.
250 $a 1st ed. 2015.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a XXIV, 336 p. 110 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 8973
505 0 $a Encoding Data Structures -- Fast Algorithms for Constrained Graph Density Problems -- The Directed Ring Loading with Penalty Cost -- Edge-Colorings of Weighted Graphs (Extended Abstract) -- Unit Covering in Color-Spanning Set Model -- Compact Encodings and Indexes for the Nearest Larger Neighbor Problem -- A Practical Succinct Data Structure for Tree-Like Graphs -- Forming Plurality at Minimum Cost -- Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs -- Straight-Path Queries in Trajectory Data -- Folding a Paper Strip to Minimize Thickness -- An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments (Extended Abstract) -- PTAS’s for Some Metric p-source Communication Spanning Tree Problems -- Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement -- Enumerating Eulerian Trails via Hamiltonian Path Enumeration -- The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Trees -- An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks -- Dynamic Online Multiselection in Internal and External Memory -- Competitive Analysis for Multi-objective Online Algorithms -- Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends -- An Improved Algorithm for Parameterized Edge Dominating Set Problem -- On Bar (1, j)-Visibility Graphs (Extended Abstract) -- Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs -- Non-repetitive Strings over Alphabet Lists -- Dichotomy Theorems for Homomorphism Polynomials of Graph Classes -- Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid -- Threshold Circuits for Global Patterns in 2-Dimensional Maps -- Superset Generation on Decision Diagrams -- On Triangle Cover Contact Graphs -- Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs.
520 $a This book constitutes the thoroughly refereed conference proceedings of the 9th International Workshop on Algorithms and Computation, WALCOM 2015, held in Dhaka, Bangladesh, in February 2015. The 26 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 85 submissions. The papers are organized in topical sections on approximation algorithms, data structures and algorithms, computational geometry, combinatorial algorithms, distributed and online algorithms, graph drawing and algorithms, combinatorial problems and complexity, and graph enumeration and algorithms.
650 0 $a Algorithms. $3 527865
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Computer graphics. $3 561602
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Math Applications in Computer Science. $3 669887
650 2 4 $a Symbolic and Algebraic Manipulation. $3 669944
650 2 4 $a Computer Graphics. $3 669895
700 1 $a Rahman, M. Sohel. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1066355
700 1 $a Tomita, Etsuji. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1066356
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319156132
776 0 8 $i Printed edition: $z 9783319156118
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-319-15612-5
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)