LEADER 05657nam 22008295 450 001 996466023903316 005 20230406050713.0 010 $a3-642-00202-1 024 7 $a10.1007/978-3-642-00202-1 035 $a(CKB)1000000000714732 035 $a(SSID)ssj0000320657 035 $a(PQKBManifestationID)11241649 035 $a(PQKBTitleCode)TC0000320657 035 $a(PQKBWorkID)10249365 035 $a(PQKB)10814250 035 $a(DE-He213)978-3-642-00202-1 035 $a(MiAaPQ)EBC3063935 035 $a(PPN)132874784 035 $a(EXLCZ)991000000000714732 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aWALCOM: Algorithms and Computation$b[electronic resource] $eThird International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009, Proceedings /$fedited by Sandip Das, Ryuhei Uehara 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (XIII, 408 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5431 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-00201-3 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- A Separator Theorem for String Graphs and Its Applications -- Foundations of Exact Rounding -- Approximating Shortest Paths in Graphs -- Line Transversals and Pinning Numbers -- Computational Geometry -- Algorithms for Computing Diffuse Reflection Paths in Polygons -- Shortest Gently Descending Paths -- All Farthest Neighbors in the Presence of Highways and Obstacles -- Improved Algorithm for a Widest 1-Corner Corridor -- Maximum Neighbour Voronoi Games -- On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem -- Graph Algorithms -- Colinear Coloring on Graphs -- Recursive Generation of 5-Regular Planar Graphs -- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) -- Generating All Triangulations of Plane Graphs (Extended Abstract) -- Recognition of Unigraphs through Superposition of Graphs (Extended Abstract) -- Random Generation and Enumeration of Proper Interval Graphs -- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs -- Minmax Tree Cover in the Euclidean Space -- Network Design with Weighted Degree Constraints -- Minimum Cuts of Simple Graphs in Almost Always Linear Time -- The Generalized Stable Allocation Problem -- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings -- Core and Conditional Core Path of Specified Length in Special Classes of Graphs -- Complexity -- The Planar k-Means Problem is NP-Hard -- On the Computational Complexity of Monotone Constraint Satisfaction Problems -- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane -- Graph Drawing -- Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract) -- Matched Drawability of Graph Pairs and of Graph Triples -- An Improved Upward Planarity Testing Algorithm and Related Applications -- Spherical-Rectangular Drawings -- Approximation Algorithms -- The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated -- The Minimal Manhattan Network Problem in Three Dimensions -- Randomized Algorithms -- Shape Matching by Random Sampling -- Object Caching for Queries and Updates. 330 $aThis book constitutes the refereed proceedings of the Third International Workshop on Algorithms and Computation, WALCOM 2009, held in Kolkata, India, in February 2009. The 30 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 102 submissions. The papers feature original research in the areas of design and analysis of algorithms, computational geometry, graph drawing and graph algorithms. The papers are organized in topical sections on computational geometry, graph algorithms, complexity, graph drawing, approximation algorithms, and randomized algorithms. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5431 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aComputer networks 606 $aComputer graphics 606 $aBioinformatics 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 606 $aComputer Communication Networks 606 $aComputer Graphics 606 $aComputational and Systems Biology 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 0$aComputer networks. 615 0$aComputer graphics. 615 0$aBioinformatics. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 615 24$aComputer Communication Networks. 615 24$aComputer Graphics. 615 24$aComputational and Systems Biology. 676 $a005.1 686 $aDAT 530f$2stub 686 $aSS 4800$2rvk 702 $aDas$b Sandip$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aUehara$b Ryuhei$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aWALCOM (Workshop) 906 $aBOOK 912 $a996466023903316 996 $aWALCOM: Algorithms and Computation$9774152 997 $aUNISA