default search action
3rd CALDAM 2017: Sancoale, Goa, India
- Daya Ram Gaur, N. S. Narayanaswamy:
Algorithms and Discrete Applied Mathematics - Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings. Lecture Notes in Computer Science 10156, Springer 2017, ISBN 978-3-319-53006-2 - Jessie Abraham
, Micheal Arockiaraj
Optimal Embedding of Locally Twisted Cubes into Grids. 1-11 - Sayan Bandyapadhyay, Aritra Banik:
Polynomial Time Algorithms for Bichromatic Problems. 12-23 - Gill Barequet, Minati De
Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function. 24-36 - Subhash Bhagat
Optimum Gathering of Asynchronous Robots. 37-49 - Arindam Biswas
Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime. 50-59 - Ulrik Brandes, Moritz Heine, Julian Müller
Positional Dominance: Concepts and Algorithms. 60-71 - Vladimir Braverman, Harry Lang, Keith D. Levin:
Accurate Low-Space Approximation of Metric k-Median for Insertion-Only Streams. 72-82 - Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid:
Querying Relational Event Graphs Using Colored Range Searching Data Structures. 83-95 - Manoj Changat
Axiomatic Characterization of the Interval Function of a Bipartite Graph. 96-106 - Ante Custic
Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System. 107-117 - Bireswar Das, Murali Krishna Enduri
On Structural Parameterizations of Graph Motif and Chromatic Number. 118-129 - Sandip Das, Soumen Nandi
On Chromatic Number of Colored Mixed Graphs. 130-140 - Sandip Das, Ayan Nandy, Swami Sarvottamananda:
Optimizing Movement in Convex and Non-convex Path-Networks to Establish Connectivity. 141-155 - Ajit Arvind Diwan, Bodhayan Roy:
On Colouring Point Visibility Graphs. 156-165 - Ajit A. Diwan, Sai Sandeep:
Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two. 166-176 - Arpana Garg, Sucheta Dutt:
On Rank and MDR Cyclic Codes of Length 2k Over Z8. 177-186 - Aloysius Godinho, Tarkeshwar Singh:
Group Distance Magic Labeling of Cnr. 187-192 - Hovhannes A. Harutyunyan, Zhiyuan Li:
Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs. 193-204 - R. Inkulu, Nitish P. Thakur:
Incremental Algorithms to Update Visibility Polygons. 205-218 - Ramesh K. Jallu
Liar's Domination in 2D. 219-229 - Klaus Jansen, Lars Rohwedder
Structured Instances of Restricted Assignment with Two Processing Times. 230-241 - Dishant Goyal, Varunkumar Jayapaul
Elusiveness of Finding Degrees. 242-253 - Tushar Kalra, Rogers Mathew
Maximum Weighted Independent Sets with a Budget. 254-266 - Datta Krupa R., Aniket Basu Roy
Demand Hitting and Covering of Intervals. 267-280 - Diptapriyo Majumdar
Exact and Parameterized Algorithms for (k, i)-Coloring. 281-293 - Abdullah Makkeh
The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract). 294-307 - Arti Pandey, B. S. Panda, Piyush Dane, Manav Kashyap:
Induced Matching in Some Subclasses of Bipartite Graphs. 308-319 - P. Renjith
Hamiltonicity in Split Graphs - A Dichotomy. 320-331 - Pavan Sangha, Michele Zito:
Finding Large Independent Sets in Line of Sight Networks. 332-343 - M. A. Shalu, S. Vijayakumar, T. P. Sandhya
A Lower Bound of the cd-Chromatic Number and Its Complexity. 344-355 - Sizhong Zhou, Yang Xu, Lan Xu:
Stability Number and k-Hamiltonian [a, b]-factors. 356-361 - Sizhong Zhou, Tao Zhang, Zurun Xu:
Subgraphs with Orthogonal [0, ki]1n -Factorizations in Graphs. 362-370
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-24 17:03 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: