‪Yousef M. Alhamdan‬ - ‪Google Scholar‬

Get my own profile

Cited by

	All	Since 2019
Citations	7	7
h-index	1	1
i10-index	0	0

0

4

2

202020212022202320241 3 2 1

Co-authors

Kononov Alexander (Кононов Алекса...Sobolev Institute of Mathematics (Институт Математики им. С.Л. Соболева СО РАН)Verified email at math.nsc.ru
Shigeru YamashitaRitsumeikan UniversityVerified email at cs.ritsumei.ac.jp

Yousef M. Alhamdan

Yousef M. Alhamdan

Umm Al Qura University

Verified email at uqu.edu.sa - Homepage

Approximation Algorithm Computational Complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem Yousef M. Alhamdan, Alexander Kononov The 14th International Computer Science Symposium in Russia 11532, 1-12, 2019	7*	2019
Approximation Algorithm for the Maximum k-Edge-Colored Problem YM ALHAMDAN Novosibirsk State University, 2018		2018
Reduction of Computational Steps for Topological Quantum Computation by Inserting SWAP Gates K Hoshi, Y Alhamdan, S Yamashita, S Devitt, D Nemoto Poster presented at the AQIS'15 (http://aqis-conf.org/2015/program/posters …, 2015		2015

The system can't perform the operation now. Try again later.

Articles 1–3