default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Algorithms and Applications, Volume 5
Volume 5, Number 1, March 2013
- A. Bahremandpour, Fu-Tao Hu, Seyed Mahmoud Sheikholeslami, Jun-Ming Xu:
On the Roman bondage Number of a Graph. - Hanumappa B. Walikar, L. Sudershan Reddy, S. B. Basapur:
Few More Results in domatically Co-Critical Graphs. - Bhadrachalam Chitturi:
Upper Bounds for Sorting Permutations with a Transposition Tree. - Jean-Claude Bermond, Ralf Klasing, Nelson Morales, Stéphane Pérennes, Patricio Reyes:
Gathering Radio Messages in the Path. - Xianling Lu, Deying Li, Yi Hong, Wenping Chen:
A Low-Cost Range-Free Localization Scheme for Three-Dimensional Underwater Sensor Networks. - I. Sahul Hamid, Mayamma Joseph
:
Further Results on induced graphoidal Decomposition. - T. Tamizh Chelvam, S. Nithya:
Zero-Divisor Graph of an Ideal of a Near-Ring.
Volume 5, Number 2, June 2013
- Md. Saidur Rahman:
Guest Editor's Foreword. - Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano:
Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression. - Tiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri:
On the Pairwise Compatibility Property of some Superclasses of Threshold Graphs. - Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier:
Comparing and Aggregating Partial Orders with Kendall tau Distances. - Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization under Vertex Insertion: Max PK-Free Subgraph and Max Planar Subgraph. - Tanaeem M. Moosa, Sumaiya Nazeen, M. Sohel Rahman, Rezwana Reaz:
Inferring Strings from Cover Arrays. - Amr Elmasry, Jyrki Katajainen:
Fat Heaps without Regular Counters.
Volume 5, Number 3, September 2013
- Mirela Damian, Robin Y. Flatland:
Spanning Properties of graphs induced by Directional Antennas. - Odile Favaron, Rana Khoeilar, Seyed Mahmoud Sheikholeslami:
Total outer-Connected domination subdivision numbers in graphs. - Laurent Lyaudet, Paulin Melatagia Yonta, Maurice Tchuenté, René Ndoundam:
Distance Preserving Subtrees in Minimum Average Distance Spanning Trees. - M. Kamal Kumar, L. Sudershan Reddy:
Inverse Roman domination in graphs. - N. Sridharan, S. Amutha, S. B. Rao:
Induced subgraphs of Gamma graphs. - Satyajit Banerjee:
An Efficient NC Algorithm for Approximate Maximum Weight Matching. - Milan Nath, Somnath Paul:
Graph Transformation and Distance spectral radius. - Terry A. McKee:
When All Minimal Vertex Separators Induce Complete or edgeless subgraphs. - Adegoke S. Osifodunrin:
On the Existence of a Class of (v, k, λ) Difference Sets with k < 350, n = m2, m = 5, 8, 9, 11, 13, 14 and v ≡ 0 mod 68. - Xue Du, Lingsheng Shi:
Graphs with Small Independence Number Minimizing the spectral radius. - P. G. Bhat, R. S. Bhat, Surekha R. Bhat:
Relationship between Block domination parameters of a Graph. - Geir Dahl, Fuzhen Zhang:
Integral majorization Polytopes. - Michael C. I. Nwogugu:
Sub-additive Recursive "Matching" noise and Biases in Risk-Weighted Index calculation Methods in Incomplete Markets with Partially Observable Multi-Attribute Preferences. - Bing Su, Yinfeng Xu, Binhai Zhu:
Baseline Bounded half-Plane Voronoi Diagram. - Bhadrachalam Chitturi:
Erratum: "Upper Bounds for Sorting Permutations with a Transposition Tree".
Volume 5, Number 4, December 2013
- Linda Eroh, Cong X. Kang, Eunjeong Yi:
On Metric Dimension of functigraphs. - Chaivatna Sumetphong, Supachai Tangwongsan:
Optimal Set-Partitioning Based on Group Quality likelihood using Partition-Growing Algorithm. - P. Paulraja, V. Sheeba Agnes:
Connectivity of Tensor Product of graphs. - B. S. Panda, Subhabrata Paul:
Connected Liar's domination in graphs: Complexity and Algorithms. - Nader Jafari Rad, Fatemeh Khosravi:
Limited Dominating Broadcast in graphs. - Sunil Mathew:
Arc Analysis Algorithm (AAA) for Arc-Weighted graphs. - Sizhong Zhou, Yang Xu, Jiancheng Wu:
Stability number and Minimum Degree for (a, B, k)-Critical graphs. - Guanghui Wang, Bingqiang Liu, Guizhen Liu:
A note on Rainbow Matchings. - Shengjie He, Liancui Zuo:
The Linear 6-arboricity of the Complete bipartite Graph KM, n. - Proceso L. Fernandez, Lenwood S. Heath, Naren Ramakrishnan, Michael Tan, John Paul C. Vergara:
Mining Posets from Linear Orders. - Zaixin Lu, Weili Wu, Weidong Chen, Jiaofei Zhong, Yuanjun Bi, Zheng Gao:
The Maximum Community Partition Problem in Networks. - Yue Shi, Haizhong Shi:
On the Trade Web of China and the United States: a Network Analysis. - Oscar Ortega, G. Kriston:
The median Function on Trees. - J. John, K. Uma Samundesvari:
The forcing Edge Fixing Edge-to-Vertex Monophonic number of a Graph. - Mojgan Afkhami, Kazem Khashyarmanesh:
Total graphs of Polynomial Rings and Rings of fractions. - Swadesh Choudhary, Hrishikesh Sharma, Sachin Patkar:
Optimal Folding of Data Flow graphs Based on Finite Projective Geometry using Vector Space Partitioning. - S. Arumugam, Varughese Mathew, Jian Shen:
On fractional Metric Dimension of graphs. - Aistis Atminas, Vadim V. Lozin, Sergey Kitaev, Alexandr Valyuzhenich:
Universal graphs and Universal Permutations. - Modjtaba Ghorbani, Mohammad Ali Hosseinzadeh:
The Third Version of Zagreb Index.
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:05 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:
