default search action
Discrete Mathematics, Algorithms and Applications, Volume 4
Volume 4, Number 1, March 2012
- Olof Heden:
A Survey of the Different Types of Vector Space Partitions. - Emilia A. Monakhova
:
A Survey on Undirected circulant Graphs. - Viji Paul, K. Augustine Germina
On Edge Coloring of Hypergraphs and ERDöS-Faber-LováSZ Conjecture. - Xiaoyan Ma, Xiaohui Huang, Zhao Zhang:
Diameter Vulnerability of Directed cycles and Directed Tori. - Bang Ye Wu:
Fully Polynomial-Time Approximation Schemes for the Max-Min Connected Partition Problem on Interval Graphs. - Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Signed total {k}-domination and {k}-Domatic numbers of Graphs. - Adegoke S. Osifodunrin:
A Simple Way to Establish Non-existence of difference Sets. - James Nastos, Yong Gao:
Bounded Search Tree Algorithms for Parametrized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes. - Tanaeem M. Moosa, M. Sohel Rahman:
Improved Algorithms for the Point-Set Embeddability Problem for Plane 3-Trees. - Deying Li, Zheng Li, Wenkai Ma, Wenping Chen:
Constrained Relay Node Deployment for Underwater acoustic Wireless Sensor Networks. - Wlodzimierz Bielecki, Tomasz Klimek, Marek Palkowski, Anna Beletska:
An Iterative Algorithm of Computing the Transitive Closure of a Union of Parametrized Affine Integer Tuple Relations. - Yiwei Jiang, An Zhang, Jueliang Hu:
Optimal Online Algorithms on Two Hierarchical Machines with Resource Augmentation.
Volume 4, Number 2, June 2012
- Qinghai Liu, Xiang Li, Lidong Wu, Hai Du, Zhao Zhang, Weili Wu, Xiaodong Hu, Yinfeng Xu:
A New Proof for Zassenhaus-Groemer-Oler inequality. - Yong Zhang, Yuxin Wang, Francis Y. L. Chin, Hing-Fung Ting:
Competitive Algorithms for Online Pricing. - Berkeley R. Churchill, Edmund A. Lamagna:
An Efficient Algorithm for Deriving Summation Identities from Mutual Recurrences. - T. Tamizh Chelvam
The Signed Star domination Number of Cayley Graphs. - A. P. Santhakumaran, P. Titus:
A Note on "Monophonic Distance in Graphs". - Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh:
An Efficient Algorithm for Chinese Postman Walk on Bi-Directed de Bruijn Graphs. - Yi Shi, Maryam Hasan, Zhipeng Cai, Guohui Lin, Dale Schuurmans:
Linear Coherent Bi-Clustering via Beam Searching and Sample Set Clustering. - Mirela Damian, Kristin Raudonis:
Yao Graphs Span Theta Graphs. - Fenggen Lin, Lianzhu Zhang, Fuliang Lu:
Perfect Matchings and Genus of Some Cartesian Products of Graphs. - Nini Xue, Baoyindureng Wu:
List Point Arboricity of Graphs. - A. P. Santhakumaran:
Extreme Steiner Graphs. - Ming Liu, Feifeng Zheng, Chengbin Chu, Yinfeng Xu:
Scheduling deteriorating Jobs on a Single Machine with Release times and rejection. - Yuehua Bu, Kai Lu:
Injective Coloring of Planar Graphs with girth 7. - Ahmad Erfanian, Behnaz Tolue:
Conjugate Graphs of Finite Groups. - Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny:
Optimizing Data Throughput in Client/Server Systems by keeping Queue Sizes Balanced.
Volume 4, Number 3, September 2012
- Yi Hong, Hongwei Du, Deying Li, Wenping Chen:
Conflict-Aware Data Aggregation Scheduling in Wireless Sensor Networks with Adjustable Transmission Range. - Jennifer Seberry, Dongvu Tonien
Some Constructions of Mutually Orthogonal Latin Squares and Superimposed Codes. - Ullas Thomas, Sunil C. Mathew
On Set-Indexers of Paths, cycles and certain Related Graphs. - Florian Huc, Cláudia Linhares Sales
The Proportional Coloring Problem: Optimizing Buffers in Radio Mesh Networks. - Manjusri Basu, Bandhu Prasad
Coding Theory on H(X) Fibonacci P-numbers polynomials. - Lihua Feng:
The Gutman Index of unicyclic Graphs. - Loreto Gonzalez-Hernandez, Nelson Rangel-Valdez
Construction of Mixed Covering Arrays of strengths 2 through 6 Using a Tabu Search Approach. - Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Ladislav Stacho:
Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs. - Maryvonne Mahéo, Jean-François Saclé:
SOME RESULTS ON (p, g, ∑)-VALUATION OF GRAPHS. - Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Jaroslav Opatrny, Oscar Morales-Ponce, Ladislav Stacho:
Strong Connectivity in Sensor Networks with given Number of Directional Antennae of Bounded Angle. - Masashi Kiyomi
Bipartite Permutation Graphs are reconstructible. - Vasileios Iliopoulos, David B. Penman:
Dual Pivot Quicksort. - Wei Gao, Fen Zhou:
A Question on Relaxed equitable Coloring. - Bal Kishan Dass, Rashmi Verma:
Construction of M-Repeated Burst Error Correcting Binary Linear Code. - Dinabandhu Pradhan:
Complexity of certain Functional Variants of total domination in Chordal bipartite Graphs. - Jianfeng Hou, Guizhen Liu:
A Bound on the bondage Number of toroidal Graphs.
Volume 4, Number 4, December 2012
- Adrian Dumitrescu:
The Traveling Salesman Problem for Lines and Rays in the Plane. - Aijun Dong, Guanghui Wang:
Neighbor Sum Distinguishing Coloring of some Graphs. - Bal Kishan Dass, Poonam Garg
Bounds for Codes Correcting/Detecting repeated Low-Density Burst Errors. - Manjusri Basu, Debiprasad Acharya
The Algorithm of Finding All Paradoxical Pairs in a Linear Transportation Problem. - B. S. Panda, Dinabandhu Pradhan:
Acyclic Matchings in Subclasses of bipartite Graphs. - Ming Liu, Chengbin Chu:
Optimal Semi-Online Algorithms for M-batch-Machine Flow shop Scheduling. - Carolin Hannusch
Construction of Self-Dual Radical 2-Codes of given Distance. - Yoshihiro Indo, Takaaki Mizuki
Absolutely Secure Message Transmission using a Key Sharing Graph. - Kannan Balakrishnan, Manoj Changat, Henry Martyn Mulder, Ajitha R. Subhamathi:
Axiomatic Characterization of the antimedian Function on Paths and Hypercubes. - Biswajit Deb
On Mrj Reachability in Trees. - Joonmo Kim, Li Sheng:
A Note on Balanced Howell Rotations for Twin Prime Power Type. - Blanca Isabel Niel:
Every Longest Hamiltonian Path in even n-Gons. - Dipendu Maity, Ashish Kumar Upadhyay
Contractible Hamiltonian cycles in Polyhedral Maps. - Tariq Shah, Antonio Aparecido de Andrade:
Cyclic Codes through , with and B = A+1, and Encoding. - Somnath Paul
On the Maximal Distance spectral radius in a Class of bicyclic Graphs. - Francesco M. Malvestuto, Mauro Mezzini
Characteristic Properties and Recognition of Graphs in which Geodesic and Monophonic convexities are Equivalent.
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-11-18 20:34 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: