default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Algorithms and Applications, Volume 3
Volume 3, Number 1, March 2011
- I. Sahul Hamid, A. Anitha
:
On the Label graphoidal Covering Number-II. 1-8 - Weiping Shang, Xiumei Wang:
Algorithms for Minimum Connected capacitated Dominating Set Problem. 9-16 - Weijuan Zhang, Baoyindureng Wu, Xinhui An:
The Hyper-Wiener Index of the kth Power of a Graph. 17-24 - Wei Zhu, Shengbiao Hu, Haicheng Ma:
A Note on Tricyclic Graphs with Minimum Degree Distance. 25-32 - Arezoo N. Ghameshlou, Abdollah Khodkar, Seyed Mahmoud Sheikholeslami:
The Signed Bad numbers in Graphs. 33-42 - Xuan Gong, Maggie X. Cheng, Yibo Xu:
Throughput and Delay Optimization with Configurable Tradeoff in Multihop Wireless Networks. 43-52 - G. Marimuthu, M. Sivanandha Saraswathy, G. Uma Maheshwari:
The Upper and Lower Independence Number of Graphs. 53-62 - Hanumappa B. Walikar, L. Sudershan Reddy:
Graphs that are not domatically Co-Critical. 63-68 - Weili Wu, Jiaofei Zhong:
On Characteristic Area of Steiner Tree. 69-76 - Dragan M. Randjelovic:
Calculations of High Dependability on Flowing Systolic Arrays for Two Matrix Multiplication. 77-86 - Milan Nath:
On the Null-Spaces of bicyclic singular Graphs. 87-100 - Vardges Melkonian:
Circuit Integration through Lattice Hyperterms. 101-120 - Adegoke S. Osifodunrin:
ON THE EXISTENCE OF NON-ABELIAN (210, 77, 28), (336, 135, 54) AND (496, 55, 6) DIFFERENCE SETS. 121-138
Volume 3, Number 2, June 2011
- Yi-Zheng Fan, Jing-Mei Zhang, Yi Wang:
Spectral radii of unicyclic Graphs with Fixed Number of Cut vertices. 139-146 - Xunuan Yang, Baoyindureng Wu, Guiying Yan:
On the Sum of Independence Number and Average Degree of a Graph. 147-158 - A. P. Santhakumaran, P. Titus:
Monophonic Distance in Graphs. 159-170 - Yuehua Bu, Yudie Wu:
k-FOLD (2k + 1)-COLORING OF PLANAR GRAPHS. 171-184 - Ya-Hong Chen, Rong-Ying Pan, Xiao-Dong Zhang:
Two Sharp Upper Bounds for the signless Laplacian spectral radius of Graphs. 185-192 - Erling Wei, Ye Chen, Ping Li, Hong-Jian Lai:
Every N2-Locally Connected claw-Free Graph with Minimum Degree at Least 7 is Z3-Connected. 193-202 - Lyra Yulianti:
The asymptotic Distribution of the Number of 3-Star Factors in Random d-Regular Graphs. 203-222 - Christos Koukouvinos, Dimitris E. Simos:
Quasi-Cyclic Codes from Cyclic-Structured Designs with Good Properties. 223-244 - Vadim E. Levit, Eugen Mandrescu:
Very Well-Covered Graphs of girth at Least Four and Local Maximum Stable Set Greedoids. 245-252 - Milan Nath:
On the Second largest spectral radius of unicyclic bipartite Graphs. 253-258 - Manjusri Basu, Bandhu Prasad:
Coding Theory on the (M, T)-Extension of the Fibonacci P-numbers. 259-268
Volume 3, Number 3, September 2011
- Bhadrachalam Chitturi:
A Note on Complexity of Genetic mutations. 269-286 - Dongvu Tonien, Reihaneh Safavi-Naini, Peter R. Wild:
On "the Power of Verification Queries" in Unconditionally Secure Message Authentication. 287-304 - Zhihua An, Baoyindureng Wu, Daobin Li, Yun Wang, Guifu Su:
Nordhaus-Gaddum-Type Theorem for Diameter of Graphs when Decomposing into Many Parts. 305-310 - A. Anitha, S. Arumugam, Mustapha Chellali:
Equitable domination in Graphs. 311-322 - Fanica Gavril:
Minimum Weight Feedback Vertex Sets in Circle n-Gon Graphs and Circle Trapezoid Graphs. 323-336 - Baoyindureng Wu, Guojie Liu, Xinhui An, Guiying Yan, Xiaoping Liu:
A Conjecture on Average Distance and Diameter of a Graph. 337-342 - Xiaojuan Li, Bing Wei, Yongjin Zhu:
Cycles in Triangle-Free Graphs. 343-356 - A. P. Santhakumaran, T. Jebaraj, S. V. Ullas Chandran:
The Linear geodetic Number of a Graph. 357-368 - Mathilde Bouvel, Cédric Chauve, Marni Mishna, Dominique Rossin:
Average-Case Analysis of Perfect Sorting by Reversals. 369-392 - Dongvu Tonien, Reihaneh Safavi-Naini, Peter Nickolas:
Breaking and Repairing an Approximate Message Authentication Scheme. 393-412
Volume 3, Number 4, December 2011
- T. Tamizh Chelvam, Thangaraj Asir:
Domination in the total Graph on ℤn. 413-422 - Jin-Yi Liu:
A Randomized Algorithm for Weighted Approximation of Points by a Step Function. 423-432 - Qinghai Liu, Zhao Zhang, Zhihua Yu:
Cyclic Connectivity of Star Graph. 433-442 - Tomoshi Otsuki, Hideyuki Aisu, Toshiaki Tanaka:
A Search-Based Approach to Railway Rolling Stock Allocation Problems. 443-456 - Balasingham Balamohan, Paola Flocchini, Ali Miri, Nicola Santoro:
Time Optimal Algorithms for Black Hole Search in Rings. 457-472 - Hai Du, Weili Wu, Zaixin Lu, Yinfeng Xu:
On the Steiner Ratio in. 473-490 - Wei Ding, Guohui Lin, Guoliang Xue:
Diameter-Constrained Steiner Trees. 491-502 - Wei Ding, Guoliang Xue:
A Divide-and-Conquer Algorithm for Finding a Most Reliable Source on a Ring-Embedded Tree Network with Unreliable Edges. 503-516 - Peter Damaschke, Azam Sheikh Muhammad:
Bounds for Nonadaptive Group Tests to estimate the Amount of Defectives. 517-536 - Gregory Karagiorgos, Dimitrios Poulakis:
Efficient Algorithms for the Basis of Finite Abelian Groups. 537-552 - Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Robenek, Denis Trystram:
Approximation Algorithms for Multiple Strip Packing and Scheduling Parallel Jobs in Platforms. 553-586 - Reihaneh Safavi-Naini, Dongvu Tonien:
Fuzzy Universal Hashing and Approximate Authentication. 587-608
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
