01403nam0 22003131i 450 UON0044008620231205104945.90009-338-8408-720140526d1979 |0itac50 barusUS|||| 1||||K istorii russkoj poezii 1910-ch - nacala 1920-ch godov Gleb StruveBerkeley : Berkeley Slavic specialities 1979177 p.21 cmContiene: ArionSbornik stichov. Avrora / Georgij Maslov predisloviem Ju. Tynjanova. Nesobrannye proizvedenija G. V. Maslova001UON001723872001 Modern Russian Literature and Culture. Studies and Texts.1001UON004402352001 ArionSbornik stichov 001UON004402342001 AvroraGeorgij Maslov USBerkeleyUONL000021891.71letteratura russa. Poesia22STRUVEGleb PetrovičUONV209315465368Berkeley Slavic SpecialtiesUONV265796650ITSOL20240220RICASIBA - SISTEMA BIBLIOTECARIO DI ATENEOUONSIUON00440086SIBA - SISTEMA BIBLIOTECARIO DI ATENEOSI RUSSO A 3126 SI EO 10090 7 3126 K istorii russkoj poezii 1910-ch - nacala 1920-ch godov1326526UNIOR06175nam 22008655 450 991072894220332120251107172757.03-031-34347-610.1007/978-3-031-34347-6(MiAaPQ)EBC30564794(Au-PeEL)EBL30564794(OCoLC)1381446379(DE-He213)978-3-031-34347-6(BIP)091289468(PPN)272259438(CKB)26821652600041(EXLCZ)992682165260004120230529d2023 u| 0engurcnu||||||||txtrdacontentcrdamediacrrdacarrierCombinatorial Algorithms 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7–10, 2023, Proceedings /edited by Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee1st ed. 2023.Cham :Springer Nature Switzerland :Imprint: Springer,2023.1 online resource (424 pages)Lecture Notes in Computer Science,1611-3349 ;13889Print version: Hsieh, Sun-Yuan Combinatorial Algorithms Cham : Springer,c2023 9783031343469 Includes bibliographical references and index.Multi-Priority Graph Sparsification -- Point Enclosure Problem for Homothetic Polygons -- Hardness of Balanced Mobiles -- Burn and Win -- Min-Max Relative Regret for Scheduling to Minimize Maximum Lateness -- Advice Complexity Bounds for Online Delayed F-Node-, H-Node- and H-Edge-Deletion Problems -- Parameterized algorithms for Eccentricity Shortest Path Problem -- A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs -- Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks -- A Polyhedral Perspective on Tropical Convolutions -- Online Knapsack with Removal and Recourse -- Minimum Surgical Probing with Convexity Constraints -- A linear algorithm for radio k-coloring powers of paths having small diameter -- Capacity-Preserving Subgraphs of Directed Flow Networks -- Timeline Cover in Temporal Graphs: Exact and Approximation Algorithms -- Finding Small CompleteSubgraphs Efficiently -- Maximal distortion of geodesic diameters in polygonal domains -- On 2-strong connectivity orientations of mixed graphs and related problems -- Make a Graph Singly Connected By Edge Orientations -- Computing the Center of Uncertain Points on Cactus Graphs -- Cosecure Domination: Hardness Results and Algorithms -- Optimal cost-based allocations under two-sided preferences -- Generating cyclic rotation Gray codes for stamp foldings and semi-meanders -- On Computing Large Temporal (Unilateral) Connected Components -- On Integer Linear Programs for Treewidth based on Perfect Elimination Orderings -- Finding Perfect Matching Cuts Faster -- Connected Feedback Vertex Set on AT-Free graphs -- Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries -- Improved Analysis of two Algorithms for Min-Weighted Sum Bin Packing -- Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism -- A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-connected Induced Subgraphs -- Partial-Adaptive Submodular Maximization -- Budget-Constrained Cost-Covering Job Assignment for a Total Contribution-Maximizing Platform.This book constitutes the refereed proceedings of the 34th International Workshop on Combinatorial Algorithms, IWOCA 2023, held in Tainan, Taiwan, during June 7–10, 2023. The 33 full papers included in this book were carefully reviewed and selected from 86 submissions. They were organized in topical sections as follows: algorithms and data structures; algorithmic and combinatorical aspects of cryptography and information security; algorithmic game theory and complexity of games; approximation algorithms; complexity theory; combinatorics and graph theory; combinatorial generation, enumeration and counting; combinatorial optimization; combinatorics of words; computational biology; computational geometry; decompositions and combinatorial designs; distributed and network algorithms; experimental combinatorics; fine-grained complexity; graph algorithms and modelling with graphs; graph drawing and graph labelling; network theoryand temporal graphs; quantum computing and algorithms for quantum computers; online algorithms; parameterized and exact algorithms; probabilistic and randomized algorithms; and streaming algorithms.Lecture Notes in Computer Science,1611-3349 ;13889Computer scienceMathematicsDiscrete mathematicsComputer engineeringComputer networksAlgorithmsData structures (Computer science)Information theoryComputer graphicsNumerical analysisDiscrete Mathematics in Computer ScienceComputer Engineering and NetworksDesign and Analysis of AlgorithmsData Structures and Information TheoryComputer GraphicsNumerical AnalysisComputer scienceMathematics.Discrete mathematics.Computer engineering.Computer networks.Algorithms.Data structures (Computer science)Information theory.Computer graphics.Numerical analysis.Discrete Mathematics in Computer Science.Computer Engineering and Networks.Design and Analysis of Algorithms.Data Structures and Information Theory.Computer Graphics.Numerical Analysis.511.8511.6Hsieh Sun-YuanHung Ling-JuLee Chia-Wei(Associate Professor)MiAaPQMiAaPQMiAaPQBOOK9910728942203321Combinatorial Algorithms2868813UNINA