LEADER 06203nam 22007335 450 001 996466048303316 005 20230330005935.0 010 $a3-642-33293-5 024 7 $a10.1007/978-3-642-33293-7 035 $a(CKB)3390000000030231 035 $a(SSID)ssj0000746083 035 $a(PQKBManifestationID)11410454 035 $a(PQKBTitleCode)TC0000746083 035 $a(PQKBWorkID)10860442 035 $a(PQKB)11492431 035 $a(DE-He213)978-3-642-33293-7 035 $a(MiAaPQ)EBC3070176 035 $a(PPN)168324059 035 $a(EXLCZ)993390000000030231 100 $a20120829d2012 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aParameterized and Exact Computation$b[electronic resource] $e7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings /$fedited by Dimitrios M. Thilikos, Gerhard J. Woeginger 205 $a1st ed. 2012. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2012. 215 $a1 online resource (X, 275 p. 14 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7535 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-33292-7 327 $tThe Path Taken for k-Path /$rAndreas Bjo?rklund --$tRandomized Techniques for Parameterized Algorithms /$rDa?niel Marx --$tFinding a Maximum Induced Degenerate Subgraph Faster Than 2n /$rMarcin Pilipczuk and Micha? Pilipczuk --$tThe Exponential Time Hypothesis and the Parameterized Clique Problem /$rYijia Chen, Kord Eickmeyer and Jo?rg Flum --$tNew Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set /$rBruno Escoffier, Je?ro?me Monnot, Vangelis Th. Paschos and Mingyu Xiao --$tA New Algorithm for Parameterized MAX-SAT /$rIvan Bliznets and Alexander Golovnev --$tRestricted and Swap Common Superstring: A Parameterized View /$rPaola Bonizzoni, Riccardo Dondi, Giancarlo Mauri and Italo Zoppis --$tNonblocker in H-Minor Free Graphs: Kernelization Meets Discharging /$r?ukasz Kowalik --$tSome Definitorial Suggestions for Parameterized Proof Complexity /$rJo?rg Flum and Moritz Mu?ller --$tAn Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs /$rPetr A. Golovach, Pinar Heggernes, Dieter Kratsch and Reza Saei --$tPreprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? /$rFedor V. Fomin, Bart M. P. Jansen and Micha? Pilipczuk --$tA Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs /$rCe?dric Bentz -- 327 $tInstance Compression for the Polynomial Hierarchy and beyond /$rChiranjit Chakraborty and Rahul Santhanam --$tPolynomial Time and Parameterized Approximation Algorithms for Boxicity /$rAbhijin Adiga, Jasine Babu and L. Sunil Chandran --$tHomomorphic Hashing for Sparse Coefficient Extraction /$rPetteri Kaski, Mikko Koivisto and Jesper Nederlof --$tFast Monotone Summation over Disjoint Sets /$rPetteri Kaski, Mikko Koivisto and Janne H. Korhonen --$tWeighted Counting of k-Matchings Is #W[1]-Hard /$rMarkus Bla?ser and Radu Curticapean --$tComputing Directed Pathwidth in O(1.89n) Time /$rKenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki and Toshihiro Tano --$tMSOL Restricted Contractibility to Planar Graphs /$rJames Abello, Pavel Klavi?k, Jan Kratochvi?l and Toma?s? Vyskoc?il --$tOn the Space Complexity of Parameterized Problems /$rMichael Elberfeld, Christoph Stockhusen and Till Tantau --$tOn Tractable Parameterizations of Graph Isomorphism /$rAdam Bouland, Anuj Dawar and Eryk Kopczyn?ski --$tParameterized Algorithmics and Computational Experiments for Finding 2-Clubs /$rSepp Hartung, Christian Komusiewicz and Andre? Nichterlein --$tFinding Dense Subgraphs of Sparse Graphs /$rChristian Komusiewicz and Manuel Sorge --$tEnumerating Neighbour and Closest Strings /$rNaomi Nishimura and Narges Simjour --$tAn Improved Kernel for the Undirected Planar Feedback Vertex Set Problem /$rFaisal N. Abu-Khzam and Mazen Bou Khuzam. 330 $aThis book constitutes the refereed proceedings of the 7th International Symposium on Parameterized and Exact Computation, IPEC 2012, in Ljubljana, Slovenia, in September 2012. The 21 revised full papers presented together with 2 keynote talks were carefully reviewed and selected from 37 submissions. The topics addressed cover research in all aspects of parameterized/exact algorithms and complexity including but are not limited to new techniques for the design and analysis of parameterized and exact algorithms; fixed-parameter tractability results; parameterized complexity theory; relationship between parameterized complexity and traditional complexity classifications; applications of parameterized and exact computation; and implementation issues of parameterized and exact algorithms. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7535 606 $aAlgorithms 606 $aNumerical analysis 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence?Data processing 606 $aAlgorithms 606 $aNumerical Analysis 606 $aDiscrete Mathematics in Computer Science 606 $aData Science 606 $aMathematical Applications in Computer Science 615 0$aAlgorithms. 615 0$aNumerical analysis. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence?Data processing. 615 14$aAlgorithms. 615 24$aNumerical Analysis. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Science. 615 24$aMathematical Applications in Computer Science. 676 $a519.5/44 702 $aThilikos$b Dimitrios M$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aWoeginger$b Gerhard J$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aIPEC (Symposium) 906 $aBOOK 912 $a996466048303316 996 $aParameterized and Exact Computation$9772030 997 $aUNISA