↓ Skip to main content

LATIN 2012: Theoretical Informatics

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 A Generalization of the Convex Kakeya Problem
  3. Altmetric Badge
    Chapter 2 Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines
  4. Altmetric Badge
    Chapter 3 Bichromatic 2-Center of Pairs of Points
  5. Altmetric Badge
    Chapter 4 Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs
  6. Altmetric Badge
    Chapter 5 A Better Approximation Ratio and an IP Formulation for a Sensor Cover Problem
  7. Altmetric Badge
    Chapter 6 On the Advice Complexity of the Knapsack Problem
  8. Altmetric Badge
    Chapter 7 Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems
  9. Altmetric Badge
    Chapter 8 On Plane Constrained Bounded-Degree Spanners
  10. Altmetric Badge
    Chapter 9 Space-Efficient Approximation Scheme for Circular Earth Mover Distance
  11. Altmetric Badge
    Chapter 10 Density Classification on Infinite Lattices and Trees
  12. Altmetric Badge
    Chapter 11 Coloring Planar Homothets and Three-Dimensional Hypergraphs
  13. Altmetric Badge
    Chapter 12 An Equivariance Theorem with Applications to Renaming
  14. Altmetric Badge
    Chapter 13 Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks
  15. Altmetric Badge
    Chapter 14 Pseudorandomness of a Random Kronecker Sequence
  16. Altmetric Badge
    Chapter 15 Revisiting the Cache Miss Analysis of Multithreaded Algorithms
  17. Altmetric Badge
    Chapter 16 Parameterized Complexity of MaxSat above Average
  18. Altmetric Badge
    Chapter 17 Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n
  19. Altmetric Badge
    Chapter 18 A O (1/ ε 2 ) n -Time Sieving Algorithm for Approximate Integer Programming
  20. Altmetric Badge
    Chapter 19 Two-Dimensional Range Diameter Queries
  21. Altmetric Badge
    Chapter 20 An Improved Upper Bound on the Density of Universal Random Graphs
  22. Altmetric Badge
    Chapter 21 Logspace Computations in Graph Groups and Coxeter Groups
  23. Altmetric Badge
    Chapter 22 Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points
  24. Altmetric Badge
    Chapter 23 On the Radon Number for P 3 -Convexity
  25. Altmetric Badge
    Chapter 24 Computing Minimum Geodetic Sets of Proper Interval Graphs
  26. Altmetric Badge
    Chapter 25 Hausdorff Rank of Scattered Context-Free Linear Orders
  27. Altmetric Badge
    Chapter 26 Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism
  28. Altmetric Badge
    Chapter 27 On the Non-progressive Spread of Influence through Social Networks
  29. Altmetric Badge
    Chapter 28 Forbidden Patterns
  30. Altmetric Badge
    Chapter 29 Structural Complexity of Multiobjective NP Search Problems
  31. Altmetric Badge
    Chapter 30 k-Gap Interval Graphs
  32. Altmetric Badge
    Chapter 31 Decidability Classes for Mobile Agents Computing
  33. Altmetric Badge
    Chapter 32 NE Is Not NP Turing Reducible to Nonexponentially Dense NP Sets
  34. Altmetric Badge
    Chapter 33 Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width
  35. Altmetric Badge
    Chapter 34 Indexed Multi-pattern Matching
  36. Altmetric Badge
    Chapter 35 New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting
  37. Altmetric Badge
    Chapter 36 Cache Me If You Can: Capacitated Selfish Replication Games
  38. Altmetric Badge
    Chapter 37 The Efficiency of MapReduce in Parallel External Memory
  39. Altmetric Badge
    Chapter 38 Algorithms for Some H -Join Decompositions
  40. Altmetric Badge
    Chapter 39 On the Bend-Number of Planar and Outerplanar Graphs
  41. Altmetric Badge
    Chapter 40 Hiring above the m -th Best Candidate: A Generalization of Records in Permutations
  42. Altmetric Badge
    Chapter 41 On the Performance of Smith’s Rule in Single-Machine Scheduling with Nonlinear Cost
  43. Altmetric Badge
    Chapter 42 Advantage of Overlapping Clusters for Minimizing Conductance
  44. Altmetric Badge
    Chapter 43 Independence of Tabulation-Based Hash Classes
  45. Altmetric Badge
    Chapter 44 Oblivious Two-Way Finite Automata: Decidability and Complexity
  46. Altmetric Badge
    Chapter 45 Clique-Colouring and Biclique-Colouring Unichord-Free Graphs
  47. Altmetric Badge
    Chapter 46 Random Walks and Bisections in Random Circulant Graphs
  48. Altmetric Badge
    Chapter 47 The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem
  49. Altmetric Badge
    Chapter 48 Fully Analyzing an Algebraic Pólya Urn Model
  50. Altmetric Badge
    Chapter 49 Degree-Constrained Node-Connectivity
  51. Altmetric Badge
    Chapter 50 Survivable Network Activation Problems
  52. Altmetric Badge
    Chapter 51 On the Integrality Gap of the Subtour LP for the 1,2-TSP
  53. Altmetric Badge
    Chapter 52 A Theory and Algorithms for Combinatorial Reoptimization
  54. Altmetric Badge
    Chapter 53 Capacity Achieving Two-Write WOM Codes
  55. Altmetric Badge
    Chapter 54 The Relationship between Inner Product and Counting Cycles
  56. Altmetric Badge
    Chapter 55 Approximating Minimum Label s - t Cut via Linear Programming
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 tweeter

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
25 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 2012: Theoretical Informatics
Published by
Springer Berlin Heidelberg, April 2012
DOI 10.1007/978-3-642-29344-3
ISBNs
978-3-64-229343-6, 978-3-64-229344-3
Editors

Fernández-Baca, David, Fernández-Baca, David

Twitter Demographics

The data shown below were collected from the profile of 1 tweeter who shared this research output. Click here to find out more about how the information was compiled.

Mendeley readers

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

Geographical breakdown

Country Count As %
Israel 1 4%
United States 1 4%
Canada 1 4%
Unknown 22 88%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 4 16%
Student > Bachelor 2 8%
Researcher 2 8%
Librarian 1 4%
Student > Master 1 4%
Other 2 8%
Unknown 13 52%
Readers by discipline Count As %
Computer Science 5 20%
Engineering 3 12%
Linguistics 1 4%
Psychology 1 4%
Social Sciences 1 4%
Other 1 4%
Unknown 13 52%