↓ 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 Web as a Graph: Measurements, Models, and Methods
  3. Altmetric Badge
    Chapter 2 Some Observations on the Computational Complexity of Graph Accessibility Problem (Extended Abstract)
  4. Altmetric Badge
    Chapter 3 An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree
  5. Altmetric Badge
    Chapter 4 Theory of 2-3 Heaps
  6. Altmetric Badge
    Chapter 5 An External Memory Data Structure for Shortest Path Queries (Extended Abstract)
  7. Altmetric Badge
    Chapter 6 Approximating the Nearest Neighbor Interchange Distance for Evolutionary Trees with Non-uniform Degrees
  8. Altmetric Badge
    Chapter 7 Signed Genome Rearrangement by Reversals and Transpositions: Models and Approximations
  9. Altmetric Badge
    Chapter 8 An Approximation Algorithm for the Two-Layered Graph Drawing Problem
  10. Altmetric Badge
    Chapter 9 Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs
  11. Altmetric Badge
    Chapter 10 Layout Problems on Lattice Graphs
  12. Altmetric Badge
    Chapter 11 A New Transference Theorem in the Geometry of Numbers
  13. Altmetric Badge
    Chapter 12 On Covering and Rank Problems for Boolean Matrices and Their Applications
  14. Altmetric Badge
    Chapter 13 A Combinatorial Algorithm for Pfaffians
  15. Altmetric Badge
    Chapter 14 How to Swap a Failing Edge of a Single Source Shortest Paths Tree
  16. Altmetric Badge
    Chapter 15 On Bounds for the k -Partitioning of Graphs
  17. Altmetric Badge
    Chapter 16 A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs
  18. Altmetric Badge
    Chapter 17 Probabilities to Accept Languages by Quantum Finite Automata
  19. Altmetric Badge
    Chapter 18 Distributionally-Hard Languages
  20. Altmetric Badge
    Chapter 19 Circuits and Context-Free Languages
  21. Altmetric Badge
    Chapter 20 On the Negation-Limited Circuit Complexity of Merging
  22. Altmetric Badge
    Chapter 21 Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy
  23. Altmetric Badge
    Chapter 22 Efficient Learning of Some Linear Matrix Languages
  24. Altmetric Badge
    Chapter 23 Minimizing Mean Response Time in Batch Processing System
  25. Altmetric Badge
    Chapter 24 Approximation Algorithms for Bounded Facility Location
  26. Altmetric Badge
    Chapter 25 Scheduling Trees onto Hypercubes and Grids Is NP -complete
  27. Altmetric Badge
    Chapter 26 Approximations of Weighted Independent Set and Hereditary Subset Problems
  28. Altmetric Badge
    Chapter 27 Multi-coloring Trees
  29. Altmetric Badge
    Chapter 28 On the Complexity of Approximating Colored-Graph Problems Extended Abstract
  30. Altmetric Badge
    Chapter 29 On the Average Sensitivity of Testing Square-Free Numbers
  31. Altmetric Badge
    Chapter 30 Binary Enumerability of Real Numbers (Extended Abstract)
  32. Altmetric Badge
    Chapter 31 GCD of Many Integers (Extended Abstract)
  33. Altmetric Badge
    Chapter 32 Multi-party Finite Computations
  34. Altmetric Badge
    Chapter 33 Probabilistic Local Majority Voting for the Agreement Problem on Finite Graphs
  35. Altmetric Badge
    Chapter 34 A Dynamic-Programming Bound for the Quadratic Assignment Problem
  36. Altmetric Badge
    Chapter 35 A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases
  37. Altmetric Badge
    Chapter 36 On Routing in Circulant Graphs
  38. Altmetric Badge
    Chapter 37 Minimum Congestion Embedding of Complete Binary Trees into Tori
  39. Altmetric Badge
    Chapter 38 Maximum Stabbing Line in 2D Plane
  40. Altmetric Badge
    Chapter 39 Generalized Shooter Location Problem
  41. Altmetric Badge
    Chapter 40 A Competitive Online Algorithm for the Paging Problem with “Shelf” Memory
  42. Altmetric Badge
    Chapter 41 Using Generalized Forecasts for Online Currency Conversion
  43. Altmetric Badge
    Chapter 42 On S-Regular Prefix-Rewriting Systems and Automatic Structures
  44. Altmetric Badge
    Chapter 43 Tractable and Intractable Second-Order Matching Problems
  45. Altmetric Badge
    Chapter 44 Efficient Fixed-Size Systolic Arrays for the Modular Multiplication
  46. Altmetric Badge
    Chapter 45 Improving Parallel Computation with Fast Integer Sorting
  47. Altmetric Badge
    Chapter 46 A Combinatorial Approach to Performance Analysis of a Shared-Memory Multiprocessor
  48. Altmetric Badge
    Chapter 47 A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation
  49. Altmetric Badge
    Chapter 48 The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

blogs
1 blog
twitter
2 X users
wikipedia
3 Wikipedia pages

Citations

dimensions_citation
5 Dimensions

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
Computing and Combinatorics
Published by
Springer Berlin Heidelberg, May 2003
DOI 10.1007/3-540-48686-0
ISBNs
978-3-54-066200-6, 978-3-54-048686-2
Editors

Asano, Takano, Imai, Hideki, Lee, D. T., Nakano, Shin-ichi, Tokuyama, Takeshi

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.
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 100%
Readers by discipline Count As %
Computer Science 1 100%