LEADER 00880nam a2200241 i 4500 001 991000894599707536 005 20020502180653.0 008 940421s1984 it ||| | ita 035 $ab1143319x-39ule_inst 035 $aPRUMB51042$9ExL 040 $aDip. di SSSC - Teatro$bita 100 1 $aMiquel, André$0386588 245 12$aL'Abrégé des merveilles /$ctraduit de l'arabe et annoté par Carra de Vaux ; préface d'André Miquel 260 $aParis :$bSindbad,$c1984 300 $a373 p ;$c23 cm. 440 3$aLa Bibliothéque arabe 700 1 $aVaux, Carra de 907 $a.b1143319x$b02-04-14$c01-07-02 912 $a991000894599707536 945 $aLE021 TO12B13$g1$iLE021N-10033$lle021$o-$pE0.00$q-$rl$s- $t0$u0$v0$w0$x0$y.i11617469$z01-07-02 996 $aAbrégé des merveilles$9818637 997 $aUNISALENTO 998 $ale021$b01-01-94$cm$da $e-$fita$git $h2$i1 LEADER 06061nam 22007815 450 001 9910484324703321 005 20251226200115.0 010 $a3-642-11269-2 024 7 $a10.1007/978-3-642-11269-0 035 $a(CKB)1000000000812689 035 $a(SSID)ssj0000355582 035 $a(PQKBManifestationID)11256494 035 $a(PQKBTitleCode)TC0000355582 035 $a(PQKBWorkID)10320801 035 $a(PQKB)11124403 035 $a(DE-He213)978-3-642-11269-0 035 $a(MiAaPQ)EBC3064904 035 $a(PPN)139963073 035 $a(BIP)28224792 035 $a(EXLCZ)991000000000812689 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aParameterized and Exact Computation $e4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers /$fedited by Jianer Chen, Fedor V. Fomin 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (X, 335 p. 26 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5917 300 $aIncludes index. 311 08$a3-642-11268-4 327 $aBalanced Hashing, Color Coding and Approximate Counting -- Kernelization: New Upper and Lower Bound Techniques -- A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams -- Planar Capacitated Dominating Set Is W[1]-Hard -- Boolean-Width of Graphs -- The Complexity of Satisfiability of Small Depth Circuits -- On Finding Directed Trees with Many Leaves -- Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms -- Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover -- What Makes Equitable Connected Partition Easy -- Improved Induced Matchings in Sparse Graphs -- Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs -- An Exact Algorithm for the Maximum Leaf Spanning Tree Problem -- An Exponential Time 2-Approximation Algorithm for Bandwidth -- On Digraph Width Measures in Parameterized Algorithmics -- The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension -- Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms -- Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs -- A Probabilistic Approach to Problems Parameterized above or below Tight Bounds -- Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor -- Partitioning into Sets of Bounded Cardinality -- Two Edge Modification Problems without Polynomial Kernels -- On the Directed Degree-Preserving Spanning Tree Problem -- Even Faster Algorithm for Set Splitting! -- Stable Assignment with Couples: Parameterized Complexity and Local Search -- Improved Parameterized Algorithms for the Kemeny Aggregation Problem -- Computing Pathwidth Faster Than 2 n . 330 $aThe Workshop on Parameterized and Exact Computation (IWPEC) is an - ternational workshop series that covers research in all aspects of parameterized and exact algorithms and complexity, and especially encourages the study of parameterized and exact computations for real-world applications and algori- mic engineering. The goal of the workshop is to present recent research results, including signi'cant work-in-progress,and to identify and explore directions for future research. IWPEC2009wasthefourthworkshopintheseries,heldinCopenhagen,D- mark, during September 10-11, 2009. The workshop was part of ALGO 2009, which also hosted the 17th European Symposium on Algorithms (ESA 2009), the 9th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2009), and the 7th Workshop on Appr- imation and Online Algorithms (WAOA 2009). Three previous meetings of the IWPEC series were held in Bergen, Norway, 2004, Zu ¨rich, Switzerland, 2006, and Victoria, Canada, 2008. At IWPEC 2009, we had two plenary speakers,Noga Alon (Tel Aviv Univ- sity, Israel) and Hans Bodlaender (Utrecht University, The Netherlands), giving 50-minutetalkseach.ProfessorAlonspokeon"ColorCoding,BalancedHashing andApproximateCounting," andProfessorBodlaenderon"Kernelization:New Upper and Lower Bound Techniques." Their respective abstracts accompanying the talks are included in these proceedings. InresponsetotheCallforPapers,52papersweresubmitted.Eachsubmission was reviewed by at least three reviewers (most by at least four). The reviewers were either Program Committee members or invited external reviewers. The ProgramCommittee held electronic meetings using the EasyChair system, went throughthoroughdiscussions,andselected25ofthesubmissionsforpresentation at the workshop and inclusion in this LNCS volume. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5917 606 $aComputer programming 606 $aDiscrete mathematics 606 $aComputer science$xMathematics 606 $aAlgorithms 606 $aProgramming Techniques 606 $aDiscrete Mathematics 606 $aMathematics of Computing 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 615 0$aComputer programming. 615 0$aDiscrete mathematics. 615 0$aComputer science$xMathematics. 615 0$aAlgorithms. 615 14$aProgramming Techniques. 615 24$aDiscrete Mathematics. 615 24$aMathematics of Computing. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 676 $a519.544 686 $a004$2sdnb 686 $aDAT 517f$2stub 686 $aSS 4800$2rvk 701 $aChen$b Jianer$01750514 701 $aFomin$b Fedor V$01750515 712 12$aIWPEC 2009 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484324703321 996 $aParameterized and exact computation$94185159 997 $aUNINA