Del 16587 i serien Lecture Notes in Computer Science

Combinatorial Algorithms

37th International Workshop, IWOCA 2026, Clermont-Ferrand, France, June 8–11, 2026, Proceedings

Häftad, Engelska, 2026

AvFlorent Foucaud,Aline Parreau

1 179 kr

Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (10)

Häftad

1 059 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

1 289 kr

Skickas inom 10-15 vardagar

Häftad

1 289 kr

Skickas inom 10-15 vardagar

Häftad

1 289 kr

Skickas inom 10-15 vardagar

Häftad

2 289 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

This book constitutes the proceedings of 37th International Workshop on Combinatorial Algorithms, IWOCA 2026, held in Clermont-Ferrand, France, during June 8–11, 2026.The 37 full papers presented in this book were carefully reviewed and selected from 110 submissions. They deal with design algorithms for the myriad combinatorial problems that underlie computer applications in science, engineering and business.

Produktinformation

Utgivningsdatum2026-06-07
Mått155 x 235 x 31 mm
Vikt855 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor548
FörlagSpringer Nature Switzerland AG
ISBN9783032277312

Tillhör följande kategorier

Diskret matematik inom Naturvetenskap och teknik
Optimering inom Naturvetenskap och teknik
Programmeringsböcker inom Data och IT
Systemvetenskap och AI inom Data och IT

.- On the Complexity of Vertex-Splitting Into an Interval Graph.- Bounds on Linear Tur´an Number for Trees.- Exact Algorithms for Edge Deletion to Cactus.- Minimizing the Weighted Makespan with Restarts on a Single Machine.- Parameterized algorithms for k-Inversion.- On the rank and the general position number in cycle convexity.- Hardness Results on Bondage and Reinforcement Problems in Chordal Graphs.- Degree Realization with Maximum Matching.- Vertex-critical graphs in subfamilies of (P4 + ℓP1)-free graphs.- Breadth-First Search Trees with Many or Few Leaves.- The Parameterized Complexity of Scheduling with Precedence Delays: Shuffe Product and Directed Bandwidth.- Parameterized Algorithms for Computing MAD Trees.- Dominating Set with Quotas: Balancing Coverage and Constraints.- Reachability in Graphs with Polynomially many Surface Non-SeparatingCycles is in UL.- Enumerating Spanners in Directed Temporal Graphs.- Beer Path Problems in Temporal Graphs.- On (1, ≤ l)-locating-dominating codes in infinite triangular grid.- Realizing Planar Linkages in Polygonal Domains.- Online Drone Coverage of Targets on a Line.- Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds.- Removable Online Knapsack: Exploiting Recourse and Bounded Item Sizes.- Layer-Based Width for PAFP on DAGs: A BFS-Width-2 Normal Form and Exact-Length-Width-2 Tractability.- Solid-resolving sets on directed graphs.- Minimum Clique Bicoloring.- On the (≤ p)-inversion diameter of oriented graphs.- Hardness of SetCover Reoptimization.- Conflict-Free Cuts in Planar and 3-Degenerate Graphs with 1-Regular Conflicts.- Tight upper bounds on color reversal by local inversions.- Domination and Coverage Problems under Vulnerability Constraints.- Fast Order Statistics with Group Inequality Testing.- An Algorithm for Monitoring Edge-geodetic Sets in Chordal Graphs.- (Even hole, triangle)-free graphs revisited.- One Sequence to Rule them All: O(1)-Time Parallel Generation of Mixed-Radix Gray Codes.- On the Complexity of Signed Domination.- Improved Bounds on Proper Conflict-free Coloring of Graphs.- Cryptographic applications of combinatorial ranking algorithms forinteger compositions.- Minimizing Makespan in Sublinear Time via Weighted Random Sampling.

Mer från samma serie

Compiler Construction

Albert Cohen

Häftad, 2014

709 kr

Del 16375

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

719 kr

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

739 kr

Theory of Cryptography

Yehuda Lindell

Häftad, 2014

739 kr

Computer Science Logic

Dirk van Dalen, Marc Bezem

Häftad, 1997

739 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

739 kr

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki - Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries, Häftad

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki

Häftad, 2026

1 209 kr

Objects and Databases

Alan Dearle, Roberto V. Zicari

Häftad, 2010

739 kr

Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi - Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops, Häftad

Del 15401

Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops

Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi

Häftad, 2025

959 kr

Del 16625

Web Engineering

Andrea Mauri, Lola Burgueño, Riccardo Tommasini

Häftad, 2026

1 099 kr

Du kanske också är intresserad av

Del 12126