↓ Skip to main content

LATIN 2016: Theoretical Informatics

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
  3. Altmetric Badge
    Chapter 2 A Middle Curve Based on Discrete Fréchet Distance
  4. Altmetric Badge
    Chapter 3 Comparison-Based FIFO Buffer Management in QoS Switches
  5. Altmetric Badge
    Chapter 4 Scheduling on Power-Heterogeneous Processors
  6. Altmetric Badge
    Chapter 5 Period Recovery over the Hamming and Edit Distances
  7. Altmetric Badge
    Chapter 6 Chasing Convex Bodies and Functions
  8. Altmetric Badge
    Chapter 7 Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems
  9. Altmetric Badge
    Chapter 8 Parameterized Complexity of Red Blue Set Cover for Lines
  10. Altmetric Badge
    Chapter 9 Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons
  11. Altmetric Badge
    Chapter 10 On Mobile Agent Verifiable Problems
  12. Altmetric Badge
    Chapter 11 Computing Maximal Layers of Points in \(E^{f(n)}\)
  13. Altmetric Badge
    Chapter 12 On the Total Number of Bends for Planar Octilinear Drawings
  14. Altmetric Badge
    Chapter 13 Bidirectional Variable-Order de Bruijn Graphs
  15. Altmetric Badge
    Chapter 14 The Read/Write Protocol Complex Is Collapsible
  16. Altmetric Badge
    Chapter 15 The I/O Complexity of Computing Prime Tables
  17. Altmetric Badge
    Chapter 16 Increasing Diamonds
  18. Altmetric Badge
    Chapter 17 Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs
  19. Altmetric Badge
    Chapter 18 A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs
  20. Altmetric Badge
    Chapter 19 Improved Spanning Ratio for Low Degree Plane Spanners
  21. Altmetric Badge
    Chapter 20 Constructing Consistent Digital Line Segments
  22. Altmetric Badge
    Chapter 21 Faster Information Gathering in Ad-Hoc Radio Tree Networks
  23. Altmetric Badge
    Chapter 22 Stabbing Circles for Sets of Segments in the Plane
  24. Altmetric Badge
    Chapter 23 Faster Algorithms to Enumerate Hypergraph Transversals
  25. Altmetric Badge
    Chapter 24 Listing Acyclic Orientations of Graphs with Single and Multiple Sources
  26. Altmetric Badge
    Chapter 25 Linear-Time Sequence Comparison Using Minimal Absent Words & Applications
  27. Altmetric Badge
    Chapter 26 The Grandmama de Bruijn Sequence for Binary Strings
  28. Altmetric Badge
    Chapter 27 Compressing Bounded Degree Graphs
  29. Altmetric Badge
    Chapter 28 Random Partial Match in Quad-K-d Trees
  30. Altmetric Badge
    Chapter 29 From Discrepancy to Majority
  31. Altmetric Badge
    Chapter 30 On the Planar Split Thickness of Graphs
  32. Altmetric Badge
    Chapter 31 A Bounded-Risk Mechanism for the Kidney Exchange Game
  33. Altmetric Badge
    Chapter 32 Tight Approximations of Degeneracy in Large Graphs
  34. Altmetric Badge
    Chapter 33 Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center
  35. Altmetric Badge
    Chapter 34 Bundled Crossings in Embedded Graphs
  36. Altmetric Badge
    Chapter 35 Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering
  37. Altmetric Badge
    Chapter 36 Deterministic Sparse Suffix Sorting on Rewritable Texts
  38. Altmetric Badge
    Chapter 37 Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings
  39. Altmetric Badge
    Chapter 38 Unshuffling Permutations
  40. Altmetric Badge
    Chapter 39 Generating Random Spanning Trees via Fast Matrix Multiplication
  41. Altmetric Badge
    Chapter 40 Routing in Unit Disk Graphs
  42. Altmetric Badge
    Chapter 41 Graph Drawings with One Bend and Few Slopes
  43. Altmetric Badge
    Chapter 42 Edge-Editing to a Dense and a Sparse Graph Class
  44. Altmetric Badge
    Chapter 43 Containment and Evasion in Stochastic Point Data
  45. Altmetric Badge
    Chapter 44 Tree Compression Using String Grammars
  46. Altmetric Badge
    Chapter 45 Trees and Languages with Periodic Signature
  47. Altmetric Badge
    Chapter 46 Rank Reduction of Directed Graphs by Vertex and Edge Deletions
  48. Altmetric Badge
    Chapter 47 New Deterministic Algorithms for Solving Parity Games
  49. Altmetric Badge
    Chapter 48 Computing a Geodesic Two-Center of Points in a Simple Polygon
  50. Altmetric Badge
    Chapter 49 Simple Approximation Algorithms for Balanced MAX 2SAT
  51. Altmetric Badge
    Chapter 50 A Parameterized Algorithm for Mixed-Cut
  52. Altmetric Badge
    Chapter 51 \((k,n-k)\) -Max-Cut: An \({\mathcal O}^*(2^p)\) -Time Algorithm and a Polynomial Kernel
  53. Altmetric Badge
    Chapter 52 Independent Set of Convex Polygons: From \(n^{\epsilon }\) to \(1+\epsilon \) via Shrinking
Attention for Chapter 13: Bidirectional Variable-Order de Bruijn Graphs
Altmetric Badge

Mentioned by

blogs
1 blog
twitter
2 tweeters

Readers on

mendeley
15 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.
Chapter title
Bidirectional Variable-Order de Bruijn Graphs
Chapter number 13
Book title
LATIN 2016: Theoretical Informatics
Published by
Springer Berlin Heidelberg, January 2016
DOI 10.1007/978-3-662-49529-2_13
Book ISBNs
978-3-66-249528-5, 978-3-66-249529-2
Authors

Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Marco Previtali, Simon J. Puglisi

Editors

Evangelos Kranakis, Gonzalo Navarro, Edgar Chávez

Twitter Demographics

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

Geographical breakdown

Country Count As %
Iran, Islamic Republic of 1 7%
France 1 7%
Unknown 13 87%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 5 33%
Researcher 3 20%
Student > Master 2 13%
Student > Bachelor 1 7%
Professor 1 7%
Other 1 7%
Unknown 2 13%
Readers by discipline Count As %
Computer Science 11 73%
Biochemistry, Genetics and Molecular Biology 1 7%
Unknown 3 20%