Остановите войну!
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
- 2008
- Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela:
Extremal K(s, t)-free Bipartite Graphs. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - Mireille Bousquet-Mélou, Yann Ponty:
Culminating Paths. Discret. Math. Theor. Comput. Sci. 10(2) (2008) - Michel Bousquet, Cédric Lamathe:
On Symmetric Structures of Order Two. Discret. Math. Theor. Comput. Sci. 10(2) (2008) - Dorota Bród, Zdzislaw Skupien:
Recurrence Among Trees with Most Numerous Efficient Dominating Sets. Discret. Math. Theor. Comput. Sci. 10(1) (2008) - Stanley Burris, Karen A. Yeats:
Sufficient Conditions for Labelled 0-1 Laws. Discret. Math. Theor. Comput. Sci. 10(1) (2008) - Gruia Calinescu, Cristina G. Fernandes:
On the k-Structure Ratio in Planar and Outerplanar Graphs. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - David Callan:
A Determinant of Stirling Cycle Numbers Counts Unlabeled Acyclic Single-Source Automata. Discret. Math. Theor. Comput. Sci. 10(2) (2008) - Silvio Capobianco:
Multidimensional Cellular Automata and Generalization of Fekete's Lemma. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - Shu-Chiuan Chang, Lung-Chi Chen:
Spanning Forests on the Sierpinski Gasket. Discret. Math. Theor. Comput. Sci. 10(2) (2008) - Dariusz Dereniowski, Adam Nadolski:
A Note on Compact and Compact Circular Edge-colorings of Graphs. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - Yi-Zheng Fan, Jing Xu, Yi Wang, Dong Liang:
The Laplacian Spread of a Tree. Discret. Math. Theor. Comput. Sci. 10(1) (2008) - Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
Total Domination in K5- and K6-covered graphs. Discret. Math. Theor. Comput. Sci. 10(1) (2008) - Marietjie Frick, Peter Katrenic:
Progress on the Traceability Conjecture for Oriented Graphs. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - Cyril Gavoille, Nicolas Hanusse:
On Compact Encoding of Pagenumber. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - Marina Groshaus, Jayme Luiz Szwarcfiter:
On Hereditary Helly Classes of Graphs. Discret. Math. Theor. Comput. Sci. 10(1) (2008) - Jaroslaw Grytczuk, Hal A. Kierstead, Pawel Pralat:
On-line Ramsey Numbers for Paths and Stars. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - Elyes Ben Hamida, Guillaume Chelius, Anthony Busson, Eric Fleury:
Neighbor Discovery in Multi-hop Wireless Networks: Evaluation and Dimensioning with Interferences Considerations. Discret. Math. Theor. Comput. Sci. 10(2) (2008) - Peter Hertling, Christoph Spandl:
Shifts with Decidable Language and Non-Computable Entropy. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - Svante Janson, Christian Lavault, Guy Louchard:
Convergence of Some Leader Election Algorithms. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - David Joyner:
On Quadratic Residue Codes and Hyperelliptic Curves. Discret. Math. Theor. Comput. Sci. 10(1) (2008) - Tomi Kärki, Tero Harju, Vesa Halava:
Interaction Properties of Relational Periods. Discret. Math. Theor. Comput. Sci. 10(1) (2008) - Hamamache Kheddouci, Olivier Togni:
Minimum Feedback Vertex Sets in Distance Graphs and Circulant Graphs. Discret. Math. Theor. Comput. Sci. 10(1) (2008) - Sergey Kitaev, Toufik Mansour, Jeffrey B. Remmel:
Counting Descents, Rises, and Levels, with Prescribed First Element, in Words. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - Tomás Masopust, Jirí Techet:
Leftmost Derivations of Propagating Scattered Context Grammars: A New Proof. Discret. Math. Theor. Comput. Sci. 10(2) (2008) - Mickaël Montassier, Pascal Ochem, Alexandre Pinlou:
Strong Oriented Chromatic Number of Planar Graphs without Short Cycles. Discret. Math. Theor. Comput. Sci. 10(1) (2008) - Grégory Nuel:
Waiting Time Distribution for Pattern Occurrence in a Constrained Sequence: an Embedding Markov Chain Approach. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - Alois Panholzer:
Analysis of Some Parameters for Random Nodes in Priority Trees. Discret. Math. Theor. Comput. Sci. 10(2) (2008) - Khodabakhsh Hessami Pilehrood, Tatiana Hessami Pilehrood:
Simultaneous Generation for Zeta Values by the Markov-WZ Method. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - Helmut Prodinger:
The Location of the First Maximum in the First Sojourn of a Dyck Path. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - Erfang Shan, Zuosong Liang, T. C. Edwin Cheng:
Clique-transversal Number in Cubic Graphs. Discret. Math. Theor. Comput. Sci. 10(2) (2008)
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-04-28 14:49 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