001469492 000__ 06301cam\\22006977i\4500
001469492 001__ 1469492
001469492 003__ OCoLC
001469492 005__ 20230803003332.0
001469492 006__ m\\\\\o\\d\\\\\\\\
001469492 007__ cr\un\nnnunnun
001469492 008__ 230608s2023\\\\sz\a\\\\o\\\\\101\0\eng\d
001469492 019__ $$a1381186238
001469492 020__ $$a9783031343476$$q(electronic bk.)
001469492 020__ $$a3031343476$$q(electronic bk.)
001469492 020__ $$z9783031343469
001469492 020__ $$z3031343468
001469492 0247_ $$a10.1007/978-3-031-34347-6$$2doi
001469492 035__ $$aSP(OCoLC)1381446379
001469492 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dYDX$$dEBLCP$$dUKAHL$$dOCLCF
001469492 049__ $$aISEA
001469492 050_4 $$aQA164
001469492 08204 $$a004.01/51$$223/eng/20230608
001469492 1112_ $$aInternational Workshop on Combinatorial Algorithms$$n(34th :$$d2023 :$$cTainan, Taiwan)
001469492 24510 $$aCombinatorial Algorithms :$$b34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023, Proceedings /$$cSun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee, editors.
001469492 2463_ $$aIWOCA 2023
001469492 264_1 $$aCham, Switzerland :$$bSpringer,$$c2023.
001469492 300__ $$a1 online resource (xxiii, 406 pages) :$$billustrations (some color).
001469492 336__ $$atext$$btxt$$2rdacontent
001469492 337__ $$acomputer$$bc$$2rdamedia
001469492 338__ $$aonline resource$$bcr$$2rdacarrier
001469492 4901_ $$aLecture notes in computer science,$$x1611-3349 ;$$v13889
001469492 4901_ $$aAdvanced research in computing and software science
001469492 500__ $$aIncludes author index.
001469492 5050_ $$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 Complete Subgraphs 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.
001469492 506__ $$aAccess limited to authorized users.
001469492 520__ $$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 theory and temporal graphs; quantum computing and algorithms for quantum computers; online algorithms; parameterized and exact algorithms; probabilistic and randomized algorithms; and streaming algorithms.
001469492 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed June 8, 2023).
001469492 650_0 $$aCombinatorial analysis$$vCongresses.
001469492 650_0 $$aAlgorithms$$vCongresses.
001469492 655_0 $$aElectronic books.
001469492 655_7 $$aConference papers and proceedings.$$2fast$$0(OCoLC)fst01423772
001469492 7001_ $$aHsieh, Sun-Yuan,$$eeditor.$$1https://orcid.org/0000-0003-4746-3179
001469492 7001_ $$aHung, Ling-Ju,$$eeditor.$$1https://orcid.org/0000-0001-5659-5507
001469492 7001_ $$aLee, Chia-Wei$$c(Associate Professor),$$eeditor.$$1https://orcid.org/0000-0002-5337-0473
001469492 77608 $$iPrint version: $$z3031343468$$z9783031343469$$w(OCoLC)1377719142
001469492 830_0 $$aLecture notes in computer science ;$$v13889.$$x1611-3349
001469492 830_0 $$aLecture notes in computer science.$$pAdvanced research in computing and software science.
001469492 852__ $$bebk
001469492 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-031-34347-6$$zOnline Access$$91397441.1
001469492 909CO $$ooai:library.usi.edu:1469492$$pGLOBAL_SET
001469492 980__ $$aBIB
001469492 980__ $$aEBOOK
001469492 982__ $$aEbook
001469492 983__ $$aOnline
001469492 994__ $$a92$$bISE