ISSN 1793-8309
A NOTE ON COMPLEXITY OF GENETIC MUTATIONS
BHADRACHALAM CHITTURI
|
|
ON "THE POWER OF VERIFICATION QUERIES" IN UNCONDITIONALLY SECURE MESSAGE AUTHENTICATION DONGVU TONIEN, REIHANEH SAFAVI-NAINI and PETER WILD
|
|
NORDHAUS–GADDUM-TYPE THEOREM FOR DIAMETER OF GRAPHS WHEN DECOMPOSING INTO MANY PARTS ZHIHUA AN, BAOYINDURENG WU, DAOBIN LI, YUN WANG and GUIFU SU
|
|
EQUITABLE DOMINATION IN GRAPHS A. ANITHA, S. ARUMUGAM and MUSTAPHA CHELLALI
|
|
MINIMUM WEIGHT FEEDBACK VERTEX SETS IN CIRCLE n-GON GRAPHS AND CIRCLE TRAPEZOID GRAPHS FANICA GAVRIL
|
|
A CONJECTURE ON AVERAGE DISTANCE AND DIAMETER OF A GRAPH BAOYINDURENG WU, GUOJIE LIU, XINHUI AN, GUIYING YAN and XIAOPING LIU
|
|
CYCLES IN TRIANGLE-FREE GRAPHS XIAOJUAN LI, BING WEI and YONGJIN ZHU
|
|
THE LINEAR GEODETIC NUMBER OF A GRAPH A. P. SANTHAKUMARAN, T. JEBARAJ and S. V. ULLAS CHANDRAN
|
|
AVERAGE-CASE ANALYSIS OF PERFECT SORTING BY REVERSALS MATHILDE BOUVEL, CEDRIC CHAUVE, MARNI MISHNA and DOMINIQUE ROSSIN
|
|
BREAKING AND REPAIRING AN APPROXIMATE MESSAGE AUTHENTICATION SCHEME DONGVU TONIEN, REIHANEH SAFAVI-NAINI and PETER NICKOLAS
|