The following pages link to full work available at URL (P205):
Displaying 50 items.
- Scheduling a single machine with parallel batching to minimize makespan and total rejection cost (Q266826) (← links)
- On computing the 2-vertex-connected components of directed graphs (Q266828) (← links)
- Binary linear programming models for robust broadcasting in communication networks (Q266832) (← links)
- Provably secure and efficient leakage-resilient certificateless signcryption scheme without bilinear pairing (Q266836) (← links)
- Decision trees with minimum average depth for sorting eight elements (Q266840) (← links)
- Lower bounds on paraclique density (Q266841) (← links)
- The contour of a bridged graph is geodetic (Q266844) (← links)
- Weak saturation number for multiple copies of the complete graph with a star removed (Q266847) (← links)
- Congruences and coordinate semirings of tropical varieties (Q266850) (← links)
- A converse to a theorem of Salem and Zygmund (Q266851) (← links)
- The Rajchman algebra \(B_{0}(G)\) of a locally compact group \(G\) (Q266853) (← links)
- A singular limit problem for conservation laws related to the Kawahara equation (Q266854) (← links)
- A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases (Q266861) (← links)
- Extracting unsatisfiable cores for LTL via temporal resolution (Q266863) (← links)
- Metric temporal logic revisited (Q266865) (← links)
- The left adjoint of Spec from a category of lattice-ordered groups (Q266868) (← links)
- The principle of signature exchangeability (Q266871) (← links)
- The problem of coincidence in a theory of temporal multiple recurrence (Q266873) (← links)
- A multiple-valued logic approach to the design and verification of hardware circuits (Q266875) (← links)
- The eco-cognitive model of abduction. II. Irrelevance and implausibility exculpated (Q266877) (← links)
- Translation of first order formulas into ground formulas via a completion theory (Q266881) (← links)
- Bunched sequential information (Q266883) (← links)
- AC-conductivity measure from heat production of free fermions in disordered media (Q266884) (← links)
- 3/4-fractional superdiffusion in a system of harmonic oscillators perturbed by a conservative noise (Q266887) (← links)
- Justification of the nonlinear Schrödinger equation for the evolution of gravity driven 2D surface water waves in a canal of finite depth (Q266889) (← links)
- On thermodynamically consistent Stefan problems with variable surface energy (Q266891) (← links)
- Asymptotic stability of high-dimensional Zakharov-Kuznetsov solitons (Q266895) (← links)
- Global well-posedness in spatially critical Besov space for the Boltzmann equation (Q266899) (← links)
- A dimension-breaking phenomenon for water waves with weak surface tension (Q266900) (← links)
- Almost global existence for the Prandtl boundary layer equations (Q266902) (← links)
- Dynamical compact elastic bodies in general relativity (Q266904) (← links)
- Asymmetric domain walls of small angle in soft ferromagnetic films (Q266907) (← links)
- A note on adjacent vertex distinguishing colorings of graphs (Q266908) (← links)
- On the first-order edge tenacity of a graph (Q266912) (← links)
- Global cycle properties of locally isometric graphs (Q266915) (← links)
- Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings (Q266919) (← links)
- On the readability of overlap digraphs (Q266924) (← links)
- Complete split graph determined by its (signless) Laplacian spectrum (Q266926) (← links)
- Vehicle scheduling under the warehouse-on-wheels policy (Q266928) (← links)
- Clique-width of path powers (Q266933) (← links)
- Induced 2-regular subgraphs in \(k\)-chordal cubic graphs (Q266935) (← links)
- Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes (Q266936) (← links)
- On self-clique shoal graphs (Q266940) (← links)
- Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943) (← links)
- List rankings and on-line list rankings of graphs (Q266945) (← links)
- On the roots of domination polynomial of graphs (Q266947) (← links)
- Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
- Minimum strictly fundamental cycle bases of planar graphs are hard to find (Q266952) (← links)
- Estimation of Laplacian spectra of direct and strong product graphs (Q266954) (← links)
- Global cycle properties in locally connected, locally traceable and locally Hamiltonian graphs (Q266958) (← links)
