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 304 matches
- 2024
- Waseem Akram, Sanjeev Saxena:
Consecutive Occurrences with Distance Constraints. CALDAM 2024: 3-13 - Bhaswar B. Bhattacharya, Sandip Das, Sk Samim Islam, Saumya Sen:
Growth Rate of the Number of Empty Triangles in the Plane. CALDAM 2024: 77-87 - Silvia M. Bianchi, Dipayan Chakraborty, Yanina Lucarini, Annegret Katrin Wagler:
Location-Domination Type Problems Under the Mycielski Construction. CALDAM 2024: 255-269 - Arijit Bishnu, Mathew C. Francis, Pritam Majumder:
Geometric Covering Number: Covering Points with Curves. CALDAM 2024: 88-102 - Aseem Dalal, B. S. Panda:
On Total Chromatic Number of Complete Multipartite Graphs. CALDAM 2024: 270-285 - Koustav De, Harshil Mittal, Palash Dey, Neeldhara Misra:
Parameterized Aspects of Distinct Kemeny Rank Aggregation. CALDAM 2024: 14-28 - D. Divya, S. Vijayakumar:
On Star Partition of Split Graphs. CALDAM 2024: 209-223 - Florent Foucaud, Pierre-Marie Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni:
Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity. CALDAM 2024: 29-43 - Barun Gorain, Tanvir Kaur, Kaushik Mondal:
Distance-2-Dispersion with Termination by a Strong Team. CALDAM 2024: 44-58 - Sathish Govindarajan, Siddhartha Sarkar:
Improved Algorithms for Minimum-Membership Geometric Set Cover. CALDAM 2024: 103-116 - Sajad Fathi Hafshejani, Daya Ram Gaur, Robert Benkoczi:
An Efficient Interior Point Method for Linear Optimization Using Modified Newton Method. CALDAM 2024: 133-147 - T. Kavaskar, Sreelakshmi Sukumaran:
Total Coloring of Some Graph Operations. CALDAM 2024: 302-312 - R. Mahendra Kumar, N. Sadagopan:
Impact of Diameter and Convex Ordering for Hamiltonicity and Domination. CALDAM 2024: 194-208 - Rajat Mittal, Sanjay S. Nair, Sunayana Patro:
On Query Complexity Measures and Their Relations for Symmetric Functions. CALDAM 2024: 59-73 - Joyashree Mondal, S. Vijayakumar:
Star Covers and Star Partitions of Cographs and Butterfly-free Graphs. CALDAM 2024: 224-238 - Kaustav Paul, Arti Pandey:
Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms. CALDAM 2024: 179-193 - Sasmita Rout, Gautam Kumar Das:
Semi-total Domination in Unit Disk Graphs. CALDAM 2024: 117-129 - M. A. Shalu, Cyriac Antony:
Star Colouring of Regular Graphs Meets Weaving and Line Graphs. CALDAM 2024: 313-327 - M. A. Shalu, V. K. Kirubakaran:
Open Packing in H-free Graphs and Subclasses of Split Graphs. CALDAM 2024: 239-251 - Ameera Vaheeda Shanavas, Manoj Changat, Marc Hellmuth, Peter F. Stadler:
Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs. CALDAM 2024: 148-161 - Lekshmi Kamal K. Sheela, Manoj Changat, Jeny Jacob:
The Weak-Toll Function of a Graph: Axiomatic Characterizations and First-Order Non-definability. CALDAM 2024: 286-301 - Pranjal Srivastava, Dhara Thakkar:
The Frobenius Problem for the Proth Numbers. CALDAM 2024: 162-175 - Subrahmanyam Kalyanasundaram, Anil Maheshwari:
Algorithms and Discrete Applied Mathematics - 10th International Conference, CALDAM 2024, Bhilai, India, February 15-17, 2024, Proceedings. Lecture Notes in Computer Science 14508, Springer 2024, ISBN 978-3-031-52212-3 [contents] - 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
skipping 274 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-10-07 16:31 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