Остановите войну!
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 34 matches
- 1993
- Noga Alon, Yair Caro, Ilia Krasikov:
Bisection of trees and sequences. Discret. Math. 114(1-3): 3-7 (1993) - Denise Amar:
Irregularity strength of regular graphs of large degree. Discret. Math. 114(1-3): 9-17 (1993) - Krystyna T. Balinska, Louis V. Quintas:
The sequential generation of random f-graphs. distributions and predominant types of edge maximal f-graphs with f>;4. Discret. Math. 114(1-3): 19-22 (1993) - Alexander Belfer, Martin Charles Golumbic:
Counting endpoint sequences for interval orders and interval graphs. Discret. Math. 114(1-3): 23-39 (1993) - S. Bellantoni, Irith Ben-Arroyo Hartman, Teresa M. Przytycka, Sue Whitesides:
Grid intersection graphs and boxicity. Discret. Math. 114(1-3): 41-49 (1993) - Jean-Claude Bermond, Nathalie Homobono, Claudine Peyrat:
Connectivity of kautz networks. Discret. Math. 114(1-3): 51-62 (1993) - J. Bond, Charles Delorme:
A note on partial Cayley graphs. Discret. Math. 114(1-3): 63-74 (1993) - André Bouchet:
Recognizing locally equivalent graphs. Discret. Math. 114(1-3): 75-86 (1993) - Mark Chaimovich:
Fast exact and approximate algorithms for k-partition and scheduling independent tasks. Discret. Math. 114(1-3): 87-103 (1993) - Gérard D. Cohen, Gilles Zémor:
Write-isolated memories (WIMs). Discret. Math. 114(1-3): 105-113 (1993) - Charles J. Colbourn, Ehab S. Elmallah:
Reliable assignments of processors to tasks and factoring on matroids. Discret. Math. 114(1-3): 115-129 (1993) - Italo J. Dejter, Walter Cedeño, V. Jauregui:
A note on frucht diagrams, boolean graphs and hamilton cycles. Discret. Math. 114(1-3): 131-135 (1993) - Charles Delorme:
Eigenvalues of finite graphs. Discret. Math. 114(1-3): 137-146 (1993) - Pilar Esqué, Francesc Aguiló, Miguel Angel Fiol:
Double commutative-step digraphs with minimum diameters. Discret. Math. 114(1-3): 147-157 (1993) - Philippe Flajolet, Michèle Soria:
General combinatorial schemas: Gaussian limit distributions and exponential tails. Discret. Math. 114(1-3): 159-180 (1993) - Jean-Luc Fouquet, Henri Thuillier:
Decomposition of 3-connected cubic graphs. Discret. Math. 114(1-3): 181-198 (1993) - Frantisek Franek, Vojtech Rödl:
2-Colorings of complete graphs with a small number of monochromatic K4 subgraphs. Discret. Math. 114(1-3): 199-203 (1993) - Gregory Freiman:
New analytical results in subset-sum problem. Discret. Math. 114(1-3): 205-217 (1993) - J. Gómez, Miguel Angel Fiol, Oriol Serra:
On large (Delta, D)-graphs. Discret. Math. 114(1-3): 219-235 (1993) - Tayuan Huang, Monique Laurent:
(s, r; mu)-nets and alternating forms graphs. Discret. Math. 114(1-3): 237-252 (1993) - François Jaeger:
Plane graphs and link invariants. Discret. Math. 114(1-3): 253-264 (1993) - Leif K. Jørgensen:
Nonexistence of certain cubic graphs with small diameters. Discret. Math. 114(1-3): 265-273 (1993) - Mauricio Karchmer, Nathan Linial, Ilan Newman, Michael E. Saks, Avi Wigderson:
Combinatorial characterization of read-once formulae. Discret. Math. 114(1-3): 275-282 (1993) - Carole S. Klein, Steven Minsker:
The super towers of Hanoi problem: large rings on small rings. Discret. Math. 114(1-3): 283-295 (1993) - Natalia Kogan, Abraham Berman:
Characterization of completely positive graphs. Discret. Math. 114(1-3): 297-304 (1993) - Ephraim Korach, Zvi Ostfeld:
Recognition of DFS trees: sequential and parallel algorithms with refined verifications. Discret. Math. 114(1-3): 305-327 (1993) - Rafi Levy, Eli Shamir:
A note on a counting problem arising in percolation theory. Discret. Math. 114(1-3): 361-365 (1993) - E. Lipkin:
On subset sums of r-sets. Discret. Math. 114(1-3): 367-377 (1993) - Maurice Nivat, Andreas Podelski:
Another variation on the common subexpression problem. Discret. Math. 114(1-3): 379-401 (1993) - Uri N. Peled, Murali K. Srinivasan:
Poset matching - a distributive analog of independent matching. Discret. Math. 114(1-3): 403-424 (1993)
skipping 4 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-05 01:14 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