** **

**May 2015 - Present: Graduate School of Information Science and Technology (IST), The University of Tokyo**

Project Lecturer and Assistant Professor

Teach and Research about discrete mathematics and algorithms.

** **

**Apr 2013 - Apr 2015: National Institute of Informatics **
(Tokyo, Japan)

Project Researcher in "*JST, ERATO: Kawarabayashi Large Graph Project*",
Network Graph Theory and Optimization Group

** **

**Oct 2012 - Mar 2013: Department of Mathematical Informatics, The University of Tokyo**

Project Researcher in "*a Multifaceted Approach toward Understanding the Limitations of Computation*" Project

**Oct 2009 - Sep 2012: The University of Tokyo**

Ph.D. in Computer Science

*Thesis: "Generalized Analysis Methods for Efficiency of Representations on Scalar Multiplication" *

**Oct 2007 - Sep 2009: The University of Tokyo**

M.S. in Computer Science

*
Thesis: "Optimal Average Joint Hamming Weight and Digit Set Expansion of Integer Pairs" (IPSJ Certificate of Excellent Master's Thesis)
*

**April 2003 - Mar 2007: Chulalongkorn University**

B.Eng. (1^{st} class Honors) in Computer Engineering

*Thesis: "Minimum Weight Conversion for Polygonal Complex Number Representation"*

** **

- ISITA2014 -- IEEE IT Society Japan Chapter, Young Researcher Best Paper Award

- Japanese Government Scholarships

- TJIA2012 - Best Presentation Award

- ICIA2012 - Best Paper Award

- 72th National Convention - Student Research Promotion Award
Information Processing Society of Japan

- 3^{rd} Place, World Robocup Competition, Small-Sized League, with*Plasma-Z*.

- Second Round Qualifier, Imagine Cup World Finalist, with*Pentor*.

- Software Development,*Companion Transform*.
Integrated Image Processing Method into Web Service

- The 4

- The 7

- The 7

- The 3

- The 7

- The 6

1. A. Gragera and V. Suppakitpaisarn, "*Relaxed Triangle Inequality Ratio of the Sorensen-Dice and Tversky
Indexes
*
", Theoretical Computer Science (TCS), Elsevier, 2017.*(Accepted)*

2. N. Fu and V. Suppakitpaisarn, "*Clustering 1-Dimensional Periodic Network Using Betweenness Centrality
*
", Computational Social Networks (CSON), Vol. 3, No. 6, pages 1-20,
Springer, 2016.

3. A. Osothongs, V. Suppakitpaisarn, and N. Sonehara, "
*
Privacy Disclosure Adaptation for Trading between Personal Attributes
and Incentives
*
", Journal of Information Processing (JIP), Vol. 25, No. 1, IPSJ, 2017. *(In Press)*

4. J. Baffier, V. Suppakitpaisarn, H. Hiraishi, and H. Imai, "
*
Parametric Multiroute Flow and its Application to Multilink-Attack
Network
*
", Discrete Optimization, Vol. 22, Part 1, pages 20-36, Elsevier, 2016.

5. V. Suppakitpaisarn, " *An Approximation Algorithm for Multiroute Flow Decomposition*",
Electronic Notes in Discrete Mathematics, Vol. 52, pages 367-374, Elsevier,
2016.

6. P. Chalermsook, H. Imai, and V. Suppakitpaisarn, " *Two Lower Bounds for Shortest Double-Base Number System*", IEICE
Transactions on Fundamentals of Electronics, Communications and Computer
Sciences, Vol. E98-A, No. 6, pages 1310-1312, IEICE, 2015.

7. V. Suppakitpaisarn and J. Baffier, "
*
Speeding up Algorithm for Maximizing Barrier Coverage Using Parametric
Multiroute Flow
*
", IEICE Communications Express, Vol. 4, No. 4, pages 111-116, IEICE, 2015.

8. H. Imai and V. Suppakitpaisarn, "
*
Improving Width-3 Joint Sparse Form to Attain Asymptotically Optimal
Complexity on Average Case
*
", IEICE Transactions on Fundamentals of Electronics, Communications and
Computer Sciences: Special Section on Discrete Mathematics and Its
Applications, Vol. E98-A, No. 6, pages 1216-1222, IEICE, 2015.

9. V.Suppakitpaisarn, M.Edahiro, and H. Imai, "
*
Optimal Elliptic Curve Scalar Multiplication Using Double-Base Chains
*
", International Journal of Digital Information and Wireless Communications
(IJDIWC), Vol. 2, No. 1, pages 923-942, SWIDC, 2012.

1. A. Gragera and V. Suppakitpaisarn,
*
"A Mapping Heuristic for Minimizing Message Latency in Massively
Distributed MCTS
*
"*, *the 8th International Workshop on Parallel and Distributed
Algorithms and Applications (PDAA2016), IEEE Xplore, 2016.*(In Press) *

2. K. Phalakarn, K. Phalakarn, and V. Suppakitpaisarn, "
*
Parallelized Side-Channel Attack Resisted Scalar Multiplication Using
q-Based Addition-Subtraction k-chains
*
", the 4^{th} International Symposium on Computing and Networking(CANDAR2016), IEEE Xplore, 2016.*(in press)*

3. P. Pakawanwong and V. Suppakitpaisarn, "
*
Visualizing the Brain Structure with a DT-MRI Integer-Programming
k-Minimum Spanning Arborescence
*
", the 8^{th} Thailand-Japan International Academic Conference
(TJIA2016), pages 58-63, 2016.

4. R. K. Singh, V. Suppakitpaisarn, and A. Osothongs, "
*
Improving Motivation in Survey Participation by Question Reordering
*
", In Hayato Owada & Kenichi Yoshida (eds.), PKAW: Knowledge Management
and Acquisition for Smart Systems and Services, Lecture Notes in Artificial
Intelligence (LNAI), Vol. 9806, pages 231-240, Springer, 2016.

5. A. Gragera and V. Suppakitpaisarn, "*Semimetric Properties of Sorensen-Dice and Tversky Indices*", In
Mohammad Kaykobad & Rossella Petreschi (eds.), WALCOM: Algorithms and
Computation, Lecture Notes in Computer Science (LNCS), Vol. 9627, pages
339-350, Springer, 2016.

6. A. Osothongs, V. Suppakitpaisarn, and N. Sonehara, "
*
A Proposed Method for Personal Attributes Disclosure Valuation: A Study
on Personal Attributes Disclosure in Thailand
*
", the 7^{th} International Conference on Information Technology
and Electrical Engineering (ICITEE 2015), pages 408-413, IEEE Xplore, 2015.

7. J. Baffier and V. Suppakitpaisarn, "
*
Algorithms for Finding Robust and Sustainable Network Flows against
Multilink-Attack
*
", the 3^{rd} International Workshop on Understanding the
Inter-Play between Sustainability, Resilience, and Robustness in Networks
(USRR 2015), pages 251-258, IEEE Xplore, 2015.

8. S. Tarnoi, V. Suppakitpaisarn, W. Kumwilaisak, Y. Ji, "*Performance
Analysis of Probabilistic Caching Scheme Using Markov Chains*", the 40 ^{th} Annual IEEE Conference on Local Computer Networks (IEEE LCN
2015), pages 46-54, IEEE Xplore, 2015.

