Остановите войну!
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 23 matches
- 1996
- Srinivasa Rao Arikati, Uri N. Peled:
A Polynomial Algorithm for the Parity Path Problem on Perfectly orientable Graphs. Discret. Appl. Math. 65(1-3): 5-20 (1996) - David Avis, Komei Fukuda:
Reverse Search for Enumeration. Discret. Appl. Math. 65(1-3): 21-46 (1996) - Achim Bachem, Winfried Hochstättler, Martin Malich:
The Simulated Trading Heuristic for Solving Vehicle Routing Problems. Discret. Appl. Math. 65(1-3): 47-72 (1996) - Claude Berge:
Some Properties of Non-bicolorable Hypergraphs and the Four-color Problem. Discret. Appl. Math. 65(1-3): 73-79 (1996) - Jacek Blazewicz, Maciej Drozdowski, Dominique de Werra, Jan Weglarz:
Deadline Scheduling of Multiprocessor Tasks. Discret. Appl. Math. 65(1-3): 81-95 (1996) - Peter Brucker, Johann L. Hurink, Frank Werner:
Improving Local Search Heuristics for Some Scheduling Problems-I. Discret. Appl. Math. 65(1-3): 97-122 (1996) - Rainer E. Burkard, Rüdiger Rudolf, Gerhard J. Woeginger:
Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients. Discret. Appl. Math. 65(1-3): 123-139 (1996) - Jacques Carlier, Corinne Lucet:
A Decomposition Algorithm for Network Reliability Evaluation. Discret. Appl. Math. 65(1-3): 141-156 (1996) - Maurice Cochand, Arlette Gaillard:
on Preemptive Scheduling: A General Setting for the Two-phase Method. Discret. Appl. Math. 65(1-3): 157-166 (1996) - Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh, Keiji Ohtsuka, Nobuhiko Yoshimura:
A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms. Discret. Appl. Math. 65(1-3): 167-190 (1996) - Mauro Dell'Amico, Francesco Maffioli:
on Some Multicriteria Arborescence Problems: Complexity and Algorithms. Discret. Appl. Math. 65(1-3): 191-206 (1996) - Reinhardt Euler, Hervé Le Verge:
Time-tables, Polyhedra and the Greedy Algorithm. Discret. Appl. Math. 65(1-3): 207-221 (1996) - Fred W. Glover:
Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems. Discret. Appl. Math. 65(1-3): 223-253 (1996) - Peter L. Hammer, Alexander K. Kelmans:
Laplacian Spectra and Spanning Trees of Threshold Graphs. Discret. Appl. Math. 65(1-3): 255-273 (1996) - Pierre Hansen, Maolin Zheng:
Shortest Shortest Path Trees of a Network. Discret. Appl. Math. 65(1-3): 275-284 (1996) - Alain Hertz, Yves Mottet, Yves Rochat:
on a Scheduling Problem in a Robotized Analytical System. Discret. Appl. Math. 65(1-3): 285-318 (1996) - Alain Hertz, Maurice Queyranne, Marino Widmer:
Preface. Discret. Appl. Math. 65(1-3): 1-3 (1996) - Alain Hertz, Marino Widmer:
An Improved Tabu Search Approach for Solving the Job Shop Scheduling Problem with Tooling Constraints. Discret. Appl. Math. 65(1-3): 319-345 (1996) - Anthony J. W. Hilton, Jiping Liu, Cheng Zhao:
Graphs That Admit 3-to-1 or 2-to-1 Maps onto the Circle. Discret. Appl. Math. 65(1-3): 347-377 (1996) - Chính T. Hoàng:
A Note on Perfectly orderable Graphs. Discret. Appl. Math. 65(1-3): 379-386 (1996) - Jenö Lehel, Frédéric Maffray, Myriam Preissmann:
Graphs with Largest Number of Minimum Cuts. Discret. Appl. Math. 65(1-3): 387-407 (1996) - Marcus Pattloch, Günter Schmidt:
Lot-size Scheduling of Two Types of Jobs on Identical Machines. Discret. Appl. Math. 65(1-3): 409-419 (1996) - Henry Shum, Leslie E. Trotter Jr.:
Cardinality-restricted Chains and Antichains in Partially ordered Sets. Discret. Appl. Math. 65(1-3): 421-439 (1996)
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-04-19 09:29 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