000			05432nam a22006135i 4500
001			978-3-642-10217-2
003			DE-He213
005			20160624102138.0
007			cr nn 008mamaa
008			100301s2009 gw | s |||| 0|eng d
020			_a9783642102172 _9978-3-642-10217-2
024	7		_a10.1007/978-3-642-10217-2 _2doi
050		4	_aQA76.9.M35
072		7	_aPBD _2bicssc
072		7	_aUYAM _2bicssc
072		7	_aCOM018000 _2bisacsh
072		7	_aMAT008000 _2bisacsh
082	0	4	_a004.0151 _223
245	1	0	_aCombinatorial Algorithms _h[electronic resource] : _b20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28–July 2, 2009, Revised Selected Papers / _cedited by Jiří Fiala, Jan Kratochvíl, Mirka Miller.
260		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2009.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2009.
300			_aXII, 480 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aLecture Notes in Computer Science, _x0302-9743 ; _v5874
505	0		_aInvited Talks -- Branching Systems -- Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology -- Succinct Representations of Trees -- Kt Minors in Large t-Connected Graphs -- Intractability in Graph Drawing and Geometry: FPT Approaches -- Contributed Talks -- Evaluation of Recoverable-Robust Timetables on Tree Networks -- Weighted LCS -- Integrality Properties of Certain Special Balanceable Families -- Forbidden Subgraph Colorings and the Oriented Chromatic Number -- Polynomial Kernels for 3-Leaf Power Graph Modification Problems -- Approximating the Max Edge-Coloring Problem -- Three Complexity Results on Coloring P k -Free Graphs -- Fully Decomposable Split Graphs -- Feedback Vertex Set on Graphs of Low Cliquewidth -- Note on Decomposition of K n,n into (0,j)-prisms -- Edge-Simple Circuits through 10 Ordered Vertices in Square Grids -- Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search -- LPF Computation Revisited -- Limiting Distribution for Distances in k-Trees -- Gray Code Compression -- Embedded Trees and the Support of the ISE -- Combinatorial Models for Cooperation Networks -- Polar Permutation Graphs -- A New Algorithm for Efficient Pattern Matching with Swaps -- The Height and Range of Watermelons without Wall -- Fast Convolutions and Their Applications in Approximate String Matching -- Better Polynomial Algorithms on Graphs of Bounded Rank-Width -- Minimax Trees in Linear Time with Applications -- Planar Biconnectivity Augmentation with Fixed Embedding -- Trivially-Perfect Width -- Lightweight Parameterized Suffix Array Construction -- On the Crossing Numbers of Cartesian Products of Stars and Graphs on Five Vertices -- Factorizations of Complete Graphs into Spanning Trees with All Possible Maximum Degrees -- On the Maximal Number of Cubic Subwords in a String -- Solution of Peter Winkler’s Pizza Problem -- An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs -- Simpler Parameterized Algorithm for OCT -- Bipartite Graphs of Large Clique-Width -- Kernel in Oriented Circulant Graphs -- Randomized Postoptimization of Covering Arrays -- New Word-Based Adaptive Dense Compressors -- Rainbow Connection in Graphs with Minimum Degree Three -- The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree -- Computability of Width of Submodular Partition Functions -- The Guarding Problem – Complexity and Approximation -- Antibandwidth of d-Dimensional Meshes.
520			_aThis book constitutes the revised selected papers of the 20th International Workshop on Combinatorial Algorithms, held in June/July 2009 in the castle of Hradec nad Moravicí, Czech Republic. The 41 papers included in this volume together with 5 invited papers were carefully reviewed and selected from over 100 submissions. The topics dealt with are algorithms and data structures, applications, combinatorial enumeration, combinatorial optimization, complexity theory, computational biology, databases, decompositions and combinatorial designs, discrete and computational geometry, including graph drawing, and graph theory and combinatorics.
650		0	_aComputer science.
650		0	_aCoding theory.
650		0	_aComputer software.
650		0	_aComputational complexity.
650		0	_aAlgebra _xData processing.
650		0	_aCombinatorics.
650	1	4	_aComputer Science.
650	2	4	_aDiscrete Mathematics in Computer Science.
650	2	4	_aCombinatorics.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aMathematical Logic and Formal Languages.
650	2	4	_aCoding and Information Theory.
650	2	4	_aSymbolic and Algebraic Manipulation.
700	1		_aFiala, Jiří. _eeditor.
700	1		_aKratochvíl, Jan. _eeditor.
700	1		_aMiller, Mirka. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642102165
786			_dSpringer
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v5874
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-642-10217-2
942			_2EBK8851 _cEBK
999			_c38145 _d38145