default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 25 matches
- 2018
- Sandip Das, Subhadeep Ranjan Dev, Arpan Sadhukhan, Uma Kant Sahoo, Sagnik Sen:
Burning Spiders. CALDAM 2018: 155-163 - Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr:
Bounded Stub Resolution for Some Maximal 1-Planar Graphs. CALDAM 2018: 214-220 - Sandip Das, Soumen Nandi, Sagnik Sen:
On Oriented L(p, 1)-labeling. CALDAM 2018: 274-282 - Sandip Das, Ayan Nandy, Swami Sarvottamananda:
Radius, Diameter, Incenter, Circumcenter, Width and Minimum Enclosing Cylinder for Some Polyhedral Distance Functions. CALDAM 2018: 283-300 - Krishnamoorthy Dinesh, Jayalal Sarma:
Alternation, Sparsity and Sensitivity: Combinatorial Bounds and Exponential Gaps. CALDAM 2018: 260-273 - Bijo S. Anand, Manoj Changat, S. V. Ullas Chandran:
The Edge Geodetic Number of Product Graphs. CALDAM 2018: 143-154 - Aritra Banik, Pratibha Choudhary:
Fixed-Parameter Tractable Algorithms for Tracking Set Problems. CALDAM 2018: 93-104 - Devsi Bantva:
On a Lower Bound for the Eccentric Connectivity Index of Graphs. CALDAM 2018: 179-187 - Manjanna Basappa:
Line Segment Disk Cover. CALDAM 2018: 81-92 - Andreas Brandstädt:
Efficient Domination and Efficient Edge Domination: A Brief Survey. CALDAM 2018: 1-14 - Bugra Çaskurlu, Matthew D. Williamson, K. Subramani, Vahan Mkrtchyan, Piotr Wojciechowski:
A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems. CALDAM 2018: 45-58 - Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid:
Window Queries for Problems on Intersecting Objects and Maximal Points. CALDAM 2018: 199-213 - Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy:
On Structural Parameterizations of Firefighting. CALDAM 2018: 221-234 - Sandip Das, Harmender Gahlawat:
Variations of Cops and Robbers Game on Grids. CALDAM 2018: 249-259 - Ashok Kumar Das, Rajkamal Sahu:
Mixed Unit Interval Bigraphs. CALDAM 2018: 15-29 - P. Francis, S. Francis Raj, M. Gokulnath:
On Indicated Coloring of Some Classes of Graphs. CALDAM 2018: 73-80 - Arpana Garg, Sucheta Dutt:
Determining Minimal Degree Polynomials of a Cyclic Code of Length 2k over \mathbb Z_8. CALDAM 2018: 118-130 - Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Sriram Bhyravarapu:
On the Tractability of (k, i)-Coloring. CALDAM 2018: 188-198 - Subrahmanyam Kalyanasundaram, Kenneth W. Regan:
Exact Computation of the Number of Accepting Paths of an NTM. CALDAM 2018: 105-117 - Kamyar Khodamoradi, Ramesh Krishnamurti, Bodhayan Roy:
Consistent Subset Problem with Two Labels. CALDAM 2018: 131-142 - Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Martin Smolík, Jakub Tetek, Martin Töpfer:
On the Simultaneous Minimum Spanning Trees Problem. CALDAM 2018: 235-248 - Myroslav Kryven, Alexander Ravsky, Alexander Wolff:
Drawing Graphs on Few Circles and Few Spheres. CALDAM 2018: 164-178 - Bodo Manthey, Victor M. J. J. Reijnders:
Probabilistic Properties of Highly Connected Random Geometric Graphs. CALDAM 2018: 59-72 - Pazhaniappan Renjith, Narasimhan Sadagopan:
Hamiltonian Path in K_1, t -free Split Graphs- A Dichotomy. CALDAM 2018: 30-44 - B. S. Panda, Partha P. Goswami:
Algorithms and Discrete Applied Mathematics - 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings. Lecture Notes in Computer Science 10743, Springer 2018, ISBN 978-3-319-74179-6 [contents]
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-23 16:47 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint