Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 36 results in range #1 to #36.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

  1. On Trade-Offs in External-Memory Diameter-Approximation: Label: en
  2. Online Compression Caching: Label: en
  3. Parameterized Computational Complexity of Dodgson and Young Elections: Label: en
  4. Computing the Greedy Spanner in Near-Quadratic Time: Label: en
  5. The Kinetic Facility Location Problem: Label: en
  6. Spanners of Additively Weighted Point Sets: Label: en
  7. A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs: Label: en
  8. On a Special Co-cycle Basis of Graphs: Label: en
  9. Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs: Label: en
  10. A Preemptive Algorithm for Maximizing Disjoint Paths on Trees: Label: en
  11. Packing Rectangles into 2OPT Bins Using Rotations: Label: en
  12. On Covering Problems of Rado: Label: en
  13. On Metric Clustering to Minimize the Sum of Radii: Label: en
  14. On the Locality of Extracting a 2-Manifold in: Label: en
  15. Reoptimization of Steiner Trees: Label: en
  16. Distributed Disaster Disclosure: Label: en
  17. Boundary Labeling with Octilinear Leaders: Label: en
  18. A Path Cover Technique for LCAs in Dags: Label: en
  19. Approximating the Interval Constrained Coloring Problem: Label: en
  20. Batch Coloring Flat Graphs and Thin: Label: en
  21. An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees: Label: en
  22. A Uniform Approach Towards Succinct Representation of Trees: Label: en
  23. Confluently Persistent Tries for Efficient Version Control: Label: en
  24. On the Redundancy of Succinct Data Structures: Label: en
  25. Data Structures with Local Update Operations: Label: en
  26. Bounded Unpopularity Matchings: Label: en
  27. The Maximum Energy-Constrained Dynamic Flow Problem: Label: en
  28. Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint: Label: en
  29. Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem: Label: en
  30. Improved Bounds for Wireless Localization: Label: en
  31. Angle Optimization in Target Tracking: Label: en
  32. Vision-Based Pursuit-Evasion in a Grid: Label: en
  33. Guarding Art Galleries: The Extra Cost for Sculptures Is Linear: Label: en
  34. I/O Efficient Dynamic Data Structures for Longest Prefix Queries: Label: en
  35. Uniquely Represented Data Structures for Computational Geometry: Label: en
  36. Simplified Planar Coresets for Data Streams: Label: en

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)