000			05148nam a22006375i 4500
001			978-3-642-00202-1
003			DE-He213
005			20240423125744.0
007			cr nn 008mamaa
008			100301s2009 gw | s |||| 0|eng d
020			_a9783642002021 _9978-3-642-00202-1
024	7		_a10.1007/978-3-642-00202-1 _2doi
050		4	_aQA76.9.A43
072		7	_aUMB _2bicssc
072		7	_aCOM051300 _2bisacsh
072		7	_aUMB _2thema
082	0	4	_a518.1 _223
245	1	0	_aWALCOM: Algorithms and Computation _h[electronic resource] : _bThird International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009, Proceedings / _cedited by Sandip Das, Ryuhei Uehara.
250			_a1st ed. 2009.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2009.
300			_aXIII, 408 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v5431
505	0		_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.
520			_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.
650		0	_aAlgorithms.
650		0	_aComputer science _xMathematics.
650		0	_aDiscrete mathematics.
650		0	_aNumerical analysis.
650		0	_aComputer networks .
650		0	_aComputer graphics.
650		0	_aBioinformatics.
650	1	4	_aAlgorithms.
650	2	4	_aDiscrete Mathematics in Computer Science.
650	2	4	_aNumerical Analysis.
650	2	4	_aComputer Communication Networks.
650	2	4	_aComputer Graphics.
650	2	4	_aComputational and Systems Biology.
700	1		_aDas, Sandip. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
700	1		_aUehara, Ryuhei. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
710	2		_aSpringerLink (Online service)
773	0		_tSpringer Nature eBook
776	0	8	_iPrinted edition: _z9783642002014
776	0	8	_iPrinted edition: _z9783642002038
830		0	_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v5431
856	4	0	_uhttps://doi.org/10.1007/978-3-642-00202-1
912			_aZDB-2-SCS
912			_aZDB-2-SXCS
912			_aZDB-2-LNC
942			_cSPRINGER
999			_c181376 _d181376