↓ Skip to main content

Combinatorial Algorithms

Overview of attention for book
Cover of 'Combinatorial Algorithms'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Collision-Free Routing Problem with Restricted L-Path
  3. Altmetric Badge
    Chapter 2 Linear Clique-Width of Bi-complement Reducible Graphs
  4. Altmetric Badge
    Chapter 3 Linear Ramsey Numbers
  5. Altmetric Badge
    Chapter 4 Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract)
  6. Altmetric Badge
    Chapter 5 Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families
  7. Altmetric Badge
    Chapter 6 Minimum Polygons for Fixed Visibility VC-Dimension
  8. Altmetric Badge
    Chapter 7 Minsum k -Sink Problem on Dynamic Flow Path Networks
  9. Altmetric Badge
    Chapter 8 Fully Leafed Induced Subtrees
  10. Altmetric Badge
    Chapter 9 Pattern Matching for k -Track Permutations
  11. Altmetric Badge
    Chapter 10 Approximation Algorithms for the p -Hub Center Routing Problem in Parameterized Metric Graphs
  12. Altmetric Badge
    Chapter 11 On the Area Requirements of Straight-Line Orthogonal Drawings of Ternary Trees
  13. Altmetric Badge
    Chapter 12 A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs
  14. Altmetric Badge
    Chapter 13 Covering with Clubs: Complexity and Approximability
  15. Altmetric Badge
    Chapter 14 On the Expected Number of Distinct Gapped Palindromic Factors
  16. Altmetric Badge
    Chapter 15 Computational Complexity of Robot Arm Simulation Problems
  17. Altmetric Badge
    Chapter 16 Evaluation of Tie-Breaking and Parameter Ordering for the IPO Family of Algorithms Used in Covering Array Generation
  18. Altmetric Badge
    Chapter 17 Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth
  19. Altmetric Badge
    Chapter 18 An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest
  20. Altmetric Badge
    Chapter 19 Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem
  21. Altmetric Badge
    Chapter 20 On the Parameterized Complexity of Colorful Components and Related Problems
  22. Altmetric Badge
    Chapter 21 Analysis of Information Leakage Due to Operative Errors in Card-Based Protocols
  23. Altmetric Badge
    Chapter 22 Zero-Suppression and Computation Models
  24. Altmetric Badge
    Chapter 23 The Crossing Number of Seq-Shellable Drawings of Complete Graphs
  25. Altmetric Badge
    Chapter 24 Cryptographic Limitations on Polynomial-Time a Posteriori Query Learning
  26. Altmetric Badge
    Chapter 25 Placing Segments on Parallel Arcs
  27. Altmetric Badge
    Chapter 26 Branch-and-Bound Algorithm for Symmetric Travelling Salesman Problem
  28. Altmetric Badge
    Chapter 27 LZ-ABT: A Practical Algorithm for $$\alpha $$ -Balanced Grammar Compression
  29. Altmetric Badge
    Chapter 28 Faster Coreset Construction for Projective Clustering via Low-Rank Approximation
  30. Altmetric Badge
    Chapter 29 Separating Interaction Effects Using Locating and Detecting Arrays
  31. Altmetric Badge
    Chapter 30 An Efficient Representation of Partitions of Integers
  32. Altmetric Badge
    Chapter 31 How Far From a Worst Solution a Random Solution of a $$k\,$$ CSP Instance Can Be?
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
6 X users

Readers on

mendeley
1 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Combinatorial Algorithms
Published by
Springer International Publishing, August 2018
DOI 10.1007/978-3-319-94667-2
ISBNs
978-3-31-994666-5, 978-3-31-994667-2
Editors

Iliopoulos, Costas, Leong, Hon Wai, Sung, Wing-Kin

X Demographics

X Demographics

The data shown below were collected from the profiles of 6 X users who shared this research output. Click here to find out more about how the information was compiled.