WALCOM: Algorithms and Computation
portes grátis
WALCOM: Algorithms and Computation
18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18-20, 2024, Proceedings
Uehara, Ryuhei; Yamanaka, Katsuhisa; Yen, Hsu-Chun
Springer Verlag, Singapore
02/2024
438
Mole
Inglês
9789819705658
15 a 20 dias
Descrição não disponível.
Recent Research Activities on Algorithmic Foundations for Social Advancement.- Reasons to Fall (More) in Love with Combinatorial Reconfiguration.- Plane Multigraphs with One-Bend and Circular-Arc Edges of a Fixed Angle.- Quantum Graph Drawing.- Simultaneous Drawing of Layered Trees.- Fully Dynamic Algorithms for Euclidean Steiner Tree.- The Parameterized Complexity of Terminal Monitoring Set.- Generating cyclic 2-Gray codes for Fibonacci q-decreasing words.- On the Hardness of Gray Code Problems for Combinatorial Objects.- On MAX-SAT with Cardinality Constraint.- Minimizing Corners in Colored Rectilinear Grids.- On Layered Area-Proportional Rectangle Contact Representations.- Short Flip Sequences to Untangle Segments in the Plane.- Improved Approximation Algorithms for Cycle and Path Packings.- Exact and Approximate Hierarchical Hub Labeling.- Reconfiguration of Multisets with Applications to Bin Packing.- The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules.- Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis.- A bisection approach to subcubic maximum induced matching.- Stable and Dynamic Minimum Cuts.- Black Hole Search in Dynamic Cactus Graph.- Recognition and Isomorphism of Proper H-graphs for unicyclic H in FPT-time.- Canonization of a random circulant graph by counting walks.- Counting Vanishing Matrix-Vector Products.- Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs.- (t,s)-completely Independent Spanning Trees.- Orientable Burning Number of Graphs.- Dichotomies for Tree Minor Containment with Structural Parameters.- Structural Parameterizations of Vertex Integrity.- On the Complexity of List H-Packing for Sparse Graph Classes.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
approximation algorithms;combinatorial reconfiguration;computational complexity;computational geometry;graph algorithms;Algorithmic Graph Theory and Combinatorics;Combinatorial Algorithms;Combinatorial Optimization;Computational Biology;Discrete Geometry;Data Structures;Experimental Algorithm Methodologies;Graph Drawing;Parallel and Distributed Algorithms;Parameterized Algorithms;Network Optimization;Online Algorithms;Randomized Algorithms;String Algorithms
Recent Research Activities on Algorithmic Foundations for Social Advancement.- Reasons to Fall (More) in Love with Combinatorial Reconfiguration.- Plane Multigraphs with One-Bend and Circular-Arc Edges of a Fixed Angle.- Quantum Graph Drawing.- Simultaneous Drawing of Layered Trees.- Fully Dynamic Algorithms for Euclidean Steiner Tree.- The Parameterized Complexity of Terminal Monitoring Set.- Generating cyclic 2-Gray codes for Fibonacci q-decreasing words.- On the Hardness of Gray Code Problems for Combinatorial Objects.- On MAX-SAT with Cardinality Constraint.- Minimizing Corners in Colored Rectilinear Grids.- On Layered Area-Proportional Rectangle Contact Representations.- Short Flip Sequences to Untangle Segments in the Plane.- Improved Approximation Algorithms for Cycle and Path Packings.- Exact and Approximate Hierarchical Hub Labeling.- Reconfiguration of Multisets with Applications to Bin Packing.- The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules.- Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis.- A bisection approach to subcubic maximum induced matching.- Stable and Dynamic Minimum Cuts.- Black Hole Search in Dynamic Cactus Graph.- Recognition and Isomorphism of Proper H-graphs for unicyclic H in FPT-time.- Canonization of a random circulant graph by counting walks.- Counting Vanishing Matrix-Vector Products.- Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs.- (t,s)-completely Independent Spanning Trees.- Orientable Burning Number of Graphs.- Dichotomies for Tree Minor Containment with Structural Parameters.- Structural Parameterizations of Vertex Integrity.- On the Complexity of List H-Packing for Sparse Graph Classes.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
approximation algorithms;combinatorial reconfiguration;computational complexity;computational geometry;graph algorithms;Algorithmic Graph Theory and Combinatorics;Combinatorial Algorithms;Combinatorial Optimization;Computational Biology;Discrete Geometry;Data Structures;Experimental Algorithm Methodologies;Graph Drawing;Parallel and Distributed Algorithms;Parameterized Algorithms;Network Optimization;Online Algorithms;Randomized Algorithms;String Algorithms
