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 #51 to #100.

Optimal Algorithms for Detecting Network Stability: Label: en
Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs: Label: en
Multi-commodity Source Location Problems and Price of Greed: Label: en
Towards Work-Efficient Parallel Parameterized Algorithms: Label: en
A Two Query Adaptive Bitprobe Scheme Storing Five Elements: Label: en
Matching Sets of Line Segments: Label: en
Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem: Label: en
Multilevel Planarity: Label: en
A Fast Algorithm for Unbounded Monotone Integer Linear Systems with Two Variables per Inequality via Graph Decomposition: Label: en
On the Algorithmic Complexity of Double Vertex-Edge Domination in Graphs: Label: en
Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components: Label: en
Drawing Clustered Graphs on Disk Arrangements: Label: en
(k, p)-Planarity: A Relaxation of Hybrid Planarity: Label: en
Flat-Foldability for 1 × n Maps with Square/Diagonal Grid Patterns: Label: en
The Prefix Fréchet Similarity: Label: en
Topological Stability of Kinetic k-centers: Label: en
Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs: Label: en
On Triangle Cover Contact Graphs: Label: en
Superset Generation on Decision Diagrams: Label: en
Threshold Circuits for Global Patterns in 2-Dimensional Maps: Label: en
Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid: Label: en
Dichotomy Theorems for Homomorphism Polynomials of Graph Classes: Label: en
Non-repetitive Strings over Alphabet Lists: Label: en
Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs: Label: en
On Bar (1,j)-Visibility Graphs: Label: en
An Improved Algorithm for Parameterized Edge Dominating Set Problem: Label: en
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends: Label: en
Competitive Analysis for Multi-objective Online Algorithms: Label: en
Dynamic Online Multiselection in Internal and External Memory: Label: en
An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks: Label: en
The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Trees: Label: en
Enumerating Eulerian Trails via Hamiltonian Path Enumeration: Label: en
Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement: Label: en
PTAS’s for Some Metric p-source Communication Spanning Tree Problems: Label: en
An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments: Label: en
Folding a Paper Strip to Minimize Thickness: Label: en
Straight-Path Queries in Trajectory Data: Label: en
Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs: Label: en
Forming Plurality at Minimum Cost: Label: en
A Practical Succinct Data Structure for Tree-Like Graphs: Label: en
Compact Encodings and Indexes for the Nearest Larger Neighbor Problem: Label: en
Unit Covering in Color-Spanning Set Model: Label: en
Edge-Colorings of Weighted Graphs: Label: en
The Directed Ring Loading with Penalty Cost: Label: en
Fast Algorithms for Constrained Graph Density Problems: Label: en
Encoding Data Structures: Label: en
A Competitive Strategy for Distance-Aware Online Shape Allocation: Label: en
Online Exploration and Triangulation in Orthogonal Polygonal Regions: Label: en
Fixed-Orientation Equilateral Triangle Matching of Point Sets: Label: en
A Novel Efficient Approach for Solving the Art Gallery Problem: Label: en