The following pages link to Akira Suzuki (Q346505):
Displayed 50 items.
- Reconfiguration of dominating sets (Q346508) (← links)
- On the rainbow connectivity of graphs: complexity and FPT algorithms (Q378215) (← links)
- Energy and fan-in of logic circuits computing symmetric Boolean functions (Q393138) (← links)
- Identities for entropy change associated with the time-evolution of an open system (Q493672) (← links)
- The complexity of dominating set reconfiguration (Q517018) (← links)
- Composite-particles (boson, fermion) theory of fractional quantum Hall effect (Q517557) (← links)
- Theory of the half-integer quantum Hall effect in graphene (Q517658) (← links)
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- Boolean Gröbner bases (Q633095) (← links)
- Quantization and instability of the damped harmonic oscillator subject to a time-dependent force (Q654881) (← links)
- Reconfiguring \(k\)-path vertex covers (Q782172) (← links)
- Non-existence of generic elementary embeddings into the ground model (Q1277152) (← links)
- An alternative approach to comprehensive Gröbner bases (Q1878492) (← links)
- Happy set problem on subclasses of co-comparability graphs (Q2154092) (← links)
- Path cover problems with length cost (Q2154120) (← links)
- Parameterized complexity of independent set reconfiguration problems (Q2192091) (← links)
- Max-Min 3-Dispersion problems (Q2300048) (← links)
- Swapping labeled tokens on graphs (Q2347003) (← links)
- Complexity of tiling a polygon with trominoes or bars (Q2411829) (← links)
- Decremental optimization of vertex-coloring under the reconfiguration framework (Q2695300) (← links)
- (Q2725949) (← links)
- ENERGY-EFFICIENT THRESHOLD CIRCUITS COMPUTING MOD FUNCTIONS (Q2841982) (← links)
- ON VAN HOVE SINGULARITIES IN PURE CUBIC CRYSTALS (Q2865306) (← links)
- Computation of inverses in residue class rings of parametric polynomial ideals (Q2883833) (← links)
- Discrete comprehensive Gröbner bases (Q2958947) (← links)
- A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases (Q2959007) (← links)
- The Complexity of (List) Edge-Coloring Reconfiguration Problem (Q2980922) (← links)
- Sequentially Swapping Colored Tokens on Graphs (Q2980931) (← links)
- Energy and Fan-In of Threshold Circuits Computing Mod Functions (Q3010397) (← links)
- On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms (Q3087941) (← links)
- The Complexity of Dominating Set Reconfiguration (Q3449837) (← links)
- Competitive Diffusion on Weighted Graphs (Q3449840) (← links)
- Computing Gröbner Bases within Linear Algebra (Q3644110) (← links)
- (Q4445022) (← links)
- Sequentially Swapping Colored Tokens on Graphs (Q4622769) (← links)
- (Q4650422) (← links)
- (Q4660713) (← links)
- Shape invariant potentials in SUSY quantum mechanics and periodic orbit theory (Q4673009) (← links)
- Energy-Efficient Threshold Circuits Detecting Global Pattern in 1-Dimentional Arrays (Q4922131) (← links)
- On the Minimum Caterpillar Problem in Digraphs (Q4925290) (← links)
- No elementary embedding from v into v is definable from parameters (Q4948529) (← links)
- Decremental Optimization of Dominating Sets Under the Reconfiguration Framework (Q5041181) (← links)
- Algorithms for Coloring Reconfiguration Under Recolorability Constraints (Q5091029) (← links)
- Complexity of Coloring Reconfiguration under Recolorability Constraints (Q5136283) (← links)
- Computing gröbner bases within linear algebra and its implementation (Q5176471) (← links)
- (Q5188248) (← links)
- On the Parameterized Complexity for Token Jumping on Graphs (Q5410654) (← links)
- Computer Algebra in Scientific Computing (Q5479259) (← links)
- Shortest Reconfiguration of Colorings Under Kempe Changes (Q5874308) (← links)
- Reconfiguration of Spanning Trees with Many or Few Leaves (Q5874492) (← links)