000 03505nam a22005655i 4500
001 978-3-642-17493-3
003 DE-He213
005 20160624102152.0
007 cr nn 008mamaa
008 101203s2010 gw | s |||| 0|eng d
020 _a9783642174933
_9978-3-642-17493-3
024 7 _a10.1007/978-3-642-17493-3
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aParameterized and Exact Computation
_h[electronic resource] :
_b5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings /
_cedited by Venkatesh Raman, Saket Saurabh.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _aX, 239p.
_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 ;
_v6478
505 0 _aThe Complexity of Satisfaction on Sparse Graphs -- Protrusions in Graphs and Their Applications -- Parameterized Complexity Results in Symmetry Breaking -- On the Kernelization Complexity of Colorful Motifs -- Partial Kernelization for Rank Aggregation: Theory and Experiments -- Enumerate and Measure: Improving Parameter Budget Management -- On the Exact Complexity of Evaluating Quantified k-CNF -- Cluster Editing: Kernelization Based on Edge Cuts -- Computing the Deficiency of Housing Markets with Duplicate Houses -- A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application -- An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion -- Multivariate Complexity Analysis of Swap Bribery -- Parameterizing by the Number of Numbers -- Are There Any Good Digraph Width Measures? -- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems -- Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming -- On the Grundy Number of a Graph -- Exponential Time Complexity of Weighted Counting of Independent Sets -- The Exponential Time Complexity of Computing the Probability That a Graph Is Connected -- Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting -- Small Vertex Cover Makes Petri Net Coverability and Boundedness Easier -- Proper Interval Vertex Deletion.
650 0 _aComputer science.
650 0 _aInformation theory.
650 0 _aComputer software.
650 0 _aComputational complexity.
650 0 _aAlgebra
_xData processing.
650 0 _aAlgorithms.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aAlgorithms.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aTheory of Computation.
650 2 4 _aSymbolic and Algebraic Manipulation.
650 2 4 _aComputation by Abstract Devices.
700 1 _aRaman, Venkatesh.
_eeditor.
700 1 _aSaurabh, Saket.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642174926
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6478
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-17493-3
942 _2EBK9445
_cEBK
999 _c38739
_d38739