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 30 matches
- 2015
- Susan A. van Aardt, Alewyn P. Burger, Jean E. Dunbar, Marietjie Frick, Bernardo Llano, Carsten Thomassen, Rita Zuazua:
Destroying longest cycles in graphs and digraphs. Discret. Appl. Math. 186: 251-259 (2015) - Camino Balbuena, Mika Olsen:
On the acyclic disconnection and the girth. Discret. Appl. Math. 186: 13-18 (2015) - Roger E. Behrend, Suil O, Douglas B. West:
Sharp lower bounds on the fractional matching number. Discret. Appl. Math. 186: 272-274 (2015) - Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler:
Clique-perfectness of complements of line graphs. Discret. Appl. Math. 186: 19-44 (2015) - Csilla Bujtás, Zsolt Tuza:
Turán numbers and batch codes. Discret. Appl. Math. 186: 45-55 (2015) - Kevin M. Byrnes:
A tight analysis of the Submodular-Supermodular Procedure. Discret. Appl. Math. 186: 275-282 (2015) - Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger:
Well-solvable cases of the QAP with block-structured matrices. Discret. Appl. Math. 186: 56-65 (2015) - Fuyuan Chen, Genghua Fan:
Fulkerson-covers of hypohamiltonian graphs. Discret. Appl. Math. 186: 66-73 (2015) - Thomas W. Cusick, Bryan Johns:
Recursion orders for weights of Boolean cubic rotation symmetric functions. Discret. Appl. Math. 186: 1-6 (2015) - Kinkar Chandra Das, Mohammad J. Nadjafi-Arani:
Comparison between the Szeged index and the eccentric connectivity index. Discret. Appl. Math. 186: 74-86 (2015) - Tuvi Etzion, Netanel Raviv:
Equidistant codes in the Grassmannian. Discret. Appl. Math. 186: 87-97 (2015) - Jugo Fuji:
Substitutable choice functions and convex geometry. Discret. Appl. Math. 186: 283-285 (2015) - Michel Grabisch, Pedro Miranda:
Exact bounds of the Möbius inverse of monotone set functions. Discret. Appl. Math. 186: 7-12 (2015) - Michael A. Henning, Lutz Volkmann:
Signed Roman k-domination in trees. Discret. Appl. Math. 186: 98-105 (2015) - Chính T. Hoàng, D. Adam Lazzarato:
Polynomial-time algorithms for minimum weighted colorings of ()-free graphs and similar graph classes. Discret. Appl. Math. 186: 106-111 (2015) - Syed Talha Jawaid, Stephen L. Smith:
Informative path planning as a maximum traveling salesman problem with submodular rewards. Discret. Appl. Math. 186: 112-127 (2015) - Ross J. Kang, Tobias Müller, Douglas B. West:
On r-dynamic coloring of grids. Discret. Appl. Math. 186: 286-290 (2015) - Sergey Kitaev, Jeffrey B. Remmel:
(a, b)-rectangle patterns in permutations and words. Discret. Appl. Math. 186: 128-146 (2015) - Matjaz Krnc, Riste Skrekovski:
Group centralization of network indices. Discret. Appl. Math. 186: 147-157 (2015) - Vadim E. Levit, David Tankus:
Well-covered graphs without cycles of lengths 4, 5 and 6. Discret. Appl. Math. 186: 158-167 (2015) - Ruifang Liu, Wai Chee Shiu:
General Randić matrix and general Randić incidence matrix. Discret. Appl. Math. 186: 168-175 (2015) - Andreas Löhne, Birgit Rudloff:
On the dual of the solvency cone. Discret. Appl. Math. 186: 176-185 (2015) - Meijie Ma:
Topological properties on the diameters of the integer simplex. Discret. Appl. Math. 186: 291-294 (2015) - Hongping Ma, Yongqiang Bai, Shengjin Ji:
On the minimal energy of conjugated unicyclic graphs with maximum degree at most 3. Discret. Appl. Math. 186: 186-198 (2015) - Lianying Miao, Qianqiu Cao, Na Cui, Shiyou Pang:
On the extremal values of the eccentric distance sum of trees. Discret. Appl. Math. 186: 199-206 (2015) - Aihong Niu, Dandan Fan, Guoping Wang:
On the distance Laplacian spectral radius of bipartite graphs. Discret. Appl. Math. 186: 207-213 (2015) - Anthony Perez:
On the kernelization of ranking r-CSPs: Linear vertex-kernels for generalizations of Feedback Arc Set and Betweenness in tournaments. Discret. Appl. Math. 186: 214-225 (2015) - Sergey Shebalov, Young Woong Park, Diego Klabjan:
Lifting for mixed integer programs with variable upper bounds. Discret. Appl. Math. 186: 226-250 (2015) - Yali Wu, Yongqi Sun, Stanislaw P. Radziszowski:
Wheel and star-critical Ramsey numbers for quadrilateral. Discret. Appl. Math. 186: 260-271 (2015) - Yujie Yan, Zhihao Ding, Zhiyi Tan:
A note on the lower bound for the Price of Anarchy of scheduling games on unrelated machines. Discret. Appl. Math. 186: 295-300 (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-21 05:15 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