default search action
Discrete Applied Mathematics, Volume 286
Volume 286, November 2020
- Daya Ram Gaur
, N. S. Narayanaswamy:
Preface: CALDAM 2017. 1-2 - Max A. Alekseyev
Computing solutions to the congruence 1n+2n+⋯+nn≡p(modn). 3-9 - Arul Jeya Shalini, Jessie Abraham
A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout. 10-18 - Manoj Changat
Axiomatic characterization of the interval function of a bipartite graph. 19-28 - Sizhong Zhou, Tao Zhang, Zurun Xu:
Subgraphs with orthogonal factorizations in graphs. 29-34 - Ankush Acharyya
Variations of largest rectangle recognition amidst a bichromatic point set. 35-50 - Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid:
Querying relational event graphs using colored range searching data structures. 51-61 - Sandip Das, Ayan Nandy, Swami Sarvottamananda:
Optimizing movement in convex and non-convex path-networks to establish connectivity. 62-77 - Ajit Arvind Diwan, Bodhayan Roy:
On colouring point visibility graphs. 78-90 - Ramesh K. Jallu
Liar's dominating set problem on unit disk graphs. 91-99 - Pavan Sangha, Michele Zito:
Independent sets in Line of Sight networks. 100-115 - Niranjan Balachandran, Rogers Mathew
System of unbiased representatives for a collection of bicolorings. 116-127 - Dishant Goyal, Varunkumar Jayapaul
Elusiveness of finding degrees. 128-139
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-12-26 00:37 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: