Entity usage

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 #151 to #200.

Efficient First-Order Model-Checking Using Short Labels: Label: en
Characterizing and Computing Minimal Cograph Completions: Label: en
A CSP-Based Approach for Solving Parity Game: Label: en
Multi-bidding Strategy in Sponsored Keyword Auction: Label: en
A Linear In-situ Algorithm for the Power of Cyclic Permutation: Label: en
Versioning Tree Structures by Path-Merging: Label: en
Absorbing Random Walks and the NAE2SAT Problem: Label: en
NP-Completeness of (k-SAT,r-UNk-SAT) and (LSAT ≥ k ,r-UNLSAT ≥ k ): Label: en
Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations: Label: en
Estimating Hybrid Frequency Moments of Data Streams: Label: en
Haplotype Assembly from Weighted SNP Fragments and Related Genotype Information: Label: en
A PTAS for the k-Consensus Structures Problem Under Euclidean Squared Distance: Label: en
A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem: Label: en
Optimal Field Splitting, with Applications in Intensity-Modulated Radiation Therapy: Label: en
Super Solutions of Random Instances of Satisfiability: Label: en
Efficient Modular Reduction Algorithm Without Correction Phase: Label: en
Enumeration, Counting, and Random Generation of Ladder Lotteries: Label: en
Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs: Label: en
Local Search to Approximate Max NAE-$$k$$-Sat Tightly: Label: en
Truthful Strategy and Resource Integration for Multi-tenant Data Center Demand Response: Label: en
Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory: Label: en
Approximate Model Counting via Extension Rule: Label: en
A New Distributed Algorithm for Computing a Dominating Set on Grids: Label: en
Fast Quantum Algorithms for Least Squares Regression and Statistic Leverage Scores: Label: en
Union Closed Tree Convex Sets: Label: en
The Online Storage Strategy for Automated Storage and Retrieval System with Single Open in One Dimension: Label: en
Parameterized Minimum Cost Partition of a Tree with Supply and Demand: Label: en
Smaller Kernels for Several FPT Problems Based on Simple Observations: Label: en
Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties: Label: en
On the Sound Covering Cycle Problem in Paired de Bruijn Graphs: Label: en
Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints: Label: en
On Solving Systems of Diagonal Polynomial Equations Over Finite Fields: Label: en
Lower and Upper Bounds for Random Mimimum Satisfiability Problem: Label: en
Machine Scheduling with a Maintenance Interval and Job Delivery Coordination: Label: en
A Linear Time Algorithm for Ordered Partition: Label: en
The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation: Label: en
Social Models and Algorithms for Optimization of Contact Immunity of Oral Polio Vaccine: Label: en
A Fast and Practical Method to Estimate Volumes of Convex Polytopes: Label: en
Efficient Computation of the Characteristic Polynomial of a Threshold Graph: Label: en
A New Algorithm for Intermediate Dataset Storage in a Cloud-Based Dataflow: Label: en
On r-Gatherings on the Line: Label: en
Soft Subdivision Search in Motion Planning, II: Axiomatics: Label: en
Broadcast Problem in Hypercube of Trees: Label: en
Dynamic Matchings in Left Weighted Convex Bipartite Graphs: Label: en
A Study of Pure Random Walk Algorithms on Constraint Satisfaction Problems with Growing Domains: Label: en
On the Advice Complexity of One-Dimensional Online Bin Packing: Label: en
Zero-Sum Flow Numbers of Triangular Grids: Label: en
On the Complexity of Constrained Sequences Alignment Problems: Label: en
Tree Convex Bipartite Graphs: $\mathcal{NP}$ -Complete Domination, Hamiltonicity and Treewidth: Label: en
Near Optimal Algorithms for Online Maximum Weighted b-Matching: Label: en