Остановите войну!
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 33 matches
- 2017
- Jessie Abraham, Micheal Arockiaraj:
Optimal Embedding of Locally Twisted Cubes into Grids. CALDAM 2017: 1-11 - Sayan Bandyapadhyay, Aritra Banik:
Polynomial Time Algorithms for Bichromatic Problems. CALDAM 2017: 12-23 - Gill Barequet, Minati De:
Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function. CALDAM 2017: 24-36 - Subhash Bhagat, Krishnendu Mukhopadhyaya:
Optimum Gathering of Asynchronous Robots. CALDAM 2017: 37-49 - Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman:
Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime. CALDAM 2017: 50-59 - Ulrik Brandes, Moritz Heine, Julian Müller, Mark Ortmann:
Positional Dominance: Concepts and Algorithms. CALDAM 2017: 60-71 - Vladimir Braverman, Harry Lang, Keith D. Levin:
Accurate Low-Space Approximation of Metric k-Median for Insertion-Only Streams. CALDAM 2017: 72-82 - Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid:
Querying Relational Event Graphs Using Colored Range Searching Data Structures. CALDAM 2017: 83-95 - Manoj Changat, Ferdoos Hossein Nezhad, N. Narayanan:
Axiomatic Characterization of the Interval Function of a Bipartite Graph. CALDAM 2017: 96-106 - Ante Custic, Ehsan Iranmanesh, Ramesh Krishnamurti:
Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System. CALDAM 2017: 107-117 - Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy:
On Structural Parameterizations of Graph Motif and Chromatic Number. CALDAM 2017: 118-129 - Sandip Das, Soumen Nandi, Sagnik Sen:
On Chromatic Number of Colored Mixed Graphs. CALDAM 2017: 130-140 - Sandip Das, Ayan Nandy, Swami Sarvottamananda:
Optimizing Movement in Convex and Non-convex Path-Networks to Establish Connectivity. CALDAM 2017: 141-155 - Ajit Arvind Diwan, Bodhayan Roy:
On Colouring Point Visibility Graphs. CALDAM 2017: 156-165 - Ajit A. Diwan, Sai Sandeep:
Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two. CALDAM 2017: 166-176 - Arpana Garg, Sucheta Dutt:
On Rank and MDR Cyclic Codes of Length 2k Over Z8. CALDAM 2017: 177-186 - Aloysius Godinho, Tarkeshwar Singh:
Group Distance Magic Labeling of Cnr. CALDAM 2017: 187-192 - Dishant Goyal, Varunkumar Jayapaul, Venkatesh Raman:
Elusiveness of Finding Degrees. CALDAM 2017: 242-253 - Hovhannes A. Harutyunyan, Zhiyuan Li:
Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs. CALDAM 2017: 193-204 - R. Inkulu, Nitish P. Thakur:
Incremental Algorithms to Update Visibility Polygons. CALDAM 2017: 205-218 - Ramesh K. Jallu, Gautam K. Das:
Liar's Domination in 2D. CALDAM 2017: 219-229 - Klaus Jansen, Lars Rohwedder:
Structured Instances of Restricted Assignment with Two Processing Times. CALDAM 2017: 230-241 - Tushar Kalra, Rogers Mathew, Sudebkumar Prasant Pal, Vijay Pandey:
Maximum Weighted Independent Sets with a Budget. CALDAM 2017: 254-266 - Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, Prafullkumar Tale:
Exact and Parameterized Algorithms for (k, i)-Coloring. CALDAM 2017: 281-293 - Abdullah Makkeh, Mozhgan Pourmoradnasseri, Dirk Oliver Theis:
The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract). CALDAM 2017: 294-307 - Arti Pandey, B. S. Panda, Piyush Dane, Manav Kashyap:
Induced Matching in Some Subclasses of Bipartite Graphs. CALDAM 2017: 308-319 - Datta Krupa R., Aniket Basu Roy, Minati De, Sathish Govindarajan:
Demand Hitting and Covering of Intervals. CALDAM 2017: 267-280 - P. Renjith, N. Sadagopan:
Hamiltonicity in Split Graphs - A Dichotomy. CALDAM 2017: 320-331 - Pavan Sangha, Michele Zito:
Finding Large Independent Sets in Line of Sight Networks. CALDAM 2017: 332-343 - M. A. Shalu, S. Vijayakumar, T. P. Sandhya:
A Lower Bound of the cd-Chromatic Number and Its Complexity. CALDAM 2017: 344-355
skipping 3 more matches
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-05-31 01:44 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