![](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 64 matches
- 1994
- Alexander A. Ageev:
On Finding Critical Independent and Vertex Sets. SIAM J. Discret. Math. 7(2): 293-295 (1994) - Noga Alon, Jehoshua Bruck
:
Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition. SIAM J. Discret. Math. 7(1): 1-8 (1994) - Noga Alon, Fan R. K. Chung, Ronald L. Graham:
Routing Permutations on Graphs Via Matchings. SIAM J. Discret. Math. 7(3): 513-530 (1994) - Noga Alon, Paul D. Seymour, Robin Thomas:
Planar Separators. SIAM J. Discret. Math. 7(2): 184-193 (1994) - László Babai, Haluk Oral, Kevin T. Phelps:
Eulerian Self-Dual Codes. SIAM J. Discret. Math. 7(2): 325-330 (1994) - Francisco Barahona, Jean Fonlupt, Ali Ridha Mahjoub:
Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs. SIAM J. Discret. Math. 7(3): 390-402 (1994) - Francisco Barahona, Ali Ridha Mahjoub:
Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs. SIAM J. Discret. Math. 7(3): 344-358 (1994) - Francisco Barahona, Ali Ridha Mahjoub:
Compositions of Graphs and Polyhedra II: Stable Sets. SIAM J. Discret. Math. 7(3): 359-371 (1994) - Francisco Barahona, Ali Ridha Mahjoub:
Compositions of Graphs and Polyhedra III: Graphs with No W4 Minor. SIAM J. Discret. Math. 7(3): 372-389 (1994) - Edward A. Bender, E. Rodney Canfield:
The Number of Degree-Restricted Rooted Maps on the Sphere. SIAM J. Discret. Math. 7(1): 9-15 (1994) - Ian F. Blake, Shuhong Gao, Ronald C. Mullin:
Normal and Self-dual Normal Bases from Factorization of c xq+1 + d xq - ax - b. SIAM J. Discret. Math. 7(3): 499-512 (1994) - Endre Boros
, Peter L. Hammer, John N. Hooker:
Predicting Cause-Effect Relationships from Incomplete Discrete Observations. SIAM J. Discret. Math. 7(4): 531-543 (1994) - Claude Carlet:
The Divisors of x2m+x of Constant Derivatives and Degree 2m-2. SIAM J. Discret. Math. 7(2): 238-244 (1994) - Jianer Chen:
A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus. SIAM J. Discret. Math. 7(4): 614-631 (1994) - Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Sorting on a Mesh-Connected Computer with Delaying Links. SIAM J. Discret. Math. 7(1): 119-132 (1994) - Sunil Chopra:
The Graph Partitioning Polytope on Series-Parallel and4-Wheel Free Graphs. SIAM J. Discret. Math. 7(1): 16-31 (1994) - Sunil Chopra:
The k-Edge-Connected Spanning Subgraph Polyhedron. SIAM J. Discret. Math. 7(2): 245-259 (1994) - Fan R. K. Chung, Vance Faber, Thomas A. Manteuffel:
An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian. SIAM J. Discret. Math. 7(3): 443-457 (1994) - Fan R. K. Chung, Wayne Goddard, Daniel J. Kleitman:
Even Cycles in Directed Graphs. SIAM J. Discret. Math. 7(3): 474-483 (1994) - Gregory M. Constantine, T. H. Savits:
A Stochastic Process Interpretation of Partition Identities. SIAM J. Discret. Math. 7(2): 194-202 (1994) - Peter Dankelmann, Thomas Niessen, Ingo Schiermeyer:
On Path-Tough Graphs. SIAM J. Discret. Math. 7(4): 571-584 (1994) - David P. Day, Ortrud Oellermann, Henda C. Swart:
Steiner Distance-Hereditary Graphs. SIAM J. Discret. Math. 7(3): 437-442 (1994) - Yvo Desmedt, Yair Frankel:
Perfect Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group. SIAM J. Discret. Math. 7(4): 667-679 (1994) - Genghua Fan, Roland Häggkvist:
The Square of a Hamiltonian Cycle. SIAM J. Discret. Math. 7(2): 203-212 (1994) - Michael R. Fellows, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs:
The Private Neighbor Cube. SIAM J. Discret. Math. 7(1): 41-47 (1994) - Stefan Felsner, Michel Habib, Rolf H. Möhring:
On the Interplay Between Interval Dimension and Dimension. SIAM J. Discret. Math. 7(1): 32-40 (1994) - Peter C. Fishburn, James A. Reeds:
Bell Inequalities, Grothendieck's Constant, and Root Two. SIAM J. Discret. Math. 7(1): 48-56 (1994) - David C. Fisher:
Domination, Fractional Domination, 2-Packing, and Graph Products. SIAM J. Discret. Math. 7(3): 493-498 (1994) - Jun Gao, J. Michael Steele:
Sums of Squares of Edge Lengths and Spacefilling Curve Heuristics for the Traveling Salesman Problem. SIAM J. Discret. Math. 7(2): 314-324 (1994) - Gerard van der Geer, Marcel van der Vlugt:
Generalized Hamming Weights of Melas Codes and Dual Melas Codes. SIAM J. Discret. Math. 7(4): 554-559 (1994)
skipping 34 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-20 10:00 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