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 50 results in range #51 to #100.

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

  1. A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem: Label: en
  2. Enumerating Isolated Cliques in Synthetic and Financial Networks: Label: en
  3. On the Surface Area of the (n, k)-Star Graph: Label: en
  4. Towards Minimum Delay Broadcasting and Multicasting in Multihop Wireless Networks: Label: en
  5. Greedy Algorithm for Least Privilege in RBAC Model: Label: en
  6. A New Approximation Algorithm for the Selective Single-Sink Buy-at-Bulk Problem in Network Design: Label: en
  7. On the Two-Stage Stochastic Graph Partitioning Problem: Label: en
  8. A Note on Treewidth in Random Graphs: Label: en
  9. On Unique Games with Negative Weights: Label: en
  10. A Semantic Model for Many-Core Parallel Computing: Label: en
  11. Kinetic Red-Blue Minimum Separating Circle: Label: en
  12. On the Partition of 3-Colorable Graphs: Label: en
  13. Tractable Feedback Vertex Sets in Restricted Bipartite Graphs: Label: en
  14. On the Surface Area of the Asymmetric Twisted Cube: Label: en
  15. Approximation Algorithms for a Bi-level Knapsack Problem: Label: en
  16. One-and-a-Half-Side Boundary Labeling: Label: en
  17. Improved Algorithms for Farthest Colored Voronoi Diagram of Segments: Label: en
  18. A Saturation Algorithm for Homogeneous Binomial Ideals: Label: en
  19. Integration of an LP Solver into Interval Constraint Propagation: Label: en
  20. On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem: Label: en
  21. Complexity of the Stamp Folding Problem: Label: en
  22. Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem: Label: en
  23. Minimum Interval Cover and Its Application to Genome Sequencing: Label: en
  24. Algorithmic Aspects of Heterogeneous Biological Networks Comparison: Label: en
  25. Mechanisms for Obnoxious Facility Game on a Path: Label: en
  26. Quickest Paths in Anisotropic Media: Label: en
  27. On the Maximum Locally Clustered Subgraph and Some Related Problems: Label: en
  28. A Near-Optimal Memoryless Online Algorithm for FIFO Buffering Two Packet Classes: Label: en
  29. Minimum Latency Data Aggregation in Wireless Sensor Network with Directional Antenna: Label: en
  30. Public Communication Based on Russian Cards Protocol: A Case Study: Label: en
  31. Approximation Algorithms for Minimum Energy Multicast Routing with Reception Cost in Wireless Sensor Networks: Label: en
  32. Further Improvement on Maximum Independent Set in Degree-4 Graphs: Label: en
  33. List Dynamic Coloring of Sparse Graphs: Label: en
  34. Euclidean Chains and Their Shortcuts: Label: en
  35. Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem: Label: en
  36. Restricted Edge Connectivity of Harary Graphs: Label: en
  37. A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unreliable Edges: Label: en
  38. Hamiltonian Cycles through Prescribed Edges in k-Ary n-Cubes: Label: en
  39. Algebraic Algorithm for Scheduling Data Retrieval in Multi-channel Wireless Data Broadcast Environments: Label: en
  40. Optimal Policy for Single-Machine Scheduling with Deterioration Effects, Learning Effects, Setup Times, and Availability Constraints: Label: en
  41. A Comprehensive Study of an Online Packet Scheduling Algorithm: Label: en
  42. Heuristics for Parallel Machine Scheduling with Deterioration Effect: Label: en
  43. Hybrid Artificial Bee Colony Search Algorithm Based on Disruptive Selection for Examination Timetabling Problems: Label: en
  44. Algorithms for Testing Monomials in Multivariate Polynomials: Label: en
  45. The Complexity of Testing Monomials in Multivariate Polynomials: Label: en
  46. An Algorithm with Better Approximation Ratio for Multicast Traffic in Unidirectional SONET/WDM Rings: Label: en
  47. Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings: Label: en
  48. Minimum Energy Broadcast Routing in Ad Hoc and Sensor Networks with Directional Antennas: Label: en
  49. A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless Networks: Label: en
  50. Fault-Tolerant Routing: k-Inconnected Many-to-One Routing in Wireless Networks: Label: en

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