Остановите войну!
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 43 matches
- 1995
- Laurent Alonso, Edward M. Reingold, René Schott:
Multidimensional Divide-and-Conquer Maximin Recurrences. SIAM J. Discret. Math. 8(3): 428-447 (1995) - Ingo Althöfer, Imre Leader:
Correlation of Boolean Functions and Pathology in Recursion Trees. SIAM J. Discret. Math. 8(4): 526-535 (1995) - Thomas Andreae, Hans-Jürgen Bandelt:
Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities. SIAM J. Discret. Math. 8(1): 1-16 (1995) - Jonathan J. Ashley, Brian H. Marcus:
Canonical Encoders for Sliding Block Decoders. SIAM J. Discret. Math. 8(4): 555-605 (1995) - Hans-Jürgen Bandelt, Michael Anthony Steel:
Symmetric Matrices Representable by Weighted Trees Over a Cancellative Abelian Monoid. SIAM J. Discret. Math. 8(4): 517-525 (1995) - Jørgen Bang-Jensen, András Frank, Bill Jackson:
Preserving and Increasing Local Edge-Connectivity in Mixed Graphs. SIAM J. Discret. Math. 8(2): 155-178 (1995) - Earl R. Barnes:
An Inequality for Probability Moments with Applications. SIAM J. Discret. Math. 8(3): 347-358 (1995) - Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg:
Salvage-Embeddings of Complete Trees. SIAM J. Discret. Math. 8(4): 617-637 (1995) - Hans L. Bodlaender, Ton Kloks, Dieter Kratsch:
Treewidth and Pathwidth of Permutation Graphs. SIAM J. Discret. Math. 8(4): 606-616 (1995) - Jürgen Bokowski, Peter Schuchert:
Altshuler's Sphere m9963 Revisited. SIAM J. Discret. Math. 8(4): 670-677 (1995) - André Bouchet, William H. Cunningham:
Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra. SIAM J. Discret. Math. 8(1): 17-32 (1995) - Leizhen Cai, Derek G. Corneil:
Tree Spanners. SIAM J. Discret. Math. 8(3): 359-387 (1995) - Bradley S. Carlson, C. Y. Roger Chen, Dikran S. Meliksetian:
Dual Eulerian Properties of Plane Multigraphs. SIAM J. Discret. Math. 8(1): 33-50 (1995) - Deborah S. Franzblau:
Combinatorial Algorithm for a Lower Bound on Frame Rigidity. SIAM J. Discret. Math. 8(3): 388-400 (1995) - Kathryn Fraughnaugh, J. Richard Lundgren, Sarah K. Merz, John S. Maybee, Norman J. Pullman:
Competition Graphs of Strongly Connected and Hamiltonian Digraphs. SIAM J. Discret. Math. 8(2): 179-185 (1995) - Jaime Gonzalez, Osvaldo Landaeta:
A Competitive Strong Spanning Tree Algorithm for the Maximum Bipartite Matching Problem. SIAM J. Discret. Math. 8(2): 186-195 (1995) - Ronald I. Greenberg, Jau-Der Shih:
Feasible Offset and Optimal Offset for General Single-Layer Channel Routing. SIAM J. Discret. Math. 8(4): 543-554 (1995) - Heikki O. Hämäläinen, Iiro S. Honkala, Simon Litsyn, Patric R. J. Östergård:
Bounds for Binary Codes That Are Multiple Coverings of the Farthest-Off Points. SIAM J. Discret. Math. 8(2): 196-207 (1995) - Pavol Hell, Xuding Zhu:
The Existence of Homomorphisms to Oriented Cycles. SIAM J. Discret. Math. 8(2): 208-222 (1995) - Michael Hofmeister:
Enumeration of Concrete Regular Covering Projections. SIAM J. Discret. Math. 8(1): 51-61 (1995) - Beverly Jamison, Stephan Olariu:
P-Components and the Homogeneous Decomposition of Graphs. SIAM J. Discret. Math. 8(3): 448-463 (1995) - Dusan B. Jevtic:
On Families of Sets of Integral Vectors Whose Representatives form Sum-Distinct Sets. SIAM J. Discret. Math. 8(4): 652-660 (1995) - Xing-De Jia:
Extremal Cayley Digraphs of Finite Cyclic Groups. SIAM J. Discret. Math. 8(1): 62-75 (1995) - Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan:
Fractional Covers and Communication Complexity. SIAM J. Discret. Math. 8(1): 76-92 (1995) - Henry A. Kierstead, Stephen G. Penrice, William T. Trotter:
On-Line and First-Fit Coloring of Graphs That Do Not Induce P5. SIAM J. Discret. Math. 8(4): 485-498 (1995) - Maria M. Klawe, Brendan Mumey:
Upper and Lower Bounds on Constructing Alphabetic Binary Trees. SIAM J. Discret. Math. 8(4): 638-651 (1995) - Donald E. Knuth:
Two-Way Rounding. SIAM J. Discret. Math. 8(2): 281-290 (1995) - Guy Kortsarz, David Peleg:
Approximation Algorithms for Minimum-Time Broadcast. SIAM J. Discret. Math. 8(3): 401-427 (1995) - Ramesh Krishnamurti, Bhagirath Narahari:
An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems. SIAM J. Discret. Math. 8(4): 661-669 (1995) - Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin:
On Lotteries with Unique Winners. SIAM J. Discret. Math. 8(1): 93-98 (1995)
skipping 13 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-24 06:01 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