Vorapong Suppakitpaisarn

  • National Institute of Informatics (NII), Tokyo
  • University of Tokyo, Department of Mathematical Informatics

According to our database1, Vorapong Suppakitpaisarn authored at least 47 papers between 2010 and 2022.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools.
Inf. Process. Lett., 2022

On the maximum edge-pair embedding bipartite matching.
Theor. Comput. Sci., 2021

A Voronoi-based method for land-use optimization using semidefinite programming and gradient descent algorithm.
Int. J. Geogr. Inf. Sci., 2021

Tight Lower Bound for Average Number of Terms in Optimal Double-base Number System.
CoRR, 2021

Evolving Homomorphic Secret Sharing for Hierarchical Access Structures.
Proceedings of the Advances in Information and Computer Security, 2021

On the Size of Minimal Separators for Treedepth Decomposition.
CoRR, 2020

PACE Solver Description: Computing Exact Treedepth via Minimal Separators.
Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

Improving Accuracy of Differentially Private Kronecker Social Networks via Graph Clustering.
Proceedings of the 2020 International Symposium on Networks, Computers and Communications, 2020

Constructive t-secure Homomorphic Secret Sharing for Low Degree Polynomials.
Proceedings of the Progress in Cryptology - INDOCRYPT 2020, 2020

Two-Stage Framework for Accurate and Differentially Private Network Information Publication.
Proceedings of the Computational Data and Social Networks - 9th International Conference, 2020

Skull and Roses Card Game.
Proceedings of the Encyclopedia of Computer Graphics and Games., 2019

Adaptive probabilistic caching technique for caching networks with dynamic content popularity.
Comput. Commun., 2019

A Computation-Efficient Approach for Segment Routing Traffic Engineering.
IEEE Access, 2019

Smart Contract-Driven Mechanism Design to Mitigate Information Diffusion in Social Networks.
Proceedings of the Mathematical Research for Blockchain Economy, 2019

Relaxed triangle inequality ratio of the Sørensen-Dice and Tversky indexes.
Theor. Comput. Sci., 2018

Maximum lifetime coverage problem with battery recovery effect.
Sustain. Comput. Informatics Syst., 2018

Optimal Representation for Right-to-Left Parallel Scalar and Multi-Scalar Point Multiplication.
Int. J. Netw. Comput., 2018

Bilevel Model for Adaptive Network Flow Problem.
Electron. Notes Discret. Math., 2018

Segment Routed Traffic Engineering with Bounded Stretch in Software-Defined Networks.
Proceedings of the 43rd IEEE Conference on Local Computer Networks, 2018

An Approximation Algorithm for Incrementally Deploying SDN Forwarding Devices.
Proceedings of the 12th International Conference on Ubiquitous Information Management and Communication, 2018

Improved Localization Accuracy Using Machine Learning: Predicting and Refining RSS Measurements.
Proceedings of the IEEE Globecom Workshops, 2018

Privacy Disclosure Adaptation for Trading between Personal Attributes and Incentives.
J. Inf. Process., 2017

Optimal Representation for Right-to-Left Parallel Scalar Point Multiplication.
Proceedings of the Fifth International Symposium on Computing and Networking, 2017

Reducing Recovery Error in Compressive Sensing with Limited Number of Base Stations.
Proceedings of the 2017 IEEE Global Communications Conference, 2017

Parallelized Side-Channel Attack Resisted Scalar Multiplication Using q-Based Addition-Subtraction k-chains.
IACR Cryptol. ePrint Arch., 2016

An Approximation Algorithm for Multiroute Flow Decomposition.
Electron. Notes Discret. Math., 2016

Parametric multiroute flow and its application to multilink-attack network.
Discret. Optim., 2016

Semimetric Properties of Sørensen-Dice and Tversky Indexes.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

Improving Motivation in Survey Participation by Question Reordering.
Proceedings of the Knowledge Management and Acquisition for Intelligent Systems, 2016

A Mapping Heuristic for Minimizing Message Latency in Massively Distributed MCTS.
Proceedings of the Fourth International Symposium on Computing and Networking, 2016

Improving Width-3 Joint Sparse Form to Attain Asymptotically Optimal Complexity on Average Case.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

Two Lower Bounds for Shortest Double-Base Number System.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

Algorithms for finding robust and sustainable network flows against multilink-attack.
Proceedings of the 7th International Workshop on Reliable Networks Design and Modeling, 2015

Performance analysis of probabilistic caching scheme using Markov chains.
Proceedings of the 40th IEEE Conference on Local Computer Networks, 2015

Evaluating the importance of personal information attributes using graph mining technique.
Proceedings of the 9th International Conference on Ubiquitous Information Management and Communication, 2015

Robust network flow against attackers with knowledge of routing method.
Proceedings of the 16th IEEE International Conference on High Performance Switching and Routing, 2015

Clustering 1-Dimensional Periodic Network Using Betweenness Centrality.
Proceedings of the Computational Social Networks - 4th International Conference, 2015

A Prototype Decision Support System for Privacy-Service Trading.
Proceedings of the 2015 IEEE International Conference on Multimedia Big Data, BigMM 2015, 2015

A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow.
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Worst case computation time for minimal joint Hamming weight numeral system.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

Parametric Multiroute Flow and Its Application to Robust Network with k Edge Failures.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

Maximum lifetime coverage problems with battery recovery effects.
Proceedings of the IEEE Global Communications Conference, 2014

Fastest multi-scalar multiplication based on optimal double-base chains.
Proceedings of the 2012 World Congress on Internet Security, 2012

Calculating Average Joint Hamming Weight for Minimal Weight Conversion of d Integers.
Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

Fast Elliptic Curve Cryptography Using Minimal Weight Conversion of d Integers.
Proceedings of the Tenth Australasian Information Security Conference, 2012

Fast Elliptic Curve Cryptography Using Optimal Double-Base Chains.
IACR Cryptol. ePrint Arch., 2011

Optimal Average Joint Hamming Weight and Minimal Weight Conversion of d Integers.
IACR Cryptol. ePrint Arch., 2010