Pages that link to "Item:Q2706174"
From MaRDI portal
The following pages link to SIAM Journal on Discrete Mathematics (Q2706174):
Displaying 50 items.
- A Lower Bound for Heilbronn's Triangle Problem in <i>d</i> Dimensions (Q2719164) (← links)
- Improved Lower Bounds on Book Crossing Numbers of Complete Graphs (Q2848524) (← links)
- On the Convergence of the Affine Hull of the Chvátal--Gomory Closures (Q2870517) (← links)
- Cops and Robber with Constraints (Q2910936) (← links)
- Extending Fractional Precolorings (Q2910941) (← links)
- Popular Matchings: Structure and Strategic Issues (Q2935279) (← links)
- Flooding Time of Edge-Markovian Evolving Graphs (Q3013157) (← links)
- The LBFS Structure and Recognition of Interval Graphs (Q3058537) (← links)
- An Efficient Sparse Regularity Concept (Q3058542) (← links)
- Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons (Q3058550) (← links)
- Short Cycle Covers of Graphs with Minimum Degree Three (Q3084229) (← links)
- Cover-Decomposition and Polychromatic Numbers (Q3092281) (← links)
- On the <i>p</i>-Median Polytope and the Intersection Property: Polyhedra and Algorithms (Q3094898) (← links)
- Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions (Q3094953) (← links)
- On Integer Multiflow Maximization (Q3128211) (← links)
- Dual Techniques for Scheduling on a Machine with Varying Speed (Q3174696) (← links)
- Constructing Permutation Rational Functions from Isogenies (Q3176494) (← links)
- A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter (Q3177162) (← links)
- Delta Minors, Delta Free Clutters, and Entanglement (Q3177442) (← links)
- Fractional colorings of cubic graphs with large girth (Q3225133) (← links)
- Deriving Finite Sphere Packings (Q3225160) (← links)
- Nonlinear Matroid Optimization and Experimental Design (Q3393425) (← links)
- Computing the Bandwidth of Interval Graphs (Q3483315) (← links)
- Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs (Q3503227) (← links)
- Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets (Q3544249) (← links)
- Clique-Width is NP-Complete (Q3563951) (← links)
- Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs (Q3583310) (← links)
- On the Duals of Binary Hyper-Kloosterman Codes (Q3614206) (← links)
- Universal Graphs for Bounded-Degree Trees and Planar Graphs (Q3828026) (← links)
- A Note on Planar Graphs and Circle Orders (Q3979445) (← links)
- Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization (Q4012442) (← links)
- Implicat Representation of Graphs (Q4030198) (← links)
- Median Graphs and Triangle-Free Graphs (Q4255811) (← links)
- Embedding de Bruijn and Shuffle-Exchange Graphs in Five Pages (Q4302273) (← links)
- Predicting Cause-Effect Relationships from Incomplete Discrete Observations (Q4317698) (← links)
- Algorithms for Vertex Partitioning Problems on Partial k-Trees (Q4377448) (← links)
- Boolean Normal Forms, Shellability, and Reliability Computations (Q4490781) (← links)
- Sparse Graphs of High Gonality (Q4568093) (← links)
- A Simpler Self-reduction Algorithm for Matroid Path-Width (Q4569568) (← links)
- On the Size-Ramsey Number of Tight Paths (Q4583428) (← links)
- Connectivity of the k-Out Hypercube (Q4584954) (← links)
- Counting Blanks in Polygonal Arrangements (Q4585744) (← links)
- Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension (Q4636778) (← links)
- On Perfect Matchings and Tilings in Uniform Hypergraphs (Q4638614) (← links)
- Odd Holes in Bull-Free Graphs (Q4638616) (← links)
- Approximating Maximum Clique by Removing Subgraphs (Q4652632) (← links)
- New Facets of the Linear Ordering Polytope (Q4699161) (← links)
- Transversals of Vertex Partitions in Graphs (Q4712708) (← links)
- The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities (Q4717570) (← links)
- Treewidth and Pathwidth of Permutation Graphs (Q4863978) (← links)
