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 31 matches
- 1986
- Frank D. Anger, J. Sarmiento, Rita V. Rodríguez:
Representative graphs of r-regular partial planes and representation of orthomodular posets. Discret. Appl. Math. 15(1): 1-10 (1986) - Darko Babic, Ante Graovac, Bojan Mohar, Tomaz Pisanski:
The matching polynomial of a polygraph. Discret. Appl. Math. 15(1): 11-24 (1986) - Egon Balas:
A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring. Discret. Appl. Math. 15(2-3): 123-134 (1986) - Wolfgang W. Bein, Peter Brucker:
Greedy concepts for network flow problems. Discret. Appl. Math. 15(2-3): 135-144 (1986) - Claude Berge:
New classes of perfect graphs. Discret. Appl. Math. 15(2-3): 145-154 (1986) - Robert E. Bixby, Collette R. Coullard:
On chains of 3-connected matroids. Discret. Appl. Math. 15(2-3): 155-166 (1986) - Rainer E. Burkard:
Optimal schedules for periodically recurring events. Discret. Appl. Math. 15(2-3): 167-180 (1986) - Paolo M. Camerini, Francesco Maffioli, Silvano Martello, Paolo Toth:
Most and least uniform spanning trees. Discret. Appl. Math. 15(2-3): 181-197 (1986) - Sung-Jin Chung, Katta G. Murty, Soo Y. Chang:
On KΔ. Discret. Appl. Math. 15(2-3): 199-211 (1986) - Maurice Cochand, Dominique de Werra:
Generalized neighbourhoods and a class of perfectly orderable graphs. Discret. Appl. Math. 15(2-3): 213-220 (1986) - Yves Crama, Peter L. Hammer, Toshihide Ibaraki:
Strong unimodularity for matrices and hypergraphs. Discret. Appl. Math. 15(2-3): 221-239 (1986) - Ulrich Derigs, Oskar Goecke, Rainer Schrader:
Monge sequences and a simple assignment algorithm. Discret. Appl. Math. 15(2-3): 241-248 (1986) - Ulrich Faigle:
Exchange properties of combinatorial closure spaces. Discret. Appl. Math. 15(2-3): 249-260 (1986) - Ulrich Faigle, Rainer Schrader:
On the computational complexity of the order polynomial. Discret. Appl. Math. 15(2-3): 261-269 (1986) - Joan Feigenbaum:
Directed cartesian-product graphs have unique factorizations that can be computed in polynomial time. Discret. Appl. Math. 15(1): 105-110 (1986) - Les R. Foulds:
Testing the theory of evolution: A novel application of comibinatorial optimization. Discret. Appl. Math. 15(2-3): 271-282 (1986) - Ivan Gutman, Fuji Zhang:
On the ordering of graphs with respect to their matching numbers. Discret. Appl. Math. 15(1): 25-33 (1986) - Nicholas G. Hall, Dorit S. Hochbaum:
A fast approximation algorithm for the multicovering problem. Discret. Appl. Math. 15(1): 35-40 (1986) - Horst W. Hamacher:
Maximal dynamic polymatroid flows and applications. Discret. Appl. Math. 15(1): 41-54 (1986) - Tero Harju, Juhani Karhumäki, H. C. M. Kleijn:
On morphic generation of regular languages. Discret. Appl. Math. 15(1): 55-60 (1986) - Bruce Hedman:
A polynomial algorithm for constructing the clique graph of a line graph. Discret. Appl. Math. 15(1): 61-66 (1986) - Bernhard Korte, László Lovász:
Homomorphisms and Ramsey properties of antimatroids. Discret. Appl. Math. 15(2-3): 283-290 (1986) - Eugene L. Lawler, Charles U. Martel:
Polymatroidal flows with lower bounds. Discret. Appl. Math. 15(2-3): 291-313 (1986) - William F. McColl, K. Noshita:
On the number of edges in the transitive closure of a graph. Discret. Appl. Math. 15(1): 67-73 (1986) - Kurt Mehlhorn, Bernd H. Schmidt:
On BF-orderable graphs. Discret. Appl. Math. 15(2-3): 315-327 (1986) - Zbigniew Palka, Andrzej Rucinski:
On the order of the largest induced tree in a random graph. Discret. Appl. Math. 15(1): 75-83 (1986) - Dan A. Simovici, Corina Reischer:
Iterative characterizations of Boolean algebras. Discret. Appl. Math. 15(1): 111-116 (1986) - Fan T. Tseng, Klaus Truemper:
A decomposition of the matroids with the max-flow min-cut property. Discret. Appl. Math. 15(2-3): 329-364 (1986) - Sheng Yu:
A property of real-time trellis automata. Discret. Appl. Math. 15(1): 117-119 (1986) - Uwe Zimmermann:
Linear and combinatorial sharing problems. Discret. Appl. Math. 15(1): 85-104 (1986)
skipping 1 more match
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-17 06:02 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