000 03682nam a22005655i 4500
001 978-3-642-17493-3
003 DE-He213
005 20240730182335.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
072 7 _aUMB
_2thema
082 0 4 _a518.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.
250 _a1st ed. 2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2010.
300 _aX, 239 p. 18 illus.
_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 ;
_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 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aComputer science.
_99832
650 1 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aTheory of Computation.
_9127886
650 2 4 _aSymbolic and Algebraic Manipulation.
_955589
700 1 _aRaman, Venkatesh.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9127887
700 1 _aSaurabh, Saket.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9127888
710 2 _aSpringerLink (Online service)
_9127889
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642174926
776 0 8 _iPrinted edition:
_z9783642174940
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v6478
_9127890
856 4 0 _uhttps://doi.org/10.1007/978-3-642-17493-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c91320
_d91320