The following pages link to full work available at URL (P205):
Displaying 50 items.
- (Total) vector domination for graphs with bounded branchwidth (Q290105) (← links)
- Matching preclusion for vertex-transitive networks (Q290107) (← links)
- On the minimum Kirchhoff index of graphs with a fixed number of cut vertices (Q290109) (← links)
- Permutation reconstruction from MinMax-betweenness constraints (Q290110) (← links)
- Eccentricity sums in trees (Q290112) (← links)
- Correction of the paper ``Bicyclic graphs with extremal values of PI index'' (Q290113) (← links)
- Mock modular forms and class number relations (Q290115) (← links)
- Bounded gaps between primes in Chebotarev sets (Q290117) (← links)
- On Zagier's adele (Q290119) (← links)
- Singular moduli of higher level and special cycles (Q290121) (← links)
- Radial limits of mock theta functions (Q290124) (← links)
- Obituary: Robert F. Coleman 1954--2014 (Q290127) (← links)
- Height bounds on zeros of quadratic forms over \(\overline{\mathbb Q}\) (Q290128) (← links)
- Mathematical model of motion of a mixture of gases and hollow microspheres with selective permeability (Q290129) (← links)
- Vortical structures behind a transverse jet in a supersonic flow at high jet to crossflow pressure ratios (Q290133) (← links)
- Functional mathematical model of a hydrogen-driven combustion chamber for a scramjet (Q290134) (← links)
- Wave flows initiated by vertical lifting of a rectangular beam from shallow water (Q290136) (← links)
- Development of complex analysis methods in filtration theory problems (Q290141) (← links)
- The value of information in risk-sharing environments with unawareness (Q290152) (← links)
- Quantal response methods for equilibrium selection in \(2\times 2\) coordination games (Q290153) (← links)
- Second-order beliefs in reputation systems with endogenous evaluations -- an experimental study (Q290156) (← links)
- Sanctions in networks: ``The most unkindest cut of all'' (Q290159) (← links)
- Fair implementation of diversity in school choice (Q290161) (← links)
- Median stable matchings in two-sided markets (Q290162) (← links)
- Gathering imperfect information before signing a contract (Q290164) (← links)
- Cooperation and distributive conflict (Q290166) (← links)
- Testing guilt aversion with an exogenous shift in beliefs (Q290168) (← links)
- Peer effects and incentives (Q290169) (← links)
- Object allocation via deferred-acceptance: strategy-proofness and comparative statics (Q290170) (← links)
- Information revelation in auctions with common and private values (Q290172) (← links)
- Efficient dynamic mechanisms with interdependent valuations (Q290174) (← links)
- Doing it now, later, or never (Q290176) (← links)
- An externality-robust auction: theory and experimental evidence (Q290178) (← links)
- The curse of uninformed voting: an experimental study (Q290181) (← links)
- On-line algorithms for the dominating set problem (Q290186) (← links)
- Containment of butterflies in networks constructed by the line digraph operation (Q290188) (← links)
- Improvements on the accelerated integer GCD algorithm (Q290191) (← links)
- Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks (Q290192) (← links)
- An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs (Q290195) (← links)
- The average height of a node in the BANG abstract directory tree (Q290196) (← links)
- An approximation algorithm for clustering graphs with dominating diametral path (Q290198) (← links)
- A faster linear systolic algorithm for recovering a longest common subsequence (Q290200) (← links)
- A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer (Q290202) (← links)
- Resolving data conflicts with multiple versions and precedence relationships in real-time databases (Q290204) (← links)
- The diameter of the cube-connected cycles (Q290207) (← links)
- Monotone real circuits are more powerful than monotone Boolean circuits (Q290209) (← links)
- Linear complexity profiles and jump complexity (Q290210) (← links)
- An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs (Q290218) (← links)
- An exact analysis on expected seeks in shadowed disks (Q290223) (← links)
- A regeneration scheme for generating extensions (Q290228) (← links)
