Kategorie: DDC-Klasse 511.6
860 Titel
-
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period
-
Editorial: finite geometries
-
Approximation of knapsack problems with conflict and forcing graphs
-
The Waldschmidt constant for squarefree monomial ideals
-
The 4/5 upper bound on the game total domination number
-
Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
-
Note on Semi-Linkage with Almost Prescribed Lengths in Large Graphs
-
On Linear Configurations in Subsets of Compact Abelian Groups, and Invariant Measurable Hypergraphs
-
Linearizable special cases of the QAP
-
Parameterized algorithms for min–max 2-cluster editing
-
Editorial: Special issue on coding and cryptography
-
Erratum to: Small Littlewood–Richardson coefficients
-
Computing the $$L_1$$ L 1 Geodesic Diameter and Center of a Polygonal Domain
-
Induced Cycles in Graphs
-
Online integrated production–distribution scheduling problems without preemption
-
Lower Bounds for Locally Highly Connected Graphs
-
On color-preserving automorphisms of Cayley graphs of odd square-free order
-
On the completeness of plane cubic curves over finite fields
-
Packing Chromatic Number of Base-3 Sierpiński Graphs
-
Ramsey numbers of cubes versus cliques