9. N. Fu and V. Suppakitpaisarn, "
*
Clustering 1-Dimensional Periodic Network Using Betweenness Centrality
*
", In My T. Thai et al. (eds.), CSoNet: Computational Social Networks,
Lecture Notes in Computer Science (LNCS), Vol. 9197, pages 128-139,
Springer, 2015.

10. V. Suppakitpaisarn, W. Dai, J. Baffier, "
*
Robust Network Flow against Attackers with Knowledge of Routing Method
*
", the 16^{th} International Conference on High Performance
Switching and Routing (IEEE HPSR 2015), pages 40-47, IEEE Xplore, 2015.

11. V. Suppakitpaisarn, "*An Approximation Algorithm for Multiroute Flow Decomposition*", the
7^{th} International Network Optimization Conference (INOC 2015),
2015.

12. A. Osothongs, V. Suppakitpaisarn, and N. Sonehara, "*A Prototype Decision Support System for Privacy-Service Trading*",
the 1^{st} IEEE International Conference on Multimedia Big Data
(BigMM 2015), pages 282-283, IEEE Xplore, 2015.
*
(Demonstration Paper)
*

13. A. Osothongs, V. Suppakitpaisarn, and N. Sonehara, "*
Evaluating the Importance of Personal Information Attributes using
Graph Mining Technique
*
", ACM International Conference on Ubiquitous Information Management and
Communication (ACM IMCOM-ICUIMC 2015), Article No. 104, ACM Digital
Library, 2015.

