LEADER 02459nam 2200613 450 001 9910824628803321 005 20230808212130.0 010 $a0-19-022078-3 010 $a0-19-992825-8 035 $a(CKB)3710000000478169 035 $a(EBL)4083567 035 $a(SSID)ssj0001554687 035 $a(PQKBManifestationID)16181923 035 $a(PQKBTitleCode)TC0001554687 035 $a(PQKBWorkID)13739892 035 $a(PQKB)10256295 035 $a(MiAaPQ)EBC4083567 035 $a(Au-PeEL)EBL4083567 035 $a(CaPaEBR)ebr11118579 035 $a(CaONFJC)MIL834642 035 $a(OCoLC)936292103 035 $a(EXLCZ)993710000000478169 100 $a20150604h20162016 uy| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aAngels of the underground $ethe American women who resisted the Japanese in the Philippines in World War II /$fTheresa Kaminski 210 1$aNew York :$cOxford University Press,$d[2016] 210 4$d©2016 215 $a1 online resource (513 p.) 300 $aDescription based upon print version of record. 311 $a0-19-992824-X 320 $aIncludes bibliographical references and index. 327 $aThe colonial Philippines -- The four women -- Manila on the edge -- The Japanese attack -- The Japanese occupation of Manila -- Bataan -- "Is the war over?" -- Organizing relief and resistance in Manila -- Cabanatuan -- Guerrillas in the midst of the occupation -- The Manila underground -- Betrayal -- The unraveling [or "The fat is in the fire"] -- The war returns -- Bloodletting and liberation -- Freedom -- Resolution. 606 $aWorld War, 1939-1945$xUnderground movements$zPhilippines 606 $aWorld War, 1939-1945$xParticipation, Female 606 $aWomen guerrillas$zPhilippines$xHistory$y20th century 606 $aAmericans$zPhilippines$xHistory$y20th century 607 $aPhilippines$xHistory$yJapanese occupation, 1942-1945 615 0$aWorld War, 1939-1945$xUnderground movements 615 0$aWorld War, 1939-1945$xParticipation, Female. 615 0$aWomen guerrillas$xHistory 615 0$aAmericans$xHistory 676 $a940.53/599082 700 $aKaminski$b Theresa$f1958-$01637956 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910824628803321 996 $aAngels of the underground$93980062 997 $aUNINA LEADER 01000nam a2200265 4500 001 991003642289707536 005 20250722145747.0 008 190426s2017 it 000 0 ita d 020 $a9788812006199 035 $ab14364876-39ule_inst 040 $aBibl. Interfacoltà T. Pellegrino$bita 082 04$a759.5 100 1 $aCaravaggio$c$035916 245 00$aCaravaggio 260 $aRoma :$bIstituto della Enciclopedia italiana,$c2017 300 $a425 p., [6] carte di tav. :$bill. ;$c31 cm 490 1 $aClassici Treccani. Pittura italiana. I grandi maestri del colore 650 4$aCaravaggio, Michelangelo Merisi :$bda 700 1 $aCaravaggio $035916 907 $a.b14364876$b26-04-19$c26-04-19 912 $a991003642289707536 945 $aLE002 Op. Preg. 66$g1$i2002001094482$lle002$o-$pE300.00$q-$rn$so$t0$u0$v0$w0$x0$y.i15887625$z26-04-19 996 $aCaravaggio$9293191 997 $aUNISALENTO 998 $ale002$b26-04-19$cm$da$fita$git$h0$i0 LEADER 08022nam 22008415 450 001 9910484703803321 005 20251226195859.0 010 $a3-540-73545-3 024 7 $a10.1007/978-3-540-73545-8 035 $a(CKB)1000000000490449 035 $a(SSID)ssj0000316940 035 $a(PQKBManifestationID)11251768 035 $a(PQKBTitleCode)TC0000316940 035 $a(PQKBWorkID)10288011 035 $a(PQKB)11077897 035 $a(DE-He213)978-3-540-73545-8 035 $a(MiAaPQ)EBC3063217 035 $a(MiAaPQ)EBC6709298 035 $a(Au-PeEL)EBL6709298 035 $a(PPN)123163625 035 $a(EXLCZ)991000000000490449 100 $a20100301d2007 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputing and Combinatorics $e13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings /$fedited by Guohui Lin 205 $a1st ed. 2007. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007. 215 $a1 online resource (XII, 572 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4598 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-73544-5 320 $aIncludes bibliographical references and index. 327 $aThe Combinatorics of Sequencing the Corn Genome -- Online Frequency Assignment in Wireless Communication Networks -- Information Distance from a Question to an Answer -- A New Field Splitting Algorithm for Intensity-Modulated Radiation Therapy -- A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem -- Seed-Based Exclusion Method for Non-coding RNA Gene Search -- A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining Method -- Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data -- Improved Exact Algorithms for Counting 3- and 4-Colorings -- Connected Coloring Completion for General Graphs: Algorithms and Complexity -- Quadratic Kernelization for Convex Recoloring of Trees -- On the Number of Cycles in Planar Graphs -- An Improved Exact Algorithm for Cubic Graph TSP -- Geometric Intersection Graphs: Do Short Cycles Help? -- Dimension, Halfspaces, and the Density of Hard Sets -- Isolation Concepts for Enumerating Dense Subgraphs -- Alignments with Non-overlapping Moves, Inversions and Tandem Duplications in O(n 4) Time -- Counting Minimum Weighted Dominating Sets -- Online Interval Scheduling: Randomized and Multiprocessor Cases -- Scheduling Selfish Tasks: About the Performance of Truthful Algorithms -- Volume Computation Using a Direct Monte Carlo Method -- Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks -- Generating Minimal k-Vertex Connected Spanning Subgraphs -- Finding Many Optimal Paths Without Growing Any Optimal Path Trees -- Enumerating Constrained Non-crossing Geometric Spanning Trees -- Colored Simultaneous Geometric Embeddings -- Properties of Symmetric Incentive Compatible Auctions -- Finding Equilibria in Games of No Chance -- Efficient Testing of Forecasts -- When Does Greedy Learning of Relevant Attributes Succeed? -- The Informational Content of Canonical Disjoint NP-Pairs -- On the Representations of NC and Log-Space Real Numbers -- Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals -- Streaming Algorithms Measured in Terms of the Computed Quantity -- A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem -- Optimal Offline Extraction of Irredundant Motif Bases -- Linear Algorithm for Broadcasting in Unicyclic Graphs -- An Improved Algorithm for Online Unit Clustering -- Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs -- Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions -- On the Hardness of Optimization in Power Law Graphs -- Can a Graph Have Distinct Regular Partitions? -- Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games -- Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates -- On the Complexity of Finding an Unknown Cut Via Vertex Queries -- ?Resistant? Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas -- An Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity -- Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats -- Priority Algorithms for the Subset-Sum Problem -- Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families -- A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs -- Improved Algorithms for Weighted and Unweighted Set Splitting Problems -- An -Approximation Algorithm for a Hard Variant of Stable Marriage -- Approximation Algorithmsfor the Black and White Traveling Salesman Problem. 330 $aThe Annual International Computing and Combinatorics Conference is an annual forum for exploring research, development, and novel applications of computing and combinatorics. It brings together researchers, professionals and industrial practitioners to interact and exchange knowledge, ideas and progress. Thetopics covermost aspects oftheoreticalcomputer scienceand combinatorics related to computing. The 13th Annual International Computing and Com- natorics Conference (COCOON 2007) was held in Ban?, Alberta during July 16?19, 2007. This was the ?rst time that COCOON was held in Canada. We received 165 submissions, among which 11 were withdrawn for various reasons. The remaining 154 submissions under full consideration came from 33 countries and regions: Australia, Brazil, Canada, China, the Czech Republic, Denmark, Finland, France, Germany, Greece, Hong Kong, India, Iran, Ireland, Israel, Italy, Japan, the Netherlands, Norway, Pakistan, Poland, Romania, R- sia, Slovakia, South Korea, Spain, Sweden, Switzerland, Taiwan, Turkey, the UK, the USA, and the US minor outlying islands. Afterasixweekperiodofcarefulreviewinganddiscussions,theprogramc- mittee accepted 51 submissions for oral presentation at the conference. Based on the a?liations, 1. 08 of the accepted papers were from Australia, 7. 67 from Canada, 3. 08 from China, 1 from the Czech Republic, 2 from Denmark, 1 from France, 5. 42 from Germany, 0. 08 from Greece, 2. 18 from Hong Kong, 0. 33 from India, 0. 17 from Ireland, 1. 83 from Israel, 1. 5fromItaly,2. 9 from Japan, 0. 17 from the Netherlands, 2. 67 from Norway, 0. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4598 606 $aComputer science 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aComputer networks 606 $aArtificial intelligence$xData processing 606 $aComputer graphics 606 $aTheory of Computation 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Communication Networks 606 $aData Science 606 $aComputer Graphics 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aComputer networks. 615 0$aArtificial intelligence$xData processing. 615 0$aComputer graphics. 615 14$aTheory of Computation. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Communication Networks. 615 24$aData Science. 615 24$aComputer Graphics. 676 $a004 702 $aLin$b Guohui 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484703803321 996 $aComputing and Combinatorics$9772278 997 $aUNINA