Остановите войну!
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 33 matches
- 2004
- Vladimir E. Alekseev, Alastair Farrugia, Vadim V. Lozin:
New Results on Generalized Graph Coloring. Discret. Math. Theor. Comput. Sci. 6(2): 215-222 (2004) - Eric Babson, Victor Reiner:
Coxeter-like complexes. Discret. Math. Theor. Comput. Sci. 6(2): 223-252 (2004) - Narjes Berregeb, Riadh Robbana, Ashish Tiwari:
Towards automated proofs of observational properties. Discret. Math. Theor. Comput. Sci. 6(2): 143-162 (2004) - Karell Bertet, Mirabelle Nebut:
Efficient Algorithms on the Family Associated to an Implicational System. Discret. Math. Theor. Comput. Sci. 6(2): 315-338 (2004) - Nathalie Caspard, Bernard Monjardet:
Some lattices of closure systems on a finite set. Discret. Math. Theor. Comput. Sci. 6(2): 163-190 (2004) - Frédéric Chazal, Véronique Maume-Deschamps:
Statistical properties of general Markov dynamical sources: applications to information theory. Discret. Math. Theor. Comput. Sci. 6(2): 283-314 (2004) - Hon-Chan Chen:
Optimal Sequential and Parallel Algorithms for Cut Vertices and Bridges on Trapezoid Graphs. Discret. Math. Theor. Comput. Sci. 6(2): 483-496 (2004) - Michael Drmota, Bernhard Gittenberger:
The Width of Galton-Watson Trees Conditioned by the Size. Discret. Math. Theor. Comput. Sci. 6(2): 387-400 (2004) - Vida Dujmovic, Attila Pór, David R. Wood:
Track Layouts of Graphs. Discret. Math. Theor. Comput. Sci. 6(2): 497-522 (2004) - Vida Dujmovic, David R. Wood:
On Linear Layouts of Graphs. Discret. Math. Theor. Comput. Sci. 6(2): 339-358 (2004) - Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto:
On Locating-Dominating Codes in Binary Hamming Spaces. Discret. Math. Theor. Comput. Sci. 6(2): 265-282 (2004) - P. Mark Kayll:
Well-spread sequences and edge-labellings with constant Hamilton-weight. Discret. Math. Theor. Comput. Sci. 6(2): 401-408 (2004) - Po-Shen Loh, Leonard J. Schulman:
Improved Expansion of Random Cayley Graphs. Discret. Math. Theor. Comput. Sci. 6(2): 523-528 (2004) - Toufik Mansour:
On an open problem of Green and Losonczy: exact enumeration of freely braided permutations. Discret. Math. Theor. Comput. Sci. 6(2): 461-470 (2004) - Alois Panholzer, Helmut Prodinger:
Analysis of some statistics for increasing tree families. Discret. Math. Theor. Comput. Sci. 6(2): 437-460 (2004) - Rajendra M. Pawale:
A Note on t-designs with t Intersection Numbers. Discret. Math. Theor. Comput. Sci. 6(2): 359-364 (2004) - Josef Pieprzyk, Xian-Mo Zhang:
On Cheating Immune Secret Sharing. Discret. Math. Theor. Comput. Sci. 6(2): 253-264 (2004) - Josef Pieprzyk, Xian-Mo Zhang:
Characterisations of Ideal Threshold Schemes. Discret. Math. Theor. Comput. Sci. 6(2): 471-482 (2004) - Vincent Puyhaubert:
Generating functions and the satisfiability threshold. Discret. Math. Theor. Comput. Sci. 6(2): 425-436 (2004) - Mireille Régnier, Alain Denise:
Rare Events and Conditional Events on Random Strings. Discret. Math. Theor. Comput. Sci. 6(2): 191-214 (2004) - Carsten Schneider:
The Summation Package Sigma: Underlying Principles and a Rhombus Tiling Application. Discret. Math. Theor. Comput. Sci. 6(2): 365-386 (2004) - Wolfgang Steiner:
The distribution of m-ary search trees generated by van der Corput sequences. Discret. Math. Theor. Comput. Sci. 6(2): 409-424 (2004) - 2003
- Alexander Burstein, Toufik Mansour:
Counting occurrences of some subword patterns. Discret. Math. Theor. Comput. Sci. 6(1): 1-12 (2003) - Cédric Chauve:
A Bijection Between Planar Constellations and Some Colored Lagrangian Trees. Discret. Math. Theor. Comput. Sci. 6(1): 13-40 (2003) - Wei-Mei Chen, Hsien-Kuei Hwang, Tsung-Hsi Tsai:
Efficient maxima-finding algorithms for random planar samples. Discret. Math. Theor. Comput. Sci. 6(1): 107-122 (2003) - Johann Cigler:
Some Algebraic Aspects of Morse Code Sequences. Discret. Math. Theor. Comput. Sci. 6(1): 55-68 (2003) - Selma Djelloul, Mekkia Kouider:
Minimum survivable graphs with bounded distance increase. Discret. Math. Theor. Comput. Sci. 6(1): 123-132 (2003) - Klaus Dohmen, André Poenitz, Peter Tittmann:
A new two-variable generalization of the chromatic polynomial. Discret. Math. Theor. Comput. Sci. 6(1): 69-90 (2003) - Brice Effantin, Hamamache Kheddouci:
The b-chromatic number of power graphs. Discret. Math. Theor. Comput. Sci. 6(1): 45-54 (2003) - Vince Grolmusz:
A Note on Set Systems with no Union of Cardinality 0 Modulo m. Discret. Math. Theor. Comput. Sci. 6(1): 41-44 (2003)
skipping 3 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 01:39 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