default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6th CALDAM 2020: Hyderabad, India
- Manoj Changat, Sandip Das:
Algorithms and Discrete Applied Mathematics - 6th International Conference, CALDAM 2020, Hyderabad, India, February 13-15, 2020, Proceedings. Lecture Notes in Computer Science 12016, Springer 2020, ISBN 978-3-030-39218-5
Graph Algorithms
- M. A. Shalu, Cyriac Antony
:
Complexity of Restricted Variant of Star Colouring. 3-14 - Pavol Hell, César Hernández-Cruz, Anurag Sanyal:
Partitioning Cographs into Two Forests and One Independent Set. 15-27 - Florent Foucaud, Ralf Klasing, Mirka Miller, Joe Ryan:
Monitoring the Edges of a Graph Using Distances. 28-40 - Mathew C. Francis, Dalu Jacob:
The Lexicographic Method for the Threshold Cover Problem. 41-52 - Michel Habib, Lalla Mouatadid, Mengchuan Zou:
Approximating Modular Decomposition Is Hard. 53-66 - Sangram Kishor Jena, Gautam K. Das:
Vertex-Edge Domination in Unit Disk Graphs. 67-78 - Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg:
Geometric Planar Networks on Bichromatic Points. 79-91 - B. S. Panda, Pooja Goyal:
Hardness Results of Global Total k-Domination Problem in Graphs. 92-101 - Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy:
Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes. 102-115 - Arti Pandey, Gopika Sharma, Nivedit Jain:
Maximum Weighted Edge Biclique Problem on Bipartite Graphs. 116-128
Graph Theory
- Angsuman Das:
Determining Number of Generalized and Double Generalized Petersen Graph. 131-140 - Priyanka Singh, Pratima Panigrahi, Aakash Singh:
Self-centeredness of Generalized Petersen Graphs. 141-155 - P. Roushini Leely Pushpam, N. Srilakshmi:
Weak Roman Bondage Number of a Graph. 156-166 - S. V. Ullas Chandran, Mitre Costa Dourado, Maya G. S. Thankachy:
On the Geodetic and Hull Numbers of Shadow Graphs. 167-177 - P. Francis, S. Francis Raj, M. Gokulnath:
Indicated Coloring of Complete Expansion and Lexicographic Product of Graphs. 178-183 - Laurent Beaudou, Florent Foucaud, Reza Naserasr:
Smallest C2l+1-Critical Graphs of Odd-Girth 2k+1. 184-196 - Huzaifa Abbasi, Manu Basavaraju, Eeshwar Gurushankar, Yash Jivani, Deepak Srikanth:
Ramsey Numbers for Line Graphs. 197-208 - Bijo S. Anand, Prasanth G. Narasimha-Shenoi, Sabeer Sain Ramla:
$\varDelta $-Convexity Number and $\varDelta $-Number of Graphs and Graph Products. 209-218 - Dimitri Lajou:
On Cartesian Products of Signed Graphs. 219-234 - L. Sunil Chandran, Sajith Padinhatteeri, Karthik Ravi Shankar:
List Distinguishing Number of p th Power of Hypercube and Cartesian Powers of a Graph. 235-247 - Mark Korenblit, Vadim E. Levit:
On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs. 248-259 - Soura Sena Das, Soumen Nandi, Sagnik Sen:
The Relative Oriented Clique Number of Triangle-Free Planar Graphs Is 10. 260-266
Combinatorial Optimization
- Umair Arif, Robert Benkoczi, Daya Ram Gaur, Ramesh Krishnamurti:
On the Minimum Satisfiability Problem. 269-281 - Bjoern Tauer, Dennis Fischer, Janosch Fuchs, Laura Vargas Koch, Stephan Zieger:
Waiting for Trains: Complexity Results. 282-303
Distributed Algorithms
- K. S. Ajish Kumar, Deepak Rajendraprasad, K. S. Sudeep:
Oriented Diameter of Star Graphs. 307-317 - Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das, Krishnendu Mukhopadhyaya:
Gathering over Meeting Nodes in Infinite Grid. 318-330 - Subhrangsu Mandal, Arobinda Gupta:
0-1 Timed Matching in Bipartite Temporal Graphs. 331-346 - Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu, Buddhadeb Sau:
Arbitrary Pattern Formation by Opaque Fat Robots with Lights. 347-359
Combinatorial Algorithms
- Marsden Jacques, Dennis Wong:
Greedy Universal Cycle Constructions for Weak Orders. 363-370 - Rolf Klein, David Kübel, Elmar Langetepe, Jörg-Rüdiger Sack, Barbara Schwarzwald:
A New Model in Firefighting Theory. 371-383 - Sofiat Olaosebikan, David F. Manlove:
An Algorithm for Strong Stability in the Student-Project Allocation Problem with Ties. 384-399
Computational Complexity
- Frédéric Havet, Dorian Mazauric, Viet-Ha Nguyen, Rémi Watrigant:
Overlaying a Hypergraph with a Graph with Bounded Maximum Degree. 403-414 - Raphael Steiner, Sebastian Wiederrecht:
Parameterized Algorithms for Directed Modular Width. 415-426 - Chamanvir Kaur, Neeldhara Misra:
On the Parameterized Complexity of Spanning Trees with Small Vertex Covers. 427-438 - Pradeesha Ashok, Rathin Bhargava, Naman Gupta, Mohammad Khalid, Dolly Yadav:
Minimum Conflict Free Colouring Parameterized by Treewidth. 439-450
Computational Geometry
- N. R. Aravind, Udit Maniyar:
Planar Projections of Graphs. 453-462 - Sergey Bereg, Mohammadreza Haghpanah:
New Algorithms and Bounds for Halving Pseudolines. 463-475 - Sergey Bereg, Mohammadreza Haghpanah:
Algorithms for Radon Partitions with Tolerance. 476-487
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-03-01 15:02 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:
