Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 319
Volume 319, October 2022
Algorithms and Discrete Applied Mathematics (CALDAM 2019)
- Swami Sarvattamananda, Sudebkumar Prasant Pal:
Preface: CALDAM 2019. 1 - Henning Fernau
, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman:
Improved descriptional complexity results on generalized forbidding grammars. 2-18 - Andreas M. Hinz, Borut Luzar, Ciril Petr:
The Dudeney-Stockmeyer Conjecture. 19-26 - Sandip Das, Harmender Gahlawat:
Bumblebee visitation problem. 27-41 - L. Sunil Chandran, Abhiruk Lahiri, Nitin Singh:
Improved approximation for maximum edge colouring problem. 42-52 - Sameera Muhamed Salam, J. Nandini Warrier, Daphna Chacko, K. Murali Krishnan, K. S. Sudeep:
On chordal and perfect plane near-triangulations. 53-60 - Ranveer Singh, Naomi Shaked-Monderer, Avi Berman:
A linear time algorithm for the nullity of vertex-weighted block graphs. 61-70 - Jammigumpula Ajay, Satyabrata Jana, Sasanka Roy:
Collision-free routing problem with restricted L-path. 71-80 - M. A. Shalu, S. Vijayakumar, T. P. Sandhya, Joyashree Mondal:
Induced star partition of graphs. 81-91 - Supantha Pandit:
Covering and packing of triangles intersecting a straight line. 92-110 - Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy:
The balanced connected subgraph problem. 111-120 - Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani:
Storing four elements in the two query bitprobe model. 121-131 - Deepanjan Kesh, Vidya Sagar Sharma:
On the bitprobe complexity of two probe adaptive schemes. 132-140 - Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou:
On selecting a fraction of leaves with disjoint neighborhoods in a plane tree. 141-148 - Kalpana Mahalingam, Helda Princy Rajendran:
Properties of m-bonacci-sum graphs. 149-158 - Kannan Balakrishnan, Manoj Changat, Andreas M. Hinz, Divya Sindhu Lekha:
The median of Sierpiński graphs. 159-170 - Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier:
On graphs whose eternal vertex cover number and vertex cover number coincide. 171-182 - Sizhong Zhou, Qiuxiang Bian, Quanru Pan:
Path factors in subgraphs. 183-191
- Manoj Changat, Sandip Das:
Preface: CALDAM 2020. 192-193 - Sergey Bereg, Mohammadreza Haghpanah:
New algorithms and bounds for halving pseudolines. 194-206 - Sergey Bereg, Mohammadreza Haghpanah:
Algorithms for Radon partitions with tolerance. 207-215 - N. R. Aravind, Udit Maniyar:
Planar projections of graphs. 216-222 - B. S. Panda, Pooja Goyal:
Hardness results of global total k-domination problem in graphs. 223-238 - Pradeesha Ashok, Rathin Bhargava, Naman Gupta, Mohammad Khalid, Dolly Yadav:
Structural parameterization for minimum conflict-free colouring. 239-253 - N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare:
Vertex partitioning problems on graphs with bounded tree width. 254-270 - Dinabandhu Pradhan, S. Banerjee, Jia-Bao Liu:
Perfect Italian domination in graphs: Complexity and algorithms. 271-295 - Rolf Klein, David Kübel, Elmar Langetepe, Jörg-Rüdiger Sack, Barbara Schwarzwald:
A new model and algorithms in firefighting theory. 296-309 - Subhrangsu Mandal, Arobinda Gupta:
Maximum 0-1 timed matching on temporal graphs. 310-326 - M. A. Shalu, Cyriac Antony:
The complexity of restricted star colouring. 327-350 - Sangram Kishor Jena, Gautam K. Das:
Vertex-edge domination in unit disk graphs. 351-361 - K. S. Ajish Kumar, Deepak Rajendraprasad, K. S. Sudeep:
Oriented diameter of star graphs. 362-371 - Umair Arif, Robert Benkoczi, Daya Ram Gaur, Ramesh Krishnamurti:
A primal-dual approximation algorithm for Minsat. 372-381 - Yuying Mao, Wei Yu, Zhaohui Liu, Jiafeng Xiong:
Approximation algorithms for some Minimum Postmen Cover Problems. 382-393 - Frédéric Havet, Dorian Mazauric, Viet-Ha Nguyen, Rémi Watrigant:
Overlaying a hypergraph with a graph with bounded maximum degree. 394-406 - Anni Hakanen, Ville Junnila, Tero Laihonen, Ismael G. Yero:
On vertices contained in all or in no metric basis. 407-423 - Florent Foucaud, Shih-Shun Kao, Ralf Klasing, Mirka Miller, Joe Ryan:
Monitoring the edges of a graph using distances. 424-438 - Andreas M. Hinz, Caroline Holz auf der Heide, Sara Sabrina Zemljic:
Metric properties of Sierpiński triangle graphs. 439-453 - Martin Knor, Riste Skrekovski, Ismael G. Yero:
A note on the metric and edge metric dimensions of 2-connected graphs. 454-460 - Thangaraj Asir, V. Rabikka:
The Wiener index of the zero-divisor graph of Zn. 461-471 - Danilo Korze, Zehui Shao, Aleksander Vesel:
New results on radio k-labelings of distance graphs. 472-479 - P. K. Neethu, S. V. Ullas Chandran:
A note on the convexity number of the complementary prisms of trees. 480-486 - Bijo S. Anand, Mitre Costa Dourado, Prasanth G. Narasimha-Shenoi, Sabeer Sain Ramla:
On the Δ-interval and the Δ-convexity numbers of graphs and graph products. 487-498 - S. V. Ullas Chandran, Mitre Costa Dourado, Maya G. S. Thankachy:
Computational and structural aspects of the geodetic and the hull numbers of shadow graphs. 499-510 - Sizhong Zhou, Hongxia Liu, Yang Xu:
A note on fractional ID-[a, b]-factor-critical covered graphs. 511-516 - Carrie Frizzell:
Generalized bijective maps between G-parking functions, spanning trees, and the Tutte polynomial. 517-532 - Dimitri Lajou:
On Cartesian products of signed graphs. 533-555 - S. Ramachandran:
Are all pairs of hypomorphic digraphs S-isomorphic? 556-563 - Laurent Beaudou, Florent Foucaud, Reza Naserasr:
Smallest C2ℓ+1-critical graphs of odd-girth 2k+1. 564-575 - P. Francis, S. Francis Raj, M. Gokulnath:
On indicated coloring of lexicographic product of graphs. 576-582 - Mark Korenblit, Vadim E. Levit:
On lengths of edge-labeled graph expressions. 583-594 - Anuraj Mohan, K. V. Pramod:
Representation learning for temporal networks using temporal random walk and deep autoencoder. 595-605
a service of 
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-05-03 20:46 CEST 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:
