9783031343469 - combinatorial algorithms: 34th international workshop, iwoca 2023, tainan, taiwan, june 7–10, 2023, proceedings: 13889 (11 risultati)
- Brossura
Da: Books Puddle, New York, NY, U.S.A.Books Puddle
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 114,96
EUR 3,45 spedizioneSpedito in U.S.A.Quantità: 4 disponibili
Condizione: New. pp. 432.
- Brossura
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 70,33
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Kartoniert / Broschiert. Condizione: New.
Altre immagini- Brossura
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 72,85
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Taschenbuch. Condizione: Neu. Combinatorial Algorithms | 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023, Proceedings | Sun-Yuan Hsieh (u. a.) | Taschenbuch | Lecture Notes in Computer Science | xxiii | Englisch | 2023 | Springer | EAN 9783031343469 | Verantwortliche Person für die EU: Springer Verlag Gm…bH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
- Brossura
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 80,24
EUR 63,26 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 34th International Workshop on Combinatorial Algorithms, IWOCA2023, 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; algorithmicand combinatorical aspects of cryptography and information security; algorithmicgame theory and complexity of games; approximation algorithms;complexity theory; combinatorics and graph theory; combinatorial generation,enumeration and counting; combinatorial optimization; combinatoricsof words; computational biology; computational geometry; decompositionsand combinatorial designs; distributed and network algorithms; experimentalcombinatorics; fine-grained complexity; graph algorithms and modellingwith graphs; graph drawing and graph labelling; network theoryand temporalgraphs; quantum computing and algorithms for quantum computers;online algorithms; parameterized and exact algorithms; probabilistic and randomized algorithms; and streaming algorithms.
- Brossura
Da: Buchpark, Trebbin, GermaniaBuchpark
Contatta il venditoreVenditore con 5 stelleCondizione: Usato
EUR 65,15
EUR 105,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Condizione: Hervorragend. Zustand: Hervorragend | Seiten: 432 | Sprache: Englisch | Produktart: Bücher | 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 carefull…y 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.
- Brossura
Da: BUCHSERVICE / ANTIQUARIAT Lars Lutzer, Wahlstedt, GermaniaBUCHSERVICE / ANTIQUARIAT Lars Lutzer
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Molto buono
EUR 179,95
EUR 39,95 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Softcover. Condizione: gut. 2023. Combinatorial Algorithms In deutscher Sprache. pages.
- Brossura
- Print on Demand
Da: Brook Bookstore On Demand, Napoli, NA, ItaliaBrook Bookstore On Demand
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 66,23
EUR 6,80 spedizioneSpedito da Italia a U.S.A.Quantità: Più di 20 disponibili
Condizione: new. Questo è un articolo print on demand.
- Brossura
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 80,24
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book constitutes the refereed proceedings of the 34th International Workshop on Combinatorial Algorithms, IWOCA2023, held in Tainan, Taiwan, during June 7-10, 2023.The 33 full papers included in this book were carefully review…ed and selected from 86 submissions. They were organized in topical sections as follows: algorithms and data structures; algorithmicand combinatorical aspects of cryptography and information security; algorithmicgame theory and complexity of games; approximation algorithms;complexity theory; combinatorics and graph theory; combinatorial generation,enumeration and counting; combinatorial optimization; combinatoricsof words; computational biology; computational geometry; decompositionsand combinatorial designs; distributed and network algorithms; experimentalcombinatorics; fine-grained complexity; graph algorithms and modellingwith graphs; graph drawing and graph labelling; network theoryand temporalgraphs; quantum computing and algorithms for quantum computers;online algorithms; parameterized and exact algorithms; probabilistic and randomized algorithms; and streaming algorithms. 432 pp. Englisch.
- Brossura
- Print on Demand
Da: Majestic Books, Hounslow, Regno UnitoMajestic Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 116,04
EUR 7,60 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 4 disponibili
Condizione: New. Print on Demand pp. 432.
- Brossura
- Print on Demand
Da: Biblios, frankfurt am main, HESSE, GermaniaBiblios
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 118,80
EUR 9,95 spedizioneSpedito da Germania a U.S.A.Quantità: 4 disponibili
Condizione: New. PRINT ON DEMAND pp. 432.
- Brossura
- Print on Demand
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 80,24
EUR 60,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 On…line 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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 432 pp. Englisch.
