Vorapong Suppakitpaisarn

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