default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8th CALDAM 2022: Puducherry, India
- Niranjan Balachandran, R. Inkulu:
Algorithms and Discrete Applied Mathematics - 8th International Conference, CALDAM 2022, Puducherry, India, February 10-12, 2022, Proceedings. Lecture Notes in Computer Science 13179, Springer 2022, ISBN 978-3-030-95017-0
Graph Theory
- Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena:
A Proof of the Multiplicative 1-2-3 Conjecture. 3-14 - Athmakoori Prashant
, P. Francis, S. Francis Raj:
Chromatic Bounds for Some Subclasses of $(P_3\cup P_2)$-free graphs. 15-21 - Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List Homomorphisms to Separable Signed Graphs. 22-35 - James Tuite, Elias John Thomas, S. V. Ullas Chandran:
Some Position Problems for Graphs. 36-47 - Arun Anil, Manoj Changat:
Comparability Graphs Among Cover-Incomparability Graphs. 48-61
Graph Algorithms
- Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang:
Complexity of Paired Domination in AT-free and Planar Graphs. 65-77 - M. A. Shalu, Cyriac Antony:
The Complexity of Star Colouring in Bounded Degree Graphs and Regular Graphs. 78-90 - Bruno José da Silva Barros, Luiz Satoru Ochi, Rian Gabriel S. Pinheiro, Uéverton S. Souza:
On Conflict-Free Spanning Tree: Algorithms and Complexity. 91-102 - Sparsh Jain, Sreejith K. Pallathumadam, Deepak Rajendraprasad:
B0-VPG Representation of AT-free Outerplanar Graphs. 103-114 - A. Mohanapriya, P. Renjith, N. Sadagopan:
P Versus NPC: Minimum Steiner Trees in Convex Split Graphs. 115-126 - M. A. Shalu, V. K. Kirubakaran:
On cd-Coloring of P5, K4-free Chordal Graphs. 127-139 - Andrzej Lingas, Mia Persson, Dzmitry Sledneu:
An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs. 140-151 - Riccardo Dondi, Alexandru Popa:
Covering a Graph with Densest Subgraphs. 152-163
Computational Geometry
- Maike Buchin, Dennis Rohde:
Coresets for (k, ℓ )-Median Clustering Under the Fréchet Distance. 167-180 - Sabine Storandt:
Bounds and Algorithms for Geodetic Hulls. 181-194 - Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda:
Voronoi Games Using Geodesics. 195-207
Algorithms and Optimization
- Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi:
Approximation and Parameterized Algorithms for Balanced Connected Partition Problems. 211-223 - Xiangyu Guo, Kelin Luo:
Algorithms for Online Car-Sharing Problem. 224-236 - Pranjal Dutta, Mahesh Sreekumar Rajasree:
Algebraic Algorithms for Variants of Subset Sum. 237-251 - B. S. Panda, Sachin:
Hardness and Approximation Results for Some Variants of Stable Marriage Problem. 252-264 - Neeldhara Misra, Debanuj Nayak:
On Fair Division with Binary Valuations Respecting Social Networks. 265-278 - Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi:
Parameterized Intractability of Defensive Alliance Problem. 279-291 - Piotr Wojciechowski, K. Subramani, Alvaro Velasquez, Matthew D. Williamson:
On the Approximability of Path and Cycle Problems in Arc-Dependent Networks. 292-304 - Puspal Bhabak, Hovhannes A. Harutyunyan:
Approximation Algorithms in Graphs with Known Broadcast Time of the Base Graph. 305-316
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-09-19 23:32 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:
