Остановите войну!
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 51 matches
- 2022
- Jammigumpula Ajay, Satyabrata Jana, Sasanka Roy:
Collision-free routing problem with restricted L-path. Discret. Appl. Math. 319: 71-80 (2022) - Bijo S. Anand, Mitre Costa Dourado, Prasanth G. Narasimha-Shenoi, Sabeer Sain Ramla:
On the Δ-interval and the Δ-convexity numbers of graphs and graph products. Discret. Appl. Math. 319: 487-498 (2022) - N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare:
Vertex partitioning problems on graphs with bounded tree width. Discret. Appl. Math. 319: 254-270 (2022) - N. R. Aravind, Udit Maniyar:
Planar projections of graphs. Discret. Appl. Math. 319: 216-222 (2022) - Umair Arif, Robert Benkoczi, Daya Ram Gaur, Ramesh Krishnamurti:
A primal-dual approximation algorithm for Minsat. Discret. Appl. Math. 319: 372-381 (2022) - Pradeesha Ashok, Rathin Bhargava, Naman Gupta, Mohammad Khalid, Dolly Yadav:
Structural parameterization for minimum conflict-free colouring. Discret. Appl. Math. 319: 239-253 (2022) - Thangaraj Asir, V. Rabikka:
The Wiener index of the zero-divisor graph of Zn. Discret. Appl. Math. 319: 461-471 (2022) - Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier:
On graphs whose eternal vertex cover number and vertex cover number coincide. Discret. Appl. Math. 319: 171-182 (2022) - Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani:
Storing four elements in the two query bitprobe model. Discret. Appl. Math. 319: 121-131 (2022) - Kannan Balakrishnan, Manoj Changat, Andreas M. Hinz, Divya Sindhu Lekha:
The median of Sierpiński graphs. Discret. Appl. Math. 319: 159-170 (2022) - Laurent Beaudou, Florent Foucaud, Reza Naserasr:
Smallest C2ℓ+1-critical graphs of odd-girth 2k+1. Discret. Appl. Math. 319: 564-575 (2022) - Sergey Bereg, Mohammadreza Haghpanah:
New algorithms and bounds for halving pseudolines. Discret. Appl. Math. 319: 194-206 (2022) - Sergey Bereg, Mohammadreza Haghpanah:
Algorithms for Radon partitions with tolerance. Discret. Appl. Math. 319: 207-215 (2022) - Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy:
The balanced connected subgraph problem. Discret. Appl. Math. 319: 111-120 (2022) - S. V. Ullas Chandran, Mitre Costa Dourado, Maya G. S. Thankachy:
Computational and structural aspects of the geodetic and the hull numbers of shadow graphs. Discret. Appl. Math. 319: 499-510 (2022) - L. Sunil Chandran, Abhiruk Lahiri, Nitin Singh:
Improved approximation for maximum edge colouring problem. Discret. Appl. Math. 319: 42-52 (2022) - Manoj Changat, Sandip Das:
Preface: CALDAM 2020. Discret. Appl. Math. 319: 192-193 (2022) - Sandip Das, Harmender Gahlawat:
Bumblebee visitation problem. Discret. Appl. Math. 319: 27-41 (2022) - Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman:
Improved descriptional complexity results on generalized forbidding grammars. Discret. Appl. Math. 319: 2-18 (2022) - Florent Foucaud, Shih-Shun Kao, Ralf Klasing, Mirka Miller, Joe Ryan:
Monitoring the edges of a graph using distances. Discret. Appl. Math. 319: 424-438 (2022) - P. Francis, S. Francis Raj, M. Gokulnath:
On indicated coloring of lexicographic product of graphs. Discret. Appl. Math. 319: 576-582 (2022) - Carrie Frizzell:
Generalized bijective maps between G-parking functions, spanning trees, and the Tutte polynomial. Discret. Appl. Math. 319: 517-532 (2022) - Anni Hakanen, Ville Junnila, Tero Laihonen, Ismael G. Yero:
On vertices contained in all or in no metric basis. Discret. Appl. Math. 319: 407-423 (2022) - Frédéric Havet, Dorian Mazauric, Viet-Ha Nguyen, Rémi Watrigant:
Overlaying a hypergraph with a graph with bounded maximum degree. Discret. Appl. Math. 319: 394-406 (2022) - Andreas M. Hinz, Caroline Holz auf der Heide, Sara Sabrina Zemljic:
Metric properties of Sierpiński triangle graphs. Discret. Appl. Math. 319: 439-453 (2022) - Andreas M. Hinz, Borut Luzar, Ciril Petr:
The Dudeney-Stockmeyer Conjecture. Discret. Appl. Math. 319: 19-26 (2022) - Sangram Kishor Jena, Gautam K. Das:
Vertex-edge domination in unit disk graphs. Discret. Appl. Math. 319: 351-361 (2022) - Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou:
On selecting a fraction of leaves with disjoint neighborhoods in a plane tree. Discret. Appl. Math. 319: 141-148 (2022) - Deepanjan Kesh, Vidya Sagar Sharma:
On the bitprobe complexity of two probe adaptive schemes. Discret. Appl. Math. 319: 132-140 (2022) - Rolf Klein, David Kübel, Elmar Langetepe, Jörg-Rüdiger Sack, Barbara Schwarzwald:
A new model and algorithms in firefighting theory. Discret. Appl. Math. 319: 296-309 (2022)
skipping 21 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-06-01 02:57 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