14. V. Suppakitpaisarn and J. Baffier, "*
Speeding up Algorithm for Maximizing Barrier Coverage Using Parametric
Multiroute Flow
*
", the 7^{th} Thailand-Japan International Academic Conference
(TJIA2014), pages 180-184, 2014.

15. N. Fu, V. Suppakitpaisarn, K. Kimura, and N. Kakimura, "*Maximum Lifetime Coverage Problems with Battery Recovery Effects*",
IEEE Global Communication Conference (GLOBECOM2014) - Ad Hoc and Sensor
Networking Symposium, pages 118-124, IEEE Xplore, 2014.

16. V. Suppakitpaisarn and H. Imai, "*Worst Case Computation Time for
Minimal Joint Hamming Weight Numeral System*", the International Symposium
on Information Theory and Its Applications (ISITA2014), pages 138-142, IEEE
Xplore, 2014.
**
(IEEE IT Society Japan Chapter -- Young Researcher Best Paper Award)
**

17. J. Baffier, V. Suppakitpaisarn, H. Hiraishi, and H. Imai, "
*
Parametric Multiroute Flow and its Application to Robust Network with k
Edge Failures
*
", In Pierre Fouilhoux et al. (eds.), ISCO: Combinatorial Optimization,
Lecture Notes in Computer Science (LNCS), Vol. 8596, pages 26-37, Springer,
2014.

18. J. Baffier and V. Suppakitpaisarn, "
*
A (k+1)-Approximation Robust Network Flow Algorithm and a Tighter
Heuristic Method Using Iterative Multiroute Flow
*
", In Sudebkumar Prasant Pal & Kunihiko Sadakane (eds.), WALCOM:
Algorithms and Computation, Lecture Notes in Computer Science (LNCS), Vol.
8344, pages 68-79, Springer, 2014.

19. A. Gragera Aguaza, J. Baffier, and V. Suppakitpaisarn, "*A bounds-driven analysis of "Skull and Roses" Cards Game*", the 18^{th} Game Programming Workshop (GPW-13), pages 102-105, 2013.*(Poster Presentation)*

20. V. Suppakitpaisarn, M. Edahiro, and H. Imai, "*Optimal Elliptic Curve Cryptography Using Fibonacci Sequence*", the
5^{th} Thailand-Japan International Academic Conference (TJIA2012),
2012. **(Best Presentation Award)**

21. V. Suppakitpaisarn, M. Edahiro, and H. Imai,*"Fastest Multi-Scalar Multiplication Based on Double-Base Chain*",
World Congress on Internet Security (WorldCIS-2012), pages 93-98, IEEE
Xplore, 2012.

22. V. Suppakitpaisarn, M. Edahiro, and H. Imai, "*Fast Elliptic Curve Cryptography Using Optimal Double-Base Chains*
", the International Conference on Informatics & Applications
(ICIA2012), pages 190-204, SWIDC, 2012. **(Best Paper Award)**

23. V. Suppakitpaisarn, M. Edahiro, and H. Imai, "
*
Calculating Average Joint Hamming Weight for Minimal Weight Conversion
of d Integers
*
", In Md. Saidur Rahman & Shinichi Nakano (eds.), WALCOM: Algorithms
and Computation, Lecture Notes in Computer Science (LNCS), Vol. 7157, pages
229-240, Springer, 2012.

