Vorapong Suppakitpaisarn

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 64

Top Topics

Betweenness Centrality

Differential Privacy

Top Venues

IACR Cryptol. ePrint Arch.

Publications

Bubai Manna, Bodhayan Roy, Vorapong Suppakitpaisarn
Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network. CoRR (2024)
Bubai Manna, Bodhayan Roy, Vorapong Suppakitpaisarn
On Approximating the Dynamic and Discrete Network Flow Problem. CoRR (2024)
Takuto Mitsunobu, Reiji Suda, Vorapong Suppakitpaisarn
Worst-case analysis of LPT scheduling on a small number of non-identical processors. Inf. Process. Lett. 183 (2024)
Vorapong Suppakitpaisarn, Jin-Kao Hao
Utilizing Graph Sparsification for Pre-processing in Maxcut QUBO Solver. CoRR (2024)
Zijian Xu, Vorapong Suppakitpaisarn
On the size of minimal separators for treedepth decomposition. Discret. Appl. Math. 354 (2024)
Phongtharin Vinayavekhin, Banphatree Khomkham, Vorapong Suppakitpaisarn, Philippe Codognet, Torahiko Terada, Atsushi Miura
Identifying Relationships and Classifying Western-style Paintings: Machine Learning Approaches for Artworks by Western Artists and Meiji-era Japanese Artists. ACM Journal on Computing and Cultural Heritage 17 (1) (2024)
Vorapong Suppakitpaisarn, Jin-Kao Hao
Utilizing Graph Sparsification for Pre-processing in Max Cut QUBO Solver. MIC (1) (2024)
Kittiphop Phalakarn, Vorapong Suppakitpaisarn, Nuttapong Attrapadung, Kanta Matsuura
Evolving Homomorphic Secret Sharing for Hierarchical Access Structures. IACR Cryptol. ePrint Arch. 2023 (2023)
Sayan Mukherjee, Vorapong Suppakitpaisarn
Robustness for Spectral Clustering of General Graphs under Local Differential Privacy. CoRR (2023)
Pengchang Ren, Reiji Suda, Vorapong Suppakitpaisarn
Efficient Additions and Montgomery Reductions of Large Integers for SIMD. ARITH (2023)
Louis Betzer, Vorapong Suppakitpaisarn, Quentin Hillebrand
Local Differential Privacy for Number of Paths and Katz Centrality. CoRR (2023)
Kittiphon Phalakarn, Vorapong Suppakitpaisarn, Francisco Rodríguez-Henríquez, M. Anwar Hasan
Vectorized and Parallel Computation of Large Smooth-Degree Isogenies using Precedence-Constrained Scheduling. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023 (3) (2023)
Quentin Hillebrand, Vorapong Suppakitpaisarn, Tetsuo Shibuya
Communication Cost Reduction for Subgraph Counting under Local Differential Privacy via Hash Functions. CoRR (2023)
Pengchang Ren, Reiji Suda, Vorapong Suppakitpaisarn
Efficient Additions and Montgomery Reductions of Large Integers for SIMD. CoRR (2023)
Kittiphon Phalakarn, Vorapong Suppakitpaisarn, Francisco Rodríguez-Henríquez, M. Anwar Hasan
Vectorized and Parallel Computation of Large Smooth-Degree Isogenies using Precedence-Constrained Scheduling. IACR Cryptol. ePrint Arch. 2023 (2023)
Kittiphop Phalakarn, Vorapong Suppakitpaisarn, Nuttapong Attrapadung, Kanta Matsuura
Constructive t-secure Homomorphic Secret Sharing for Low Degree Polynomials. IACR Cryptol. ePrint Arch. 2023 (2023)
Peerawit Suriya, Vorapong Suppakitpaisarn, Supanut Chaidee, Phapaengmueng Sukkasem
Submodularity Property for Facility Locations of Dynamic Flow Networks. ATMOS (2023)
Quentin Hillebrand, Vorapong Suppakitpaisarn, Tetsuo Shibuya
Unbiased Locally Private Estimator for Polynomials of Laplacian Variables. KDD (2023)
Pengchang Ren, Reiji Suda, Vorapong Suppakitpaisarn
Throughput-Optimized Implementation of Isogeny-based Cryptography on Vectorized ARM SVE Processor. CANDAR (2022)
Jing Bi, Vorapong Suppakitpaisarn
Performances of Symmetric Loss for Private Data from Exponential Mechanism. CANDARW (2022)
Jing Bi, Vorapong Suppakitpaisarn
Performances of Symmetric Loss for Private Data from Exponential Mechanism. CoRR (2022)
Phongtharin Vinayavekhin, Vorapong Suppakitpaisarn, Philippe Codognet, Torahiko Terada, Atsushi Miura
Learning Similarity for Discovering Inspirations of Western Arts in Japanese Culture. ICPR Workshops (3) (2022)
Kittiphon Phalakarn, Vorapong Suppakitpaisarn, M. Anwar Hasan
Speeding-Up Parallel Computation of Large Smooth-Degree Isogeny using Precedence-Constrained Scheduling. IACR Cryptol. ePrint Arch. 2022 (2022)
Kittiphon Phalakarn, Vorapong Suppakitpaisarn, M. Anwar Hasan
Speeding-Up Parallel Computation of Large Smooth-Degree Isogeny Using Precedence-Constrained Scheduling. ACISP (2022)
Bodhayan Roy, Vorapong Suppakitpaisarn, Bubai Manna, Cam Ly Nguyen
Minimum Target Coverage for Air Quality Monitoring Using Bus Routes. VTC Fall (2022)
Vorapong Suppakitpaisarn
Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools. Inf. Process. Lett. 175 (2022)
Takuto Mitsunobu, Reiji Suda, Vorapong Suppakitpaisarn
Worst-Case Analysis of LPT Scheduling on Small Number of Non-Identical Processors. CoRR (2022)
Kittiphop Phalakarn, Vorapong Suppakitpaisarn, Nuttapong Attrapadung, Kanta Matsuura
Evolving Homomorphic Secret Sharing for Hierarchical Access Structures. IWSEC (2021)
Vorapong Suppakitpaisarn, Atthaphon Ariyarit, Supanut Chaidee
A Voronoi-based method for land-use optimization using semidefinite programming and gradient descent algorithm. Int. J. Geogr. Inf. Sci. 35 (5) (2021)
Cam Ly Nguyen, Vorapong Suppakitpaisarn, Athasit Surarerks, Phanu Vajanopath
On the maximum edge-pair embedding bipartite matching. Theor. Comput. Sci. 882 (2021)
Kittiphon Phalakarn, Vorapong Suppakitpaisarn, M. Anwar Hasan
Single-round Lattice-based Multisignatures. CANDAR (Workshops) (2021)
Vorapong Suppakitpaisarn
Tight Lower Bound for Average Number of Terms in Optimal Double-base Number System. CoRR (2021)
Cam Ly Nguyen, Vorapong Suppakitpaisarn, Athasit Surarerks, Phanu Vajanopath
On the Maximum Edge-Pair Embedding Bipartite Matching. WALCOM (2020)
Kittiphop Phalakarn, Vorapong Suppakitpaisarn, Nuttapong Attrapadung, Kanta Matsuura
Constructive t-secure Homomorphic Secret Sharing for Low Degree Polynomials. INDOCRYPT (2020)
Zijian Xu, Dejun Mao, Vorapong Suppakitpaisarn
PACE Solver Description: Computing Exact Treedepth via Minimal Separators. IPEC (2020)
Arinjita Paul, Vorapong Suppakitpaisarn, Mitali Bafna, C. Pandu Rangan
Improving Accuracy of Differentially Private Kronecker Social Networks via Graph Clustering. ISNCC (2020)
Zijian Xu, Vorapong Suppakitpaisarn
On the Size of Minimal Separators for Treedepth Decomposition. CoRR (2020)
Maneesh Babu Adhikari, Vorapong Suppakitpaisarn, Arinjita Paul, C. Pandu Rangan
Two-Stage Framework for Accurate and Differentially Private Network Information Publication. CSoNet (2020)
Arinjita Paul, Vorapong Suppakitpaisarn, C. Pandu Rangan
Smart Contract-Driven Mechanism Design to Mitigate Information Diffusion in Social Networks. MARBLE (2019)
Tossaphol Settawatcharawanit, Yi-Han Chiang, Vorapong Suppakitpaisarn, Yusheng Ji
A Computation-Efficient Approach for Segment Routing Traffic Engineering. IEEE Access 7 (2019)
Saran Tarnoi, Wuttipong Kumwilaisak, Vorapong Suppakitpaisarn, Kensuke Fukuda, Yusheng Ji
Adaptive probabilistic caching technique for caching networks with dynamic content popularity. Comput. Commun. 139 (2019)
Norie Fu, Naonori Kakimura, Kei Kimura, Vorapong Suppakitpaisarn
Maximum lifetime coverage problem with battery recovery effect. Sustain. Comput. Informatics Syst. 18 (2018)
Jean-François Baffier, Pierre-Louis Poirion, Vorapong Suppakitpaisarn
Bilevel Model for Adaptive Network Flow Problem. Electron. Notes Discret. Math. 64 (2018)
Alonso Gragera, Vorapong Suppakitpaisarn
Relaxed triangle inequality ratio of the Sørensen-Dice and Tversky indexes. Theor. Comput. Sci. 718 (2018)
Kittiphon Phalakarn, Kittiphop Phalakarn, Vorapong Suppakitpaisarn
Optimal Representation for Right-to-Left Parallel Scalar and Multi-Scalar Point Multiplication. Int. J. Netw. Comput. 8 (2) (2018)
Xusheng Zhang, Vorapong Suppakitpaisarn
An Approximation Algorithm for Incrementally Deploying SDN Forwarding Devices. IMCOM (2018)
Tossaphol Settawatcharawanit, Vorapong Suppakitpaisarn, Shigeki Yamada, Yusheng Ji
Segment Routed Traffic Engineering with Bounded Stretch in Software-Defined Networks. LCN (2018)
Cam Ly Nguyen, Orestis Georgiou, Vorapong Suppakitpaisarn
Improved Localization Accuracy Using Machine Learning: Predicting and Refining RSS Measurements. GLOBECOM Workshops (2018)
Ake Osothongs, Vorapong Suppakitpaisarn, Noboru Sonehara
Privacy Disclosure Adaptation for Trading between Personal Attributes and Incentives. J. Inf. Process. 25 (2017)
Prompong Pakawanwong, Vorapong Suppakitpaisarn, Liwen Xu, Naonori Kakimura
Reducing Recovery Error in Compressive Sensing with Limited Number of Base Stations. GLOBECOM (2017)
Kittiphon Phalakarn, Kittiphop Phalakarn, Vorapong Suppakitpaisarn
Optimal Representation for Right-to-Left Parallel Scalar Point Multiplication. CANDAR (2017)
Vorapong Suppakitpaisarn
An Approximation Algorithm for Multiroute Flow Decomposition. Electron. Notes Discret. Math. 52 (2016)
Kittiphop Phalakarn, Kittiphon Phalakarn, Vorapong Suppakitpaisarn
Parallelized Side-Channel Attack Resisted Scalar Multiplication Using q-Based Addition-Subtraction k-Chains. CANDAR (2016)
Rohit Kumar Singh, Vorapong Suppakitpaisarn, Ake Osothongs
Improving Motivation in Survey Participation by Question Reordering. PKAW (2016)
Alonso Gragera, Vorapong Suppakitpaisarn
Semimetric Properties of Sørensen-Dice and Tversky Indexes. WALCOM (2016)
Alonso Gragera, Vorapong Suppakitpaisarn
A Mapping Heuristic for Minimizing Message Latency in Massively Distributed MCTS. CANDAR (2016)
Kittiphop Phalakarn, Kittiphon Phalakarn, Vorapong Suppakitpaisarn
Parallelized Side-Channel Attack Resisted Scalar Multiplication Using q-Based Addition-Subtraction k-chains. IACR Cryptol. ePrint Arch. 2016 (2016)
Jean-François Baffier, Vorapong Suppakitpaisarn, Hidefumi Hiraishi, Hiroshi Imai
Parametric multiroute flow and its application to multilink-attack network. Discret. Optim. 22 (2016)
Parinya Chalermsook, Hiroshi Imai, Vorapong Suppakitpaisarn
Two Lower Bounds for Shortest Double-Base Number System. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (6) (2015)
Jean-François Baffier, Vorapong Suppakitpaisarn
Algorithms for finding robust and sustainable network flows against multilink-attack. RNDM@WMNC (2015)
Hiroshi Imai, Vorapong Suppakitpaisarn
Improving Width-3 Joint Sparse Form to Attain Asymptotically Optimal Complexity on Average Case. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (6) (2015)
Norie Fu, Vorapong Suppakitpaisarn
Clustering 1-Dimensional Periodic Network Using Betweenness Centrality. CSoNet (2015)
Saran Tarnoi, Vorapong Suppakitpaisarn, Wuttipong Kumwilaisak, Yusheng Ji
Performance analysis of probabilistic caching scheme using Markov chains. LCN (2015)
Vorapong Suppakitpaisarn, Wenkai Dai, Jean-François Baffier
Robust network flow against attackers with knowledge of routing method. HPSR (2015)
Vorapong Suppakitpaisarn, Hiroshi Imai
Worst case computation time for minimal joint Hamming weight numeral system. ISITA (2014)
Jean-François Baffier, Vorapong Suppakitpaisarn, Hidefumi Hiraishi, Hiroshi Imai
Parametric Multiroute Flow and Its Application to Robust Network with k Edge Failures. ISCO (2014)
Jean-François Baffier, Vorapong Suppakitpaisarn
A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow. WALCOM (2014)
Norie Fu, Vorapong Suppakitpaisarn, Kei Kimura, Naonori Kakimura
Maximum lifetime coverage problems with battery recovery effects. GLOBECOM (2014)
Vorapong Suppakitpaisarn, Masato Edahiro, Hiroshi Imai
Fast Elliptic Curve Cryptography Using Minimal Weight Conversion of d Integers. AISC (2012)
Vorapong Suppakitpaisarn, Hiroshi Imai, Masato Edahiro
Fastest multi-scalar multiplication based on optimal double-base chains. WorldCIS (2012)
Vorapong Suppakitpaisarn, Masato Edahiro, Hiroshi Imai
Calculating Average Joint Hamming Weight for Minimal Weight Conversion of d Integers. WALCOM (2012)
Vorapong Suppakitpaisarn, Masato Edahiro, Hiroshi Imai
Fast Elliptic Curve Cryptography Using Optimal Double-Base Chains. IACR Cryptol. ePrint Arch. 2011 (2011)
Vorapong Suppakitpaisarn, Masato Edahiro, Hiroshi Imai
Optimal Average Joint Hamming Weight and Minimal Weight Conversion of d Integers. IACR Cryptol. ePrint Arch. 2010 (2010)