Остановите войну!
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 37 matches
- 2002
- Noga Alon, Michael Krivelevich:
Testing k-colorability. SIAM J. Discret. Math. 15(2): 211-227 (2002) - Yaagoub Ashir, Iain A. Stewart:
Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes. SIAM J. Discret. Math. 15(3): 317-328 (2002) - Hans-Jürgen Bandelt, Victor Chepoi:
Graphs with Connected Medians. SIAM J. Discret. Math. 15(2): 268-282 (2002) - Alexander Barg:
On Some Polynomials Related to Weight Enumerators of Linear Codes. SIAM J. Discret. Math. 15(2): 155-164 (2002) - Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan:
Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms. SIAM J. Discret. Math. 15(2): 252-267 (2002) - Oleg V. Borodin, Douglas R. Woodall:
Cyclic Colorings of 3-Polytopes with Large Maximum Face Size. SIAM J. Discret. Math. 15(2): 143-154 (2002) - Eddie Cheng, Sven de Vries:
On the Facet-Inducing Antiweb-Wheel Inequalities for Stable Set Polytopes. SIAM J. Discret. Math. 15(4): 470-487 (2002) - Gérard Cornuéjols, Bertrand Guenin:
Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour. SIAM J. Discret. Math. 15(3): 329-352 (2002) - Jitender S. Deogun, Dieter Kratsch:
Dominating Pair Graphs. SIAM J. Discret. Math. 15(3): 353-366 (2002) - Ding-Zhu Du, Frank K. Hwang, Xiaohua Jia, Hung Q. Ngo:
Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1. SIAM J. Discret. Math. 15(3): 305-316 (2002) - Peter C. Fishburn, Paul E. Wright:
Interference Patterns in Regular Graphs with Bijective Colorings. SIAM J. Discret. Math. 15(3): 382-402 (2002) - Michel X. Goemans, Maurice Queyranne, Andreas S. Schulz, Martin Skutella, Yaoguang Wang:
Single Machine Scheduling with Release Dates. SIAM J. Discret. Math. 15(2): 165-192 (2002) - Refael Hassin, Shlomi Rubinstein:
Robust Matchings. SIAM J. Discret. Math. 15(4): 530-537 (2002) - Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning:
Domination in Graphs Applied to Electric Power Networks. SIAM J. Discret. Math. 15(4): 519-529 (2002) - Iiro S. Honkala, Andrew Klapper:
Multicovering Bounds from Relative Covering Radii. SIAM J. Discret. Math. 15(2): 228-234 (2002) - Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen:
Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs. SIAM J. Discret. Math. 15(4): 488-518 (2002) - Bruce Kitchens:
Multidimensional Convolutional Codes. SIAM J. Discret. Math. 15(3): 367-381 (2002) - Sandi Klavzar, Henry Martyn Mulder:
Partial Cubes and Crossing Graphs. SIAM J. Discret. Math. 15(2): 235-251 (2002) - Dieter Kratsch, Lorna Stewart:
Approximating Bandwidth by Mixing Layouts of Interval Graphs. SIAM J. Discret. Math. 15(4): 435-449 (2002) - David Peleg, Avishai Wool:
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems. SIAM J. Discret. Math. 15(3): 416-433 (2002) - Kalle Ranto:
Infinite Families of 3-Designs from Z4-Goethals Codes with Block Size 8. SIAM J. Discret. Math. 15(3): 289-304 (2002) - Romeo Rizzi:
Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs. SIAM J. Discret. Math. 15(3): 283-288 (2002) - Joe Sawada:
A Fast Algorithm for Generating Nonisomorphic Chord Diagrams. SIAM J. Discret. Math. 15(4): 546-561 (2002) - Alexander Schrijver:
Strong T-Perfection of Bad-K4-Free Graphs. SIAM J. Discret. Math. 15(3): 403-415 (2002) - Andreas S. Schulz, Martin Skutella:
Scheduling Unrelated Machines by Randomized Rounding. SIAM J. Discret. Math. 15(4): 450-469 (2002) - Michael Anthony Steel, László A. Székely:
Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications. SIAM J. Discret. Math. 15(4): 562-575 (2002) - Biing-Feng Wang:
Finding a 2-Core of a Tree in Linear Time. SIAM J. Discret. Math. 15(2): 193-210 (2002) - Wei-Fan Wang, Ko-Wei Lih:
Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles. SIAM J. Discret. Math. 15(4): 538-545 (2002) - 2001
- Noga Alon, Benny Sudakov, Uri Zwick:
Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms. SIAM J. Discret. Math. 15(1): 58-72 (2001) - Tim Blackmore, Graham H. Norton:
Determining When the Absolute State Complexity of a Hermitian Code Achieves Its DLP Bound. SIAM J. Discret. Math. 15(1): 14-40 (2001)
skipping 7 more matches
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-05-08 18:41 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