24. V. Suppakitpaisarn, M. Edahiro, and H. Imai, "
*
Fast Elliptic Curve Cryptography Using Minimal Weight Conversion of d
Integers
*
", In Josef Pieprzyk & Clark Thomborson (eds.), the 10^{th}
Australasian Information Security Conference (AISC2012), Conferences in
Research and Practice in Information Technology (CRPIT), Vol. 125, pages
15-26, ACS, 2012.

25. V. Suppakitpaisarn, "
*
New Side Channel Attack Countermeasure Based on Minimal Hamming Weight
Distribution
*
", the 3^{rd} Thailand-Japan International Academic Conference
(TJIA2010), pages 58-59, 2010.

26. T. Praneenararat and V. Suppakitpaisarn, "*Striped Grid Files: An Alternative for High-Dimensional Indexing*",
the 2^{nd} Thailand-Japan International Academic Conference
(TJIA2009), 2009.

**(Best Presentation Award)**

27. T. Praneenararat, V. Suppakitpaisarn, S. Pitakchonlasap and J.
Chongstitvatana, "*Striped Grid Files: An Alternative for High-dimensional Indexing*",
the 4th Joint Conference on Computer Science and Software Engineering
(JCSSE2007), pages 248-253, 2007.

1. K. Phalakarn, K. Phalakarn, and V. Suppakitpaisarn, "
*
Parallelized Side-Channel Attack Resisted Scalar Multiplication Using
q-Based Addition-Subtraction k-chains
*
", IACR Cryptology ePrint Archive, no. 2016: 899, 2016.

2. V. Suppakitpaisarn, M. Edahiro, H. Imai, " *Fast Elliptic Curve Cryptography Using Optimal Double-Base Chains*
", IACR Cryptology ePrint Archive, no. 2011: 30, 2011.

3. V. Suppakitpaisarn, M. Edahiro and H. Imai, " *Fast Elliptic Curve Cryptography Using Optimal Double-Base Chain*",
RIMS - Mathematical Foundation of Algorithms and Computer Science, Vol.
1744, pages 129-136, 2011.

4. V. Suppakitpaisarn and M. Edahiro, "
*
New Side Channel Attack Countermeasure Based on Minimal Hamming Weight
Distribution
*
", RIMS-Mathematical Foundation of Algorithms and Computer Science, Vol.
1691, pages 174-180, 2010.

5. V. Suppakitpaisarn, M. Edahiro, H. Imai, "
*
Optimal Average Joint Hamming Weight and Minimal Weight Conversion of d
Integers
*
", IACR Cryptology ePrint Archive, no. 2010: 300, 2010.

1. V. Suppakitpaisarn, "
*
Activities of International Center for Information Science and
Information Technology
*
", ETH Zurich - The University of Tokyo Strategic Partnership Symposium on
Science, Design, Manufacturing, and Information, 2017. *(Poster Presentation)*

2. S. Chaidee, P. Pakawanwong, V. Suppakitpaisan and P. Teerasawat, "
*
Spatial Optimization: Where Mathematics, Computer Science and
Architecture Come Together
*
", the 2^{nd} Thai-Japan Integrated Annual Educational Talk (TJIA
E-Talk 2016), page 155, 2016.

3. T. Settawatcharawanit, Y. Ji, V. Suppakitpaisarn, S. Yamada, " *TEKS: Traffic Engineering Using k-skip Source Routing*", IEICE
Research Meeting on Communication Quality (CQ), Technical Report of IEICE,
Vol. 115, no. 408, 2016.* *

4. R. K. Singh and V. Suppakitpaisarn, "
*
Improving Motivation in Survey Participation by Question Reordering
*
", 3^{rd} Research Meeting of JSAI Special Interest Group on
Business Informatics (SIG-BI), 2015.

5. S. Tarnoi, V. Suppakitpaisarn, and Y. Ji, " *Adaptive Probabilistic Caching for Information-Centric Networking*
", IEICE Research Meeting on Information Networks (IN), Technical Report of
IEICE, Vol. 115, no. 210, pages 63-68, 2015.

6. C. Chuengsatiansup and V. Suppakitpaisarn, " *Fast Elliptic Curve Multi-Scalar Multiplication Using DBNS*", IEICE
Society Conference, No. A-7-3, page 100, 2015.

