fachmedien.de - spezialisierte Fachinformationen für Studium und Beruf
fachmedien.de - spezialisierte Fachinformationen für Studium und Beruf
fachmedien.de - spezialisierte Fachinformationen für Studium und Beruf
fachmedien.de - spezialisierte Fachinformationen für Studium und Beruf
fachmedien.de - spezialisierte Fachinformationen für Studium und Beruf

Site Breadcrumb

Verkauf durch Sack Fachmedien

Foucaud / Parreau

Combinatorial Algorithms

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

Medium: Buch
ISBN: 978-3-032-27731-2
Verlag: Springer
Erscheinungstermin: 07.06.2026
In den Warenkorb
Lieferfrist: bis zu 10 Tage
Auf die Merkliste Drucken
Leseprobe
Überschrift

Beschreibung

Kostenloser Versand

nach Deutschland, Österreich und in die Schweiz

Bequem zahlen

Rechnung, Kreditkarte, PayPal oder Bankeinzug

Wir sind gerne für Sie da

0800 000-1378 (Inland)
service@fachmedien.de
<<Kontaktformular>>

Fragen

Fragen Lorem ipsum dolor sit amet, consetetur sadipscing elitr, sed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat, sed diam voluptua
Anwtorten

Anwtorten At vero eos et accusam et justo duo dolores et ea rebum. Stet clita kasd gubergren, no sea takimata sanctus est Lorem ipsum dolor sit amet. Lorem ipsum dolor sit amet

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. 

Produkteigenschaften

  • Artikelnummer: 9783032277312
  • Medium: Buch
  • ISBN: 978-3-032-27731-2
  • Verlag: Springer
  • Erscheinungstermin: 07.06.2026
  • Sprache(n): Englisch
  • Auflage: Erscheinungsjahr 2026
  • Serie: Lecture Notes in Computer Science
  • Produktform: Kartoniert, Paperback
  • Gewicht: 855 g
  • Seiten: 548
  • Format (B x H x T): 155 x 235 x 31 mm
  • Ausgabetyp: Kein, Unbekannt

Themen

Autoren/Hrsg.

Herausgeber

.- 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 + lP1)-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-Separating
Cycles 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 for
integer compositions.- Minimizing Makespan in Sublinear Time via Weighted Random Sampling.