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 25 matches
- 2015
- Encarnación Abajo, Ana Diánez:
Exact value of ex(n;{c3, ..., cs}) for n ≤ [25(s-1)/8]. Discret. Appl. Math. 185: 1-7 (2015) - Saeid Taghavi Afshord, Yuri Pottosin, Bahman Arasteh:
An input variable partitioning algorithm for functional decomposition of a system of Boolean functions based on the tabular method. Discret. Appl. Math. 185: 208-219 (2015) - André Berger, Heiko Röglin, Ruben van der Zwaan:
Internet routing between autonomous systems: Fast algorithms for path trading. Discret. Appl. Math. 185: 8-17 (2015) - Clara Betancur, Roberto Cruz, Juan Rada:
Vertex-degree-based topological indices over starlike trees. Discret. Appl. Math. 185: 18-25 (2015) - Francine Blanchet-Sadri, Michelle Bodnar, Jordan Nikkel, J. D. Quigley, Xufan Zhang:
Squares and primitivity in partial words. Discret. Appl. Math. 185: 26-37 (2015) - Yair Caro, Josef Lauri, Christina Zarb:
(2, 2)-colourings and clique-free σ-hypergraphs. Discret. Appl. Math. 185: 38-43 (2015) - D. Chao:
The Horn renamability, q-Horn and SLUR threshold for random k-CNF formulas. Discret. Appl. Math. 185: 44-51 (2015) - Sheng Chen, Xiaomei Chen:
Weak connectedness of tensor product of digraphs. Discret. Appl. Math. 185: 52-58 (2015) - Xiaomin Chen, Guangda Huzhang, Peihan Miao, Kuan Yang:
Graph metric with no proper inclusion between lines. Discret. Appl. Math. 185: 59-70 (2015) - Jennifer Diemunsch, Michitaka Furuya, Maryam Sharifzadeh, Shoichi Tsuchiya, David Wang, Jennifer Wise, Elyse Yeager:
A characterization of P5-free graphs with a homeomorphically irreducible spanning tree. Discret. Appl. Math. 185: 71-78 (2015) - Igor Fabrici, Stanislav Jendrol', Michaela Vrbjarová:
Unique-maximum edge-colouring of plane graphs with respect to faces. Discret. Appl. Math. 185: 239-243 (2015) - Sepp Hartung, Christian Komusiewicz, André Nichterlein, Ondrej Suchý:
On structural parameterizations for the 2-club problem. Discret. Appl. Math. 185: 79-92 (2015) - Tibor Jordán, Viktória E. Kaszanitzky:
Sparse hypergraphs with applications in combinatorial rigidity. Discret. Appl. Math. 185: 93-101 (2015) - Xueliang Li, Yaping Mao:
Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs. Discret. Appl. Math. 185: 102-112 (2015) - Fengxia Liu, Zhao Zhang, Hong-Jian Lai, Meng Zhang:
Degree sequence realizations with given packing and covering of spanning trees. Discret. Appl. Math. 185: 113-118 (2015) - Guanzhong Ma:
Characterization of rotation words generated by homeomorphisms on a circle. Discret. Appl. Math. 185: 244-248 (2015) - Akira Matsubayashi:
Separator-based graph embedding into multidimensional grids with small edge-congestion. Discret. Appl. Math. 185: 119-137 (2015) - Daniel Meister, Udi Rotics:
Clique-width of full bubble model graphs. Discret. Appl. Math. 185: 138-167 (2015) - Jung-Heum Park, Insung Ihm:
Many-to-many two-disjoint path covers in cylindrical and toroidal grids. Discret. Appl. Math. 185: 168-191 (2015) - Hachem Slimani, Hamamache Kheddouci:
Saturated boundary k-alliances in graphs. Discret. Appl. Math. 185: 192-207 (2015) - Shuangliang Tian, Qian Wang:
Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs. Discret. Appl. Math. 185: 220-226 (2015) - Sebastián Urrutia, Abilio Lucena:
Erratum to "Characterizing acyclic graphs by labeling edges" [Discrete Appl. Math. 164 (2014) 492-499]. Discret. Appl. Math. 185: 254-255 (2015) - Alexandria Yu:
An inequality on global alliances for trees. Discret. Appl. Math. 185: 227-229 (2015) - Weigang Yuan, Xiao-Dong Zhang:
The second Zagreb indices of graphs with given degree sequences. Discret. Appl. Math. 185: 230-238 (2015) - Lingping Zhong, Qing Cui:
On a relation between the atom-bond connectivity and the first geometric-arithmetic indices. Discret. Appl. Math. 185: 249-253 (2015)
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-10-11 18:37 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