7. A. Osothongs, V. Suppakitpaisarn, and N. Sonehara, " *Valuation of Personal Attributes for Privacy-Service Trading*", the
7^{th} International Workshop on Information Systems for Social
Innovation (ISSI2014), 2015. *(Poster Presentation)*

8. V. Suppakitpaisarn and K. Kawarabayashi, " *Scalable Algorithm for Adaptive Anonymity Scheme*", JST ERATO
Kawarabayashi Large Graph Project / Minato Discrete Structure Manipulation
System Project Joint Workshop - "Yosenkai" (farewell gathering), 2015. * (Poster Presentation)*

9. S. Tarnoi, V. Suppakitpaisarn, and Y. Ji, "
*
Analysis Model of Probabilistic Caching Scheme for Content-Centric
Networking
*
", IEICE Research Meeting on Communication Quality (CQ), Technical Report
of IEICE, Vol. 114, no. 404, pages 79-86, 2015.* *

10. J. Baffier, V. Suppakitpaisarn, H. Hiraishi, and H. Imai, "*Extended Multiroute Flow for Multilink Attack Networks*", 1 ^{st} Workshop for Union of CNRS Asian Research Unit (AURA), 2014.

11. F. Norie, V. Suppakitpaisarn, " *The Betweenness Centrality on 1-Dimensional Periodic Graphs*",
Workshop on Geometric Structures with Symmetry and Periodicity,
Computational Geometry Week 2014, 2014.

12. V. Suppakitpaisarn, H. Imai, "
*
Yet Another Proof for Optimal Joint Average Hamming Weight of Width-3
Joint Sparse Form
*
", Eleventh Algorithmic Number Theory Symposium (ANTS-XI), 2014. *(Poster Presentation)*

13. J. Baffier, V. Suppakitpaisarn, H. Hiraishi, and H. Imai, "
*
Parametric Multiroute Flow and its Application to Robust Network with k
Edge Failures
*
", Japanese-Swiss Workshop on Combinatorics and Computational Geometry,
2014. *(Poster Presentation)*

14. F. Norie, V. Suppakitpaisarn, " *The Betweenness Centrality on 1-Dimensional Periodic Graphs*",
Japanese-Swiss Workshop on Combinatorics and Computational Geometry, 2014. *(Poster Presentation)*

15. F. Norie, V. Suppakitpaisarn, K. Kimura, N. Kakimura, " *Maximum Lifetime Coverage Problems with Battery Recovery Effects*",
Forum on Information Technology: Special Section on Advanced Topics on
Basic Research, 2013. *(Poster Presentation)*

16. V. Suppakitpaisarn, " *Worst Case Computation Time for Minimal Joint Hamming Weight*",
Proceedings of International Conference on Numerical Computations: Theory
and Algorithms (NUMTA2013), page 134, 2013.

17. V. Suppakitpaisarn, H. Imai, "
*
Yet Another Proof for Optimal Joint Average Hamming Weight of Width-3
Joint Sparse Form
*
", the 6^{th} Annual Meeting of Asian Association for Algorithms
and Computation (AAAC2013), 2013.

18. C. Chuengsatiansup, H. Imai, and V. Suppakitpaisarn, "
*
Evaluating Optimized Computation in Double-Base Chain for Efficient
Elliptic Curve Cryptography
*
", the 15^{th} Japan-Korea Joint Workshop on Algorithms and
Computation (WAAC2012), pages 56-63, 2012*.*

19. V. Suppakitpaisarn, M. Edahiro and H. Imai, "
*
Calculating the Efficiency of Elliptic Curve Cryptography by Reducing
the Suffix Tree of Hamming Weight Array
*
", ERATO Minato Discrete Structure Manipulation System Project, Early
Summer Workshop, 2012.

20. V. Suppakitpaisarn, M. Edahiro and H. Imai, " *Optimal Average Joint Hamming Weight for Asymmetric Representation*
", IEICE Research Meeting on Theoretical Foundations of Computing (COMP),
Technical Report of IEICE, Vol. 112, no. 93, pages 79-86, 2012.

