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 24 matches
- 2009
- Lech Adamus:
Edge condition for long cycles in bipartite graphs. Discret. Math. Theor. Comput. Sci. 11(2): 25-32 (2009) - Janusz Adamus, Lech Adamus:
Ore and Erdős type conditions for long cycles in balanced bipartite graphs. Discret. Math. Theor. Comput. Sci. 11(2): 57-70 (2009) - Gábor Bacsó, Zsolt Tuza:
Clique-transversal sets and weak 2-colorings in graphs of small maximum degree. Discret. Math. Theor. Comput. Sci. 11(2): 15-24 (2009) - Camino Balbuena:
A method for obtaining small regular bipartite graphs of girth 8. Discret. Math. Theor. Comput. Sci. 11(2): 33-46 (2009) - Marilena Barnabei, Flavio Bonetti, Matteo Silimbani:
The Eulerian distribution on centrosymmetric involutions. Discret. Math. Theor. Comput. Sci. 11(1): 95-116 (2009) - Valérie Berthé, Laurent Imbert:
Diophantine Approximation, Ostrowski Numeration and the Double-Base Number System. Discret. Math. Theor. Comput. Sci. 11(1): 153-172 (2009) - Romain Boulet:
Spectral characterizations of sun graphs and broken sun graphs. Discret. Math. Theor. Comput. Sci. 11(2): 149-169 (2009) - Charlotte A. C. Brennan, Arnold Knopfmacher:
The distribution of ascents of size d or more in compositions. Discret. Math. Theor. Comput. Sci. 11(1): 1-10 (2009) - Shu-Chiuan Chang, Lung-Chi Chen:
Number of connected spanning subgraphs on the Sierpinski gasket. Discret. Math. Theor. Comput. Sci. 11(1): 55-78 (2009) - Alessandra Cherubini, Andrzej Kisielewicz, Brunetto Piochi:
On the length of shortest 2-collapsing words. Discret. Math. Theor. Comput. Sci. 11(1): 33-44 (2009) - Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski:
Gray Codes Avoiding Matchings. Discret. Math. Theor. Comput. Sci. 11(2): 123-148 (2009) - Jeff Erickson, Ferran Hurtado, Pat Morin:
Centerpoint Theorems for Wedges. Discret. Math. Theor. Comput. Sci. 11(1): 45-54 (2009) - Jan Foniok, Claude Tardif:
Adjoint functors and tree duality. Discret. Math. Theor. Comput. Sci. 11(2): 97-110 (2009) - Petr Gregor, Riste Skrekovski:
Long cycles in hypercubes with distant faulty vertices. Discret. Math. Theor. Comput. Sci. 11(1): 187-200 (2009) - Louis Kauffman, Pedro Lopes:
Determinants of Rational Knots. Discret. Math. Theor. Comput. Sci. 11(2): 111-122 (2009) - Michal Kolarz, Wlodzimierz Moczurad:
Directed figure codes are decidable. Discret. Math. Theor. Comput. Sci. 11(2): 1-14 (2009) - Jing Kong, Yaokun Wu:
On economical set representations of graphs. Discret. Math. Theor. Comput. Sci. 11(2): 71-96 (2009) - Toufik Mansour:
Enumeration of words by the sum of differences between adjacent letters. Discret. Math. Theor. Comput. Sci. 11(1): 173-186 (2009) - Ruy Fabila Monroy, David Flores-Peñaloza, Clemens Huemer, Ferran Hurtado, David R. Wood, Jorge Urrutia:
On the Chromatic Number of some Flip Graphs. Discret. Math. Theor. Comput. Sci. 11(2): 47-56 (2009) - Raffaele Mosca:
Independent sets in (P6, diamond)-free graphs. Discret. Math. Theor. Comput. Sci. 11(1): 125-140 (2009) - Yidong Sun, Zhiping Wang:
String Pattern Avoidance in Generalized Non-crossing Trees. Discret. Math. Theor. Comput. Sci. 11(1): 79-94 (2009) - Artur Szymanski, A. Pawel Wojda:
Self-complementing permutations of k-uniform hypergraphs. Discret. Math. Theor. Comput. Sci. 11(1): 117-124 (2009) - Elmar Teufl, Stephan G. Wagner:
Asymptotic enumeration on self-similar graphs with two boundary vertices. Discret. Math. Theor. Comput. Sci. 11(1): 11-32 (2009) - Deshi Ye, Guochuan Zhang:
On-line extensible bin packing with unequal bin sizes. Discret. Math. Theor. Comput. Sci. 11(1): 141-152 (2009)
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-11-02 05:29 CET 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