LEADER 06175nam 22008655 450 001 9910728942203321 005 20251107172757.0 010 $a3-031-34347-6 024 7 $a10.1007/978-3-031-34347-6 035 $a(MiAaPQ)EBC30564794 035 $a(Au-PeEL)EBL30564794 035 $a(OCoLC)1381446379 035 $a(DE-He213)978-3-031-34347-6 035 $a(BIP)091289468 035 $a(PPN)272259438 035 $a(CKB)26821652600041 035 $a(EXLCZ)9926821652600041 100 $a20230529d2023 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aCombinatorial Algorithms $e34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7?10, 2023, Proceedings /$fedited by Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee 205 $a1st ed. 2023. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2023. 215 $a1 online resource (424 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v13889 311 08$aPrint version: Hsieh, Sun-Yuan Combinatorial Algorithms Cham : Springer,c2023 9783031343469 320 $aIncludes bibliographical references and index. 327 $aMulti-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. 330 $aThis 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. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v13889 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aComputer engineering 606 $aComputer networks 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aInformation theory 606 $aComputer graphics 606 $aNumerical analysis 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Engineering and Networks 606 $aDesign and Analysis of Algorithms 606 $aData Structures and Information Theory 606 $aComputer Graphics 606 $aNumerical Analysis 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aComputer engineering. 615 0$aComputer networks. 615 0$aAlgorithms. 615 0$aData structures (Computer science) 615 0$aInformation theory. 615 0$aComputer graphics. 615 0$aNumerical analysis. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aComputer Engineering and Networks. 615 24$aDesign and Analysis of Algorithms. 615 24$aData Structures and Information Theory. 615 24$aComputer Graphics. 615 24$aNumerical Analysis. 676 $a511.8 676 $a511.6 702 $aHsieh$b Sun-Yuan 702 $aHung$b Ling-Ju 702 $aLee$b Chia-Wei$c(Associate Professor) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910728942203321 996 $aCombinatorial Algorithms$92868813 997 $aUNINA