![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 25 matches
- 1986
- IJsbrand Jan Aalbersberg
, Grzegorz Rozenberg, Andrzej Ehrenfeucht:
On the membership problem for regular DNLC grammars. Discret. Appl. Math. 13(1): 79-85 (1986) - Agha Iqbal Ali, Jeff L. Kennington:
The asymmetric M-travelling salesmen problem: A duality based branch-and-bound algorithm. Discret. Appl. Math. 13(2-3): 259-276 (1986) - Richard P. Anstee:
Invariant sets of arcs in network flow problems. Discret. Appl. Math. 13(1): 1-7 (1986) - Mikhail J. Atallah, Greg N. Frederickson:
A note on finding a maximum empty rectangle. Discret. Appl. Math. 13(1): 87-91 (1986) - Mikhail J. Atallah, Susanne E. Hambrusch:
An assignment algorithm with applications to integrated circuit layout. Discret. Appl. Math. 13(1): 9-22 (1986) - Francisco Barahona:
A solvable case of quadratic 0-1 programming. Discret. Appl. Math. 13(1): 23-26 (1986) - Oscar Barros, Andrés Weintraub
:
Spatial market equilibrium problems as network models. Discret. Appl. Math. 13(2-3): 109-130 (1986) - Jean Bovet:
Une amelioration de la methode de Dijkstra pour la recherche d'un plus court chemin dans un reseau. Discret. Appl. Math. 13(1): 93-96 (1986) - Fred W. Glover, Beth Novick:
The 2-quasi-greedy algorithm for cardinality constrained matroid bases. Discret. Appl. Math. 13(2-3): 277-286 (1986) - Alan J. Goldman, Prasoon Tiwari:
Allowable processing orders in the accelerated cascade algorithm. Discret. Appl. Math. 13(2-3): 213-221 (1986) - Eric Goles:
Antisymmetrical neural networks. Discret. Appl. Math. 13(1): 97-100 (1986) - Frieda Granot, Refael Hassin:
Multi-terminal maximum flows in node-capacitated networks. Discret. Appl. Math. 13(2-3): 157-163 (1986) - Stephen T. Hedetniemi, Renu C. Laskar, John Pfaff:
A linear algorithm for finding a minimum dominating set in a cactus. Discret. Appl. Math. 13(2-3): 287-292 (1986) - Ming S. Hung, Walter O. Rom, Allan D. Waren:
Degeneracy in transportation problems. Discret. Appl. Math. 13(2-3): 223-237 (1986) - Yoshiro Ikura, George L. Nemhauser:
Computational experience with a polynomial-time dual simplex algorithm for the transportation problem. Discret. Appl. Math. 13(2-3): 239-248 (1986) - Philip C. Jones, Romesh Saigal, Michael H. Schneider:
A variable-dimension homotopy on networks for computing linear spatial equilibria. Discret. Appl. Math. 13(2-3): 131-156 (1986) - Darwin D. Klingman, Robert F. Schneider:
Microcomputer-based algorithms for large scale shortest path problems. Discret. Appl. Math. 13(2-3): 183-206 (1986) - John Mote:
The family constrained network problem. Discret. Appl. Math. 13(2-3): 249-257 (1986) - Nancy V. Phillips:
A new variant of the partitioning shortest path algorithm. Discret. Appl. Math. 13(2-3): 207-212 (1986) - Svatopluk Poljak, Daniel Turzík:
On an application of convexity to discrete systems. Discret. Appl. Math. 13(1): 27-32 (1986) - Svatopluk Poljak, Daniel Turzík:
On pre-periods of discrete influence systems. Discret. Appl. Math. 13(1): 33-39 (1986) - Ivo G. Rosenberg:
Structural rigidity II: Almost infinitesimally rigid bar frameworks. Discret. Appl. Math. 13(1): 41-59 (1986) - M. T. Shing, T. C. Hu:
A decomposition algorithm for multi-terminal networks flows. Discret. Appl. Math. 13(2-3): 165-181 (1986) - Milan Vlach
:
Conditions for the existence of solutions of the three-dimensional planar transportation problem. Discret. Appl. Math. 13(1): 61-78 (1986) - Yechezkel Zalcstein, Stanley P. Franklin:
Testing homotopy equivalence is isomorphism complete. Discret. Appl. Math. 13(1): 101-104 (1986)
loading more results
failed to load more results, please try again later
![](https://dblp1.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-09-01 12:39 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