The following pages link to OpenAlex ID (P388):
Displaying 50 items.
- Symmetric products of generalized metric spaces (Q281701) (← links)
- Some arithmetic properties of the CWL invariant (Q281703) (← links)
- \(A_\infty\)-actions and recognition of relative loop spaces (Q281707) (← links)
- Function spaces from coherent continuous domains to RB-domains (Q281709) (← links)
- \((H,G)\)-coincidence theorems for free \(G\)-spaces (Q281711) (← links)
- On a hyperspace of compact subsets which is homeomorphic to a non-separable Hilbert space (Q281713) (← links)
- Separable-stable representations of a compression body (Q281715) (← links)
- Farrell-Jones conjecture for fundamental groups of graphs of virtually cyclic groups (Q281717) (← links)
- The \(E_{2}\)-term of the \(K(n)\)-local \(E_{n}\)-Adams spectral sequence (Q281720) (← links)
- The structure of Whitney blocks (Q281722) (← links)
- The rank of a warping matrix (Q281726) (← links)
- A classification of subgroups of \(SL(4, \mathbb{R})\) isomorphic to \(\mathbb{R}^3\) and generalized cusps in projective 3 manifolds (Q281728) (← links)
- On the Seifert fibered space link group (Q281731) (← links)
- Computational topology: isotopic convergence to a stick knot (Q281736) (← links)
- The homotopy type of spaces of coprime polynomials revisited (Q281739) (← links)
- Every simple compact semiring is finite. (Q281741) (← links)
- Advances in cryptology -- EUROCRYPT 2016. 35th annual international conference on the theory and applications of cryptographic techniques, Vienna, Austria, May 8--12, 2016. Proceedings. Part I (Q281742) (← links)
- Advances in cryptology -- EUROCRYPT 2016. 35th annual international conference on the theory and applications of cryptographic techniques, Vienna, Austria, May 8--12, 2016. Proceedings. Part II (Q281743) (← links)
- Laurent phenomenon algebras (Q281749) (← links)
- Preface to the special issue on the Pisot substitution conjecture (Q281750) (← links)
- Pair correlations of aperiodic inflation rules via renormalisation: some interesting examples (Q281752) (← links)
- Geometrical and spectral properties of Pisot substitutions (Q281753) (← links)
- The \(S\)-adic Pisot conjecture on two letters (Q281757) (← links)
- An uncountable set of tiling spaces with distinct cohomology (Q281759) (← links)
- Finitely balanced sequences and plasticity of 1-dimensional tilings (Q281760) (← links)
- Representations of toral automorphisms (Q281762) (← links)
- Topology of the set of univoque bases (Q281764) (← links)
- Birational geometry of higher-dimensional Fano varieties (Q281765) (← links)
- An \(O(n\log n)\) algorithm for finding edge span of cacti (Q281767) (← links)
- On judicious partitions of graphs (Q281768) (← links)
- Acyclic coloring of graphs with some girth restriction (Q281769) (← links)
- On identifying codes in the Cartesian product of a path and a complete graph (Q281771) (← links)
- A simple greedy approximation algorithm for the minimum connected \(k\)-center problem (Q281773) (← links)
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic (Q281776) (← links)
- Optimization techniques for robust multivariate location and scatter estimation (Q281780) (← links)
- Heuristics for the network design problem with connectivity requirements (Q281782) (← links)
- The 2-surviving rate of planar graphs without 5-cycles (Q281784) (← links)
- New results on two-machine flow-shop scheduling with rejection (Q281786) (← links)
- An approximation algorithm for maximum weight budgeted connected set cover (Q281790) (← links)
- On statistical bounds of heuristic solutions to location problems (Q281793) (← links)
- A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring (Q281797) (← links)
- Online integrated production-distribution scheduling problems without preemption (Q281801) (← links)
- Equality in a bound that relates the size and the restrained domination number of a graph (Q281803) (← links)
- Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart (Q281805) (← links)
- OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks (Q281809) (← links)
- Sizes and transmissions of digraphs with a given clique number (Q281810) (← links)
- Total coloring of planar graphs without short cycles (Q281812) (← links)
- A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations (Q281816) (← links)
- On Bharathi-Kempe-Salek conjecture for influence maximization on arborescence (Q281819) (← links)
- On the directed cut cone and polytope (Q281821) (← links)
