Остановите войну!
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 30 matches
- 2001
- Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima:
A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. J. Comb. Optim. 5(2): 213-231 (2001) - Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh:
A 2\frac{1}{10}-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. J. Comb. Optim. 5(3): 317-326 (2001) - Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Xiaodong Wu, Jinhui Xu:
Determining an Optimal Penetration Among Weighted Regions in Two and Three Dimensions. J. Comb. Optim. 5(1): 59-79 (2001) - Xiuzhen Cheng, Joon-Mo Kim, Bing Lu:
A Polynomial Time Approximation Scheme for the Problem of Interconnecting Highways. J. Comb. Optim. 5(3): 327-343 (2001) - Pierluigi Crescenzi, Xiaotie Deng, Christos H. Papadimitriou:
On Approximating a Scheduling Problem. J. Comb. Optim. 5(3): 287-297 (2001) - Xiaotie Deng, Evangelos E. Milios, Andranik Mirzaian:
Robot Map Verification of a Graph World. J. Comb. Optim. 5(4): 383-395 (2001) - Daya Ram Gaur, Ramesh Krishnamurti:
Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability. J. Comb. Optim. 5(2): 167-173 (2001) - Peter Hall:
On the Addition and Comparison of Graphs Labeled with Stochastic Variables: Learnable Anatomical Catalogs. J. Comb. Optim. 5(1): 43-58 (2001) - Mhand Hifi, Catherine Roucairol:
Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock Problems. J. Comb. Optim. 5(4): 465-494 (2001) - Shyh-In Hwang, Sheng-Tzong Cheng:
Combinatorial Optimization in Real-Time Scheduling: Theory and Algorithms. J. Comb. Optim. 5(3): 345-375 (2001) - Leonidas D. Iasemidis, Panos M. Pardalos, J. Chris Sackellares, Deng-Shan Shiau:
Quadratic Binary Programming and Dynamical System Approach to Determine the Predictability of Epileptic Seizures. J. Comb. Optim. 5(1): 9-26 (2001) - Piotr Krysta, Roberto Solis-Oba:
Approximation Algorithms for Bounded Facility Location Problems. J. Comb. Optim. 5(2): 233-247 (2001) - Yoshiyuki Kusakari, Daisuke Masubuchi, Takao Nishizeki:
Finding a Noncrossing Steiner Forest in Plane Graphs Under a 2-Face Condition. J. Comb. Optim. 5(2): 249-266 (2001) - Hing-Yip Lau, H. F. Ting:
The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent. J. Comb. Optim. 5(4): 411-420 (2001) - Adam N. Letchford:
On Disjunctive Cuts for Combinatorial Optimization. J. Comb. Optim. 5(3): 299-315 (2001) - John E. Mitchell:
Restarting after Branching in the SDP Approach to MAX-CUT and Similar Combinatorial Optimization Problems. J. Comb. Optim. 5(2): 151-166 (2001) - Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki:
Augmenting a Submodular and Posi-modular Set Function by a Multigraph. J. Comb. Optim. 5(2): 175-212 (2001) - Ingela Nyström, Örjan Smedby:
Skeletonization of Volumetric Vascular Images - Distance Information Utilized for Visualization. J. Comb. Optim. 5(1): 27-41 (2001) - Ján Plesník:
Minimum Cost Edge Subset Covering Exactly k Vertices of a Graph. J. Comb. Optim. 5(3): 275-286 (2001) - Sanguthevar Rajasekaran, Y. Hu, Jun Luo, H. Nick, Panos M. Pardalos, Sartaj Sahni, G. Shaw:
Efficient Algorithms for Similarity Search. J. Comb. Optim. 5(1): 125-132 (2001) - Sanguthevar Rajasekaran, H. Nick, Panos M. Pardalos, Sartaj Sahni, G. Shaw:
Efficient Algorithms for Local Alignment Search. J. Comb. Optim. 5(1): 117-124 (2001) - Mauricio G. C. Resende:
"Mobile Networks and Computing". J. Comb. Optim. 5(4): 297-298 (2001) - Mauricio G. C. Resende:
Multichannel Optical Networks: Theory and Practice. J. Comb. Optim. 5(4): 495-496 (2001) - Li Sheng, Chi Wang, Peisen Zhang:
Tagged Probe Interval Graphs. J. Comb. Optim. 5(1): 133-142 (2001) - J. MacGregor Smith, Wu-Ji Li:
Quadratic Assignment Problems and M/G/C/C/ State Dependent Network Flows. J. Comb. Optim. 5(4): 421-443 (2001) - Alan P. Sprague, Stephen E. Brossette:
Medical Surveillance, Frequent Sets, and Closure Operations. J. Comb. Optim. 5(1): 81-94 (2001) - Nodari Vakhania:
Tight Performance Bounds of CP-Scheduling on Out-Trees. J. Comb. Optim. 5(4): 445-464 (2001) - Jie Wang:
Optimization Problems in Medical Applications. J. Comb. Optim. 5(1): 7-8 (2001) - Peng Zhao, Tao Jiang:
A Heuristic Algorithm for Multiple Sequence Alignment Based on Blocks. J. Comb. Optim. 5(1): 95-115 (2001) - Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. J. Comb. Optim. 5(4): 397-410 (2001)
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-05-07 04:48 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