The following pages link to Shuji Kijima (Q304265):
Displayed 50 items.
- Extended formulations for sparsity matroids (Q304267) (← links)
- Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits (Q442349) (← links)
- Subgraph isomorphism in graph classes (Q456655) (← links)
- Polynomial time approximate or perfect samplers for discretized Dirichlet distribution (Q623726) (← links)
- A polynomial-time perfect sampler for the \(Q\)-Ising with a vertex-independent noise (Q652623) (← links)
- An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convolution (Q727987) (← links)
- An FPTAS for the volume of some \(\mathcal{V} \)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes (Q784479) (← links)
- Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers (Q820530) (← links)
- Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers (Q940932) (← links)
- On listing, sampling, and counting the chordal graphs with edge constraints (Q974754) (← links)
- Plane formation by synchronous mobile robots in the three dimensional Euclidean space (Q1664133) (← links)
- Total variation discrepancy of deterministic random walks for ergodic Markov chains (Q1675930) (← links)
- The parity Hamiltonian cycle problem (Q1690220) (← links)
- Team assembling problem for asynchronous heterogeneous mobile robots (Q1704590) (← links)
- On space complexity of self-stabilizing leader election in mediated population protocol (Q1938386) (← links)
- Plane formation by semi-synchronous robots in the three dimensional Euclidean space (Q2007917) (← links)
- Searching for an evader in an unknown graph by an optimal number of searchers (Q2007918) (← links)
- Search by a metamorphic robotic system in a finite 2D square grid (Q2139088) (← links)
- An FPTAS for the volume of some \(\mathcal{V}\)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes (Q2412398) (← links)
- Approximating the path-distance-width for AT-free graphs and graphs in related classes (Q2442209) (← links)
- Every finite distributive lattice is isomorphic to the minimizer set of an \(M^\natural \)-concave set function (Q2661580) (← links)
- Online Linear Optimization for Job Scheduling Under Precedence Constraints (Q2835641) (← links)
- The Parity Hamiltonian Cycle Problem in Directed Graphs (Q2835661) (← links)
- On Randomized Approximation for Finding a Level Ideal of a Poset and the Generalized Median Stable Matchings (Q2884322) (← links)
- L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains (Q2920442) (← links)
- Collision of Random Walks and a Refined Analysis of Attacks on the Discrete Logarithm Problem (Q2941189) (← links)
- An FPTAS for the Volume Computationof 0-1 Knapsack Polytopes Based on Approximate Convolution Integral (Q2942645) (← links)
- Dominating Set Counting in Graph Classes (Q3087935) (← links)
- A Randomized Algorithm for Finding Frequent Elements in Streams Using O(loglogN) Space (Q3104649) (← links)
- Online Linear Optimization over Permutations (Q3104653) (← links)
- Approximability of the Path-Distance-Width for AT-free Graphs (Q3104783) (← links)
- (Q3154676) (← links)
- Online Prediction under Submodular Constraints (Q3164825) (← links)
- Plane formation by synchronous mobile robots without chirality (Q3300811) (← links)
- Approximation Algorithm and Perfect Sampler for Closed Jackson Networks with Single Servers (Q3395041) (← links)
- Polynomial time perfect sampling algorithm for two-rowed contingency tables (Q3419592) (← links)
- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints (Q3511357) (← links)
- Listing Chordal Graphs and Interval Graphs (Q3522943) (← links)
- Deterministic Random Walks for Rapidly Mixing Chains (Q4584953) (← links)
- Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots (Q4909420) (← links)
- Self-stabilizing Localization of the Middle Point of a Line Segment by an Oblivious Robot with Limited Visibility (Q5045441) (← links)
- Deterministic Random Walks on Finite Graphs (Q5194705) (← links)
- Total Variation Discrepancy of Deterministic Random Walks for Ergodic Markov Chains (Q5194950) (← links)
- Finding Submodularity Hidden in Symmetric Difference (Q5218436) (← links)
- Pattern Formation by Oblivious Asynchronous Mobile Robots (Q5258906) (← links)
- Deterministic random walks on finite graphs (Q5265345) (← links)
- Finding a Level Ideal of a Poset (Q5323080) (← links)
- A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise (Q5323081) (← links)
- (Q5485309) (← links)
- Can a Skywalker Localize the Midpoint of a Rope? (Q5868878) (← links)