↓ 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 Weak Heaps and Friends: Recent Developments
  3. Altmetric Badge
    Chapter 2 Efficient Exploration of Anonymous Undirected Graphs
  4. Altmetric Badge
    Chapter 3 On Maximum Rank Aggregation Problems
  5. Altmetric Badge
    Chapter 4 Deciding Representability of Sets of Words of Equal Length in Polynomial Time
  6. Altmetric Badge
    Chapter 5 Prefix Table Construction and Conversion
  7. Altmetric Badge
    Chapter 6 On the Approximability of Splitting-SAT in 2-CNF Horn Formulas
  8. Altmetric Badge
    Chapter 7 Boundary-to-Boundary Flows in Planar Graphs
  9. Altmetric Badge
    Chapter 8 Exact Algorithms for Weak Roman Domination
  10. Altmetric Badge
    Chapter 9 Verification Problem of Maximal Points under Uncertainty
  11. Altmetric Badge
    Chapter 10 Incidence Coloring Game and Arboricity of Graphs
  12. Altmetric Badge
    Chapter 11 Linear-Time Self-stabilizing Algorithms for Minimal Domination in Graphs
  13. Altmetric Badge
    Chapter 12 Phase Transition of Random Non-uniform Hypergraphs
  14. Altmetric Badge
    Chapter 13 Domino Tatami Covering Is NP-Complete
  15. Altmetric Badge
    Chapter 14 The Complexity of the Identifying Code Problem in Restricted Graph Classes
  16. Altmetric Badge
    Chapter 15 Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes
  17. Altmetric Badge
    Chapter 16 Combinatorial Algorithms
  18. Altmetric Badge
    Chapter 17 Graph Editing to a Fixed Target
  19. Altmetric Badge
    Chapter 18 Tight Bound on the Diameter of the Knödel Graph
  20. Altmetric Badge
    Chapter 19 Structural Properties of Subdivided-Line Graphs
  21. Altmetric Badge
    Chapter 20 Induced Subtrees in Interval Graphs
  22. Altmetric Badge
    Chapter 21 Protein Folding in 2D-Triangular Lattice Revisited
  23. Altmetric Badge
    Chapter 22 SAT and IP Based Algorithms for Magic Labeling with Applications
  24. Altmetric Badge
    Chapter 23 An Optimal Algorithm for Computing All Subtree Repeats in Trees
  25. Altmetric Badge
    Chapter 24 Approximation Bounds on the Number of Mixedcast Rounds in Wireless Ad-Hoc Networks
  26. Altmetric Badge
    Chapter 25 Maximum Spectral Radius of Graphs with Connectivity at Most k and Minimum Degree at Least δ
  27. Altmetric Badge
    Chapter 26 Degree Sequences of PageRank Uniform Graphs and Digraphs with Prime Outdegrees
  28. Altmetric Badge
    Chapter 27 On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs
  29. Altmetric Badge
    Chapter 28 Construction Techniques for Digraphs with Minimum Diameter
  30. Altmetric Badge
    Chapter 29 Suffix Tree of Alignment: An Efficient Index for Similar Data
  31. Altmetric Badge
    Chapter 30 Fitting Voronoi Diagrams to Planar Tesselations
  32. Altmetric Badge
    Chapter 31 Partial Information Network Queries
  33. Altmetric Badge
    Chapter 32 An Application of Completely Separating Systems to Graph Labeling
  34. Altmetric Badge
    Chapter 33 Universal Cycles for Weight-Range Binary Strings
  35. Altmetric Badge
    Chapter 34 Circuit Complexity of Shuffle
  36. Altmetric Badge
    Chapter 35 An Optimal Algorithm for the Popular Condensation Problem
  37. Altmetric Badge
    Chapter 36 Maximum st -Flow in Directed Planar Graphs via Shortest Paths
  38. Altmetric Badge
    Chapter 37 Hypergraph Covering Problems Motivated by Genome Assembly Questions
  39. Altmetric Badge
    Chapter 38 Cluster Editing with Locally Bounded Modifications Revisited
  40. Altmetric Badge
    Chapter 39 New Approximation Algorithms for the Vertex Cover Problem
  41. Altmetric Badge
    Chapter 40 Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation
  42. Altmetric Badge
    Chapter 41 Motif Matching Using Gapped Patterns
  43. Altmetric Badge
    Chapter 42 Domino Graphs and the Decipherability of Directed Figure Codes
  44. Altmetric Badge
    Chapter 43 A Pretty Complete Combinatorial Algorithm for the Threshold Synthesis Problem
  45. Altmetric Badge
    Chapter 44 Conjunctive Hierarchical Secret Sharing Scheme Based on MDS Codes
  46. Altmetric Badge
    Chapter 45 An FPT Certifying Algorithm for the Vertex-Deletion Problem
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
2 X users
wikipedia
4 Wikipedia pages
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 Berlin Heidelberg, November 2013
DOI 10.1007/978-3-642-45278-9
ISBNs
978-3-64-245277-2, 978-3-64-245278-9
Editors

Lecroq, Thierry, Mouchard, Laurent

X Demographics

X Demographics

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