↓ Skip to main content

LATIN 2018: Theoretical Informatics

Overview of attention for book
Cover of 'LATIN 2018: Theoretical Informatics'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness
  3. Altmetric Badge
    Chapter 2 Approximate Correlation Clustering Using Same-Cluster Queries
  4. Altmetric Badge
    Chapter 3 Finding Tight Hamilton Cycles in Random Hypergraphs Faster
  5. Altmetric Badge
    Chapter 4 Walking Through Waypoints
  6. Altmetric Badge
    Chapter 5 A Collection of Lower Bounds for Online Matching on the Line
  7. Altmetric Badge
    Chapter 6 On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths
  8. Altmetric Badge
    Chapter 7 Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets
  9. Altmetric Badge
    Chapter 8 A Polynomial Sized Kernel for Tracking Paths Problem
  10. Altmetric Badge
    Chapter 9 Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees
  11. Altmetric Badge
    Chapter 10 Approximate Nearest Neighbor Search for $$\ell _p$$ -Spaces $$(2
  12. Altmetric Badge
    Chapter 11 The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model
  13. Altmetric Badge
    Chapter 12 Partitioning Orthogonal Histograms into Rectangular Boxes
  14. Altmetric Badge
    Chapter 13 Compact Self-Stabilizing Leader Election for General Networks
  15. Altmetric Badge
    Chapter 14 Random Walks with Multiple Step Lengths
  16. Altmetric Badge
    Chapter 15 Tight Kernels for Covering and Hitting: P oint H yperplane C over and P olynomial P oint H itting S et
  17. Altmetric Badge
    Chapter 16 A Tight Bound for Shortest Augmenting Paths on Trees
  18. Altmetric Badge
    Chapter 17 Approximation Algorithms for Replenishment Problems with Fixed Turnover Times
  19. Altmetric Badge
    Chapter 18 Maximum Box Problem on Stochastic Points
  20. Altmetric Badge
    Chapter 19 The Online Set Aggregation Problem
  21. Altmetric Badge
    Chapter 20 Agglomerative Clustering of Growing Squares
  22. Altmetric Badge
    Chapter 21 Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions
  23. Altmetric Badge
    Chapter 22 Property Suffix Array with Applications
  24. Altmetric Badge
    Chapter 23 Competitive Algorithms for Demand Response Management in Smart Grid
  25. Altmetric Badge
    Chapter 24 An Average-Case Lower Bound Against  $$\mathsf {ACC}^0$$ ACC 0
  26. Altmetric Badge
    Chapter 25 Compressed Indexing with Signature Grammars
  27. Altmetric Badge
    Chapter 26 Combinatorics of Beacon-Based Routing in Three Dimensions
  28. Altmetric Badge
    Chapter 27 On Split $$B_1$$ B 1 -EPG Graphs
  29. Altmetric Badge
    Chapter 28 Efficient Algorithms for Computing a Minimal Homology Basis
  30. Altmetric Badge
    Chapter 29 Shifting the Phase Transition Threshold for Random Graphs Using Degree Set Constraints
  31. Altmetric Badge
    Chapter 30 On the Biased Partial Word Collector Problem
  32. Altmetric Badge
    Chapter 31 Constructive Ramsey Numbers for Loose Hyperpaths
  33. Altmetric Badge
    Chapter 32 Cache Oblivious Sparse Matrix Multiplication
  34. Altmetric Badge
    Chapter 33 Don’t Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading
  35. Altmetric Badge
    Chapter 34 Probabilistic Analysis of Online (Class-Constrained) Bin Packing and Bin Covering
  36. Altmetric Badge
    Chapter 35 Locating the Eigenvalues for Graphs of Small Clique-Width
  37. Altmetric Badge
    Chapter 36 On the Approximation Ratio of Lempel-Ziv Parsing
  38. Altmetric Badge
    Chapter 37 Kernelization for Maximum Happy Vertices Problem
  39. Altmetric Badge
    Chapter 38 When is Red-Blue Nonblocker Fixed-Parameter Tractable?
  40. Altmetric Badge
    Chapter 39 Incremental Strong Connectivity and 2-Connectivity in Directed Graphs
  41. Altmetric Badge
    Chapter 40 Efficient Algorithms for Listing k Disjoint st -Paths in Graphs
  42. Altmetric Badge
    Chapter 41 Transversals of Longest Cycles in Chordal and Bounded Tree-Width Graphs
  43. Altmetric Badge
    Chapter 42 Majority Model on Random Regular Graphs
  44. Altmetric Badge
    Chapter 43 Property Testing for Point Sets on the Plane
  45. Altmetric Badge
    Chapter 44 Maximal and Convex Layers of Random Point Sets
  46. Altmetric Badge
    Chapter 45 Plane Gossip: Approximating Rumor Spread in Planar Graphs
  47. Altmetric Badge
    Chapter 46 Algorithms and Bounds for Very Strong Rainbow Coloring
  48. Altmetric Badge
    Chapter 47 New Integer Linear Programming Models for the Vertex Coloring Problem
  49. Altmetric Badge
    Chapter 48 Submodular Maximization with Uncertain Knapsack Capacity
  50. Altmetric Badge
    Chapter 49 Select and Permute: An Improved Online Framework for Scheduling to Minimize Weighted Completion Time
  51. Altmetric Badge
    Chapter 50 Recognizing Generalized Transmission Graphs of Line Segments and Circular Sectors
  52. Altmetric Badge
    Chapter 51 A Tight Lower Bound for an Online Hypercube Packing Problem and Bounds for Prices of Anarchy of a Related Game
  53. Altmetric Badge
    Chapter 52 The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue
  54. Altmetric Badge
    Chapter 53 Satisfying Neighbor Preferences on a Circle
  55. Altmetric Badge
    Chapter 54 Two-Dimensional Knapsack for Circles
  56. Altmetric Badge
    Chapter 55 Scheduling Parallelizable Jobs Online to Maximize Throughput
  57. Altmetric Badge
    Chapter 56 Reactive Proximity Data Structures for Graphs
  58. Altmetric Badge
    Chapter 57 Mutants and Residents with Different Connection Graphs in the Moran Process
  59. Altmetric Badge
    Chapter 58 A Framework for Algorithm Stability and Its Application to Kinetic Euclidean MSTs
  60. Altmetric Badge
    Chapter 59 Rapid Mixing of k -Class Biased Permutations
  61. Altmetric Badge
    Chapter 60 Transition Operations over Plane Trees
  62. Altmetric Badge
    Chapter 61 Analysis of the Continued Logarithm Algorithm
  63. Altmetric Badge
    Chapter 62 Quadratic Simulations of Merlin–Arthur Games
  64. Altmetric Badge
    Chapter 63 On Counting Perfect Matchings in General Graphs
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
7 X users
facebook
1 Facebook page
wikipedia
1 Wikipedia page

Readers on

mendeley
4 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
LATIN 2018: Theoretical Informatics
Published by
Springer International Publishing, March 2018
DOI 10.1007/978-3-319-77404-6
ISBNs
978-3-31-977403-9, 978-3-31-977404-6
Editors

Bender, Michael A., Farach-Colton, Martín, Mosteiro, Miguel A.

X Demographics

X Demographics

The data shown below were collected from the profiles of 7 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 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 4 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 25%
Student > Doctoral Student 1 25%
Unknown 2 50%
Readers by discipline Count As %
Computer Science 1 25%
Energy 1 25%
Unknown 2 50%