Остановите войну!
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 35 matches
- 2023
- Niranjan Balachandran, Anish Hebbar:
Cyclability, Connectivity and Circumference. CALDAM 2023: 257-268 - Niranjan Balachandran, Brahadeesh Sankarnarayanan:
5-List Coloring Toroidal 6-Regular Triangulations in Linear Time. CALDAM 2023: 134-146 - Moritz Beck, Joachim Spoerhase, Sabine Storandt:
Mind the Gap: Edge Facility Location Problems in Theory and Practice. CALDAM 2023: 321-334 - Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille:
The Weak (2, 2)-Labelling Problem for Graphs with Forbidden Induced Structures. CALDAM 2023: 204-215 - Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy:
On Locally Identifying Coloring of Graphs. CALDAM 2023: 147-158 - Sriram Bhyravarapu, I. Vinod Reddy:
On Structural Parameterizations of Star Coloring. CALDAM 2023: 159-171 - Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja:
New Bounds and Constructions for Neighbor-Locating Colorings of Graphs. CALDAM 2023: 121-133 - Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret Katrin Wagler:
On Three Domination-Based Identification Problems in Block Graphs. CALDAM 2023: 271-283 - Prabhat Kumar Chand, Manish Kumar, Anisur Rahaman Molla, Sumathi Sivasubramaniam:
Fault-Tolerant Dispersion of Mobile Robots. CALDAM 2023: 28-40 - Juhi Chaudhary, Sounaka Mishra, B. S. Panda:
Minimum Maximal Acyclic Matching in Proper Interval Graphs. CALDAM 2023: 377-388 - Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda:
Rectilinear Voronoi Games with a Simple Rectilinear Obstacle in Plane. CALDAM 2023: 89-100 - Sandip Das, Florent Foucaud, Sk Samim Islam, Joydeep Mukherjee:
Relation Between Broadcast Domination and Multipacking Numbers on Chordal Graphs. CALDAM 2023: 297-308 - Sandip Das, Harmender Gahlawat, Ashwin Ramgopal, Uma Kant Sahoo, Sagnik Sen:
Cops and Robber on Oriented Graphs with Respect to Push Operation. CALDAM 2023: 309-320 - Pranjal Dutta, Mahesh Sreekumar Rajasree:
Efficient Reductions and Algorithms for Subset Product. CALDAM 2023: 3-14 - Florent Foucaud, Krishna Narayanan, Lekshmi Ramasubramony Sulochana:
Monitoring Edge-Geodetic Sets in Graphs. CALDAM 2023: 245-256 - Barun Gorain, Shaswati Patra, Rishi Ranjan Singh:
Graph Covering Using Bounded Size Subgraphs. CALDAM 2023: 415-426 - Leila Karimi, Vijay Adoni, Daya Ram Gaur:
Resource Management in Device-to-Device Communications. CALDAM 2023: 41-55 - T. Kavaskar:
Perfectness of G-generalized Join of Graphs. CALDAM 2023: 172-183 - Kusum, Arti Pandey:
Complexity Results on Cosecure Domination in Graphs. CALDAM 2023: 335-347 - Sukanya Maji, Sanjib Sadhu:
Arbitrary-Oriented Color Spanning Region for Line Segments. CALDAM 2023: 71-86 - Vineet Malik, Sushanta Karmakar:
Some Insights on Dynamic Maintenance of Gomory-Hu Tree in Cactus Graphs and General Graphs. CALDAM 2023: 231-244 - Harshil Mittal, Saraswati Nanoti, Aditi Sethia:
Diverse Fair Allocations: Complexity and Algorithms. CALDAM 2023: 101-117 - A. Mohanapriya, P. Renjith, N. Sadagopan:
Short Cycles Dictate Dichotomy Status of the Steiner Tree Problem on Bisplit Graphs. CALDAM 2023: 219-230 - B. S. Panda, Sachin:
Algorithms and Complexity of Strongly Stable Non-crossing Matchings. CALDAM 2023: 363-376 - Subhabrata Paul, Kamal Santra:
Transitivity on Subclasses of Chordal Graphs. CALDAM 2023: 391-402 - Athmakoori Prashant, S. Francis Raj:
Coloring of a Superclass of 2K2-free graphs. CALDAM 2023: 192-203 - R. Sundara Rajan, Remi Mariam Reji, T. M. Rajalaxmi:
Maximum Subgraph Problem for 3-Regular Knödel graphs and its Wirelength. CALDAM 2023: 403-414 - Sangam Balchandar Reddy, Anjeneya Swami Kare:
Structural Parameterization of Alliance Problems. CALDAM 2023: 447-459 - Gopika Sharma, Arti Pandey:
Computational Aspects of Double Dominating Sequences in Graphs. CALDAM 2023: 284-296 - Lekshmi Kamal K. Sheela, Manoj Changat, Iztok Peterin:
Axiomatic Characterization of the Toll Walk Function of Some Graph Classes. CALDAM 2023: 427-446
skipping 5 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-07-20 16:48 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