Остановите войну!
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 22 matches
- 1993
- Alberto Apostolico, Mikhail J. Atallah, Susanne E. Hambrusch:
New Clique and Independent Set Algorithms for Circle Graphs (Discrete Applied Mathematics 36 (1992) 1-24). Discret. Appl. Math. 41(2): 179-180 (1993) - Tadashi Arai, Shuichi Ueno, Yoji Kajitani:
Generalization of aTheorem on the Parametric Maximum Flow Problem. Discret. Appl. Math. 41(1): 69-74 (1993) - Jørgen Bang-Jensen, Pavol Hell:
Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs. Discret. Appl. Math. 41(1): 75-79 (1993) - E. Andrew Boyd:
Polyhedral Results for the Precedence-Constrained Knapsack Problem. Discret. Appl. Math. 41(3): 185-201 (1993) - Neal Brand, Stephen J. Curran, Sajal K. Das, Tom Jacob:
Probability of Diameter Two for Steinhaus Graphs. Discret. Appl. Math. 41(2): 165-171 (1993) - J. Csima, László Lovász:
Dating to Marriage. Discret. Appl. Math. 41(3): 269-270 (1993) - Karel Culík II, Simant Dube:
Rational and Affine Expressions for Image Description. Discret. Appl. Math. 41(2): 85-120 (1993) - Jutta Eusterbrock:
Errata to "Selecting the Top Three Elements" by M. Aigner: A Result of a Computer-Assisted Proof Search. Discret. Appl. Math. 41(2): 131-137 (1993) - John V. Franco:
On the Occurrence of Null Clauses in Random Instances of Satisfiability. Discret. Appl. Math. 41(3): 203-209 (1993) - Gábor Galambos, J. B. G. Frenk:
A Simple Proof of Liang's Lower Bound for On-Line bin Packing and the Extension to the Parametric Case. Discret. Appl. Math. 41(2): 173-178 (1993) - Frieda Granot, Jadranka Skorin-Kapov:
On Polynomial Solvability of the High Multiplicity Total Weighted Tardiness Problem. Discret. Appl. Math. 41(2): 139-146 (1993) - Ephraim Korach, Ady Tal:
General Vertex Disjoint Paths in Series-Parallel Graphs. Discret. Appl. Math. 41(2): 147-164 (1993) - Chung-Yee Lee, Surya Danusaputro Liman:
Capacitated Two-Parallel Machines Scheduling to Minimize Sum of Job Completion Times. Discret. Appl. Math. 41(3): 211-222 (1993) - Sheelagh Lloyd:
Balance, Uncorrelatedness and the Strict Avalanche Criterion. Discret. Appl. Math. 41(3): 223-233 (1993) - Richard J. Nowakowski:
Search ans Sweep Numbers of Finite Directed Acyclic Graphs. Discret. Appl. Math. 41(1): 1-11 (1993) - Arto Salomaa:
Simple Reductions Between D0L Language and Sequence Equivalence Problems. Discret. Appl. Math. 41(3): 271-274 (1993) - Randy Shull, Alan Shuchat, James B. Orlin, Marianne Lepp:
Recognizing Hidden Bicircular Networks. Discret. Appl. Math. 41(1): 13-53 (1993) - Kyle Siegrist, Ashok T. Amin, Peter J. Slater:
The Optimal Unicyclic Graphs for Pair-Connected Reliability. Discret. Appl. Math. 41(3): 235-243 (1993) - Caterina De Simone, Antonio Sassano:
Stability Number of Bull- and Chair-Free Graphs. Discret. Appl. Math. 41(2): 121-129 (1993) - Frank W. Sinden:
Coloring Drawings of Bipartite Graphs: A Problem in Automated Assembly. Discret. Appl. Math. 41(1): 55-68 (1993) - Mike A. Steel:
Distributions on Bicoloured Binary Trees Arising from the Principle of Parsimony. Discret. Appl. Math. 41(3): 245-261 (1993) - Huishan Zhou:
The Chromatic Difference Sequence of the Cartesian Product of Graphs: Part II. Discret. Appl. Math. 41(3): 263-267 (1993)
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-03-28 18:57 CET 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