![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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
- 2010
- David J. Abraham, Telikepalli Kavitha:
Voting Paths. SIAM J. Discret. Math. 24(2): 520-537 (2010) - Anna Adamaszek
, Michal Adamaszek
:
Large-Girth Roots of Graphs. SIAM J. Discret. Math. 24(4): 1501-1514 (2010) - Max A. Alekseyev
:
On the Number of Two-Dimensional Threshold Functions. SIAM J. Discret. Math. 24(4): 1617-1631 (2010) - Noga Alon, Ohad N. Feldheim
:
The Brunn--Minkowski Inequality and Nontrivial Cycles in the Discrete Torus. SIAM J. Discret. Math. 24(3): 892-894 (2010) - Brian D. O. Anderson, Iman Shames
, Guoqiang Mao
, Baris Fidan:
Formal Theory of Noisy Sensor Network Localization. SIAM J. Discret. Math. 24(2): 684-698 (2010) - N. R. Aravind, C. R. Subramanian:
Bounds on Edge Colorings with Restrictions on the Union of Color Classes. SIAM J. Discret. Math. 24(3): 841-852 (2010) - József Balogh, Wojciech Samotij:
Almost All C4-Free Graphs Have Fewer than (1-epsilon), ex(n, C4) Edges. SIAM J. Discret. Math. 24(3): 1011-1018 (2010) - Hans-Jürgen Bandelt, Victor Chepoi, David Eppstein:
Combinatorics and Geometry of Finite and Infinite Squaregraphs. SIAM J. Discret. Math. 24(4): 1399-1440 (2010) - Reuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz:
Approximation of Partial Capacitated Vertex Cover. SIAM J. Discret. Math. 24(4): 1441-1469 (2010) - Reuven Bar-Yehuda, Danny Hermelin
, Dror Rawitz:
An Extension of the Nemhauser--Trotter Theorem to Generalized Vertex Cover with Applications. SIAM J. Discret. Math. 24(1): 287-300 (2010) - Amitabh Basu
, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Minimal Inequalities for an Infinite Relaxation of Integer Programs. SIAM J. Discret. Math. 24(1): 158-168 (2010) - Walid Ben-Ameur, Makhlouf Hadji:
Designing Steiner Networks with Unicyclic Connected Components: An Easy Problem. SIAM J. Discret. Math. 24(4): 1541-1557 (2010) - Jean-Claude Bermond, Charles J. Colbourn, Lucia Gionfriddo, Gaetano Quattrocchi, Ignasi Sau
:
Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4. SIAM J. Discret. Math. 24(2): 400-419 (2010) - Andrew Beveridge:
Connectivity of Random Cubic Sum Graphs. SIAM J. Discret. Math. 24(3): 895-909 (2010) - Mindaugas Bloznelis:
Component Evolution in General Random Intersection Graphs. SIAM J. Discret. Math. 24(2): 639-654 (2010) - Tom Bohman
, Andrzej Dudek, Alan M. Frieze
, Oleg Pikhurko:
Flips in Graphs. SIAM J. Discret. Math. 24(3): 1046-1055 (2010) - Andriy V. Bondarenko
, Maryna S. Viazovska:
Spherical Designs via Brouwer Fixed Point Theorem. SIAM J. Discret. Math. 24(1): 207-217 (2010) - Joseph E. Bonin
:
A Construction of Infinite Sets of Intertwines for Pairs of Matroids. SIAM J. Discret. Math. 24(4): 1742-1752 (2010) - Peter Borg
:
Cross-Intersecting Families of Partial Permutations. SIAM J. Discret. Math. 24(2): 600-608 (2010) - Julia Böttcher
, Peter Heinig, Anusch Taraz:
Embedding into Bipartite Graphs. SIAM J. Discret. Math. 24(4): 1215-1233 (2010) - Petter Brändén:
Discrete Concavity and the Half-Plane Property. SIAM J. Discret. Math. 24(3): 921-933 (2010) - Andreas Brandstädt, Vadim V. Lozin
, Raffaele Mosca:
Independent Sets of Maximum Weight in Apple-Free Graphs. SIAM J. Discret. Math. 24(1): 239-254 (2010) - Stephan Brandt, Jozef Miskuf, Dieter Rautenbach, Friedrich Regen, Imre Z. Ruzsa:
Edge-Injective and Edge-Surjective Vertex Labellings. SIAM J. Discret. Math. 24(2): 666-683 (2010) - Bostjan Bresar, Sandi Klavzar
, Douglas F. Rall
:
Domination Game and an Imagination Strategy. SIAM J. Discret. Math. 24(3): 979-991 (2010) - Graham R. Brightwell, Gérard D. Cohen, Emanuela Fachini, Marianne Fairthorne, János Körner, Gábor Simonyi, Ágnes Tóth:
Permutation Capacities of Families of Oriented Infinite Paths. SIAM J. Discret. Math. 24(2): 441-456 (2010) - Henning Bruhn, Maya Stein
:
t-Perfection Is Always Strong for Claw-Free Graphs. SIAM J. Discret. Math. 24(3): 770-781 (2010) - Sergio Cabello
, Günter Rote:
Obnoxious Centers in Graphs. SIAM J. Discret. Math. 24(4): 1713-1730 (2010) - Leizhen Cai, Yongxi Cheng, Elad Verbin, Yuan Zhou:
Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem. SIAM J. Discret. Math. 24(4): 1322-1335 (2010) - Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani:
Rationality and Strongly Polynomial Solvability of Eisenberg--Gale Markets with Two Agents. SIAM J. Discret. Math. 24(3): 1117-1136 (2010) - Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani:
Design is as Easy as Optimization. SIAM J. Discret. Math. 24(1): 270-286 (2010)
skipping 83 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-23 17:35 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