WALCOM: Algorithms and Computation

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

AvEmilio Di Giacomo,Debajyoti Mondal

Häftad, Engelska, 2026

Del 16444 i serien Lecture Notes in Computer Science

818 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

556 kr

753 kr

572 kr

829 kr

829 kr

555 kr

555 kr

555 kr

555 kr

572 kr

Beskrivning

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

Utgivningsdatum:2026-02-14
Mått:155 x 235 x 33 mm
Vikt:914 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:592
Förlag:Springer Verlag, Singapore
ISBN:9789819571260

Utforska kategorier

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

Innehållsförteckning

.- 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

555 kr

Graph Drawing and Network Visualization

Anna Lubiw, Emilio Di Giacomo

E-bok

2015

718 kr

WALCOM: Algorithms and Computation

Debajyoti Mondal, Emilio Di Giacomo

E-bok

2026

1 026 kr

Mer från samma serie

Multiobjective Optimization

Jürgen Branke, Kalyanmoy Deb, Kaisa Miettinen, Roman Slowiński

Häftad, 2008

555 kr

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang - Knowledge Graphs, Häftad

Del 16297

Knowledge Graphs

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang

Häftad, 2026

933 kr

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

572 kr

Del 16096

Energy Informatics

Ivo Martinac, Bo Nørregaard Jørgensen, Zheng Grace Ma, Rúnar Unnþórsson, Chiara Bordin

Häftad, 2025

842 kr

Alejandro Jiménez Rodríguez, Rafael Mestre, Chaona Chen, Anna Mura, Edmund Barker, Paul Verschure, Tony Prescott - Biomimetic and Biohybrid Systems, Häftad

Del 15582

Biomimetic and Biohybrid Systems

Alejandro Jiménez Rodríguez, Rafael Mestre, Chaona Chen, Anna Mura, Edmund Barker, Paul Verschure, Tony Prescott

Häftad, 2025

1 022 kr

Extended Reality

Lucio Tommaso De Paolis, Pasquale Arpaia, Marco Sacco

Häftad, 2026

1 164 kr

Reliable Software Technologies - Ada-Europe '98

Lars Asplund

Häftad, 1998

572 kr

Lieven Eeckhout, Chao Li, Zhibin Yu, Avi Mendelson - Advanced Parallel Processing Technologies, Häftad

Nyhet

Del 16693

Advanced Parallel Processing Technologies

Lieven Eeckhout, Chao Li, Zhibin Yu, Avi Mendelson

Häftad, 2026

1 024 kr

Del 16832

Progress in Cryptology - AFRICACRYPT 2026

Nadia El Mrabet, Loubna Ghammam, Francisco Rodríguez-Henríquez

Häftad, 2026

933 kr

David Duenas-Cid, Gregor Eibl, Lieselot Danneels, Michael Koddebusch, Edimara Mezzomo Luciano, Gianluca Carlo Misuraca, Gerhard Schwabe, Teta Stamati, Leif Sundberg, Peter Parycek - Electronic Participation, Häftad

Nyhet

Electronic Participation

David Duenas-Cid, Gregor Eibl, Lieselot Danneels, Michael Koddebusch, Edimara Mezzomo Luciano, Gianluca Carlo Misuraca, Gerhard Schwabe, Teta Stamati, Leif Sundberg, Peter Parycek

Häftad, 2026

730 kr

Du kanske också är intresserad av

10% rabatt på allt

L'amour toujours : Berättelsen om Tidö

Maggie Strömberg, Torbjörn Nilsson

Inbunden, 2026

275 kr

WALCOM: Algorithms and Computation

Shin-ichi Nakano, Md. Saidur Rahman

Häftad, 2008

572 kr

WALCOM: Algorithms and Computation

Sandip Das, Ryuhei Uehara

Häftad, 2009

555 kr

WALCOM: Algorithms and Computation

Debajyoti Mondal, Emilio Di Giacomo

E-bok

2026

1 026 kr

WALCOM: Algorithms and Computation

Md. Saidur Rahman, Satoshi Fujita

Häftad, 2010

555 kr

Del 13973

WALCOM: Algorithms and Computation

Chun-Cheng Lin, Bertrand M. T. Lin, Giuseppe Liotta

Häftad, 2023

829 kr

Del 10755

WALCOM: Algorithms and Computation

M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara

Häftad, 2018

555 kr

WALCOM: Algorithms and Computation

NAOKI KATOH, Amit Kumar

Häftad, 2011

555 kr

Del 15411

WALCOM: Algorithms and Computation

Shin-ichi Nakano, Mingyu Xiao

Häftad, 2025

884 kr

Del 8973

WALCOM: Algorithms and Computation

M. Sohel Rahman, Etsuji Tomita

Häftad, 2015

555 kr

WALCOM: Algorithms and Computation

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

AvEmilio Di Giacomo,Debajyoti Mondal

Häftad, Engelska, 2026

Del 16444 i serien Lecture Notes in Computer Science

818 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

556 kr

753 kr

572 kr

829 kr

829 kr

555 kr

555 kr

555 kr

555 kr

572 kr

Beskrivning

Produktinformation

Utgivningsdatum:2026-02-14
Mått:155 x 235 x 33 mm
Vikt:914 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:592
Förlag:Springer Verlag, Singapore
ISBN:9789819571260

Utforska kategorier

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

Innehållsförteckning

.- 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

555 kr

Graph Drawing and Network Visualization

Anna Lubiw, Emilio Di Giacomo

E-bok

2015

718 kr

WALCOM: Algorithms and Computation

Debajyoti Mondal, Emilio Di Giacomo

E-bok

2026

1 026 kr

Mer från samma serie

Multiobjective Optimization

Jürgen Branke, Kalyanmoy Deb, Kaisa Miettinen, Roman Slowiński

Häftad, 2008

555 kr

Del 16297

Knowledge Graphs

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang

Häftad, 2026

933 kr

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

572 kr

Del 16096

Energy Informatics

Ivo Martinac, Bo Nørregaard Jørgensen, Zheng Grace Ma, Rúnar Unnþórsson, Chiara Bordin

Häftad, 2025

842 kr

Del 15582

Biomimetic and Biohybrid Systems

Alejandro Jiménez Rodríguez, Rafael Mestre, Chaona Chen, Anna Mura, Edmund Barker, Paul Verschure, Tony Prescott

Häftad, 2025

1 022 kr

Extended Reality

Lucio Tommaso De Paolis, Pasquale Arpaia, Marco Sacco

Häftad, 2026

1 164 kr

Reliable Software Technologies - Ada-Europe '98

Lars Asplund

Häftad, 1998

572 kr

Nyhet

Del 16693

Advanced Parallel Processing Technologies

Lieven Eeckhout, Chao Li, Zhibin Yu, Avi Mendelson

Häftad, 2026

1 024 kr

Del 16832

Progress in Cryptology - AFRICACRYPT 2026

Nadia El Mrabet, Loubna Ghammam, Francisco Rodríguez-Henríquez

Häftad, 2026

933 kr

Nyhet

Electronic Participation

David Duenas-Cid, Gregor Eibl, Lieselot Danneels, Michael Koddebusch, Edimara Mezzomo Luciano, Gianluca Carlo Misuraca, Gerhard Schwabe, Teta Stamati, Leif Sundberg, Peter Parycek

Häftad, 2026

730 kr