↓ Skip to main content

Computing and Combinatorics

Overview of attention for book
Cover of 'Computing and Combinatorics'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 The Combinatorics of Sequencing the Corn Genome
  3. Altmetric Badge
    Chapter 2 Online Frequency Assignment in Wireless Communication Networks
  4. Altmetric Badge
    Chapter 3 Information Distance from a Question to an Answer
  5. Altmetric Badge
    Chapter 4 A New Field Splitting Algorithm for Intensity-Modulated Radiation Therapy
  6. Altmetric Badge
    Chapter 5 A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem
  7. Altmetric Badge
    Chapter 6 Seed-Based Exclusion Method for Non-coding RNA Gene Search
  8. Altmetric Badge
    Chapter 7 A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining Method
  9. Altmetric Badge
    Chapter 8 Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data
  10. Altmetric Badge
    Chapter 9 Improved Exact Algorithms for Counting 3- and 4-Colorings
  11. Altmetric Badge
    Chapter 10 Connected Coloring Completion for General Graphs: Algorithms and Complexity
  12. Altmetric Badge
    Chapter 11 Quadratic Kernelization for Convex Recoloring of Trees
  13. Altmetric Badge
    Chapter 12 On the Number of Cycles in Planar Graphs
  14. Altmetric Badge
    Chapter 13 An Improved Exact Algorithm for Cubic Graph TSP
  15. Altmetric Badge
    Chapter 14 Geometric Intersection Graphs: Do Short Cycles Help?
  16. Altmetric Badge
    Chapter 15 Dimension, Halfspaces, and the Density of Hard Sets
  17. Altmetric Badge
    Chapter 16 Isolation Concepts for Enumerating Dense Subgraphs
  18. Altmetric Badge
    Chapter 17 Alignments with Non-overlapping Moves, Inversions and Tandem Duplications in O(n 4) Time
  19. Altmetric Badge
    Chapter 18 Counting Minimum Weighted Dominating Sets
  20. Altmetric Badge
    Chapter 19 Online Interval Scheduling: Randomized and Multiprocessor Cases
  21. Altmetric Badge
    Chapter 20 Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
  22. Altmetric Badge
    Chapter 21 Volume Computation Using a Direct Monte Carlo Method
  23. Altmetric Badge
    Chapter 22 Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks
  24. Altmetric Badge
    Chapter 23 Generating Minimal k-Vertex Connected Spanning Subgraphs
  25. Altmetric Badge
    Chapter 24 Finding Many Optimal Paths Without Growing Any Optimal Path Trees
  26. Altmetric Badge
    Chapter 25 Enumerating Constrained Non-crossing Geometric Spanning Trees
  27. Altmetric Badge
    Chapter 26 Colored Simultaneous Geometric Embeddings
  28. Altmetric Badge
    Chapter 27 Properties of Symmetric Incentive Compatible Auctions
  29. Altmetric Badge
    Chapter 28 Finding Equilibria in Games of No Chance
  30. Altmetric Badge
    Chapter 29 Efficient Testing of Forecasts
  31. Altmetric Badge
    Chapter 30 When Does Greedy Learning of Relevant Attributes Succeed?
  32. Altmetric Badge
    Chapter 31 The Informational Content of Canonical Disjoint NP-Pairs
  33. Altmetric Badge
    Chapter 32 On the Representations of NC and Log-Space Real Numbers
  34. Altmetric Badge
    Chapter 33 Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals
  35. Altmetric Badge
    Chapter 34 Streaming Algorithms Measured in Terms of the Computed Quantity
  36. Altmetric Badge
    Chapter 35 A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem
  37. Altmetric Badge
    Chapter 36 Optimal Offline Extraction of Irredundant Motif Bases
  38. Altmetric Badge
    Chapter 37 Linear Algorithm for Broadcasting in Unicyclic Graphs
  39. Altmetric Badge
    Chapter 38 An Improved Algorithm for Online Unit Clustering
  40. Altmetric Badge
    Chapter 39 Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs
  41. Altmetric Badge
    Chapter 40 Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions
  42. Altmetric Badge
    Chapter 41 On the Hardness of Optimization in Power Law Graphs
  43. Altmetric Badge
    Chapter 42 Can a Graph Have Distinct Regular Partitions?
  44. Altmetric Badge
    Chapter 43 Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games
  45. Altmetric Badge
    Chapter 44 Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates
  46. Altmetric Badge
    Chapter 45 On the Complexity of Finding an Unknown Cut Via Vertex Queries
  47. Altmetric Badge
    Chapter 46 “Resistant” Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas
  48. Altmetric Badge
    Chapter 47 An Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity
  49. Altmetric Badge
    Chapter 48 Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats
  50. Altmetric Badge
    Chapter 49 Priority Algorithms for the Subset-Sum Problem
  51. Altmetric Badge
    Chapter 50 Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families
  52. Altmetric Badge
    Chapter 51 A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs
  53. Altmetric Badge
    Chapter 52 Improved Algorithms for Weighted and Unweighted Set Splitting Problems
  54. Altmetric Badge
    Chapter 53 Computing and Combinatorics
  55. Altmetric Badge
    Chapter 54 Approximation Algorithms for the Black and White Traveling Salesman Problem
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

news
1 news outlet
wikipedia
21 Wikipedia pages
q&a
2 Q&A threads

Citations

dimensions_citation
4 Dimensions

Readers on

mendeley
2 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
Computing and Combinatorics
Published by
Springer Science & Business Media, June 2007
DOI 10.1007/978-3-540-73545-8
ISBNs
978-3-54-073544-1, 978-3-54-073545-8
Editors

Guohui Lin

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Student > Bachelor 1 50%
Unknown 1 50%
Readers by discipline Count As %
Nursing and Health Professions 1 50%
Unknown 1 50%