Остановите войну!
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 132 matches
- 2017
- Lele Wang, Ofer Shayevitz:
Graph Information Ratio. SIAM J. Discret. Math. 31(4): 2703-2734 (2017) - Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, Nick Wormald:
On the Push&Pull Protocol for Rumor Spreading. SIAM J. Discret. Math. 31(2): 647-668 (2017) - Ron Aharoni, Dani Kotlar, Ran Ziv:
Representation of Large Matchings in Bipartite Graphs. SIAM J. Discret. Math. 31(3): 1726-1731 (2017) - Noga Alon, Guy Rutenberg:
Broadcast Transmission to Prioritizing Receivers. SIAM J. Discret. Math. 31(4): 2517-2529 (2017) - Julio Aracena, Adrien Richard, Lilian Salinas:
Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks. SIAM J. Discret. Math. 31(3): 1702-1725 (2017) - N. R. Aravind, R. B. Sandeep, Naveen Sivadasan:
Dichotomy Results on the Hardness of H-free Edge Modification Problems. SIAM J. Discret. Math. 31(1): 542-561 (2017) - Kassie Archer, Scott M. LaLonde:
Allowed Patterns of Symmetric Tent Maps via Commuter Functions. SIAM J. Discret. Math. 31(1): 317-334 (2017) - Federico Ardila, Hanner Bastidas, Cesar Ceballos, John Guo:
The Configuration Space of a Robotic Arm in a Tunnel. SIAM J. Discret. Math. 31(4): 2675-2702 (2017) - József Balogh, Hong Liu, Maryam Sharifzadeh:
On Two Problems in Ramsey-Turán Theory. SIAM J. Discret. Math. 31(3): 1848-1866 (2017) - Monika Balvociute, David Bryant, Andreas Spillner:
When Can Splits be Drawn in the Plane? SIAM J. Discret. Math. 31(2): 839-856 (2017) - Amotz Bar-Noy, Dror Rawitz, Peter Terlecky:
Maximizing Barrier Coverage Lifetime with Mobile Sensors. SIAM J. Discret. Math. 31(1): 573-596 (2017) - Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht, Jakob Schnitzer, Fabian Schulenburg:
Loose Hamiltonian Cycles Forced by Large (k-2)-Degree - Approximate Version. SIAM J. Discret. Math. 31(4): 2328-2347 (2017) - Wouter Cames van Batenburg, Louis Esperet, Tobias Müller:
Coloring Jordan Regions and Curves. SIAM J. Discret. Math. 31(3): 1670-1684 (2017) - Jean-Claude Belfiore, Cem Güneri, Buket Özkaya:
Quasi-Cyclic Subcodes of Cyclic Codes. SIAM J. Discret. Math. 31(2): 1454-1475 (2017) - Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan:
Metric Dimension of Bounded Tree-length Graphs. SIAM J. Discret. Math. 31(2): 1217-1243 (2017) - Attila Bernáth, Roland Grappe, Zoltán Szigeti:
Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph. SIAM J. Discret. Math. 31(1): 335-382 (2017) - Daniel Irving Bernstein, Colby Long:
L-Infinity Optimization to Linear Spaces and Phylogenetic Trees. SIAM J. Discret. Math. 31(2): 875-889 (2017) - Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz:
Bi-Covering: Covering Edges with Two Small Subsets of Vertices. SIAM J. Discret. Math. 31(4): 2626-2646 (2017) - Arijit Bishnu, Sameer Desai, Arijit Ghosh, Mayank Goswami, Subhabrata Paul:
Uniformity of Point Samples in Metric Spaces Using Gap Ratio. SIAM J. Discret. Math. 31(3): 2138-2171 (2017) - Andreas Björklund, Vikram Kamat, Lukasz Kowalik, Meirav Zehavi:
Spotting Trees with Few Leaves. SIAM J. Discret. Math. 31(2): 687-713 (2017) - Francis Black, Elizabeth Drellich, Julianna Tymoczko:
Valid Plane Trees: Combinatorial Models for RNA Secondary Structures with Watson-Crick Base Pairs. SIAM J. Discret. Math. 31(4): 2586-2602 (2017) - Davide Bolognini, Antonio Macchia, Emanuele Ventura, Volkmar Welker:
The Poset of Proper Divisibility. SIAM J. Discret. Math. 31(3): 2093-2109 (2017) - J. Adrian Bondy, Zbigniew Lonc, Pawel Rzazewski:
Erratum: Constructing Optimal k-Radius Sequences. SIAM J. Discret. Math. 31(1): 645-646 (2017) - Sylvia C. Boyd, Philippe Legault:
Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph. SIAM J. Discret. Math. 31(1): 632-644 (2017) - Silouanos Brazitikos, Thodoris Karageorgos:
An Algorithmic Regularity Lemma for Lp Regular Sparse Matrices. SIAM J. Discret. Math. 31(4): 2301-2313 (2017) - Raimundo Briceño, Ronnie Pavlov:
Strong Spatial Mixing in Homomorphism Spaces. SIAM J. Discret. Math. 31(3): 2110-2137 (2017) - Henning Bruhn, Elke Fuchs:
t-Perfection in P5-Free Graphs. SIAM J. Discret. Math. 31(3): 1616-1633 (2017) - Darryn E. Bryant, Charles J. Colbourn, Daniel Horsley, Ian M. Wanless:
Steiner Triple Systems with High Chromatic Index. SIAM J. Discret. Math. 31(4): 2603-2611 (2017) - David E. Burstein, Jonathan Rubin:
Sufficient Conditions for Graphicality of Bidegree Sequences. SIAM J. Discret. Math. 31(1): 50-62 (2017) - Eimear Byrne, Marco Calderini:
Bounding the Optimal Rate of the ICSI and ICCSI problem. SIAM J. Discret. Math. 31(2): 1403-1427 (2017)
skipping 102 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-07 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