![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.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 39 matches
- 1980
- Aldo Aiello, Ernesto Burattini, A. Massarotti, Francesco Ventriglia
:
"A posteriori" evaluation of bin packing approximation algorithms. Discret. Appl. Math. 2(2): 159-161 (1980) - Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson:
Langages sur des alphabets infinis. Discret. Appl. Math. 2(1): 1-20 (1980) - Samir K. Bhattacharya, A. K. Gupta:
Occupation times for two-state Markov chains. Discret. Appl. Math. 2(3): 249-250 (1980) - Charles E. Blair:
Facial disjunctive programs and sequence of cutting-planes. Discret. Appl. Math. 2(3): 173-179 (1980) - Charles J. Colbourn, Derek G. Corneil:
On deciding switching equivalence of graphs. Discret. Appl. Math. 2(3): 181-184 (1980) - Richard W. Cottle:
Observations on a class of nasty linear complementarity problems. Discret. Appl. Math. 2(2): 89-111 (1980) - Raymond A. Cuninghame-Green, P. F. J. Meijer:
An algebra for piecewise-linear minimax problems. Discret. Appl. Math. 2(4): 267-294 (1980) - Bal Kishan Dass, Sunil Kumar Muttoo:
A note on Reed-Muller codes. Discret. Appl. Math. 2(4): 345-348 (1980) - Roberto Dvornicich
:
On a problem of cyclic permutations of integers. Discret. Appl. Math. 2(4): 353-355 (1980) - Andrzej Ehrenfeucht, Grzegorz Rozenberg, R. Verraedt:
Many-to-one simulation in E0L forms is decidable. Discret. Appl. Math. 2(1): 73-76 (1980) - Friedrich Esser, Frank Harary:
Digraphs with real and gaussian spectra. Discret. Appl. Math. 2(2): 113-124 (1980) - Reinhardt Euler:
On a classification of independence systems. Discret. Appl. Math. 2(4): 357-360 (1980) - Arthur M. Farley, Andrzej Proskurowski:
Computation of the center and diameter of outerplanar graphs. Discret. Appl. Math. 2(3): 185-191 (1980) - Alan M. Frieze
:
Probabilistic analysis of some euclidean clustering problems. Discret. Appl. Math. 2(4): 295-309 (1980) - Satoru Fujishige
:
Principal structures of submodular systems. Discret. Appl. Math. 2(1): 77-79 (1980) - E. Ya. Gabovich, I. I. Melamed:
On constant discrete programming problems. Discret. Appl. Math. 2(3): 193-205 (1980) - Fred W. Glover, Darwin Klingman, John Mote, David Whitman:
An extended abstract of an indepth algorithmic and computational study for maximum flow problems. Discret. Appl. Math. 2(3): 251-254 (1980) - M. Gordon, John A. Torkington:
Enumeration of coloured plane trees with a given type partition. Discret. Appl. Math. 2(3): 207-223 (1980) - Harold Greenberg, Israel Feldman:
A better step-off algorithm for the knapsack problem. Discret. Appl. Math. 2(1): 21-25 (1980) - Georg Gunther, Bert L. Hartnell:
Optimal K-secure graphs. Discret. Appl. Math. 2(3): 225-231 (1980) - Horst W. Hamacher:
Algebraic flows in regular matroids. Discret. Appl. Math. 2(1): 27-38 (1980) - Pierre Hansen:
An O(tm log D) Algorithm for shortest paths. Discret. Appl. Math. 2(2): 151-153 (1980) - Monique Hucher, Germain Sabatier, Jacques Grolier:
Effectifs des diverses sequences de polyedres 3-valents convexes ayant moins de 11 faces et de polyedres sans face triangulaire ayant de 11 a 14 faces. Discret. Appl. Math. 2(3): 255-257 (1980) - Toshihide Ibaraki:
The number of additional variables required for the integer programming formulation. Discret. Appl. Math. 2(2): 155-158 (1980) - Ellis L. Johnson, Uwe H. Suhl:
Experiments in integer programming. Discret. Appl. Math. 2(1): 39-55 (1980) - Tohru Kikuno, Noriyoshi Yoshida, Yoshiaki Kakuda:
NP-completeness of some type of p-center problem. Discret. Appl. Math. 2(4): 361-363 (1980) - Jenö Lehel:
Deltahedra are realizable as simplicial convex polyhedra. Discret. Appl. Math. 2(1): 81-84 (1980) - C. Marrazzini:
Characterization of the inverse of a particular circulant matrix by means of a continued fraction. Discret. Appl. Math. 2(2): 163-165 (1980) - John S. Maybee:
Sign solvable graphs. Discret. Appl. Math. 2(1): 57-63 (1980) - Masakazu Nasu:
An interconnection of local maps inducing onto global maps. Discret. Appl. Math. 2(2): 125-150 (1980)
skipping 9 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.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-08-01 17:47 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