Del 16444 i serien Lecture Notes in Computer Science

WALCOM: Algorithms and Computation

20th International Conference and Workshops on Algorithms and Computation, WALCOM 2026, Perugia, Italy, March 4–6, 2026, Proceedings

Häftad, Engelska, 2026

AvEmilio Di Giacomo,Debajyoti Mondal

1 059 kr

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

Finns i fler format (10)

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

979 kr

Skickas inom 10-15 vardagar

Häftad

739 kr

Skickas inom 10-15 vardagar

Häftad

1 079 kr

Skickas inom 10-15 vardagar

Häftad

1 079 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

719 kr

Skickas inom 10-15 vardagar

Häftad

739 kr

Skickas inom 10-15 vardagar

This book constitutes the refereed proceedings of the 20th International Conference and Workshops on Algorithms and Computation, WALCOM 2026, held in Perugia, Italy, on March 4–6, 2026.The 38 full papers were selected from carefully reviewed 108 submissions. WALCOM 2026 were orgainzed in following topical sections as Graph drawings and embeddings, Approximation, Induced subgraphs and dominating sets, Complexity, Games and graph reconfiguration, Shortest paths and minimum spanning trees, Geometric problems and Enumeration problems.

Produktinformation

Utgivningsdatum2026-02-14
Mått155 x 235 x 33 mm
Vikt914 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor592
FörlagSpringer Verlag, Singapore
ISBN9789819571260

Tillhör följande kategorier

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

.- Graph drawings and embeddings..- Computing Beyond-Planar Crossing Numbers via Forbidden Crossing Patterns..- Minimum-Weight Outerplane Laman Graphs..- Minimizing Vertical Length in Linked Bar Charts..- On Compaction and Realizability of Almost Convex Octilinear Representations..- Hardness and Parameterized Tractability of the Weak Graph Distance. .- Approximation..- Hardness and Approximation Results for Extending Unique Neighborhood Networks..- Approximating the Average-case Graph Search Problem with Non-uniform Costs..- Linear time small coresets for k-mean clustering of segments with applications..- Cartesian Forest Matching..- Streaming algorithms for products of probabilities. .- Induced subgraphs and dominating sets..- Finding Order-Preserving Subgraphs..- Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited..- Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs..- Complexity of perfect (1,2)-dominating sets in low-degree graphs..- Complexity..- A Complexity Analysis of the c-Closed Vertex Deletion Problem..- On the Computational Complexity of Covering Multi-Interface Networks..- Generalizing Brooks’ Theorem via Partial Coloring is Hard Classically and Locally..- Space Efficient Algorithms for Parameterised Problems..- Subexponential and Parameterized Mixing Times of Glauber Dynamics on Independent Sets. .- Games and graph reconfiguration .- Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles..- Can One Flip Spoil It All?..- Computing Power Indices in Weighted Majority Games with Formal Power Series..- How to Reconfigure Your Alliances..- Graph Irregularity via Edge Deletions..- Shortest paths and minimum spanning trees..- Forcing a unique minimum spanning tree and a unique shortest path..- On the MST-ratio: Theoretical Bounds and Complexity of Finding the Maximum..- Disjoint Tours and the Price of Diversity..- Shortcutting the diameter of a polygon..- Parameterized Complexity of Reconfiguring Vertex-Disjoint Shortest Paths. .- Geometric problems .- Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion..- Fundamentals of Computing Continuous Dynamic Time Warping in 2D under Different Norms..- The Gate-Cover Problem..- Trajectory Visibility at First Sight..- Tile Reconfiguration by a Finite Automaton. .- Enumeration problems.- Enumerating All Graph Colorings Using Zero-Suppressed Binary Decision Diagrams..- Engineering Algorithms for L-Isolated Maximal Clique Enumeration..- On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs..- Enumeration of Bases in Matroid with Exponentially Large Ground Set.

Mer från samma författare

Del 9411

Graph Drawing and Network Visualization

Emilio Di Giacomo, Anna Lubiw

Häftad, 2015

719 kr

Mer från samma serie

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

739 kr

COLOG-88

Per Martin-Löf, Grigori Mints

Häftad, 1990

719 kr

Compiler Construction

Albert Cohen

Häftad, 2014

709 kr

Del 16375

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

719 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

Du kanske också är intresserad av