↓ Skip to main content

LATIN 2014: Theoretical Informatics

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Conjugacy in Baumslag’s Group, Generic Case Complexity, and Division in Power Circuits
  3. Altmetric Badge
    Chapter 2 Hierarchical Complexity of 2-Clique-Colouring Weakly Chordal Graphs and Perfect Graphs Having Cliques of Size at Least 3
  4. Altmetric Badge
    Chapter 3 The Computational Complexity of the Game of Set and Its Theoretical Applications
  5. Altmetric Badge
    Chapter 4 Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line
  6. Altmetric Badge
    Chapter 5 Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds
  7. Altmetric Badge
    Chapter 6 False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time
  8. Altmetric Badge
    Chapter 7 A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width
  9. Altmetric Badge
    Chapter 8 Optimal Algorithms for Constrained 1-Center Problems
  10. Altmetric Badge
    Chapter 9 A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters
  11. Altmetric Badge
    Chapter 10 Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs
  12. Altmetric Badge
    Chapter 11 Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time
  13. Altmetric Badge
    Chapter 12 The Planar Slope Number of Subcubic Graphs
  14. Altmetric Badge
    Chapter 13 Smooth Orthogonal Drawings of Planar Graphs
  15. Altmetric Badge
    Chapter 14 Drawing HV -Restricted Planar Graphs
  16. Altmetric Badge
    Chapter 15 Periodic Planar Straight-Frame Drawings with Polynomial Resolution
  17. Altmetric Badge
    Chapter 16 A Characterization of Those Automata That Structurally Generate Finite Groups
  18. Altmetric Badge
    Chapter 17 Linear Grammars with One-Sided Contexts and Their Automaton Representation
  19. Altmetric Badge
    Chapter 18 On the Computability of Relations on λ -Terms and Rice’s Theorem - The Case of the Expansion Problem for Explicit Substitutions
  20. Altmetric Badge
    Chapter 19 Computing in the Presence of Concurrent Solo Executions
  21. Altmetric Badge
    Chapter 20 Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems
  22. Altmetric Badge
    Chapter 21 (Total) Vector Domination for Graphs with Bounded Branchwidth
  23. Altmetric Badge
    Chapter 22 Computing the Degeneracy of Large Graphs
  24. Altmetric Badge
    Chapter 23 Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems
  25. Altmetric Badge
    Chapter 24 An Improved Data Stream Algorithm for Clustering
  26. Altmetric Badge
    Chapter 25 Approximation Algorithms for the Gromov Hyperbolicity of Discrete Metric Spaces
  27. Altmetric Badge
    Chapter 26 A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras
  28. Altmetric Badge
    Chapter 27 Helly-Type Theorems in Property Testing
  29. Altmetric Badge
    Chapter 28 New Bounds for Online Packing LPs
  30. Altmetric Badge
    Chapter 29 Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles
  31. Altmetric Badge
    Chapter 30 Collision-Free Network Exploration
  32. Altmetric Badge
    Chapter 31 Powers of Hamilton Cycles in Pseudorandom Graphs
  33. Altmetric Badge
    Chapter 32 Local Update Algorithms for Random Graphs
  34. Altmetric Badge
    Chapter 33 Odd Graphs Are Prism-Hamiltonian and Have a Long Cycle
  35. Altmetric Badge
    Chapter 34 Relatively Bridge-Addable Classes of Graphs
  36. Altmetric Badge
    Chapter 35 O ( n ) Time Algorithms for Dominating Induced Matching Problems
  37. Altmetric Badge
    Chapter 36 Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation
  38. Altmetric Badge
    Chapter 37 Convexity in Partial Cubes: The Hull Number
  39. Altmetric Badge
    Chapter 38 Connected Greedy Colourings
  40. Altmetric Badge
    Chapter 39 On the Number of Prefix and Border Tables
  41. Altmetric Badge
    Chapter 40 Probabilities of 2-Xor Functions
  42. Altmetric Badge
    Chapter 41 Equivalence Classes of Random Boolean Trees and Application to the Catalan Satisfiability Problem
  43. Altmetric Badge
    Chapter 42 The Flip Diameter of Rectangulations and Convex Subdivisions
  44. Altmetric Badge
    Chapter 43 Weighted Staircase Tableaux, Asymmetric Exclusion Process, and Eulerian Type Recurrences
  45. Altmetric Badge
    Chapter 44 Counting and Generating Permutations Using Timed Languages
  46. Altmetric Badge
    Chapter 45 Semantic Word Cloud Representations: Hardness and Approximation Algorithms
  47. Altmetric Badge
    Chapter 46 The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction
  48. Altmetric Badge
    Chapter 47 Complexity of Coloring Graphs without Paths and Cycles
  49. Altmetric Badge
    Chapter 48 Approximating Real-Time Scheduling on Identical Machines
  50. Altmetric Badge
    Chapter 49 Integrated Supply Chain Management via Randomized Rounding
  51. Altmetric Badge
    Chapter 50 The Online Connected Facility Location Problem
  52. Altmetric Badge
    Chapter 51 Multiply Balanced k  −Partitioning
  53. Altmetric Badge
    Chapter 52 On Some Recent Approximation Algorithms for MAX SAT
  54. Altmetric Badge
    Chapter 53 Packet Forwarding Algorithms in a Line Network
  55. Altmetric Badge
    Chapter 54 Survivability of Swarms of Bouncing Robots
  56. Altmetric Badge
    Chapter 55 Emergence of Wave Patterns on Kadanoff Sandpiles
  57. Altmetric Badge
    Chapter 56 A Divide and Conquer Method to Compute Binomial Ideals
  58. Altmetric Badge
    Chapter 57 How Fast Can We Multiply Large Integers on an Actual Computer?
  59. Altmetric Badge
    Chapter 58 Sorting Permutations by Prefix and Suffix Versions of Reversals and Transpositions
  60. Altmetric Badge
    Chapter 59 Algorithmic and Hardness Results for the Colorful Components Problems
  61. Altmetric Badge
    Chapter 60 On the stability of generalized second price auctions with budgets
  62. Altmetric Badge
    Chapter 61 Approximation Algorithms for the Max-Buying Problem with Limited Supply
  63. Altmetric Badge
    Chapter 62 Budget Feasible Mechanisms for Experimental Design
  64. Altmetric Badge
    Chapter 63 LZ77-Based Self-indexing with Faster Pattern Matching
  65. Altmetric Badge
    Chapter 64 Quad- K -d Trees
  66. Altmetric Badge
    Chapter 65 Biased Predecessor Search
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

blogs
1 blog
twitter
9 tweeters
wikipedia
1 Wikipedia page

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
6 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 2014: Theoretical Informatics
Published by
Springer Berlin Heidelberg, March 2014
DOI 10.1007/978-3-642-54423-1
ISBNs
978-3-64-254422-4, 978-3-64-254423-1
Editors

Pardo, Alberto, Viola, Alfredo

Twitter Demographics

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

Geographical breakdown

Country Count As %
Unknown 6 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 17%
Professor > Associate Professor 1 17%
Unknown 4 67%
Readers by discipline Count As %
Computer Science 1 17%
Unknown 5 83%