Остановите войну!
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 26 matches
- 2003
- Laura Bahiense, Francisco Barahona, Oscar Porto:
Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation. J. Comb. Optim. 7(3): 259-282 (2003) - Hans L. Bodlaender:
Necessary Edges in k-Chordalisations of Graphs. J. Comb. Optim. 7(3): 283-290 (2003) - Wanpracha Art Chaovalitwongse, Dukwon Kim, Panos M. Pardalos:
GRASP with a New Local Search Scheme for Vehicle Routing Problems with Time Windows. J. Comb. Optim. 7(2): 179-207 (2003) - Chiuyuan Chen:
Any Maximal Planar Graph with Only One Separating Triangle is Hamiltonian. J. Comb. Optim. 7(1): 79-86 (2003) - Danny Z. Chen, Xiaobo Hu, Jinhui Xu:
Computing Optimal Beams in Two and Three Dimensions. J. Comb. Optim. 7(2): 111-136 (2003) - Xiaotie Deng, Chung Keung Poon, Yuzhong Zhang:
Approximation Algorithms in Batch Processing. J. Comb. Optim. 7(3): 247-257 (2003) - Arkadii G. D'yachkov, Péter L. Erdös, Anthony J. Macula, Vyacheslav V. Rykov, David C. Torney, Chang-Shung Tung, Pavel A. Vilenkin, P. Scott White:
Exordium for DNA Codes. J. Comb. Optim. 7(4): 369-379 (2003) - Giovanni Felici, Claudio Gentile:
Zero-Lifting for Integer Block Structured Problems. J. Comb. Optim. 7(2): 161-167 (2003) - Celia A. Glass, Adam Prügel-Bennett:
Genetic Algorithm for Graph Coloring: Exploration of Galinier and Hao's Algorithm. J. Comb. Optim. 7(3): 229-236 (2003) - Tayuan Huang, Chih-Wen Weng:
A Note on Decoding of Superimposed Codes. J. Comb. Optim. 7(4): 381-384 (2003) - Frank K. Hwang, Wen-Dar Lin:
The Incremental Group Testing Model for Gap Closing in Sequencing Long Molecules. J. Comb. Optim. 7(4): 327-337 (2003) - Frank K. Hwang, Yu-Chi Liu:
Random Pooling Designs Under Various Structures. J. Comb. Optim. 7(4): 339-352 (2003) - Adar A. Kalir, Subhash C. Sarin:
Constructing Near Optimal Schedules for the Flow-Shop Lot Streaming Problem with Sublot-Attached Setups. J. Comb. Optim. 7(1): 23-44 (2003) - Ming-Yang Kao, Jared Samet, Wing-Kin Sung:
The Enhanced Double Digest Problem for DNA Physical Mapping. J. Comb. Optim. 7(1): 69-78 (2003) - Jon Lee:
Cropped Cubes. J. Comb. Optim. 7(2): 169-178 (2003) - Yusheng Li, Wenan Zang:
The Independence Number of Graphs with a Forbidden Cycle and Ramsey Numbers. J. Comb. Optim. 7(4): 353-359 (2003) - Hongwei Liu, Sanyang Liu, Fengmin Xu:
A Tight Semidefinite Relaxation of the MAX CUT Problem. J. Comb. Optim. 7(3): 237-245 (2003) - Zhenhong Liu, Jianzhong Zhang:
On Inverse Problems of Optimum Perfect Matching. J. Comb. Optim. 7(3): 215-228 (2003) - Anthony J. Macula:
Trivial Two-Stage Group Testing with High Error Rates. J. Comb. Optim. 7(4): 361-368 (2003) - Hiroshi Nagamochi, Peter Eades:
An Edge-Splitting Algorithm in Planar Graphs. J. Comb. Optim. 7(2): 137-159 (2003) - Haesun Park, Weili Wu, Zhen Liu, Xiaoyu Wu, Hong G. Zhao:
DNA Screening, Pooling Design and Simplicial Complex. J. Comb. Optim. 7(4): 389-394 (2003) - Sachin B. Patkar, H. Narayanan:
Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and its Connections with Principal Partition. J. Comb. Optim. 7(1): 45-68 (2003) - Roger Z. Ríos-Mercado, Jonathan F. Bard:
The Flow Shop Scheduling Polyhedron with Setup Time. J. Comb. Optim. 7(3): 291-318 (2003) - Eugene Shragowitz, Habib Youssef, Bing Lu:
Iterative Converging Algorithms for Computing Bounds on Durations of Activities in Pert and Pert-Like Models. J. Comb. Optim. 7(1): 5-22 (2003) - Michel Vasquez, Jin-Kao Hao:
Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem. J. Comb. Optim. 7(1): 87-103 (2003) - Weili Wu, Chungui Li, Xiaoyu Wu, Xiao Huang:
Decoding in Pooling Designs. J. Comb. Optim. 7(4): 385-388 (2003)
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-06-06 07:15 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