000			01810nam a22005055i 4500
001			978-3-642-25870-1
003			DE-He213
005			20130515022259.0
007			cr nn 008mamaa
008			111129s2011 gw | s |||| 0|eng d
020			_a9783642258701 _9978-3-642-25870-1
024	7		_a10.1007/978-3-642-25870-1 _2doi
050		4	_aQA76.9.M35
072		7	_aPBD _2bicssc
072		7	_aCOM018000 _2bisacsh
082	0	4	_a004.0151 _223
100	1		_aKolman, Petr.
245	1	0	_aGraph-Theoretic Concepts in Computer Science _h[electronic resource] : _b37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers / _cedited by Petr Kolman, Jan Kratochvíl.
260			_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2011.
300			_bdigital.
490	0		_aLecture Notes in Computer Science, _x0302-9743 ; _v6986
650		0	_aComputer science.
650		0	_aComputer Communication Networks.
650		0	_aData structures (Computer science).
650		0	_aComputer software.
650		0	_aComputational complexity.
650		0	_aAlgorithms.
650		0	_aGeometry.
650	1	4	_aComputer Science.
650	2	4	_aDiscrete Mathematics in Computer Science.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aGeometry.
650	2	4	_aAlgorithms.
650	2	4	_aComputer Communication Networks.
650	2	4	_aData Structures.
700	1		_aKratochvíl, Jan.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642258695
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v6986
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-642-25870-1
912			_aZDB-2-SCS
912			_aZDB-2-LNC
999			_c85837 _d85837