![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 18 matches
- 1996
- V. Balachandhran, C. Pandu Rangan:
All-pairs-shortest-length on Strongly Chordal Graphs. Discret. Appl. Math. 69(1-2): 169-182 (1996) - Jason I. Brown
:
The Complexity of Generalized Graph Colorings. Discret. Appl. Math. 69(3): 257-270 (1996) - Zhi-Zhong Chen, Xin He:
Parallel Complexity of Partitioning a Planar Graph Into Vertex-induced Forests. Discret. Appl. Math. 69(1-2): 183-198 (1996) - János Demetrovics, Vu Duc Thi:
Some Results About Normal Forms for Functional Dependency in the Relational Datamodel. Discret. Appl. Math. 69(1-2): 61-74 (1996) - Josep Fàbrega
, Miguel Angel Fiol:
Bipartite Graphs and Digraphs with Maximum Connectivity. Discret. Appl. Math. 69(3): 271-279 (1996) - Carsten Flotow:
On Powers of Circular Arc Graphs and Proper Circular Arc Graphs. Discret. Appl. Math. 69(3): 199-207 (1996) - Gregory Z. Gutin, Anders Yeo:
Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph. Discret. Appl. Math. 69(1-2): 75-82 (1996) - Samir Khuller, Balaji Raghavachari, Neal E. Young
:
On Strongly Connected Digraphs with Bounded Cycle Length. Discret. Appl. Math. 69(3): 281-289 (1996) - Hyeong-Seok Lim, Jung-Heum Park
, Kyung-Yong Chwa:
Embedding Trees in Recursive Circulants. Discret. Appl. Math. 69(1-2): 83-99 (1996) - Kazuhisa Makino, Toshihide Ibaraki:
Interior and Exterior Functions of Boolean Functions. Discret. Appl. Math. 69(3): 209-231 (1996) - Karl Nachtigall:
Periodic Network Optimization with Different Arc Frequencies. Discret. Appl. Math. 69(1-2): 1-17 (1996) - Lee Aaron Newberg:
The Number of Clone Orderings. Discret. Appl. Math. 69(3): 233-245 (1996) - Meei Pyng Ng, Nicholas C. Wormald:
Reconstruction of Rooted Trees From Subtrees. Discret. Appl. Math. 69(1-2): 19-31 (1996) - Dennis Pixton:
Regularity of Splicing Languages. Discret. Appl. Math. 69(1-2): 101-124 (1996) - Peter W. Stephens:
Gap Strings and Spanning Forests for Bridge Graphs of Biconnected Graphs. Discret. Appl. Math. 69(1-2): 125-145 (1996) - Jeffrey Wood, John Shawe-Taylor
:
Representation Theory and Invariant Neural Networks. Discret. Appl. Math. 69(1-2): 33-60 (1996) - Jing-Ho Yan, Jer-Jeong Chen, Gerard J. Chang:
Quasi-threshold Graphs. Discret. Appl. Math. 69(3): 247-255 (1996) - Heping Zhang
, Fuji Zhang:
The Clar Covering Polynomial of Hexagonal Systems I. Discret. Appl. Math. 69(1-2): 147-167 (1996)
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-09 01:17 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