Overview

Full Product Details

Author:   Ryuhei Uehara ,  Katsuhisa Yamanaka ,  Hsu-Chun Yen
Publisher:   Springer Verlag, Singapore
Imprint:   Springer Nature
Edition:   1st ed. 2024
Volume:   14549
ISBN:  

9789819705658

ISBN 10:   9819705657
Pages:   438
Publication Date:   29 February 2024
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand  
We will order this item for you from a manufactured on demand supplier.

Table of Contents

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions