000			05240nam a22004215i 4500
008			230529s2023 sz | s |||| 0|eng d
020			_a9783031343476 _9978-3-031-34347-6
041			_aeng
082	0	4	_a004.0151 _223
245	1	0	_aCombinatorial Algorithms _h[electronic resource] : _b34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023, Proceedings / _cedited by Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee.
250			_a1st ed. 2023.
260		1	_aCham : _bSpringer Nature Switzerland : _bImprint: Springer, _c2023.
300			_aXXIII, 406 p. 86 illus., 48 illus. in color. _bonline resource.
490	1		_aLecture Notes in Computer Science, _x1611-3349 ; _v13889
505	0		_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.
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.
650		0	_aComputer science _xMathematics.
650		0	_aDiscrete mathematics.
650		0	_aComputer engineering.
650		0	_aComputer networks .
650		0	_aAlgorithms.
650		0	_aData structures (Computer science).
650		0	_aInformation theory.
650		0	_aComputer graphics.
650		0	_aNumerical analysis.
650	1	4	_aDiscrete Mathematics in Computer Science. _91465309
650	2	4	_aComputer Engineering and Networks.
650	2	4	_aDesign and Analysis of Algorithms. _91465673
650	2	4	_aData Structures and Information Theory. _91464963
650	2	4	_aComputer Graphics.
650	2	4	_aNumerical Analysis.
700	1		_aHsieh, Sun-Yuan. _eeditor. _0(orcid)0000-0003-4746-3179 _1https://orcid.org/0000-0003-4746-3179 _4edt _4http://id.loc.gov/vocabulary/relators/edt _91467234
700	1		_aHung, Ling-Ju. _eeditor. _0(orcid)0000-0001-5659-5507 _1https://orcid.org/0000-0001-5659-5507 _4edt _4http://id.loc.gov/vocabulary/relators/edt _91467235
700	1		_aLee, Chia-Wei. _eeditor. _0(orcid)0000-0002-5337-0473 _1https://orcid.org/0000-0002-5337-0473 _4edt _4http://id.loc.gov/vocabulary/relators/edt _91467236
856	4	0	_uhttps://doi.org/10.1007/978-3-031-34347-6 _3Click Here
887			_aAkhil Chandra Saren
942			_cEBK
999			_c1609314 _d1609310