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 35 matches
- 1983
- Brian Alspach, Peter Eades, Gordon Rose:
A lower-bound for the number of productions required for a certain class of languages. Discret. Appl. Math. 6(2): 109-115 (1983) - Susan F. Assmann, Daniel J. Kleitman:
The number of rounds needed to exchange information within a graph. Discret. Appl. Math. 6(2): 117-125 (1983) - Michael D. Beeler:
A new Van der Waerden number. Discret. Appl. Math. 6(2): 207 (1983) - Béla Bollobás, Andrew Thomason:
Parallel sorting. Discret. Appl. Math. 6(1): 1-11 (1983) - N. G. de Bruijn:
Denumerations of rooted trees and multisets. Discret. Appl. Math. 6(1): 25-33 (1983) - M. S. Burgin, E. Ya. Gabovich:
Equivalence among optimization problems on matrix sets. Discret. Appl. Math. 6(1): 13-24 (1983) - P. L. Buzytsky, Gregory A. Freiman:
An effective formula for the number of solutions of a system of two 0, 1-equations. Discret. Appl. Math. 6(2): 127-133 (1983) - Margaret B. Cozzens, Fred S. Roberts:
Computing the boxicity of a graph by covering its complement by cointerval graphs. Discret. Appl. Math. 6(3): 217-228 (1983) - János Demetrovics, Gy. Gyepesi:
Some generalized type functional dependencies formalized as equality set on matrices. Discret. Appl. Math. 6(1): 35-47 (1983) - Dietmar Dorninger, Helmut Länger:
An explicit formula for the solution of the Fisher-Wright selection model in population genetics. Discret. Appl. Math. 6(2): 209-211 (1983) - Ronald D. Dutton, Robert C. Brigham:
A characterization of competition graphs. Discret. Appl. Math. 6(3): 315-317 (1983) - Françoise Fogelman, Eric Goles, Gérard Weisbuch:
Transient length in sequential iteration of threshold functions. Discret. Appl. Math. 6(1): 95-98 (1983) - Alan M. Frieze:
An extension of Christofides heuristic to the k-person travelling salesman problem. Discret. Appl. Math. 6(1): 79-83 (1983) - Mark K. Goldberg:
A nonfactorial algorithm for testing isomorphism of two graphs. Discret. Appl. Math. 6(3): 229-236 (1983) - Pierre Hansen:
Recognizing sign solvable graphs. Discret. Appl. Math. 6(3): 237-241 (1983) - A. C. Hayes, David G. Larman:
The vertices of the knapsack polytope. Discret. Appl. Math. 6(2): 135-138 (1983) - Dorit S. Hochbaum:
Efficient bounds for the stable set, vertex cover and set packing problems. Discret. Appl. Math. 6(3): 243-254 (1983) - Tetsuo Ichimori, Hiroaki Ishii, Toshio Nishida:
Two routing problems with the limitation of fuel. Discret. Appl. Math. 6(1): 85-89 (1983) - Rolf G. Karlsson, Patricio V. Poblete:
An O(mlog logD) algorithm for shortest paths. Discret. Appl. Math. 6(1): 91-93 (1983) - Manohar Lal Kaushik:
Comments on "a note on Reed-Muller codes". Discret. Appl. Math. 6(2): 213-214 (1983) - Daniel J. Kleitman, Robert A. Lew:
An algorithm for collapsing sign alternating sequences of real numbers. Discret. Appl. Math. 6(1): 49-53 (1983) - Renu C. Laskar, Douglas R. Shier:
On powers and centers of chordal graphs. Discret. Appl. Math. 6(2): 139-147 (1983) - Chien-Hua M. Lin, Harvey M. Salkin:
An efficient algorithm for the complete set partitioning problem. Discret. Appl. Math. 6(2): 149-156 (1983) - J. Richard Lundgren, John S. Maybee:
A characterization of graphs of competition number m. Discret. Appl. Math. 6(3): 319-322 (1983) - Christoph Maas:
Some results about the interval number of a graph. Discret. Appl. Math. 6(1): 99-102 (1983) - George Markowsky, Andrew Wohlgemuth:
Intersection-union systems. Discret. Appl. Math. 6(3): 255-262 (1983) - Willi Maurer:
Bivalent trees and forests or upper bounds for the probability of a union revisited. Discret. Appl. Math. 6(2): 157-171 (1983) - I. Morihara, T. Ibaraki, T. Hasegawa:
Bin packing and multiprocessor scheduling problems with side constraint on job types. Discret. Appl. Math. 6(2): 173-191 (1983) - Haruko Okamura:
Multicommodity flows in graphs. Discret. Appl. Math. 6(1): 55-62 (1983) - Svatopluk Poljak, Ales Pultr, Vojtech Rödl:
On qualitatively independent partitions and related problems. Discret. Appl. Math. 6(2): 193-205 (1983)
skipping 5 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-09-27 14:09 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