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 26 results in range #201 to #226.

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

  1. On Star-Cover and Path-Cover of a Tree: Label: en
  2. Calculating the Crossing Probability on the Square Tessellation of a Connection Game with Random Move Order: The Algorithm and Its Complexity: Label: en
  3. Finding Simple Paths on Given Points in a Polygonal Region: Label: en
  4. Oblivious Integral Routing for Minimizing the Quadratic Polynomial Cost: Label: en
  5. Improved Approximation Algorithm for Maximum Agreement Forest of Two Trees: Label: en
  6. Approximation Algorithms for Bandwidth Consecutive Multicolorings: Label: en
  7. The PoA of Scheduling Game with Machine Activation Costs: Label: en
  8. Approximation Algorithms on Consistent Dynamic Map Labeling: Label: en
  9. Parallel-Machine Scheduling Problem under the Job Rejection Constraint: Label: en
  10. Minimal Double Dominating Sets in Trees: Label: en
  11. Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time: Label: en
  12. A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations: Label: en
  13. Spanning Distribution Forests of Graphs: Label: en
  14. Monotone Grid Drawings of Planar Graphs: Label: en
  15. Improved LP-rounding Approximations for the k-Disjoint Restricted Shortest Paths Problem: Label: en
  16. Randomized Parameterized Algorithms for Co-path Set Problem: Label: en
  17. Combining Edge Weight and Vertex Weight for Minimum Vertex Cover Problem: Label: en
  18. The Complexity of Zero-Visibility Cops and Robber: Label: en
  19. Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints: Label: en
  20. A Circular Matrix-Merging Algorithm with Application in VMAT Radiation Therapy: Label: en
  21. A Fixed-Parameter Approach for Privacy-Protection with Global Recoding: Label: en
  22. Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear Time: Label: en
  23. Minimizing energy on homogeneous processors with shared memory: Label: en
  24. Buffer minimization with conflicts on a line: Label: en
  25. New approximation algorithms for the minimum cycle cover problem: Label: en
  26. A strongly polynomial time algorithm for the maximum supply rate problem on trees: Label: en

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