Остановите войну!
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 19 matches
- 2006
- Samy Abbes:
A Cartesian closed category of event structures with quotients. Discret. Math. Theor. Comput. Sci. 8(1): 249-272 (2006) - Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza:
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks. Discret. Math. Theor. Comput. Sci. 8(1): 1-16 (2006) - R. Balasubramanian, C. R. Subramanian:
On Sampling Colorings of Bipartite Graphs. Discret. Math. Theor. Comput. Sci. 8(1): 17-30 (2006) - Andreas Brandstädt, Tilo Klembt, Suhail Mahfud:
P6- and triangle-free graphs revisited: structure and bounded clique-width. Discret. Math. Theor. Comput. Sci. 8(1): 173-188 (2006) - Tiziana Calamoneri:
Optimal L(h, k)-Labeling of Regular Grids. Discret. Math. Theor. Comput. Sci. 8(1): 141-158 (2006) - Bao-Xing Chen, Jixiang Meng, Wenjun Xiao:
Some new optimal and suboptimal infinite families of undirected double-loop networks. Discret. Math. Theor. Comput. Sci. 8(1): 299-312 (2006) - Sylvie Corteel, Guy Louchard, Robin Pemantle:
Common intervals in permutations. Discret. Math. Theor. Comput. Sci. 8(1): 189-214 (2006) - Alan M. Frieze, Juan Vera:
On randomly colouring locally sparse graphs. Discret. Math. Theor. Comput. Sci. 8(1): 121-128 (2006) - Ed Hong:
The Online Specialization Problem. Discret. Math. Theor. Comput. Sci. 8(1): 97-120 (2006) - Mustapha Kchikech, Olivier Togni:
Approximation Algorithms for Multicoloring Planar Graphs and Powers of Square and Triangular Meshes. Discret. Math. Theor. Comput. Sci. 8(1): 159-172 (2006) - Arnold Knopfmacher, Helmut Prodinger:
The first descent in samples of geometric random variables and permutations. Discret. Math. Theor. Comput. Sci. 8(1): 215-234 (2006) - Mekkia Kouider, Preben D. Vestergaard:
Generalized connected domination in graphs. Discret. Math. Theor. Comput. Sci. 8(1): 57-64 (2006) - Toufik Mansour, Basel Sirhan:
Counting l-letter subwords in compositions. Discret. Math. Theor. Comput. Sci. 8(1): 285-298 (2006) - Stavros D. Nikolopoulos, Charis Papadopoulos:
On the number of spanning trees of Knm±G graphs. Discret. Math. Theor. Comput. Sci. 8(1): 235-248 (2006) - Stavros D. Nikolopoulos, Leonidas Palios:
Recognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs. Discret. Math. Theor. Comput. Sci. 8(1): 65-82 (2006) - Helmut Prodinger:
d-records in geometrically distributed random variables. Discret. Math. Theor. Comput. Sci. 8(1): 273-284 (2006) - Hui Rao, Yu-Mei Xue:
Tile Z2 with translations of one set. Discret. Math. Theor. Comput. Sci. 8(1): 129-140 (2006) - Ludger Rüschendorf, Ralf Neininger:
Survey of Multivariate Aspects of the Contraction Method. Discret. Math. Theor. Comput. Sci. 8(1): 31-56 (2006) - Jakob Grue Simonsen:
On the Computability of the Topological Entropy of Subshifts. Discret. Math. Theor. Comput. Sci. 8(1): 83-96 (2006)
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-10 14:17 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