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

Proportional Cost Buyback Problem with Weight Bounds: Label: en
Online Scheduling for Electricity Cost in Smart Grid: Label: en
Listing Center Strings Under the Edit Distance Metric: Label: en
The Minimum Acceptable Violation Ranking of Alternatives from Voters’ Ordinal Rankings: Label: en
Algebraic Theory on Shortest Paths for All Flows: Label: en
On the Minimal Constraint Satisfaction Problem: Complexity and Generation: Label: en
An Online Model of Berth and Quay Crane Integrated Allocation in Container Terminals: Label: en
A New Tractable Case of the QAP with a Robinson Matrix: Label: en
Parameterized Algorithms for Generalized Domination: Label: en
Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region: Label: en
Computational Study on Dominating Set Problem of Planar Graphs: Label: en
Separating Sublinear Time Computations by Approximate Diameter: Label: en
New Algorithms for k-Center and Extensions: Label: en
A Parameterized Perspective on Packing Paths of Length Two: Label: en
Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems: Label: en
Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets: Label: en
Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries: Label: en
Parameterized Graph Editing with Chosen Vertex Degrees: Label: en
Going Weighted: Parameterized Algorithms for Cluster Editing: Label: en
The Clique Corona Operation and Greedoids: Label: en
Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs: Label: en
Magic Labelings on Cycles and Wheels: Label: en
A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs: Label: en
On the Stable Set Polytope of Claw-Free Graphs: Label: en
Automatic Generation of Symmetry-Breaking Constraints: Label: en
On Recovering Syntenic Blocks from Comparative Maps: Label: en
The Robot Cleans Up: Label: en
Covering Arrays Avoiding Forbidden Edges: Label: en
An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem: Label: en
Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs: Label: en
Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem: Label: en
Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph: Label: en
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems: Label: en
Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks: Label: en
Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks: Label: en
Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order: Label: en
Algorithms and Implementation for Interconnection Graph Problem: Label: en
Strong Formulations for 2-Node-Connected Steiner Network Problems: Label: en
Flows with Unit Path Capacities and Related Packing and Covering Problems: Label: en
On k- Versus (k + 1)-Leaf Powers: Label: en
Simplicial Powers of Graphs: Label: en
Protean Graphs with a Variety of Ranking Schemes: Label: en
Vertex-Uncertainty in Graph-Problems: Label: en
Turán Graphs, Stability Number, and Fibonacci Index: Label: en
Clustered SplitsNetworks: Label: en
Delay Management Problem: Complexity Results and Robust Algorithms: Label: en
Stochastic Online Scheduling Revisited: Label: en
Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization: Label: en
Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays: Label: en
A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem: Label: en