Остановите войну!
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 39 matches
- 2020
- Huzaifa Abbasi, Manu Basavaraju, Eeshwar Gurushankar, Yash Jivani, Deepak Srikanth:
Ramsey Numbers for Line Graphs. CALDAM 2020: 197-208 - Bijo S. Anand, Prasanth G. Narasimha-Shenoi, Sabeer Sain Ramla:
$\varDelta $-Convexity Number and $\varDelta $-Number of Graphs and Graph Products. CALDAM 2020: 209-218 - N. R. Aravind, Udit Maniyar:
Planar Projections of Graphs. CALDAM 2020: 453-462 - Umair Arif, Robert Benkoczi, Daya Ram Gaur, Ramesh Krishnamurti:
On the Minimum Satisfiability Problem. CALDAM 2020: 269-281 - Pradeesha Ashok, Rathin Bhargava, Naman Gupta, Mohammad Khalid, Dolly Yadav:
Minimum Conflict Free Colouring Parameterized by Treewidth. CALDAM 2020: 439-450 - Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg:
Geometric Planar Networks on Bichromatic Points. CALDAM 2020: 79-91 - Laurent Beaudou, Florent Foucaud, Reza Naserasr:
Smallest C2l+1-Critical Graphs of Odd-Girth 2k+1. CALDAM 2020: 184-196 - Sergey Bereg, Mohammadreza Haghpanah:
New Algorithms and Bounds for Halving Pseudolines. CALDAM 2020: 463-475 - Sergey Bereg, Mohammadreza Haghpanah:
Algorithms for Radon Partitions with Tolerance. CALDAM 2020: 476-487 - Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das, Krishnendu Mukhopadhyaya:
Gathering over Meeting Nodes in Infinite Grid. CALDAM 2020: 318-330 - Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu, Buddhadeb Sau:
Arbitrary Pattern Formation by Opaque Fat Robots with Lights. CALDAM 2020: 347-359 - Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy:
Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes. CALDAM 2020: 102-115 - S. V. Ullas Chandran, Mitre Costa Dourado, Maya G. S. Thankachy:
On the Geodetic and Hull Numbers of Shadow Graphs. CALDAM 2020: 167-177 - L. Sunil Chandran, Sajith Padinhatteeri, Karthik Ravi Shankar:
List Distinguishing Number of p th Power of Hypercube and Cartesian Powers of a Graph. CALDAM 2020: 235-247 - Angsuman Das:
Determining Number of Generalized and Double Generalized Petersen Graph. CALDAM 2020: 131-140 - Soura Sena Das, Soumen Nandi, Sagnik Sen:
The Relative Oriented Clique Number of Triangle-Free Planar Graphs Is 10. CALDAM 2020: 260-266 - Florent Foucaud, Ralf Klasing, Mirka Miller, Joe Ryan:
Monitoring the Edges of a Graph Using Distances. CALDAM 2020: 28-40 - Mathew C. Francis, Dalu Jacob:
The Lexicographic Method for the Threshold Cover Problem. CALDAM 2020: 41-52 - P. Francis, S. Francis Raj, M. Gokulnath:
Indicated Coloring of Complete Expansion and Lexicographic Product of Graphs. CALDAM 2020: 178-183 - Michel Habib, Lalla Mouatadid, Mengchuan Zou:
Approximating Modular Decomposition Is Hard. CALDAM 2020: 53-66 - Frédéric Havet, Dorian Mazauric, Viet-Ha Nguyen, Rémi Watrigant:
Overlaying a Hypergraph with a Graph with Bounded Maximum Degree. CALDAM 2020: 403-414 - Pavol Hell, César Hernández-Cruz, Anurag Sanyal:
Partitioning Cographs into Two Forests and One Independent Set. CALDAM 2020: 15-27 - Marsden Jacques, Dennis Wong:
Greedy Universal Cycle Constructions for Weak Orders. CALDAM 2020: 363-370 - Sangram Kishor Jena, Gautam K. Das:
Vertex-Edge Domination in Unit Disk Graphs. CALDAM 2020: 67-78 - Chamanvir Kaur, Neeldhara Misra:
On the Parameterized Complexity of Spanning Trees with Small Vertex Covers. CALDAM 2020: 427-438 - Rolf Klein, David Kübel, Elmar Langetepe, Jörg-Rüdiger Sack, Barbara Schwarzwald:
A New Model in Firefighting Theory. CALDAM 2020: 371-383 - Mark Korenblit, Vadim E. Levit:
On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs. CALDAM 2020: 248-259 - K. S. Ajish Kumar, Deepak Rajendraprasad, K. S. Sudeep:
Oriented Diameter of Star Graphs. CALDAM 2020: 307-317 - Dimitri Lajou:
On Cartesian Products of Signed Graphs. CALDAM 2020: 219-234 - Subhrangsu Mandal, Arobinda Gupta:
0-1 Timed Matching in Bipartite Temporal Graphs. CALDAM 2020: 331-346
skipping 9 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-04-28 00:39 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