Computing and Combinatorics

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Theoretical Problems Related to the Internet
3. Altmetric Badge
   Chapter 2 Recent Progress and Prospects for Integer Factorisation Algorithms
4. Altmetric Badge
   Chapter 3 Approximating Uniform Triangular Meshes in Polygons
5. Altmetric Badge
   Chapter 4 Maximum Induced Matchings of Random Cubic Graphs
6. Altmetric Badge
   Chapter 5 A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems
7. Altmetric Badge
   Chapter 6 On Local Transformation of Polygons with Visibility Properties
8. Altmetric Badge
   Chapter 7 Embedding Problems for Paths with Direction Constrained Edges
9. Altmetric Badge
   Chapter 8 Characterization of Level Non-planar Graphs by Minimal Patterns
10. Altmetric Badge
    Chapter 9 Rectangular Drawings of Plane Graphs Without Designated Corners
11. Altmetric Badge
    Chapter 10 Computing Optimal Embeddings for Planar Graphs
12. Altmetric Badge
    Chapter 11 Approximation Algorithms for Independent Sets in Map Graphs
13. Altmetric Badge
    Chapter 12 Hierarchical Topological Inference on Planar Disc Maps
14. Altmetric Badge
    Chapter 13 Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs
15. Altmetric Badge
    Chapter 14 Parameterized Complexity of Finding Subgraphs with Hereditary Properties
16. Altmetric Badge
    Chapter 15 Some Results on Tries with Adaptive Branching
17. Altmetric Badge
    Chapter 16 Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound
18. Altmetric Badge
    Chapter 17 Closure Properties of Real Number Classes under Limits and Computable Operators
19. Altmetric Badge
    Chapter 18 A Characterization of Graphs with Vertex Cover Six
20. Altmetric Badge
    Chapter 19 On the Monotonicity of Minimum Diameter with Respect to Order and Maximum Out-Degree
21. Altmetric Badge
    Chapter 20 Online Independent Sets
22. Altmetric Badge
    Chapter 21 Two-Dimensional On-Line Bin Packing Problem with Rotatable Items
23. Altmetric Badge
    Chapter 22 Better Bounds on the Accommodating Ratio for the Seat Reservation Problem
24. Altmetric Badge
    Chapter 23 Ordinal On-Line Scheduling on Two Uniform Machines
25. Altmetric Badge
    Chapter 24 Agents, Distributed Algorithms, and Stabilization
26. Altmetric Badge
    Chapter 25 A Fast Sorting Algorithm and Its Generalization on Broadcast Communications
27. Altmetric Badge
    Chapter 26 Efficient List Ranking Algorithms on Reconfigurable Mesh
28. Altmetric Badge
    Chapter 27 Tripods Do Not Pack Densely
29. Altmetric Badge
    Chapter 28 An Efficient k Nearest Neighbor Searching Algorithm for a Query Line
30. Altmetric Badge
    Chapter 29 Tetrahedralization of Two Nested Convex Polyhedra
31. Altmetric Badge
    Chapter 30 Efficient Algorithms for Two-Center Problems for a Convex Polygon
32. Altmetric Badge
    Chapter 31 On Computation of Arbitrage for Markets with Friction
33. Altmetric Badge
    Chapter 32 On Some Optimization Problems in Obnoxious Facility Location
34. Altmetric Badge
    Chapter 33 Generating Necklaces and Strings with Forbidden Substrings
35. Altmetric Badge
    Chapter 34 Optimal Labelling of Point Features in the Slider Model
36. Altmetric Badge
    Chapter 35 Mappings for Conflict-Free Access of Paths in Elementary Data Structures
37. Altmetric Badge
    Chapter 36 Theory of Trinomial Heaps
38. Altmetric Badge
    Chapter 37 Polyhedral Aspects of the Consecutive Ones Problem
39. Altmetric Badge
    Chapter 38 The Complexity of Physical Mapping with Strict Chimerism
40. Altmetric Badge
    Chapter 39 Logical Analysis of Data with Decomposable Structures
41. Altmetric Badge
    Chapter 40 Learning from Approximate Data
42. Altmetric Badge
    Chapter 41 A Combinatorial Approach to Asymmetric Traitor Tracing
43. Altmetric Badge
    Chapter 42 Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs
44. Altmetric Badge
    Chapter 43 One-Way Probabilistic Reversible and Quantum One-Counter Automata
45. Altmetric Badge
    Chapter 44 Similarity Enrichment in Image Compression through Weighted Finite Automata
46. Altmetric Badge
    Chapter 45 On the Power of Input-Synchronized Alternating Finite Automata
47. Altmetric Badge
    Chapter 46 Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction