default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7th CALDAM 2021: Rupnagar, India
- Apurva Mudgal, C. R. Subramanian:
Algorithms and Discrete Applied Mathematics - 7th International Conference, CALDAM 2021, Rupnagar, India, February 11-13, 2021, Proceedings. Lecture Notes in Computer Science 12601, Springer 2021, ISBN 978-3-030-67898-2
Approximation Algorithms
- Kelin Luo
, Frits C. R. Spieksma:
Online Bin Packing with Overload Cost. 3-15 - Apoorv Garg, Abhiram Ranade:
Scheduling Trains with Small Stretch on a Unidirectional Line. 16-31 - Chakradhar Padamutham, Venkata Subba Reddy Palagiri:
Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs. 32-42 - Arun Kumar Das, Sandip Das, Joydeep Mukherjee:
Approximation Algorithms for Orthogonal Line Centers. 43-54 - Ton Kloks, Arti Pandey:
Semitotal Domination on AT-Free Graphs and Circle Graphs. 55-65 - Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal:
Burning Grids and Intervals. 66-79
Parameterized Algorithms
- Palash Dey, Arnab Maiti, Amatya Sharma:
On Parameterized Complexity of Liquid Democracy. 83-94 - Frank Gurski, Dominique Komander, Carolin Rehs:
Acyclic Coloring Parameterized by Directed Clique-Width. 95-108 - I. Vinod Reddy:
On Structural Parameterizations of Load Coloring. 109-121 - Kasthurirangan Prahlad Narasimhan:
One-Sided Discrete Terrain Guarding and Chordal Graphs. 122-134 - Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi:
Parameterized Complexity of Locally Minimal Defensive Alliances. 135-148
Computational Geometry
- Ioannis Mantas, Marko Savic, Hendrik Schrezenmaier:
New Variants of Perfect Non-crossing Matchings. 151-164 - Vahideh Keikha, Hamidreza Keikha, Ali Mohades:
Cause I'm a Genial Imprecise Point: Outlier Detection for Uncertain Data. 165-178 - Sandip Das, Subhadeep Ranjan Dev, Swami Sarvottamananda:
A Worst-Case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes. 179-195 - Václav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr:
On the Intersections of Non-homotopic Loops. 196-205
Graph Theory
- M. A. Shalu, V. K. Kirubakaran:
On cd-Coloring of Trees and Co-bipartite Graphs. 209-221 - Manoj Changat, Ferdoos Hossein Nezhad, Peter F. Stadler:
Cut Vertex Transit Functions of Hypergraphs. 222-233 - Manoj Changat, Prasanth G. Narasimha-Shenoi, Mary Shalet Thottungal Joseph:
Lexicographic Product of Digraphs and Related Boundary-Type Sets. 234-246 - Adarsh Srinivasan, N. S. Narayanaswamy:
The Connected Domination Number of Grids. 247-258 - Sandip Das, Siddani Bhaskara Rao, Uma Kant Sahoo:
On Degree Sequences and Eccentricities in Pseudoline Arrangement Graphs. 259-271 - Sheikh Shakil Akhtar, Sandip Das, Harmender Gahlawat:
Cops and Robber on Butterflies and Solid Grids. 272-281 - P. Francis, S. Francis Raj, M. Gokulnath:
b-Coloring of Some Powers of Hypercubes. 282-287 - Athmakoori Prashant, M. Gokulnath:
Chromatic Bounds for the Subclasses of pK2-Free Graphs. 288-293 - Manoj Changat, Nella Jeena Jacob, Prasanth G. Narasimha-Shenoi:
Axiomatic Characterization of the Median Function of a Block Graph. 294-308 - P. Francis, Deepak Rajendraprasad:
On Coupon Coloring of Cartesian Product of Some Graphs. 309-316 - David Hartman, Aneta Pokorná, Pavel Valtr:
On the Connectivity and the Diameter of Betweenness-Uniform Graphs. 317-330
Combinatorics and Algorithms
- Aditya Gulati, Sayak Chakrabarti, Rajat Mittal:
On Algorithms to Find p-ordering. 333-345 - Andrew Bloch-Hansen, Nasim Samei, Roberto Solis-Oba:
Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem. 346-358 - Piotr Wojciechowski, K. Subramani, Alvaro Velasquez, Bugra Çaskurlu:
Algorithmic Analysis of Priority-Based Bin Packing. 359-372 - Ghurumuruhan Ganesan:
Recursive Methods for Some Problems in Coding and Random Permutations. 373-384 - Ghurumuruhan Ganesan:
Achieving Positive Rates with Predetermined Dictionaries. 385-396 - Maithilee Patawar, Kalpesh Kapoor:
Characterization of Dense Patterns Having Distinct Squares. 397-409
Graph Algorithms
- Sergey Bereg, José Miguel Díaz-Báñez, Paul Horn, Mario Alberto López, Jorge Urrutia:
Failure and Communication in a Synchronized Multi-drone System. 413-425 - Archak Das, Kaustav Bose, Buddhadeb Sau:
Memory Optimal Dispersion by Anonymous Mobile Robots. 426-439 - Miroslaw Kowaluk, Andrzej Lingas:
Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products. 440-451 - L. Sunil Chandran, Sajal K. Das, Pavol Hell, Sajith Padinhatteeri, Raji R. Pillai:
Template-Driven Rainbow Coloring of Proper Interval Graphs. 452-470 - Sanjana Dey, Anil Maheshwari, Subhas C. Nandy:
Minimum Consistent Subset of Simple Graph Classes. 471-484
Computational Complexity
- Satyabrata Jana, Supantha Pandit, Sasanka Roy:
Balanced Connected Graph Partition. 487-499 - B. S. Panda, Pooja Goyal:
Hardness Results of Global Roman Domination in Graphs. 500-511
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-01-29 21:25 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:
