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.
Showing below up to 50 results in range #1 to #50.
- Approximation hardness of domination problems on generalized convex graphs: Label: en
- Faster parameterized algorithm for \(r\)-pseudoforest deletion: Label: en
- Improved FPT approximation scheme and approximate kernel for biclique-free max \(k\)-weight SAT: greedy strikes back: Label: en
- Termination of rewriting on reversible Boolean circuits as a free 3-category problem: Label: en
- Phase transition of the 3-majority opinion dynamics with noisy interactions: Label: en
- Parameterizing path partitions: Label: en
- Payment scheduling in the interval debt model: Label: en
- \(G\)-good-neighbor diagnosability under the modified comparison model for multiprocessor systems: Label: en
- The complexity of ferromagnetic 2-spin systems on bounded degree graphs: Label: en
- FPT approximation for capacitated clustering with outliers: Label: en
- Improved SARSA and DQN algorithms for reinforcement learning: Label: en
- A new fast root-finder for black box polynomials: Label: en
- On layered area-proportional rectangle contact representations: Label: en
- The evolutionary dynamics of soft-max policy gradient in multi-agent settings: Label: en
- Sign-then-encrypt with security enhancement and compressed ciphertext: Label: en
- On the number of equal-letter runs of the bijective Burrows-Wheeler transform: Label: en
- The distributed algorithms for the lower-bounded \(k\)-center clustering in metric space: Label: en
- Complexity issues concerning the quadruple Roman domination problem in graphs: Label: en
- Self-similarity of communities of the ABCD model: Label: en
- EFX allocations for indivisible chores: matching-based approach: Label: en
- Egalitarian roommate allocations: complexity and stability: Label: en
- Exact and inexact search for 2d side-sharing tandems: Label: en
- Exact and approximation algorithms for the contiguous translocation distance problem: Label: en
- Deterministic primal-dual algorithms for online \(k\)-way matching with delays: Label: en
- Adaptive pruning-based Newton's method for distributed learning: Label: en
- Towards strong regret minimization sets: balancing freshness and diversity in data selection: Label: en
- Dichotomies for tree minor containment with structural parameters: Label: en
- Finer-grained reductions in fine-grained hardness of approximation: Label: en
- Adding direction constraints to the 1-2-3 conjecture: Label: en
- Chemical mass-action systems as analog computers: implementing arithmetic computations at specified speed: Label: en
- Gathering on a circle with limited visibility by anonymous oblivious robots: Label: en
- On central placements of new vertices in a planar point set: Label: en
- Approximating the shortest path problem with scenarios: Label: en
- On MAX-SAT with cardinality constraint: Label: en
- Fault-tolerant mutual visibility without any axis agreement in presence of mobility failure: Label: en
- Vertex-independent spanning trees in complete Josephus cubes: Label: en
- The monadic theory of toric words: Label: en
- Density of \(k\)-ary words with 0, 1, 2-error overlaps: Label: en
- Distributed computing in the asynchronous LOCAL model: Label: en
- Structural parameterizations of vertex integrity: Label: en
- Instance-optimal information-based voting: Label: en
- Retraction notice to: ``Optimizing scalability and availability of cloud based software services using modified scale rate limiting algorithm: Label: en
- Algebraic properties and transformations of monographs: Label: en
- Comparison of machine learning algorithms for classification of big data sets: Label: en
- Euclidean division by \(d\) in base \(b\): Label: en
- The \textsc{Exact Subset MultiCover} problem: Label: en
- Enabling high reliability via matroidal connectivity and conditional matroidal connectivity on arrangement graph networks: Label: en
- Privacy in population protocols with probabilistic scheduling: Label: en
- Tolerance to asynchrony in algorithms for multiplication and modulo: Label: en
- Truthful two-facility location with candidate locations: Label: en