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 36 matches
- 2012
- Guoqiang Bai, Henning Fernau:
Constraint bipartite vertex cover: simpler exact algorithms and implementations. J. Comb. Optim. 23(3): 331-355 (2012) - Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié:
The max quasi-independent set problem. J. Comb. Optim. 23(1): 94-117 (2012) - Tian-Ming Bu, Xiaotie Deng, Qi Qi:
Multi-bidding strategy in sponsored search auctions. J. Comb. Optim. 23(3): 356-372 (2012) - Gerard J. Chang, Ting-Pang Chang, Li-Da Tong:
Hamiltonian numbers of Möbius double loop networks. J. Comb. Optim. 23(4): 462-470 (2012) - Huilan Chang, Frank K. Hwang, Uriel G. Rothblum:
A new approach to solve open-partition problems. J. Comb. Optim. 23(1): 61-78 (2012) - Qin Chen, Xujin Chen:
Packing cycles exactly in polynomial time. J. Comb. Optim. 23(2): 167-188 (2012) - Danny Z. Chen, Ewa Misiolek:
Flattening topologically spherical surface. J. Comb. Optim. 23(3): 309-321 (2012) - Yongxi Cheng, Guohui Lin:
Solving haplotype inference problem with non-genotyped founders via integer linear programming. J. Comb. Optim. 23(1): 50-60 (2012) - Federico Della Croce, Dominique Quadri:
Improving an exact approach for solving separable integer quadratic knapsack problems. J. Comb. Optim. 23(1): 21-28 (2012) - Hongjie Du, Weili Wu, Shan Shan, Donghyun Kim, Wonjun Lee:
Constructing weakly connected dominating set for secure clustering in distributed sensor network. J. Comb. Optim. 23(2): 301-307 (2012) - Neng Fan, Panos M. Pardalos:
Multi-way clustering and biclustering by the Ratio cut and Normalized cut in graphs. J. Comb. Optim. 23(2): 224-251 (2012) - Sumit Ganguly, Mohit Bansal, Shruti Dube:
Estimating hybrid frequency moments of data streams. J. Comb. Optim. 23(3): 373-394 (2012) - Elisabeth Gassner:
An inverse approach to convex ordered median problems in trees. J. Comb. Optim. 23(2): 261-273 (2012) - Wayne Goddard, Jeremy Lyle:
Independent dominating sets in triangle-free graphs. J. Comb. Optim. 23(1): 9-20 (2012) - Yijie Han:
Tight bound for matching. J. Comb. Optim. 23(3): 322-330 (2012) - Shenwei Huang, Erfang Shan, Liying Kang:
Perfect matchings in paired domination vertex critical graphs. J. Comb. Optim. 23(4): 507-518 (2012) - Haitao Jiang, Zhong Li, Guohui Lin, Lusheng Wang, Binhai Zhu:
Exact and approximation algorithms for the complementary maximal strip recovery problem. J. Comb. Optim. 23(4): 493-506 (2012) - Haitao Jiang, Binhai Zhu, Daming Zhu, Hong Zhu:
Minimum common string partition revisited. J. Comb. Optim. 23(4): 519-527 (2012) - Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub:
Models for the single-vehicle preemptive pickup and delivery problem. J. Comb. Optim. 23(2): 196-223 (2012) - Bo-Jr Li, Gerard J. Chang:
The competition number of a graph with exactly two holes. J. Comb. Optim. 23(1): 1-8 (2012) - Minming Li, Tiantian Liu, Chun Jason Xue, Yingchao Zhao:
Analysis and approximation for bank selection instruction minimization on partitioned memory architecture. J. Comb. Optim. 23(2): 274-291 (2012) - Yingshu Li, Yiwei Wu, Chunyu Ai, Raheem A. Beyah:
On the construction of k-connected m-dominating sets in wireless networks. J. Comb. Optim. 23(1): 118-139 (2012) - Ming Liu, Chengbin Chu, Yinfeng Xu, Jiazhen Huo:
An optimal online algorithm for single machine scheduling to minimize total general completion time. J. Comb. Optim. 23(2): 189-195 (2012) - Ming Liu, Feifeng Zheng, Chengbin Chu, Jiantong Zhang:
An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration. J. Comb. Optim. 23(4): 483-492 (2012) - Wenkai Ma, Deying Li, Zhao Zhang:
Algorithms for the minimum weight k-fold (connected) dominating set problem. J. Comb. Optim. 23(4): 528-540 (2012) - Benjamin McClosky, Illya V. Hicks:
Combinatorial algorithms for the maximum k-plex problem. J. Comb. Optim. 23(1): 29-49 (2012) - Konstantin Moiseev, Avinoam Kolodny, Shmuel Wimer:
The complexity of VLSI power-delay optimization by interconnect resizing. J. Comb. Optim. 23(2): 292-300 (2012) - Dvir Shabtay, Nufar Gaspar, Liron Yedidsion:
A bicriteria approach to scheduling a single machine with job rejection and positional penalties. J. Comb. Optim. 23(4): 395-424 (2012) - Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
The total {k}-domatic number of a graph. J. Comb. Optim. 23(2): 252-260 (2012) - Tongliang Shi, Mei Lu:
Fault-tolerant diameter for three family interconnection networks. J. Comb. Optim. 23(4): 471-482 (2012)
skipping 6 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-09-21 04:38 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