02058nam 2200457 a 450 991048094060332120180731044843.083-233-8137-2(CKB)2670000000254143(EBL)3015825(MiAaPQ)EBC3015825(EXLCZ)99267000000025414320120921d2009 uy 0polur|n|---|||||Mie̜dzy sceptycyzmem a zaufaniem[electronic resource] stosunki polsko-niemieckie w dobie przeobrażeń = Zwischen Skepsis und vertrauen : die deutsch-polnischen Beziehungen im Wandel /herausgegeben von, redaktorzy Kamila Mazurek & Thomas MehlhausenKraków Wydawn. Uniwersytetu Jagiellońskiegoc20091 online resource (178 p.)Includes indexes.83-233-2751-3 ""REFLEKSJE NAD PRZYSZÅ?OÅšCIÄ?. Metoda scenariuszowa jako prospektywny instrument analizy""""OBRAZY PRZYSZÅ?OÅšCI SÄ?SIEDZTWA. Scenariusze stosunków polsko-niemieckich w roku 2020""; ""ZWISCHEN SKEPSIS UND VERTRAUEN. Die deutsch-polnischen Beziehungen im Wandel""; ""DANKSAGUNG""; ""ABKÃœRZUNGSVERZEICHNIS""; ""AUTORENVERZEICHNIS""; ""EINLEITUNG""; ""Teil 1. DIE DEUTSCH-POLNISCHEN BEZIEHUNGEN SEIT DEM ZWEITEN WELTKRIEG""; ""DIE BEDEUTUNG HISTORISCHER ERFAHRUNGEN. Der lange Schatten der Volksrepublik Polen auf die deutsch-polnischen Beziehungen""SkepticismPolandSkepticismGermanyTrustPolandTrustGermanyPolandForeign relationsGermanyGermanyForeign relationsPolandElectronic books.SkepticismSkepticismTrustTrustMazurek Kamila992145Mehlhausen Thomas992146MiAaPQMiAaPQMiAaPQBOOK9910480940603321Mie̜dzy sceptycyzmem a zaufaniem2271199UNINA05619nam 22007935 450 991055273040332120240307230703.03-030-96731-X10.1007/978-3-030-96731-4(MiAaPQ)EBC6926800(Au-PeEL)EBL6926800(CKB)21403470000041(DE-He213)978-3-030-96731-4(PPN)26151797X(EXLCZ)992140347000004120220221d2022 u| 0engurcnu||||||||txtrdacontentcrdamediacrrdacarrierWALCOM: Algorithms and Computation 16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022, Proceedings /edited by Petra Mutzel, Md. Saidur Rahman, Slamin1st ed. 2022.Cham :Springer International Publishing :Imprint: Springer,2022.1 online resource (428 pages)Theoretical Computer Science and General Issues,2512-2029 ;13174Print version: Mutzel, Petra WALCOM: Algorithms and Computation Cham : Springer International Publishing AG,c2022 9783030967307 Includes bibliographical references and index.Invited Talks -- Some Problems Related to the Space of Optimal Tree Reconciliations -- From the W-hierarchy to XNLP: Classes of Fixed Parameter Intractability -- Invitation to Combinatorial Reconfiguration -- Combinatorial Reconfiguration -- Reconfiguration of Regular Induced Subgraphs -- Traversability, Reconfiguration, and Reachability in the Gadget Framework -- 1-Complex $ s,t $ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids -- Graph Drawing and Visualization -- Aspect Ratio Universal Rectangular Layouts -- Morphing tree drawings in a small 3D grid -- StreamTable: An Area Proportional Visualization for Tables with Flowing Streams -- Vertex-to-Point Conflict-Free Chromatic Guarding is NP-hard -- The Polygon Burning Problem -- Reverse Shortest Path Problem in Weighted Unit-Disk Graphs -- Computational Complexity -- Happy Set Problem on Subclasses of Co-comparability Graphs -- Finding Geometric Representations of Apex Graphs is NP-Hard -- The Complexity of L(p,q)-Edge-Labelling -- Trains, Games, and Complexity: 0/1/2-Player Motion Planning through Input/Output Gadgets -- Online and Property Testing -- An Optimal Tester for k-Linear -- Machine Learning Advised Ski Rental Problem with a Discount -- Parameterized Complexity -- On the Harmless Set Problem Parameterized by Treewidth -- Isomorphism Testing for T -graphs in FPT -- Parameterized algorithms for Steiner Tree and Dominating Set: bounding the leafage by the vertex leafage -- Parameterized complexity of reconfiguration of atoms -- Parameterized Complexity of Immunization in the Threshold Model -- Parameterized Complexity of Minimum Membership Dominating Set -- Graph Algorithms -- Finding popular branchings in vertex-weighted digraphs -- Vertex-Weighted Graphs: Realizable and Unrealizable Domains -- Hypergraph Representation via Axis-Aligned Point-Subspace Cover -- Structural Parameterizations of Budgeted Graph Coloring -- Counting and Sampling Orientations on Chordal Graphs -- Minimum t-spanners on subcubic graphs -- Approximation Algorithms -- Approximating the Bundled Crossing Number -- Path Cover Problems with Length Cost -- On approximating shortest paths in weighted triangular tessellations.This book constitutes the proceedings of the 16th International Conference on Algorithms and Computation, WALCOM 2022, which was held in Jember, Indonesia, during March 24-26, 2022. This proceedings volume contains 30 full papers which were carefully reviewed and selected from a total of 89 submissions and 3 invited papers. They cover diverse areas of algorithms and computation, such as approximation algorithms, computational complexity, computational geometry, graph algorithms, graph drawing and visualization, online algorithms, parameterized complexity and property testing.Theoretical Computer Science and General Issues,2512-2029 ;13174Computer scienceMathematicsComputer science—MathematicsDiscrete mathematicsData structures (Computer science)Information theoryComputer graphicsComputer engineeringComputer networksTheory of ComputationDiscrete Mathematics in Computer ScienceData Structures and Information TheoryComputer GraphicsComputer Engineering and NetworksComputer scienceMathematics.Computer science—Mathematics.Discrete mathematics.Data structures (Computer science).Information theory.Computer graphics.Computer engineering.Computer networks.Theory of Computation.Discrete Mathematics in Computer Science.Data Structures and Information Theory.Computer Graphics.Computer Engineering and Networks.005.1005.1Mutzel PetraRahman Md. Saidur1966-SlaminMiAaPQMiAaPQMiAaPQBOOK9910552730403321WALCOM: Algorithms and Computation774152UNINA