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.

Approximation Algorithms for the Random Field Ising Model: Label: en
Expanders on Matrices over a Finite Chain Ring, II: Label: en
Parameterized Counting and Cayley Graph Expanders: Label: en
Strengthening a Theorem of Meyniel: Label: en
The Discrepancy of Unsatisfiable Matrices and a Lower Bound for the Komlós Conjecture Constant: Label: en
On Connected Components with Many Edges: Label: en
A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs: Label: en
Tight Probability Bounds with Pairwise Independence: Label: en
On the Gamma-Vector of Symmetric Edge Polytopes: Label: en
On the PoA Conjecture: Trees versus Biconnected Components: Label: en
On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts: Label: en
Planar Convex Codes are Decidable: Label: en
Inverse Problems for Discrete Heat Equations and Random Walks for a Class of Graphs: Label: en
The Spectrum of Triangle-Free Graphs: Label: en
Cayley Sums and Minkowski Sums of Lattice Polytopes: Label: en
Hat Guessing Numbers of Strongly Degenerate Graphs: Label: en
Matroid Intersection under Restricted Oracles: Label: en
The Tuza–Vestergaard Theorem: Label: en
Balanced Subdivisions of a Large Clique in Graphs with High Average Degree: Label: en
Decomposing Random Permutations into Order-Isomorphic Subpermutations: Label: en
On the Turán Number of Generalized Theta Graphs: Label: en
Cyclic Matroids: Label: en
Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs: Label: en
Fuglede’s Conjecture Holds in \(\boldsymbol{\mathbb{Z}_{p}\times \mathbb{Z}_{p^{n}}}\): Label: en
On Discrete Truthful Heterogeneous Two-Facility Location: Label: en
Efficient Linear and Affine Codes for Correcting Insertions/Deletions: Label: en
Ramsey Equivalence for Asymmetric Pairs of Graphs: Label: en
Packing and Covering a Given Directed Graph in a Directed Graph: Label: en
On the Erdős–Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs: Label: en
On the Column Number and Forbidden Submatrices for \(\Delta\)-Modular Matrices: Label: en
Square Coloring Planar Graphs with Automatic Discharging: Label: en
Optimal Sets of Questions for Twenty Questions: Label: en
Convex Characters, Algorithms, and Matchings: Label: en
Unified Greedy Approximability beyond Submodular Maximization: Label: en
Invertibility of Digraphs and Tournaments: Label: en
A Property on Monochromatic Copies of Graphs Containing a Triangle: Label: en
Geometric Network Creation Games: Label: en
The Treewidth and Pathwidth of Graph Unions: Label: en
Highly Connected Subgraphs with Large Chromatic Number: Label: en
On Ramsey Size-Linear Graphs and Related Questions: Label: en
Transportation Distance between Probability Measures on the Infinite Regular Tree: Label: en
Rainbow Saturation for Complete Graphs: Label: en
Shallow Minors, Graph Products, and Beyond-Planar Graphs: Label: en
A Dual Approach for Dynamic Pricing in Multidemand Markets: Label: en
On t-Intersecting Hypergraphs with Minimum Positive Codegrees: Label: en
Tropical Linear Regression and Mean Payoff Games: Or, How to Measure the Distance to Equilibria: Label: en
Simple Codes and Sparse Recovery with Fast Decoding: Label: en
Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs: Label: en
Lower Bounds for Maximum Weighted Cut: Label: en
Saturation of Ordered Graphs: Label: en