9783031343469 - combinatorial algorithms: 34th international workshop, iwoca 2023, tainan, taiwan, june 7–10, 2023, proceedings: 13889 (lecture notes in computer science) (9 resultados)
- Tapa blanda
Librería: Books Puddle, New York, NY, Estados Unidos de AmericaBooks Puddle
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 117,05
Envío por EUR 3,48Se envía dentro de Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. pp. 432.
- Tapa blanda
Librería: moluna, Greven, , Alemaniamoluna
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 70,33
Envío por EUR 48,99Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Kartoniert / Broschiert. Condición: New.
Más imágenes- Tapa blanda
Librería: preigu, Osnabrück, Alemaniapreigu
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 72,75
Envío por EUR 70,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 5 disponibles
Taschenbuch. Condición: 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 Gmb…H, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
- Tapa blanda
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 80,24
Envío por EUR 63,26Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: 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 f…rom 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.
- Tapa blanda
- Impresión bajo demanda
Librería: Brook Bookstore On Demand, Napoli, NA, ItaliaBrook Bookstore On Demand
Contactar con el vendedorVendedor de 3 estrellasCondición: Nuevo
EUR 66,23
Envío por EUR 6,80Se envía de Italia a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: new. Questo è un articolo print on demand.
- Tapa blanda
- Impresión bajo demanda
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, , AlemaniaBuchWeltWeit Ludwig Meier e.K.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 80,24
Envío por EUR 23,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Taschenbuch. Condición: 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 reviewe…d 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.
- Tapa blanda
- Impresión bajo demanda
Librería: Majestic Books, Hounslow, , Reino UnidoMajestic Books
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 117,84
Envío por EUR 7,49Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. Print on Demand pp. 432.
- Tapa blanda
- Impresión bajo demanda
Librería: Biblios, frankfurt am main, HESSE, AlemaniaBiblios
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 118,01
Envío por EUR 9,95Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. PRINT ON DEMAND pp. 432.
- Tapa blanda
- Impresión bajo demanda
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 80,24
Envío por EUR 60,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: 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 Onl…ine 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.