21. V. Suppakitpaisarn, M. Edahiro and H. Imai, " *Fast Elliptic Curve Cryptography Using Optimal Double-Base Chain*",
LA2010-Winter, 2011.

22. V. Suppakitpaisarn, M. Edahiro and H. Imai, "
*
Minimal Weight Conversion Algorithm for Any Digit Sets and Its Analysis
*
", 21^{st} International Workshop on Combinatorial Algorithms
(IWOCA2010), 2010. *(Poster Presentation)*

23. V. Suppakitpaisarn and M. Edahiro, "
*
Optimal Average Joint Hamming Weight and Digit Set Expansion of Integer
Pairs
*
", Proceedings of 72^{nd} IPSJ National Convention, pages 3/653 -
3/654, IPSJ, 2010. **(Student Research Promotion Award)**

24. V. Suppakitpaisarn and M. Edahiro, "
*
New Side Channel Attack Countermeasure Based on Minimal Hamming Weight
Distribution
*
", LA Symposium 2009-Winter, 2010.

25. M. Strefler, C. Su, V. Suppakitpaisarn, I. Suzuki, and A. Turrini, " *Computational and Symbolic Proofs of Security: a Short Report*",
the Spring School and Workshop on Computational and Symbolic Proofs of
Security (CoSyProofs 2009), 2009.

26. V. Suppakitpaisarn and M. Edahiro, "
*
Fast Scalar-Point Multiplication Using Enlarged Digit Set on Integer
Pairs
*
", the 26^{th} Symposium on Cryptography and Information Security
(SCIS2009), 2009.

27. V. Suppakitpaisarn and M. Edahiro, "
*
The Novel Representation for Redundant Complex Number Arithmetic:
Extended Octagonal Representation
*
", the 11^{th} Korea-Japan Joint Workshop on Algorithm and
Computation (WAAC2008), pages 7-14, 2008.

28. V. Suppakitpaisarn and A. Surarerks, "
*
Minimal Weight Representation for Polygonal Complex Number
Representation
*
", LA Symposium 2007-Winter, 2008.

29. V. Suppakitpaisarn and A. Surarerks, "*Minimal Weight Representation for Polygonal Number*", the 11 ^{th} Annual National Symposium on Computational Science and
Engineering (ANSCSE11), 2007.

1. V. Suppakitpaisarn, "*Case-Study of Research Approach by Young Engineer 1*", Special Session on I-Scover, IEICE Society Conference, No. TK-1-3,
pages SSS-5-SSS-6, 2015.

2. V. Suppakitpaisarn, "*Parametric Multiroute Flow and Robust Network Optimization*", Seminar, College of Science and Engineering, Texas State
University, 2014.

3. V. Suppakitpaisarn, "*Generalized Analysis Methods for Efficiency of Representations for Elliptic Curve Scalar Multiplication*", Lunch Seminar,
National Institute of Informatics, 2013.

4. V. Suppakitpaisarn, "*Generalized Analysis Methods for Efficiency of Representations for Elliptic Curve Scalar Multiplication*", ELC
Mini-workshop (Cryptography), 2012.

5. V. Suppakitpaisarn, "*Fast Elliptic Curve Cryptography Using Optimal Double-Base Chain*", the 3^{rd} ERATO-SORST Quantum Computation and
Information Workshop, 2011.

6. V. Suppakitpaisarn, "*Optimal Average Joint Hamming Weight and Minimal Weight Conversion of d Integers*", Uber Seminar, Cryptography and Computer
Algebra Group, Technical University of Darmstadt, 2010.

1. A. Gragera Aguaza, J. Baffier, and V. Suppakitpaisarn, " *An Analysis of 'Skull & Roses' Cards Game*", In Newton Lee et
al. (eds.), Encyclopedia of Computer Graphics and Games (ECGG), pages 1-4,
2015. *(Invited)*

2. V. Suppakitpaisarn, "
*
Optimal Average Joint Hamming Weight and Digit Set Expansion of Integer
Pairs
*
", Recommended Senior Thesis and Master Thesis by IPSJ, Information
Processing, Vol. 52, No. 2, pp. 202, IPSJ, 2011. *(In Japanese)*