Остановите войну!
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 78 matches
- 2008
- Peter Dankelmann, Simon Mukwembi, Henda C. Swart:
Average Distance and Edge-Connectivity II. SIAM J. Discret. Math. 21(4): 1035-1052 (2008) - Moshe Dror, James B. Orlin:
Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets. SIAM J. Discret. Math. 21(4): 1019-1034 (2008) - Yoshimi Egawa, Katsumi Inoue, Ken-ichi Kawarabayashi:
Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs. SIAM J. Discret. Math. 21(4): 1061-1070 (2008) - Benjamin Lévêque, Frédéric Maffray:
Coloring Bull-Free Perfectly Contractile Graphs. SIAM J. Discret. Math. 21(4): 999-1018 (2008) - Linyuan Lu:
Explicit Construction of Small Folkman Graphs. SIAM J. Discret. Math. 21(4): 1053-1060 (2008) - Liqun Pu, Hao Shen, Jun Ma, San Ling:
Cycle Systems in the Complete Bipartite Graph Plus a One-Factor. SIAM J. Discret. Math. 21(4): 1083-1092 (2008) - Robert H. Sloan, Balázs Szörényi, György Turán:
On k-Term DNF with the Largest Number of Prime Implicants. SIAM J. Discret. Math. 21(4): 987-998 (2008) - K. S. Sudeep, Sundar Vishwanathan:
Matched-Factor $d$-Domatic Coloring of Graphs. SIAM J. Discret. Math. 21(4): 1071-1082 (2008) - 2007
- T. L. Alderson, Keith E. Mellinger:
Constructions of Optical Orthogonal Codes from Finite Geometry. SIAM J. Discret. Math. 21(3): 785-793 (2007) - Noga Alon, Anja Krech, Tibor Szabó:
Tur[a-acute]n's Theorem in the Hypercube. SIAM J. Discret. Math. 21(1): 66-72 (2007) - Noga Alon, Eyal Lubetzky:
Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon. SIAM J. Discret. Math. 21(2): 329-348 (2007) - Roel Apfelbaum, Micha Sharir:
Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes. SIAM J. Discret. Math. 21(3): 707-725 (2007) - Christian Avart, Vojtech Rödl, Mathias Schacht:
Every Monotone 3-Graph Property is Testable. SIAM J. Discret. Math. 21(1): 73-92 (2007) - Maria Axenovich, József Balogh:
Graphs Having Small Number of Sizes on Induced k-Subgraphs. SIAM J. Discret. Math. 21(1): 264-272 (2007) - Robert Babilon, Vít Jelínek, Daniel Král, Pavel Valtr:
Labelings of Graphs with Fixed and Variable Edge-Weights. SIAM J. Discret. Math. 21(3): 688-706 (2007) - Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman:
Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks. SIAM J. Discret. Math. 21(1): 141-157 (2007) - Camino Balbuena, Pedro García-Vázquez:
On the Minimum Order of Extremal Graphs to have a Prescribed Girth. SIAM J. Discret. Math. 21(1): 251-257 (2007) - Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp:
Adjacent Vertex Distinguishing Edge-Colorings. SIAM J. Discret. Math. 21(1): 237-250 (2007) - Imre Bárány, Jirí Matousek:
Quadratically Many Colorful Simplices. SIAM J. Discret. Math. 21(1): 191-198 (2007) - Sasmita Barik, Sukanta Pati, B. K. Sarma:
The Spectrum of the Corona of Two Graphs. SIAM J. Discret. Math. 21(1): 47-56 (2007) - Kenneth A. Berman:
Locating Servers for Reliability and Affine Embeddings. SIAM J. Discret. Math. 21(3): 637-646 (2007) - Jean-Claude Bermond, Afonso Ferreira, Stéphane Pérennes, Joseph G. Peters:
Neighborhood Broadcasting in Hypercubes. SIAM J. Discret. Math. 21(4): 823-843 (2007) - Anne Berry, Martin Charles Golumbic, Marina Lipshteyn:
Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs. SIAM J. Discret. Math. 21(3): 573-591 (2007) - Bostjan Bresar, Sandi Klavzar:
Crossing Graphs as Joins of Graphs and Cartesian Products of Median Graphs. SIAM J. Discret. Math. 21(1): 26-32 (2007) - José Cáceres, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas, Carlos Seara, David R. Wood:
On the Metric Dimension of Cartesian Products of Graphs. SIAM J. Discret. Math. 21(2): 423-441 (2007) - Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan:
The Complexity of the List Partition Problem for Graphs. SIAM J. Discret. Math. 21(4): 900-929 (2007) - Yeow Meng Chee, Alan C. H. Ling:
On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges. SIAM J. Discret. Math. 21(3): 805-821 (2007) - Qi Cheng:
Constructing Finite Field Extensions with Large Order Elements. SIAM J. Discret. Math. 21(3): 726-730 (2007) - Joseph Cheriyan, Adrian Vetta:
Approximation Algorithms for Network Design with Metric Costs. SIAM J. Discret. Math. 21(3): 612-636 (2007) - Miroslav Chlebík, Janka Chlebíková:
The Complexity of Combinatorial Optimization Problems on d-Dimensional Boxes. SIAM J. Discret. Math. 21(1): 158-169 (2007)
skipping 48 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-31 03:13 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