Остановите войну!
for scientists:
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 28 matches
- 2015
- Md. Shafiul Alam, Asish Mukhopadhyay:
Three Paths to Point Placement. CALDAM 2015: 33-44 - Puspal Bhabak, Hovhannes A. Harutyunyan:
Constant Approximation for Broadcasting in k-cycle Graph. CALDAM 2015: 21-32 - Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy:
Rectilinear Path Problems in Restricted Memory Setup. CALDAM 2015: 69-80 - Pritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy:
Vertex Guarding in Weak Visibility Polygons. CALDAM 2015: 45-57 - Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen:
On a Special Class of Boxicity 2 Graphs. CALDAM 2015: 157-168 - Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties. CALDAM 2015: 89-100 - Olivier Bodini, Antoine Genitrini, Frédéric Peschanski, Nicolas Rolin:
Associativity for Binary Parallel Processes: A Quantitative Study. CALDAM 2015: 217-228 - Manoj Changat, Divya Sindhu Lekha, Henry Martyn Mulder, Ajitha R. Subhamathi:
Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete Graphs. CALDAM 2015: 138-149 - Ankit Chauhan, B. V. Raghavendra Rao:
Parameterized Analogues of Probabilistic Computation. CALDAM 2015: 181-192 - Ashok Kumar Das, Ritapa Chakraborty:
New Characterizations of Proper Interval Bigraphs and Proper Circular Arc Bigraphs. CALDAM 2015: 117-125 - Adrian Dumitrescu, Anirban Ghosh, Masud Hasan:
On Collections of Polygons Cuttable with a Segment Saw. CALDAM 2015: 58-68 - P. Francis, S. Francis Raj:
Bounds for the b-chromatic Number of Induced Subgraphs and G - e. CALDAM 2015: 111-116 - Daya Ram Gaur, Rishi Ranjan Singh:
Cumulative Vehicle Routing Problem: A Column Generation Approach. CALDAM 2015: 262-274 - Barun Gorain, Partha Sarathi Mandal:
Energy Efficient Sweep Coverage with Mobile and Static Sensors. CALDAM 2015: 275-285 - T. Karthick:
New Polynomial Case for Efficient Domination in P 6-free Graphs. CALDAM 2015: 81-88 - Mark Korenblit:
Algebraic Expressions of Rhomboidal Graphs. CALDAM 2015: 193-204 - Paul D. Manuel, Indra Rajasingh, R. Sundara Rajan, N. Parthiban, T. M. Rajalaxmi:
A Tight Bound for Congestion of an Embedding. CALDAM 2015: 229-237 - N. S. Narayanaswamy, Anju Srinivasan:
Tree Path Labeling of Hypergraphs - A Generalization of the Consecutive Ones Property. CALDAM 2015: 150-156 - Bhawani Sankar Panda:
Separator Theorems for Interval Graphs and Proper Interval Graphs. CALDAM 2015: 101-110 - Arti Pandey, Bhawani Sankar Panda:
Domination in Some Subclasses of Bipartite Graphs. CALDAM 2015: 169-180 - Arun K. Pujari, Venkateswara Rao Kagita, Anubhuti Garg, Vineet Padmanabhan:
Bi-directional Search for Skyline Probability. CALDAM 2015: 250-261 - Santiago Valdés Ravelo, Carlos E. Ferreira:
A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem. CALDAM 2015: 9-20 - Sigve Hortemo Sæther:
Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter. CALDAM 2015: 205-216 - Apurba Sarkar, Arindam Biswas, Mousumi Dutt, Arnab Bhattacharya:
Generation of Random Digital Curves Using Combinatorial Techniques. CALDAM 2015: 286-297 - Rohan Sharma, Bibhas Adhikari, Abhishek Mishra:
On Spectra of Corona Graphs. CALDAM 2015: 126-137 - C. R. Subramanian:
Probabilistic Arguments in Graph Coloring (Invited Talk). CALDAM 2015: 1-8 - Mindi Yuan, Wei Shen, Jun Li, Yannis Pavlidis, Shen Li:
Auction/Belief Propagation Algorithms for Constrained Assignment Problem. CALDAM 2015: 238-249 - Sumit Ganguly, Ramesh Krishnamurti:
Algorithms and Discrete Applied Mathematics - First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings. Lecture Notes in Computer Science 8959, Springer 2015, ISBN 978-3-319-14973-8 [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-06-16 16:46 CEST 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