![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
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 17 matches
- 1998
- Jérôme Amilhastre, Marie-Catherine Vilarem, Philippe Janssen:
Complexity of Minimum Biclique Cover and Minimum Biclique Decomposition for Bipartite Domino-free Graphs. Discret. Appl. Math. 86(2-3): 125-144 (1998) - Shai Ben-David, Ami Litman:
Combinatorial Variability of Vapnik-chervonenkis Classes with Applications to Sample Compression Schemes. Discret. Appl. Math. 86(1): 3-25 (1998) - Jean-Claude Bermond, Luisa Gargano
, Stephane Perennes:
Optimal Sequential Gossiping by Short Messages. Discret. Appl. Math. 86(2-3): 145-155 (1998) - Francine Blanchet-Sadri:
Trees, Congruences and Varieties of Finite Semigroups. Discret. Appl. Math. 86(2-3): 157-179 (1998) - Annalisa De Bonis:
A Predetermined Algorithm for Detecting a Counterfeit Coin with a Multi-arms Balance. Discret. Appl. Math. 86(2-3): 181-200 (1998) - Nicolò Cesa-Bianchi, David Haussler:
A Graph-theoretic Generalization of the Sauer-Shelah Lemma. Discret. Appl. Math. 86(1): 27-35 (1998) - Toshihiro Fujito:
A Unified Approximation Algorithm for Node-deletion Problems. Discret. Appl. Math. 86(2-3): 213-231 (1998) - Márta Horváth, Gábor Lugosi:
Scale-sensitive Dimensions and Skeleton Estimates for Classification. Discret. Appl. Math. 86(1): 37-61 (1998) - Pascal Koiran, Eduardo D. Sontag:
Vapnik-Chervonenkis Dimension of Recurrent Neural Networks. Discret. Appl. Math. 86(1): 63-79 (1998) - Arnaud Maes:
Morphisms and Almost-periodicity. Discret. Appl. Math. 86(2-3): 233-248 (1998) - Vitaly Maiorov, Joel Ratsaby:
The Degree of Approximation of Sets in Euclidean Space Using Sets with Bounded Vapnik-Chervonenkis Dimension. Discret. Appl. Math. 86(1): 81-93 (1998) - Damien Palmer, Don Row, Roy Stee, Simon Wotherspoon
:
Rigidity of Octahedral-tetrahedral Trusses. Discret. Appl. Math. 86(2-3): 249-262 (1998) - David Peleg:
Size Bounds for Dynamic Monopolies. Discret. Appl. Math. 86(2-3): 263-273 (1998) - John Shawe-Taylor
:
Special Issue of DAM on the Vapnik-chervonenkis Dimension. Discret. Appl. Math. 86(1): 1-2 (1998) - Joseph Sill:
The Capacity of Monotonic Functions. Discret. Appl. Math. 86(1): 95-107 (1998) - David Steinsaltz:
Fluctuation Bounds for Sock-sorting and Other Stochastic Processes. Discret. Appl. Math. 86(1): 109-123 (1998) - Wenceslas Fernandez de la Vega, Mohamed El Haddad, Daniel Barraez, Oscar Ordaz:
The Forwarding Diameter of Graphs. Discret. Appl. Math. 86(2-3): 201-211 (1998)
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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 17:43 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