Остановите войну!
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 66 matches
- 2005
- Lowell Abrams, Donniell E. Fishkind:
A Genus Bound for Digital Image Boundaries. SIAM J. Discret. Math. 19(3): 807-813 (2005) - Susanne Albers, Helge Bals:
Dynamic TCP Acknowledgment: Penalizing Long Delays. SIAM J. Discret. Math. 19(4): 938-951 (2005) - Stephen Alstrup, Philip Bille, Theis Rauhe:
Labeling Schemes for Small Distances in Trees. SIAM J. Discret. Math. 19(2): 448-462 (2005) - Roel Apfelbaum, Micha Sharir:
Repeated Angles in Three and Four Dimensions. SIAM J. Discret. Math. 19(2): 294-300 (2005) - Reuven Bar-Yehuda, Dror Rawitz:
On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique. SIAM J. Discret. Math. 19(3): 762-797 (2005) - Yael Ben-Haim, Simon Litsyn:
Exact Minimum Density of Codes Identifying Vertices in the Square Grid. SIAM J. Discret. Math. 19(1): 69-82 (2005) - Jean-Claude Bermond, Charles J. Colbourn, David Coudert, Gennian Ge, Alan C. H. Ling, Xavier Muñoz:
Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6. SIAM J. Discret. Math. 19(2): 523-542 (2005) - Mohamed Didi Biha:
On the 3-Terminal Cut Polyhedron. SIAM J. Discret. Math. 19(3): 575-587 (2005) - Béla Bollobás, Don Coppersmith, Michael Elkin:
Sparse Distance Preservers and Additive Spanners. SIAM J. Discret. Math. 19(4): 1029-1055 (2005) - Iliya Bouyukliev, Patric R. J. Östergård:
Classification of Self-Orthogonal Codes over F3 and F4. SIAM J. Discret. Math. 19(2): 363-370 (2005) - Peter Braß:
An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem. SIAM J. Discret. Math. 19(1): 192-195 (2005) - Jason I. Brown, Richard J. Nowakowski:
Well-Covered Vector Spaces of Graphs. SIAM J. Discret. Math. 19(4): 952-965 (2005) - Dennis J. Brueni, Lenwood S. Heath:
The PMU Placement Problem. SIAM J. Discret. Math. 19(3): 744-761 (2005) - Alexander Burstein, Sergey Kitaev:
On Unavoidable Sets of Word Patterns. SIAM J. Discret. Math. 19(2): 371-381 (2005) - Panu Chaichanavong, Brian H. Marcus:
Stabilization of Block-Type-Decodability Properties for Constrained Systems. SIAM J. Discret. Math. 19(2): 321-344 (2005) - Marc Chardon, Aziz Moukrim:
The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders. SIAM J. Discret. Math. 19(1): 109-121 (2005) - Robert W. Chen, Alan Zame, Chien-Tai Lin, Hsiu-fen Wu:
A Random Version of Shepp's Urn Scheme. SIAM J. Discret. Math. 19(1): 149-164 (2005) - Don Coppersmith, Moshe Lewenstein:
Constructive Bounds on Ordered Factorizations. SIAM J. Discret. Math. 19(2): 301-303 (2005) - Sean Curran, Orlando Lee, Xingxing Yu:
Nonseparating Planar Chains in 4-Connected Graphs. SIAM J. Discret. Math. 19(2): 399-419 (2005) - Sean Curran, Orlando Lee, Xingxing Yu:
Chain Decompositions of 4-Connected Graphs. SIAM J. Discret. Math. 19(4): 848-880 (2005) - Philip Daniel, Charles Semple:
A Class of General Supertree Methods for Nested Taxa. SIAM J. Discret. Math. 19(2): 463-480 (2005) - Michael Drmota, Hsien-Kuei Hwang:
Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees. SIAM J. Discret. Math. 19(1): 19-45 (2005) - Ioana Dumitriu, Joel H. Spencer:
The Two-Batch Liar Game over an Arbitrary Channel. SIAM J. Discret. Math. 19(4): 1056-1064 (2005) - Tomás Dvorák:
Hamiltonian Cycles with Prescribed Edges in Hypercubes. SIAM J. Discret. Math. 19(1): 135-144 (2005) - Michael Elkin, Guy Kortsarz:
Polylogarithmic Additive Inapproximability of the Radio Broadcast Problem. SIAM J. Discret. Math. 19(4): 881-899 (2005) - Sylvia B. Encheva:
On Projective Codes Satisfying the Chain Condition. SIAM J. Discret. Math. 19(1): 145-148 (2005) - Péter L. Erdös, Zoltán Füredi, Gyula O. H. Katona:
Two-Part and k-Sperner Families: New Proofs Using Permutations. SIAM J. Discret. Math. 19(2): 489-500 (2005) - Tomás Feder, Carlos S. Subi:
Disks on a Tree: Analysis of a Combinatorial Game. SIAM J. Discret. Math. 19(3): 543-552 (2005) - Rongquan Feng, Jin Ho Kwak, Young Soo Kwon:
Enumerating Typical Circulant Covering Projections Onto a Circulant Graph. SIAM J. Discret. Math. 19(1): 196-207 (2005) - Jirí Fiala, Daniel Král, Riste Skrekovski:
A Brooks-Type Theorem for the Generalized List T-Coloring. SIAM J. Discret. Math. 19(3): 588-609 (2005)
skipping 36 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-29 11:20 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