![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.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 21 matches
- 2000
- Nesrine Abbas, Lorna K. Stewart:
Biconvex graphs: ordering and algorithms. Discret. Appl. Math. 103(1-3): 1-19 (2000) - Mordecai Avriel, Michal Penn, Naomi Shpirer:
Container ship stowage problem: complexity and connection to the coloring of circle graphs. Discret. Appl. Math. 103(1-3): 271-279 (2000) - Philippe Baptiste:
Scheduling equal-length jobs on identical parallel machines. Discret. Appl. Math. 103(1-3): 21-32 (2000) - Jesús Mario Bilbao, Paul H. Edelman:
The Shapley value on convex geometries. Discret. Appl. Math. 103(1-3): 33-40 (2000) - Gerard J. Chang, Bor-Liang Chen, Hung-Lin Fu, Kuo-Ching Huang:
Linear k-arboricities on trees. Discret. Appl. Math. 103(1-3): 281-287 (2000) - Elias Dahlhaus, Peter Horák, Mirka Miller, Joseph F. Ryan:
The train marshalling problem. Discret. Appl. Math. 103(1-3): 41-54 (2000) - William Duckworth, Michele Zito:
Sparse Hypercube 3-spanners. Discret. Appl. Math. 103(1-3): 289-295 (2000) - Peter Eades, Antonios Symvonis
, Sue Whitesides:
Three-dimensional orthogonal graph drawing algorithms. Discret. Appl. Math. 103(1-3): 55-87 (2000) - Fritz von Haeseler, Heinz-Otto Peitgen, Guentcho Skordev:
On the fractal structure of the rescaled evolution set of Carlitz sequences of polynomials. Discret. Appl. Math. 103(1-3): 89-109 (2000) - Ariel Halpert, Flórián Lengyel, János Pach:
Cellular telephone networks and random maps in hypergraphs. Discret. Appl. Math. 103(1-3): 111-126 (2000) - Steven B. Horton, R. Gary Parker, Richard B. Borie:
On minimum cuts and the linear arrangement problem. Discret. Appl. Math. 103(1-3): 127-139 (2000) - D. Frank Hsu, Xiao-Dong Hu:
On shortest three-edge-connected Steiner networks with Euclidean distance. Discret. Appl. Math. 103(1-3): 141-152 (2000) - Lucian Ilie
, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
On strongly context-free languages. Discret. Appl. Math. 103(1-3): 153-165 (2000) - Samir Khuller, Azriel Rosenfeld, Angela Y. Wu:
Centers of sets of pixels. Discret. Appl. Math. 103(1-3): 297-306 (2000) - Dongsoo S. Kim, Ding-Zhu Du, Panos M. Pardalos:
A coloring problem on the n-cube. Discret. Appl. Math. 103(1-3): 307-311 (2000) - Monika Molnárová, Ján Pribis:
Matrix period in max-algebra. Discret. Appl. Math. 103(1-3): 167-175 (2000) - Jeffrey L. Poet, Bryan L. Shader
:
Score certificate numbers of upset tournaments. Discret. Appl. Math. 103(1-3): 177-189 (2000) - Fred S. Roberts
, Li Sheng:
Phylogeny numbers for graphs with two triangles. Discret. Appl. Math. 103(1-3): 191-207 (2000) - H. Edwin Romeijn, Dolores Romero Morales
:
A class of greedy algorithms for the generalized assignment problem. Discret. Appl. Math. 103(1-3): 209-235 (2000) - Martin Sauerhoff, Ingo Wegener, Ralph Werchner:
Optimal ordered binary decision diagrams for read-once formulas. Discret. Appl. Math. 103(1-3): 237-258 (2000) - Wenxun Xing, Jiawei Zhang:
Parallel machine scheduling with splitting jobs. Discret. Appl. Math. 103(1-3): 259-269 (2000)
loading more results
failed to load more results, please try again later
![](https://dblp.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-20 02:13 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