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 318 matches
- 2013
- Yiqiao Wang, Qiaojun Shu, Weifan Wang:
The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle. Discret. Appl. Math. 161(16-17): 2687-2694 (2013) - Encarnación Abajo, Rocío M. Casablanca, Ana Diánez, Pedro García-Vázquez:
On average connectivity of the strong product of graphs. Discret. Appl. Math. 161(18): 2795-2801 (2013) - Mukti Acharya, Deepa Sinha:
Characterization of signed line digraphs. Discret. Appl. Math. 161(9): 1170-1172 (2013) - Sarah Spence Adams, Noura Howell, Nathaniel J. Karst, Denise Sakai Troxell, Junjie Zhu:
On the L(2, 1)-labelings of amalgamations of graphs. Discret. Appl. Math. 161(7-8): 881-888 (2013) - Kira V. Adaricheva, James B. Nation, Robert Rand:
Ordered direct implicational basis of a finite closure system. Discret. Appl. Math. 161(6): 707-723 (2013) - Bernardetta Addis, Marco Di Summa, Andrea Grosso:
Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth. Discret. Appl. Math. 161(16-17): 2349-2360 (2013) - Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen:
The maximum number of minimal codewords in long codes. Discret. Appl. Math. 161(3): 424-429 (2013) - Patrick Ali, Simon Mukwembi, Sheunesu Munyira:
Degree distance and vertex-connectivity. Discret. Appl. Math. 161(18): 2802-2811 (2013) - Eric Ould Dadah Andriantiana:
Energy, Hosoya index and Merrifield-Simmons index of trees with prescribed degree sequence. Discret. Appl. Math. 161(6): 724-741 (2013) - Eric Angel, Romain Campigotto, Christian Laforest:
A new lower bound on the independence number of graphs. Discret. Appl. Math. 161(6): 847-852 (2013) - Shoshana Anily, Aharona Pfeffer:
The uncapacitated swapping problem on a line and on a circle. Discret. Appl. Math. 161(4-5): 454-465 (2013) - Miguel F. Anjos, Manuel V. C. Vieira:
Semidefinite resolution and exactness of semidefinite relaxations for satisfiability. Discret. Appl. Math. 161(18): 2812-2826 (2013) - Mustapha Aouchiche, Pierre Hansen:
A survey of Nordhaus-Gaddum type relations. Discret. Appl. Math. 161(4-5): 466-546 (2013) - Julio Aracena, Jacques Demongeot, Eric Fanchon, Marco Montalva:
On the number of update digraphs and its relation with the feedback arc sets and tournaments. Discret. Appl. Math. 161(10-11): 1345-1355 (2013) - Julio Aracena, Luis Gómez, Lilian Salinas:
Limit cycles and update digraphs in Boolean networks. Discret. Appl. Math. 161(1-2): 1-12 (2013) - Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza:
Optimal solutions for routing problems with profits. Discret. Appl. Math. 161(4-5): 547-557 (2013) - Danilo Artigas, Simone Dantas, Mitre Costa Dourado, Jayme Luiz Szwarcfiter, Sei-ichi Yamaguchi:
On the contour of graphs. Discret. Appl. Math. 161(10-11): 1356-1362 (2013) - S. Arumugam, Bibin K. Jose, Csilla Bujtás, Zsolt Tuza:
Equality of domination and transversal numbers in hypergraphs. Discret. Appl. Math. 161(13-14): 1859-1867 (2013) - Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono:
Optimal approximability of bookmark assignments. Discret. Appl. Math. 161(16-17): 2361-2366 (2013) - Peter R. J. Asveld:
Permuting operations on strings and the distribution of their prime numbers. Discret. Appl. Math. 161(13-14): 1868-1881 (2013) - David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein:
Watching systems in graphs: An extension of identifying codes. Discret. Appl. Math. 161(12): 1674-1685 (2013) - Igor Averbakh, Mehmet Baysan:
Batching and delivery in semi-online distribution systems. Discret. Appl. Math. 161(1-2): 28-42 (2013) - Sergey V. Avgustinovich, Sergey Kitaev, Alexandr Valyuzhenich:
Avoidance of boxed mesh patterns on permutations. Discret. Appl. Math. 161(1-2): 43-51 (2013) - Maria Axenovich, Marcus Krug, Georg Osang, Ignaz Rutter:
Fork-forests in bi-colored complete bipartite graphs. Discret. Appl. Math. 161(10-11): 1363-1366 (2013) - Mahdieh Azari, Ali Iranmanesh:
Computing the eccentric-distance sum for graph operations. Discret. Appl. Math. 161(18): 2827-2840 (2013) - Mikhail A. Babin, Sergei O. Kuznetsov:
Computing premises of a minimal cover of functional dependencies is intractable. Discret. Appl. Math. 161(6): 742-749 (2013) - Rangaswami Balakrishnan, S. Francis Raj:
Bounds for the b-chromatic number of G-v. Discret. Appl. Math. 161(9): 1173-1179 (2013) - Péter Balázs:
Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections. Discret. Appl. Math. 161(15): 2224-2235 (2013) - Camino Balbuena, Diego González-Moreno, Juan José Montellano-Ballesteros:
A note on the upper bound and girth pair of (k;g)-cages. Discret. Appl. Math. 161(6): 853-857 (2013) - Camino Balbuena, Xavier Marcote:
The k-restricted edge-connectivity of a product of graphs. Discret. Appl. Math. 161(1-2): 52-59 (2013)
skipping 288 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-09-26 09:20 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