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 #1 to #50.

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

  1. Approximation algorithms for drone delivery scheduling with a fixed number of drones: Label: en
  2. Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees: Label: en
  3. Finding and counting small tournaments in large tournaments: Label: en
  4. Packing squares independently: Label: en
  5. Sorting genomes by prefix double-cut-and-joins: Label: en
  6. Path partitions of phylogenetic networks: Label: en
  7. Approximation algorithms for minimum ply covering of points with unit squares and unit disks: Label: en
  8. On decision problems concerning contextual insertions and deletions: Label: en
  9. Adaptive collective responses to local stimuli in anonymous dynamic networks: Label: en
  10. Dynamically equivalent disjunctive networks: Label: en
  11. Geography, Kotzig's Nim, and variants: Label: en
  12. Parking problem by oblivious mobile robots in infinite grids: Label: en
  13. Double declined subnetwork reliability analysis in bubble-sort networks under node fault model: Label: en
  14. Constructing red-black spanners for mixed-charging vehicular networks: Label: en
  15. Restricted Holant dichotomy on domain sizes 3 and 4: Label: en
  16. Time optimal gathering of myopic robots on an infinite triangular grid: Label: en
  17. On the existence of funneled orientations for classes of rooted phylogenetic networks: Label: en
  18. Popularity on the roommate diversity problem: Label: en
  19. Synergistic knowledge: Label: en
  20. Approximation algorithms for finding maximum containing circle and sphere: Label: en
  21. Algorithms for the thief orienteering problem on directed acyclic graphs: Label: en
  22. Efficient algorithm for stochastic rumor blocking problem in social networks during safety accident period: Label: en
  23. Dynamic path finding for multi-load agent pickup and delivery problem: Label: en
  24. Approximating decision trees with priority hypotheses: Label: en
  25. Verifiable attribute-based multi-keyword search scheme with sensitive information hiding for cloud-assisted e-healthcare sharing systems: Label: en
  26. Injective coloring of subclasses of chordal graphs: Label: en
  27. Extremal polyphenyl chains with respect to the Kirchhoff index: Label: en
  28. On approximating partial scenario set cover: Label: en
  29. Approximation hardness of domination problems on generalized convex graphs: Label: en
  30. Faster parameterized algorithm for \(r\)-pseudoforest deletion: Label: en
  31. Improved FPT approximation scheme and approximate kernel for biclique-free max \(k\)-weight SAT: greedy strikes back: Label: en
  32. Termination of rewriting on reversible Boolean circuits as a free 3-category problem: Label: en
  33. Phase transition of the 3-majority opinion dynamics with noisy interactions: Label: en
  34. Parameterizing path partitions: Label: en
  35. Payment scheduling in the interval debt model: Label: en
  36. \(G\)-good-neighbor diagnosability under the modified comparison model for multiprocessor systems: Label: en
  37. The complexity of ferromagnetic 2-spin systems on bounded degree graphs: Label: en
  38. FPT approximation for capacitated clustering with outliers: Label: en
  39. Improved SARSA and DQN algorithms for reinforcement learning: Label: en
  40. A new fast root-finder for black box polynomials: Label: en
  41. On layered area-proportional rectangle contact representations: Label: en
  42. The evolutionary dynamics of soft-max policy gradient in multi-agent settings: Label: en
  43. Sign-then-encrypt with security enhancement and compressed ciphertext: Label: en
  44. On the number of equal-letter runs of the bijective Burrows-Wheeler transform: Label: en
  45. The distributed algorithms for the lower-bounded \(k\)-center clustering in metric space: Label: en
  46. Complexity issues concerning the quadruple Roman domination problem in graphs: Label: en
  47. Self-similarity of communities of the ABCD model: Label: en
  48. EFX allocations for indivisible chores: matching-based approach: Label: en
  49. Egalitarian roommate allocations: complexity and stability: Label: en
  50. Exact and inexact search for 2d side-sharing tandems: Label: en

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