06203nam 22007335 450 99646604830331620230330005935.03-642-33293-510.1007/978-3-642-33293-7(CKB)3390000000030231(SSID)ssj0000746083(PQKBManifestationID)11410454(PQKBTitleCode)TC0000746083(PQKBWorkID)10860442(PQKB)11492431(DE-He213)978-3-642-33293-7(MiAaPQ)EBC3070176(PPN)168324059(EXLCZ)99339000000003023120120829d2012 u| 0engurnn#008mamaatxtccrParameterized and Exact Computation[electronic resource] 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings /edited by Dimitrios M. Thilikos, Gerhard J. Woeginger1st ed. 2012.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2012.1 online resource (X, 275 p. 14 illus.)Theoretical Computer Science and General Issues,2512-2029 ;7535Bibliographic Level Mode of Issuance: Monograph3-642-33292-7 The Path Taken for k-Path /Andreas Björklund --Randomized Techniques for Parameterized Algorithms /Dániel Marx --Finding a Maximum Induced Degenerate Subgraph Faster Than 2n /Marcin Pilipczuk and Michał Pilipczuk --The Exponential Time Hypothesis and the Parameterized Clique Problem /Yijia Chen, Kord Eickmeyer and Jörg Flum --New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set /Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos and Mingyu Xiao --A New Algorithm for Parameterized MAX-SAT /Ivan Bliznets and Alexander Golovnev --Restricted and Swap Common Superstring: A Parameterized View /Paola Bonizzoni, Riccardo Dondi, Giancarlo Mauri and Italo Zoppis --Nonblocker in H-Minor Free Graphs: Kernelization Meets Discharging /Łukasz Kowalik --Some Definitorial Suggestions for Parameterized Proof Complexity /Jörg Flum and Moritz Müller --An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs /Petr A. Golovach, Pinar Heggernes, Dieter Kratsch and Reza Saei --Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? /Fedor V. Fomin, Bart M. P. Jansen and Michał Pilipczuk --A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs /Cédric Bentz --Instance Compression for the Polynomial Hierarchy and beyond /Chiranjit Chakraborty and Rahul Santhanam --Polynomial Time and Parameterized Approximation Algorithms for Boxicity /Abhijin Adiga, Jasine Babu and L. Sunil Chandran --Homomorphic Hashing for Sparse Coefficient Extraction /Petteri Kaski, Mikko Koivisto and Jesper Nederlof --Fast Monotone Summation over Disjoint Sets /Petteri Kaski, Mikko Koivisto and Janne H. Korhonen --Weighted Counting of k-Matchings Is #W[1]-Hard /Markus Bläser and Radu Curticapean --Computing Directed Pathwidth in O(1.89n) Time /Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki and Toshihiro Tano --MSOL Restricted Contractibility to Planar Graphs /James Abello, Pavel Klavík, Jan Kratochvíl and Tomáš Vyskočil --On the Space Complexity of Parameterized Problems /Michael Elberfeld, Christoph Stockhusen and Till Tantau --On Tractable Parameterizations of Graph Isomorphism /Adam Bouland, Anuj Dawar and Eryk Kopczyński --Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs /Sepp Hartung, Christian Komusiewicz and André Nichterlein --Finding Dense Subgraphs of Sparse Graphs /Christian Komusiewicz and Manuel Sorge --Enumerating Neighbour and Closest Strings /Naomi Nishimura and Narges Simjour --An Improved Kernel for the Undirected Planar Feedback Vertex Set Problem /Faisal N. Abu-Khzam and Mazen Bou Khuzam.This 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.Theoretical Computer Science and General Issues,2512-2029 ;7535AlgorithmsNumerical analysisComputer science—MathematicsDiscrete mathematicsArtificial intelligence—Data processingAlgorithmsNumerical AnalysisDiscrete Mathematics in Computer ScienceData ScienceMathematical Applications in Computer ScienceAlgorithms.Numerical analysis.Computer science—Mathematics.Discrete mathematics.Artificial intelligence—Data processing.Algorithms.Numerical Analysis.Discrete Mathematics in Computer Science.Data Science.Mathematical Applications in Computer Science.519.5/44Thilikos Dimitrios Medthttp://id.loc.gov/vocabulary/relators/edtWoeginger Gerhard Jedthttp://id.loc.gov/vocabulary/relators/edtIPEC (Symposium)BOOK996466048303316Parameterized and Exact Computation772030UNISA01841nam0 22003613i 450 MIL000807720240906062958.0IT83-176 19880310d1982 ||||0itac50 baitaitaitz01i xxxe z01nStoria economica d'Italia nel secolo 19.(1815-1882)Mario Romania cura di Sergio ZaninelliBolognaIl mulino[1982]502 p.22 cmCollezione di testi e di studi. StoriografiaInclude appendice statistica.Tit. in cop. e sul dorso: Storia economica dell'Italia nel secolo 19.CFI0398668001CFI00041402001 Collezione di testi e di studi. StoriografiaStoria economica d'Italia nel secolo 19.PAL0315195CFIV01834864404Storia economica dell'Italia nel secolo 19.CFI0398668ITALIAEconomiaStoria1815-1882FIRNAPC134060I330.945SITUAZIONI E CONDIZIONI ECONOMICHE. ITALIA23Romani, MarioCFIV01834807068073Zaninelli, SergioCFIV009040ITIT-NA007919880310IT-BN0095 IT-SA0060 IT-NA0079 IT-NA0452 IT-NA0095 MIL0008077Biblioteca Centralizzata di Ateneo1 v. in 2 copie 01POZZO LIB.ECON MON 6584 0101 0070078005 B (bis 1 v. (2. copia. Precedente collocazione 7 Ec 800)T 20220715202207151 v. in 2 copie 01POZZO LIB.ECON MON 6584 0101 0000088195 B 1 v.A 2007091120070911 01 27 BN IS SBStoria economica d'Italia nel secolo 1964404UNISANNIO