Остановите войну!
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 26 matches
- 2023
- Marcelo Bianchetti, Javier Marenco:
A branch-and-cut algorithm for the routing and spectrum allocation problem. Discret. Appl. Math. 339: 107-126 (2023) - Flavia Bonomo-Braberman, Gastón Abel Brito:
Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs. Discret. Appl. Math. 339: 53-77 (2023) - Peter Borg:
Isolation of connected graphs. Discret. Appl. Math. 339: 154-165 (2023) - Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Sasanka Roy, Luís Fernando Schultz Xavier da Silveira:
Constant delay lattice train schedules. Discret. Appl. Math. 339: 1-10 (2023) - Josep Fàbrega, Jaume Martí-Farré, Xavier Muñoz:
Immune sets in monotone infection rules. Characterization and complexity. Discret. Appl. Math. 339: 202-215 (2023) - Atli Fannar Franklín, Robert K. Moniot:
The difficulty of beating the Taxman. Discret. Appl. Math. 339: 166-171 (2023) - Chen Guo, Chengzhong Wu, Zhifang Xiao, Jianbo Lu, Zhihong Liu:
The intermittent diagnosability for two families of interconnection networks under the PMC model and MM* model. Discret. Appl. Math. 339: 89-106 (2023) - Mohsen Jannesari:
Graphs with doubly resolving number 2. Discret. Appl. Math. 339: 178-183 (2023) - Qihui Jin, Shasha Li, Mengmeng Xie:
3-path-connectivity of Cayley graphs generated by transposition trees. Discret. Appl. Math. 339: 292-299 (2023) - Jonathan Joe, Matt Noble:
A Triangle-free, 4-chromatic Q3 Euclidean distance graph Scavenger hunt! Discret. Appl. Math. 339: 216-226 (2023) - Nathan Kahl, Kristi Luttrell:
On maximum graphs in Tutte polynomial posets. Discret. Appl. Math. 339: 78-88 (2023) - Natawat Klamsakul, Pantaree Thengarnanchai, Mattanaporn Suebtangjai, Pailin Kaewperm, Nuttanon Songsuwan, Pawaton Kaemawichanurat:
Counting maximal independent sets in some n-gonal cacti. Discret. Appl. Math. 339: 234-280 (2023) - Antti Kuusisto, Raine Rönnholm:
The optimal way to play the most difficult repeated two-player coordination games. Discret. Appl. Math. 339: 36-52 (2023) - Kaiyang Lan, Feng Liu, Yidong Zhou:
Some remarks on graphs with no induced subdivision of K4. Discret. Appl. Math. 339: 227-233 (2023) - Jiayu Lou, Ligong Wang, Ming Yuan:
On the α-index of minimally 2-connected graphs with given order or size. Discret. Appl. Math. 339: 281-291 (2023) - Borut Luzar, Mária Maceková, Simona Rindosová, Roman Soták, Katarína Sroková, Kenny Storgel:
Locally irregular edge-coloring of subcubic graphs. Discret. Appl. Math. 339: 136-148 (2023) - Pasin Manurangsi, Warut Suksompong:
Fixing knockout tournaments with seeds. Discret. Appl. Math. 339: 21-35 (2023) - Abel Cabrera Martínez, Alejandro Estrada-Moreno:
Double domination in rooted product graphs. Discret. Appl. Math. 339: 127-135 (2023) - Kyle Murphy:
Strict optimal rubbling of graphs. Discret. Appl. Math. 339: 349-361 (2023) - Fumihiko Nakano, Taizo Sadahiro, Tetsuya Sakurai:
Top to random shuffles on colored permutations. Discret. Appl. Math. 339: 336-348 (2023) - Jan Pavlík:
Distributivity of a segmentation lattice. Discret. Appl. Math. 339: 300-316 (2023) - Celso A. Weffort-Santos, Rafael C. S. Schouery:
Graphs without gap-vertex-labellings: Families and bounds. Discret. Appl. Math. 339: 317-335 (2023) - Biao Wu:
A refined result on cross-intersecting families. Discret. Appl. Math. 339: 149-153 (2023) - Jiadong Wu, Yisai Xue, Liying Kang:
Some sufficient conditions for graphs being k-leaf-connected. Discret. Appl. Math. 339: 11-20 (2023) - Yuxing Yang, Xiaohui Hua, Lulu Yang:
Hyper K1,r and sub-K1,r fault tolerance of star graphs. Discret. Appl. Math. 339: 172-177 (2023) - Yu Yang, Bang-Bang Jin, Mei Lu, Zhihao Hui, Lu-Xuan Zhao, Hua Wang:
Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices. Discret. Appl. Math. 339: 184-201 (2023)
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-10 07:08 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