Остановите войну!
for scientists:
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 45 matches
- 2003
- Jørgen Bang-Jensen, Stéphan Thomassé:
Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs. Discret. Appl. Math. 131(2): 555-559 (2003) - Hans L. Bodlaender, Richard B. Tan, Jan van Leeuwen:
Finding a bigtriangleup-regular supergraph of minimum order. Discret. Appl. Math. 131(1): 3-9 (2003) - Rodica Boliac, Vadim V. Lozin:
An augmenting graph approach to the stable set problem in P5-free graphs. Discret. Appl. Math. 131(3): 567-575 (2003) - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
An inequality for polymatroid functions and its applications. Discret. Appl. Math. 131(2): 255-281 (2003) - Vincent Bouchitté, Ioan Todinca:
Approximating the treewidth of AT-free graphs. Discret. Appl. Math. 131(1): 11-37 (2003) - Andreas Brandstädt, Chính T. Hoàng, Van Bang Le:
Stability number of bull- and chair-free graphs revisited. Discret. Appl. Math. 131(1): 39-50 (2003) - Bostjan Bresar, Wilfried Imrich, Sandi Klavzar:
Fast recognition algorithms for classes of partial cubes. Discret. Appl. Math. 131(1): 51-61 (2003) - Leizhen Cai:
The complexity of the locally connected spanning tree problem. Discret. Appl. Math. 131(1): 63-75 (2003) - Eowyn Cenek, Lorna Stewart:
Maximum independent set and maximum clique algorithms for overlap graphs. Discret. Appl. Math. 131(1): 77-91 (2003) - Victor Chepoi, Feodor F. Dragan:
Finding a central vertex in an HHD-free graph. Discret. Appl. Math. 131(1): 93-11 (2003) - Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn, Hans Georg Schaathun:
Erratum to "Intersecting codes and separating codes": [Discrete Applied Mathematics 128 (2003) 75-83]. Discret. Appl. Math. 131(3): 689-690 (2003) - Harold S. Connamacher, Andrzej Proskurowski:
The complexity of minimizing certain cost metrics for k-source spanning trees. Discret. Appl. Math. 131(1): 113-127 (2003) - Bruno Courcelle, R. Vanicat:
Query efficient implementation of graphs of bounded clique-width. Discret. Appl. Math. 131(1): 129-150 (2003) - Elias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart:
MAD trees and distance-hereditary graphs. Discret. Appl. Math. 131(1): 151-167 (2003) - Vladimir I. Danilov, Gleb A. Koshevoy, Christine Lang:
Gross substitution, discrete convexity, and submodularity. Discret. Appl. Math. 131(2): 283-298 (2003) - Madhav P. Desai, H. Narayanan, Sachin B. Patkar:
The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function. Discret. Appl. Math. 131(2): 299-310 (2003) - Sylvain Durand:
Finding sharper distinctions for conditions of transitivity of the majority method. Discret. Appl. Math. 131(3): 577-595 (2003) - Samuel Fiorini, Peter C. Fishburn:
Facets of linear signed order polytopes. Discret. Appl. Math. 131(3): 597-610 (2003) - Lisa Fleischer, Satoru Iwata:
A push-relabel framework for submodular function minimization and applications to parametric optimization. Discret. Appl. Math. 131(2): 311-322 (2003) - Fedor V. Fomin, Dimitrios M. Thilikos:
On the monotonicity of games generated by symmetric submodular functions. Discret. Appl. Math. 131(2): 323-335 (2003) - András Frank:
Restricted t-matchings in bipartite graphs. Discret. Appl. Math. 131(2): 337-346 (2003) - András Frank, Tamás Király:
Combined connectivity augmentation and orientation problems. Discret. Appl. Math. 131(2): 401-419 (2003) - András Frank, Tamás Király, Matthias Kriesell:
On decomposing a hypergraph into k connected sub-hypergraphs. Discret. Appl. Math. 131(2): 373-383 (2003) - András Frank, Tamás Király, Zoltán Király:
On the orientation of graphs and hypergraphs. Discret. Appl. Math. 131(2): 385-400 (2003) - András Frank, László Szegö:
Constructive characterizations for packing and covering with trees. Discret. Appl. Math. 131(2): 347-371 (2003) - Tung-Shan Fu, Kwun-Shen Lin:
Lattice hypercube designs. Discret. Appl. Math. 131(3): 673-680 (2003) - Gennian Ge, Alan C. H. Ling:
A new construction for Z-cyclic whist tournaments. Discret. Appl. Math. 131(3): 643-650 (2003) - Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle:
Graph coloring on coarse grained multicomputers. Discret. Appl. Math. 131(1): 179-198 (2003) - Tibor Jordán:
On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks. Discret. Appl. Math. 131(2): 421-432 (2003) - Kenji Kashiwabara, Yoshio Okamoto:
A greedy algorithm for convex geometries. Discret. Appl. Math. 131(2): 449-465 (2003)
skipping 15 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-04-23 15:29 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