↓ 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 Unpredictable Deviousness of Models
  3. Altmetric Badge
    Chapter 2 Security Issues in Collaborative Computing
  4. Altmetric Badge
    Chapter 3 A Simplicial Approach for Discrete Fixed Point Theorems
  5. Altmetric Badge
    Chapter 4 On Incentive Compatible Competitive Selection Protocol
  6. Altmetric Badge
    Chapter 5 Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands
  7. Altmetric Badge
    Chapter 6 Aggregating Strategy for Online Auctions
  8. Altmetric Badge
    Chapter 7 On Indecomposability Preserving Elimination Sequences
  9. Altmetric Badge
    Chapter 8 Improved Algorithms for the Minmax Regret 1-Median Problem
  10. Altmetric Badge
    Chapter 9 Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size
  11. Altmetric Badge
    Chapter 10 Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
  12. Altmetric Badge
    Chapter 11 Varieties Generated by Certain Models of Reversible Finite Automata
  13. Altmetric Badge
    Chapter 12 Iterated TGR Languages: Membership Problem and Effective Closure Properties
  14. Altmetric Badge
    Chapter 13 On the Negation-Limited Circuit Complexity of Sorting and Inverting k -tonic Sequences
  15. Altmetric Badge
    Chapter 14 Robust Quantum Algorithms with ε -Biased Oracles
  16. Altmetric Badge
    Chapter 15 The Complexity of Black-Box Ring Problems
  17. Altmetric Badge
    Chapter 16 Lower Bounds and Parameterized Approach for Longest Common Subsequence
  18. Altmetric Badge
    Chapter 17 Finding Patterns with Variable Length Gaps or Don’t Cares
  19. Altmetric Badge
    Chapter 18 The Matrix Orthogonal Decomposition Problem in Intensity-Modulated Radiation Therapy
  20. Altmetric Badge
    Chapter 19 A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
  21. Altmetric Badge
    Chapter 20 A PTAS for Cutting Out Polygons with Lines
  22. Altmetric Badge
    Chapter 21 On Unfolding Lattice Polygons/Trees and Diameter-4 Trees
  23. Altmetric Badge
    Chapter 22 Restricted Mesh Simplification Using Edge Contractions
  24. Altmetric Badge
    Chapter 23 Enumerating Non-crossing Minimally Rigid Frameworks
  25. Altmetric Badge
    Chapter 24 Sequences Characterizing k -Trees
  26. Altmetric Badge
    Chapter 25 On the Threshold of Having a Linear Treewidth in Random Graphs
  27. Altmetric Badge
    Chapter 26 Reconciling Gene Trees with Apparent Polytomies
  28. Altmetric Badge
    Chapter 27 Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes
  29. Altmetric Badge
    Chapter 28 Computing Maximum-Scoring Segments in Almost Linear Time
  30. Altmetric Badge
    Chapter 29 Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants
  31. Altmetric Badge
    Chapter 30 A Detachment Algorithm for Inferring a Graph from Path Frequency
  32. Altmetric Badge
    Chapter 31 The d -Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm
  33. Altmetric Badge
    Chapter 32 Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
  34. Altmetric Badge
    Chapter 33 On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
  35. Altmetric Badge
    Chapter 34 Improved On-Line Broadcast Scheduling with Deadlines
  36. Altmetric Badge
    Chapter 35 A Tight Analysis of Most-Requested-First for On-Demand Data Broadcast
  37. Altmetric Badge
    Chapter 36 On Lazy Bin Covering and Packing Problems
  38. Altmetric Badge
    Chapter 37 Creation and Growth of Components in a Random Hypergraph Process
  39. Altmetric Badge
    Chapter 38 Optimal Acyclic Edge Colouring of Grid Like Graphs
  40. Altmetric Badge
    Chapter 39 An Edge Ordering Problem of Regular Hypergraphs
  41. Altmetric Badge
    Chapter 40 Efficient Partially Blind Signature Scheme with Provable Security
  42. Altmetric Badge
    Chapter 41 A Rigorous Analysis for Set-Up Time Models – A Metric Perspective
  43. Altmetric Badge
    Chapter 42 Geometric Representation of Graphs in Low Dimension
  44. Altmetric Badge
    Chapter 43 The On-Line Heilbronn’s Triangle Problem in d Dimensions
  45. Altmetric Badge
    Chapter 44 Counting d -Dimensional Polycubes and Nonrectangular Planar Polyominoes
  46. Altmetric Badge
    Chapter 45 Approximating Min-Max (Regret) Versions of Some Polynomial Problems
  47. Altmetric Badge
    Chapter 46 The Class Constrained Bin Packing Problem with Applications to Video-on-Demand
  48. Altmetric Badge
    Chapter 47 MAX-SNP Hardness and Approximation of Selected-Internal Steiner Trees
  49. Altmetric Badge
    Chapter 48 Minimum Clique Partition Problem with Constrained Weight for Interval Graphs
  50. Altmetric Badge
    Chapter 49 Overlap-Free Regular Languages
  51. Altmetric Badge
    Chapter 50 On the Combinatorial Representation of Information
  52. Altmetric Badge
    Chapter 51 Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard
  53. Altmetric Badge
    Chapter 52 Bimodal Crossing Minimization
  54. Altmetric Badge
    Chapter 53 Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
  55. Altmetric Badge
    Chapter 54 On the Effectiveness of the Linear Programming Relaxation of the 0-1 Multi-commodity Minimum Cost Network Flow Problem
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
3 Wikipedia pages

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
16 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, July 2006
DOI 10.1007/11809678
ISBNs
978-3-54-036925-7, 978-3-54-036926-4
Editors

Chen, Danny Z., Lee, D. T.

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
United States 2 13%
Italy 1 6%
Unknown 13 81%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 5 31%
Researcher 4 25%
Other 3 19%
Student > Master 2 13%
Student > Postgraduate 1 6%
Other 1 6%
Readers by discipline Count As %
Agricultural and Biological Sciences 8 50%
Computer Science 5 31%
Unspecified 3 19%