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 13 results in range #51 to #63.
- Drawing Planar Graphs on Points Inside a Polygon: Label: en
- Solving Counter Parity Games: Label: en
- Mortality for 2 ×2 Matrices Is NP-Hard: Label: en
- The Robust Set Problem: Parameterized Complexity and Approximation: Label: en
- Generating Functions of Timed Languages: Label: en
- Near-Optimal Expanding Generator Sets for Solvable Permutation Groups: Label: en
- Approximate Graph Isomorphism: Label: en
- A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree: Label: en
- Unordered Constraint Satisfaction Games: Label: en
- Simple Models for Recursive Schemes: Label: en
- Scott Is Always Simple: Label: en
- New Races in Parameterized Algorithmics: Label: en
- On the Complexity of Ontological Reasoning under Disjunctive Existential Rules: Label: en
