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 27 matches
- 2005
- Foto N. Afrati, Timos Aslanidis, Evripidis Bampis, Ioannis Milis:
Scheduling in Switching Networks with Set-Up Delays. J. Comb. Optim. 9(1): 49-57 (2005) - Nadia Brauner, Yves Crama, Alexander Grigoriev, Joris van de Klundert:
A Framework for the Complexity of High-Multiplicity Scheduling Problems. J. Comb. Optim. 9(3): 313-323 (2005) - Zhipeng Cai, Maysam Heydari, Guohui Lin:
Clustering Binary Oligonucleotide Fingerprint Vectors for DNA Clone Classification Analysis. J. Comb. Optim. 9(2): 199-211 (2005) - Hongxu Cai, Yingchao Zhao:
On Approximation Ratios of Minimum-Energy Multicast Routing in Wireless Networks. J. Comb. Optim. 9(3): 243-262 (2005) - Gruia Calinescu, Alexander Zelikovsky:
The Polymatroid Steiner Problems. J. Comb. Optim. 9(3): 281-294 (2005) - J. Orestes Cerdeira, Leonor Santiago Pinto:
Requiring Connectivity in the Set Covering Problem. J. Comb. Optim. 9(1): 35-47 (2005) - Danny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu:
Efficient Algorithms and Implementations for Optimizing the Sum of Linear Fractional Functions, with Applications. J. Comb. Optim. 9(1): 69-90 (2005) - Xujin Chen, Zhiquan Hu, Wenan Zang:
Perfect Circular Arc Coloring. J. Comb. Optim. 9(3): 267-280 (2005) - Zhi-Zhong Chen, Lusheng Wang:
An Improved Randomized Approximation Algorithm for Max TSP. J. Comb. Optim. 9(4): 401-432 (2005) - Ramkumar Chinchani, Duc T. Ha, Anusha Iyer, Hung Q. Ngo, Shambhu J. Upadhyaya:
On the Hardness of Approximating the Min-Hack Problem. J. Comb. Optim. 9(3): 295-311 (2005) - Vladimir G. Deineko, George Steiner, Zhihui Xue:
Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices. J. Comb. Optim. 9(4): 381-399 (2005) - Xiaotie Deng, Haodi Feng, Guojun Li, Benyun Shi:
A PTAS for Semiconductor Burn-in Scheduling. J. Comb. Optim. 9(1): 5-17 (2005) - Hung-Lin Fu, Frank K. Hwang:
On 3-Stage Clos Networks with Different Nonblocking Requirements on Two Types of Calls. J. Comb. Optim. 9(3): 263-266 (2005) - Xiaodong Gu, Guoliang Chen, Yinlong Xu:
Average-Case Performance Analysis of a 2D Strip Packing Algorithm-NFDH. J. Comb. Optim. 9(1): 19-34 (2005) - Yong He, Binwu Zhang, Enyu Yao:
Weighted Inverse Minimum Spanning Tree Problems Under Hamming Distance. J. Comb. Optim. 9(1): 91-100 (2005) - Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang, D. T. Lee:
Two Variations of the Minimum Steiner Problem. J. Comb. Optim. 9(1): 101-120 (2005) - Hark-Chin Hwang, Soo Y. Chang:
Order Consolidation for Batch Processing. J. Comb. Optim. 9(1): 121-138 (2005) - Xiaohua Jia, Dongsoo Kim, Sam Makki, Peng-Jun Wan, Chih-Wei Yi:
Power Assignment for k-Connectivity in Wireless Ad Hoc Networks. J. Comb. Optim. 9(2): 213-222 (2005) - Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To:
A Tighter Extra-Resource Analysis of Online Deadline Scheduling. J. Comb. Optim. 9(2): 157-165 (2005) - Jon Lee, Janny Leung, Sven de Vries:
Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation. J. Comb. Optim. 9(1): 59-67 (2005) - Xueliang Li, Wenan Zang:
A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs. J. Comb. Optim. 9(4): 331-347 (2005) - Guohui Lin:
An Improved Approximation Algorithm for Multicast k-Tree Routing. J. Comb. Optim. 9(4): 349-356 (2005) - Rung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao:
Finding a Length-Constrained Maximum-Density Path in a Tree. J. Comb. Optim. 9(2): 147-156 (2005) - Chung Keung Poon, Wenci Yu:
On-Line Scheduling Algorithms for a Batch Machine with Finite Capacity. J. Comb. Optim. 9(2): 167-186 (2005) - Lu Ruan, Weili Wu:
Broadcast Routing with Minimum Wavelength Conversion in WDM Optical Networks. J. Comb. Optim. 9(2): 223-235 (2005) - Dieter Vandenbussche, George L. Nemhauser:
The 2-Edge-Connected Subgraph Polyhedron. J. Comb. Optim. 9(4): 357-379 (2005) - Binwu Zhang, Jianzhong Zhang, Yong He:
The Center Location Improvement Problem Under the Hamming Distance. J. Comb. Optim. 9(2): 187-198 (2005)
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-10-21 14:43 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