WALCOM : Algorithms and Computation : 16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24-26, 2022, Proceedings / Petra Mutzel, Md. Saidur Rahman, Slamin (eds.).
WALCOM (Workshop) (16th : 2022 : Jember, Indonesia); Mutzel, Petra, editor.; Rahman, Md. Saidur, 1966- editor.; Slamin, editor.
2022
QA76.9.A43
Available Online

Linked e-resources

Linked Resource Online Access
Concurrent users Unlimited
Authorized users Authorized users
Document Delivery Supplied Can lend chapters, not whole ebooks

Details

Title WALCOM : Algorithms and Computation : 16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24-26, 2022, Proceedings / Petra Mutzel, Md. Saidur Rahman, Slamin (eds.).
Meeting Name WALCOM (Workshop) (16th : 2022 : Jember, Indonesia)
ISBN 9783030967314 (electronic bk.)
303096731X (electronic bk.)
9783030967307 (print)
3030967301
DOI https://doi.org/10.1007/978-3-030-96731-4
Published Cham, Switzerland : Springer, 2022.
Language English
Description 1 online resource (xviii, 424 pages) : illustrations (some color).
Other Standard Identifiers 10.1007/978-3-030-96731-4 doi
Call Number QA76.9.A43
Dewey Decimal Classification 005.1
Summary This book constitutes the proceedings of the 16th International Conference on Algorithms and Computation, WALCOM 2022, which was held in Jember, Indonesia, during March 24-26, 2022. This proceedings volume contains 30 full papers which were carefully reviewed and selected from a total of 89 submissions and 3 invited papers. They cover diverse areas of algorithms and computation, such as approximation algorithms, computational complexity, computational geometry, graph algorithms, graph drawing and visualization, online algorithms, parameterized complexity and property testing.
Note Includes author index.
Access Note Access limited to authorized users.
Source of Description Online resource; title from PDF title page (SpringerLink, viewed March 23, 2022).
Added Author Mutzel, Petra, editor.
Rahman, Md. Saidur, 1966- editor.
Slamin, editor.
Series Lecture notes in computer science ; 13174.
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Available in Other Form Print version: 9783030967307
Linked Resources Online Access
Record Appears in Online Resources > Ebooks
All Resources
Invited Talks
Some Problems Related to the Space of Optimal Tree Reconciliations
From the W-hierarchy to XNLP: Classes of Fixed Parameter Intractability
Invitation to Combinatorial Reconfiguration
Combinatorial Reconfiguration
Reconfiguration of Regular Induced Subgraphs
Traversability, Reconfiguration, and Reachability in the Gadget Framework
1-Complex $ s,t $ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids
Graph Drawing and Visualization
Aspect Ratio Universal Rectangular Layouts
Morphing tree drawings in a small 3D grid
StreamTable: An Area Proportional Visualization for Tables with Flowing Streams
Vertex-to-Point Conflict-Free Chromatic Guarding is NP-hard
The Polygon Burning Problem
Reverse Shortest Path Problem in Weighted Unit-Disk Graphs
Computational Complexity
Happy Set Problem on Subclasses of Co-comparability Graphs
Finding Geometric Representations of Apex Graphs is NP-Hard
The Complexity of L(p,q)-Edge-Labelling
Trains, Games, and Complexity: 0/1/2-Player Motion Planning through Input/Output Gadgets
Online and Property Testing
An Optimal Tester for k-Linear
Machine Learning Advised Ski Rental Problem with a Discount
Parameterized Complexity
On the Harmless Set Problem Parameterized by Treewidth
Isomorphism Testing for T -graphs in FPT
Parameterized algorithms for Steiner Tree and Dominating Set: bounding the leafage by the vertex leafage
Parameterized complexity of reconfiguration of atoms
Parameterized Complexity of Immunization in the Threshold Model
Parameterized Complexity of Minimum Membership Dominating Set
Graph Algorithms
Finding popular branchings in vertex-weighted digraphs
Vertex-Weighted Graphs: Realizable and Unrealizable Domains
Hypergraph Representation via Axis-Aligned Point-Subspace Cover
Structural Parameterizations of Budgeted Graph Coloring
Counting and Sampling Orientations on Chordal Graphs
Minimum t-spanners on subcubic graphs
Approximation Algorithms
Approximating the Bundled Crossing Number
Path Cover Problems with Length Cost
On approximating shortest paths in weighted triangular tessellations.

Browse Subjects

Show more subjects...

Statistics

from
to
Export