default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Algorithms and Applications, Volume 2
Volume 2, Number 1, March 2010
- Khalil Tawbe:
Reconstruction of Two Subclasses of 2l-Convex polyominoes. 1-20 - Mary V. Ashley, Tanya Y. Berger-Wolf
, Wanpracha Art Chaovalitwongse, Bhaskar DasGupta, Ashfaq A. Khokhar, Saad I. Sheikh:
An Implicit Cover Problem in wild Population Study. 21-32 - Xiumei Wang, Sujing Zhou, Yixun Lin:
Bipartite Matching extendability and toughness. 33-44 - Deepanjan Kesh, Shashank K. Mehta:
Generalized Reduction to Compute toric ideals. 45-60 - Toshimasa Ishii, Kazuhisa Makino:
Posi-Modular Systems with Modulotone Requirements under Permutation Constraints. 61-76 - Francisco Claude, Gautam K. Das, Reza Dorrigiv, Stephane Durocher, Robert Fraser, Alejandro López-Ortiz, Bradford G. Nickerson, Alejandro Salinger:
An Improved Line-Separable Algorithm for Discrete Unit Disk Cover. 77-88 - Galina T. Bogdanova, Todor Todorov, Teodora Yorgova:
New Ternary and Quaternary Constant-Weight Equidistant Codes. 89-98 - Weiping Shang, Xiumei Wang, Xiaodong Hu:
Roman domination and its Variants in Unit Disk Graphs. 99-106 - Chih-Wei Yi, Peng-Jun Wan, Chao-Min Su, Kuo-Wei Lin, Scott C.-H. Huang:
Asymptotic Distribution of the Number of isolated Nodes in Wireless Ad Hoc Networks with Unreliable Nodes and Links. 107-124 - Feng Zou, James Willson, Zhao Zhang, Weili Wu:
Fast Information Propagation in Social Networks. 125-142
Volume 2, Number 2, June 2010
- Chunxiang Wang:
On Edge-Connectivity and Super Edge-Connectivity of Interconnection Networks Modeled by Product Graphs. 143-150 - Haichao Wang, Liying Kang:
Matching Properties in Double domination Edge Critical Graphs. 151-160 - Yam Ki Cheung, Ovidiu Daescu:
FréChet Distance Problems in Weighted Regions. 161-180 - Bal Kishan Dass, Surbhi Madan:
Repeated Burst Error Locating Linear Codes. 181-188 - Moshe Dror, James B. Orlin, Michael Zhu:
Packing Shelves with Items that Divide the Shelves' Length: a Case of a Universal Number Partition Problem. 189-198 - Jyhmin Kuo:
On the Twin domination Number in Generalized de Bruijn and Generalized Kautz digraphs. 199-206 - Yuehua Bu, Qiong Li, Shuiming Zhang:
Equitable Coloring of 2-degenerate Graph and Plane Graphs without cycles of Specific lengths. 207-212 - Meijie Ma:
The Connectivity of Exchanged Hypercubes. 213-220 - Hejiao Huang, Taiping Lu:
Solving a Multi-Objective Flexible Job shop Scheduling Problem with Timed Petri Nets and Genetic Algorithm. 221-238 - Yuming Feng, Limin Zou:
On Product of Fuzzy Subhyperlattice and Interval-Valued Fuzzy Subhyperlattice. 239-246 - Chang-Xiang He, Ping Chen, Bao-Feng Wu:
The Harary Index of a Graph under perturbation. 247-256 - Satyajit Banerjee:
On the Lower Bound of the Competitive Ratio for the Weighted Online Roommates Problem. 257-262
Volume 2, Number 3, September 2010
- Yu Guan, Guanghui Xu:
Algebraic Connectivity of Weighed Graphs under Shifting Components. 263-276 - K. Sangavai, R. Anitha:
Application of Vertex Subset Degree Preserving Spanning Trees in Sensor Networks. 277-290 - Peter Damaschke, Azam Sheikh Muhammad:
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity. 291-312 - Fred R. McMorris, Henry Martyn Mulder, Oscar Ortega:
Axiomatic Characterization of the mean Function on Trees. 313-330 - Rajiv Gandhi, Bradford Greening, Sriram V. Pemmaraju, Rajiv Raman:
Sub-Coloring and Hypo-Coloring Interval Graphs. 331-346 - Xiao Zhou, Takao Nishizeki:
Convex Drawings of Internally Triconnected Plane Graphs on O(N2) Grids. 347-362 - Charles R. Johnson, Yulin Zhang:
On the Possible Ranks among Matrices with a given Pattern. 363-378 - Manjusri Basu, Bandhu Prasad:
Average Distance and Minimum Average Distance of Binary Constant Weight Code and its Properties. 379-388 - M. Masoumi, A. M. Mobasseri, A. R. Rezaei:
Minimum Flow Variation in Maximum Flows. 389-394 - Jean-Claude Bermond, Frédéric Havet, Florian Huc, Cláudia Linhares Sales:
Improper Coloring of Weighted Grid and Hexagonal Graphs. 395-412 - Zi-Xia Song:
Partial Result on Hadwiger's Conjecture. 413-424 - Ming Liu, Yinfeng Xu, Chengbin Chu, Feifeng Zheng:
Online Scheduling of Parallel Jobs with Bounded Processing times on Two Machines. 425-432 - Xinhui An, Baoyindureng Wu:
HajóS-like Theorem for Group Coloring. 433-436
Volume 2, Number 4, December 2010
- I Wayan Sudarsana, Hilda Assiyatun, Adiwijaya, Selvy Musdalifah:
The Ramsey Number for a Linear Forest versus Two identical Copies of Complete Graphs. 437-444 - Antonio Fernández Anta, Miguel A. Mosteiro:
Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks. 445-456 - Ricky Rosen:
A k-Provers Parallel Repetition Theorem for a Version of no-Signaling Model. 457-468 - Michal Kolarz:
Directed Figure Codes: Decidability Frontier. 469-482 - Xue Chen, Guangda Hu, Xiaoming Sun:
The Complexity of Word Circuits. 483-492 - Amr Elmasry:
The Violation Heap: a Relaxed Fibonacci-like Heap. 493-504 - Michael Hartwig:
On the Density of Regular and Context-Free Languages. 505-514 - Chi-Jen Lu, Hsin-Lung Wu:
On the Hardness against Constant-Depth Linear-Size Circuits. 515-526 - Shinya Anzai, Jinhee Chun, Ryosei Kasai, Matias Korman, Takeshi Tokuyama:
Effect of Corner Information in Simultaneous Placement of k Rectangles and Tableaux. 527-538 - Oleksiy Busaryev, Tamal K. Dey, Yusu Wang:
Tracking a Generator by Persistence. 539-552 - John Augustine, David Eppstein, Kevin A. Wortman:
Approximate Weighted Farthest Neighbors and Minimum Dilation Stars. 553-566 - Sylvain Lazard, Christophe Weibel, Sue Whitesides, Linqiao Zhang:
A Succinct 3D Visibility Skeleton. 567-590 - Giorgio Ausiello, Andrea Ribichini, Paolo Giulio Franciosa, Giuseppe F. Italiano:
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. 591-606 - Muhammad Nur Yanhaona, Md. Shamsuzzoha Bayzid, Md. Saidur Rahman:
Discovering Pairwise Compatibility Graphs. 607-624 - Eric Bach, Shuchi Chawla, Seeun Umboh:
Threshold Rules for Online Sample Selection. 625-642 - Maxim A. Babenko, Alexey Gusakov, Ilya P. Razenshteyn:
Triangle-Free 2-Matchings Revisited. 643-654
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 2025-12-09 23:27 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:
