The following pages link to Vorapong Suppakitpaisarn (Q325486):
Displaying 19 items.
- An approximation algorithm for multiroute flow decomposition (Q325487) (← links)
- Relaxed triangle inequality ratio of the Sørensen-Dice and Tversky indexes (Q1705776) (← links)
- Bilevel model for adaptive network flow problem (Q1742209) (← links)
- Parametric multiroute flow and its application to multilink-attack network (Q1751172) (← links)
- On the minimal Hamming weight of a multi-base representation (Q2009155) (← links)
- Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools (Q2059909) (← links)
- Evolving homomorphic secret sharing for hierarchical access structures (Q2128751) (← links)
- Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials (Q2152064) (← links)
- Semimetric Properties of Sørensen-Dice and Tversky Indexes (Q2803837) (← links)
- Calculating Average Joint Hamming Weight for Minimal Weight Conversion of d Integers (Q2889917) (← links)
- Parametric Multiroute Flow and Its Application to Robust Network with $$k$$ Edge Failures (Q3195311) (← links)
- Smart Contract-Driven Mechanism Design to Mitigate Information Diffusion in Social Networks (Q3294793) (← links)
- A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow (Q5746246) (← links)
- On the maximum edge-pair embedding bipartite matching (Q5896125) (← links)
- On the maximum edge-pair embedding bipartite matching (Q5918365) (← links)
- Worst-case analysis of LPT scheduling on a small number of non-identical processors (Q6072208) (← links)
- (Q6089680) (← links)
- On the size of minimal separators for treedepth decomposition (Q6558688) (← links)
- Submodularity property for facility locations of dynamic flow networks (Q6591941) (← links)
