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. Maximum Edge Bicliques in Tree Convex Bipartite Graphs: Label: en
  2. On Computational Aspects of Greedy Partitioning of Graphs: Label: en
  3. The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments: Label: en
  4. On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model: Label: en
  5. On the Complexity of Minimizing the Total Calibration Cost: Label: en
  6. Finding Disjoint Dense Clubs in an Undirected Graph: Label: en
  7. On the Lower Bounds of Random Max 3 and 4-SAT: Label: en
  8. Parallel Identifying (l,d)-Motifs in Biosequences Using CPU and GPU Computing: Label: en
  9. The Bounded Batch Scheduling with Common Due Window and Non-identical Size Jobs: Label: en
  10. Kernelization of Two Path Searching Problems on Split Graphs: Label: en
  11. A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan: Label: en
  12. A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique: Label: en
  13. Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles?: Label: en
  14. Empirical Study of Phase Transition of Hamiltonian Cycle Problem in Random Graphs with Degrees Greater Than One: Label: en
  15. Realtime Channel Recommendation: Switch Smartly While Watching TV: Label: en
  16. Mechanism Design for One-Facility Location Game with Obnoxious Effects: Label: en
  17. Nonlinear Dimension Reduction by Local Multidimensional Scaling: Label: en
  18. Notes on the $$\frac{6}{5}$$ -Approximation Algorithm for One-Sided Scaffold Filling: Label: en
  19. Online Scheduling with Increasing Subsequence Serving Constraint: Label: en
  20. On Counting Parameterized Matching and Packing: Label: en
  21. Breaking Cycle Structure to Improve Lower Bound for Max-SAT: Label: en
  22. Fractional Edge Cover Number of Model RB: Label: en
  23. A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs: Label: en
  24. The Scheduling Strategy of Virtual Machine Migration Based on the Gray Forecasting Model: Label: en
  25. Parameterized Algorithms for Maximum Edge Biclique and Related Problems: Label: en
  26. Improved Algorithms for Several Parameterized Problems Based on Random Methods: Label: en
  27. Positive Zero Forcing and Edge Clique Coverings: Label: en
  28. Linear Time Algorithm for 1-Center in $$\mathfrak {R}^d$$ Under Convex Polyhedral Distance Function: Label: en
  29. How to Block Blood Flow by Using Elastic Coil: Label: en
  30. Better Approximation Algorithms for Scaffolding Problems: Label: en
  31. Genomic Scaffold Filling: A Progress Report: Label: en
  32. Algorithms for Queryable Uncertainty: Label: en
  33. Inapproximability of Maximal Strip Recovery: II: Label: en
  34. Removable Edges of a Spanning Tree in 3-Connected 3-Regular Graphs: Label: en
  35. The Parameterized Complexity of the Induced Matching Problem in Planar Graphs: Label: en
  36. Some New Structural Properties of Shortest 2-Connected Steiner Networks: Label: en
  37. Notes on Fractional (1,f)-Odd Factors of Graphs: Label: en
  38. Long Alternating Cycles in Edge-Colored Complete Graphs: Label: en
  39. Easy Problems for Grid-Structured Graphs: Label: en
  40. An O(nm)-Time Certifying Algorithm for Recognizing HHD-Free Graphs: Label: en
  41. A Novel Heuristic Approach for Job Shop Scheduling Problem: Label: en
  42. A Performance Guaranteed New Algorithm for Fault-Tolerant Routing in Folded Cubes: Label: en
  43. Hamiltonian Property on Binary Recursive Networks: Label: en
  44. Constraints Solution for Time Sensitive Security Protocols: Label: en
  45. A Non-interleaving Denotational Semantics of Value Passing CCS with Action Refinement: Label: en
  46. Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness: Label: en
  47. On the Complexity of Approximation Streaming Algorithms for the k-Center Problem: Label: en
  48. On the Fractional Chromatic Number of Monotone Self-dual Boolean Functions: Label: en
  49. Maximizing the Number of Independent Labels in the Plane: Label: en
  50. The On-Line Rental Problem with Risk and Probabilistic Forecast: Label: en

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