Остановите войну!
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 113 matches
- 2012
- Pierre Aboulker, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic:
Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It. SIAM J. Discret. Math. 26(4): 1510-1531 (2012) - Eyal Ackerman, Radoslav Fulek, Csaba D. Tóth:
Graphs That Admit Polyline Drawings with Few Crossing Angles. SIAM J. Discret. Math. 26(1): 305-320 (2012) - Boris Alexeev, Alexandra Ovetsky Fradkin, Ilhee Kim:
Forbidden Induced Subgraphs of Double-split Graphs. SIAM J. Discret. Math. 26(1): 1-14 (2012) - Omid Amini, Fedor V. Fomin, Saket Saurabh:
Counting Subgraphs via Homomorphisms. SIAM J. Discret. Math. 26(2): 695-717 (2012) - Gennadiy Averkov:
On the Size of Lattice Simplices with a Single Interior Lattice Point. SIAM J. Discret. Math. 26(2): 515-526 (2012) - Deepak Bal, Alan M. Frieze:
Packing Tight Hamilton Cycles in Uniform Hypergraphs. SIAM J. Discret. Math. 26(2): 435-451 (2012) - József Balogh, Tom Bohman, Béla Bollobás, Yi Zhao:
Turán Densities of Some Hypergraphs Related to Kk+1k. SIAM J. Discret. Math. 26(4): 1609-1617 (2012) - János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós:
Large Bd-Free and Union-free Subfamilies. SIAM J. Discret. Math. 26(1): 71-76 (2012) - Rommel M. Barbosa, Erika M. M. Coelho, Mitre Costa Dourado, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
On the Carathéodory Number for the Convexity of Paths of Order Three. SIAM J. Discret. Math. 26(3): 929-939 (2012) - Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Nonconvex Representations of Plane Graphs. SIAM J. Discret. Math. 26(4): 1670-1681 (2012) - Michael Belfrage, Torsten Mütze, Reto Spöhel:
Probabilistic One-Player Ramsey Games via Deterministic Two-Player Games. SIAM J. Discret. Math. 26(3): 1031-1049 (2012) - Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff:
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners. SIAM J. Discret. Math. 26(2): 618-646 (2012) - Víctor Blanco, Justo Puerto:
An Application of Integer Programming to the Decomposition of Numerical Semigroups. SIAM J. Discret. Math. 26(3): 1210-1237 (2012) - Manuel Bodirsky, Hubie Chen, Tomás Feder:
On the Complexity of MMSNP. SIAM J. Discret. Math. 26(1): 404-414 (2012) - Tristram Bogart, Eric Katz:
Obstructions to Lifting Tropical Curves in Surfaces in 3-Space. SIAM J. Discret. Math. 26(3): 1050-1067 (2012) - Andreas Brieden, Peter Gritzmann:
On Optimal Weighted Balanced Clusterings: Gravity Bodies and Power Diagrams. SIAM J. Discret. Math. 26(2): 415-434 (2012) - Darryn E. Bryant, Nicholas J. Cavenagh, Barbara M. Maenhaut, Kyle Pula, Ian M. Wanless:
Nonextendible Latin Cuboids. SIAM J. Discret. Math. 26(1): 239-249 (2012) - Boris Bukh:
Multidimensional Kruskal-Katona Theorem. SIAM J. Discret. Math. 26(2): 548-554 (2012) - Laurent Bulteau, Guillaume Fertin, Irena Rusu:
Sorting by Transpositions Is Difficult. SIAM J. Discret. Math. 26(3): 1148-1180 (2012) - Pierre Charbit, Fabien de Montgolfier, Mathieu Raffinot:
Linear Time Split Decomposition Revisited. SIAM J. Discret. Math. 26(2): 499-514 (2012) - Xujin Chen, Zhibin Chen, Wenan Zang:
Total Dual Integrality in Some Facility Location Problems. SIAM J. Discret. Math. 26(3): 1022-1030 (2012) - Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang:
The Maximum-Weight Stable Matching Problem: Duality and Efficiency. SIAM J. Discret. Math. 26(3): 1346-1360 (2012) - Yong-Gao Chen, Quan-Hui Yang:
On a Problem of Nathanson Related to Minimal Additive Complements. SIAM J. Discret. Math. 26(4): 1532-1536 (2012) - Maria Chudnovsky, Paul D. Seymour:
Growing Without Cloning. SIAM J. Discret. Math. 26(2): 860-880 (2012) - Amin Coja-Oghlan, Angélica Y. Pachón-Pinzon:
The Decimation Process in Random k-SAT. SIAM J. Discret. Math. 26(4): 1471-1509 (2012) - Harold S. Connamacher, Michael Molloy:
The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem. SIAM J. Discret. Math. 26(2): 768-800 (2012) - David Cook II, Uwe Nagel:
Cohen-Macaulay Graphs and Face Vectors of Flag Complexes. SIAM J. Discret. Math. 26(1): 89-101 (2012) - Don Coppersmith, Victor S. Miller:
Binary Nontiles. SIAM J. Discret. Math. 26(1): 30-38 (2012) - Charles A. Cusack, Timothy Lewis, Daniel Simpson, Samuel Taggart:
The Complexity of Pebbling in Diameter Two Graphs. SIAM J. Discret. Math. 26(3): 919-928 (2012) - Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira:
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma. SIAM J. Discret. Math. 26(1): 15-29 (2012)
skipping 83 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-25 02:06 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