![](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 30 matches
- 2011
- Bader F. AlBdaiwi, Diptesh Ghosh
, Boris Goldengorin
:
Data aggregation for p-median problems. J. Comb. Optim. 21(3): 348-363 (2011) - Vikraman Arvind, T. C. Vijayaraghavan
:
The orbit problem is in the GapL hierarchy. J. Comb. Optim. 21(1): 124-137 (2011) - Hend Bouziri, Khaled Mellouli, El-Ghazali Talbi:
The k-coloring fitness landscape. J. Comb. Optim. 21(3): 306-329 (2011) - Sheng-Yi Cai, Qi-Fan Yang:
Semi-online scheduling on two uniform machines with the known largest size. J. Comb. Optim. 21(4): 393-408 (2011) - Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster:
Hardness and algorithms for rainbow connection. J. Comb. Optim. 21(3): 330-347 (2011) - Yi-Ching Chen, Kun-Mao Chao
:
On the generalized constrained longest common subsequence problems. J. Comb. Optim. 21(3): 383-392 (2011) - Wenbin Chen, Matthew C. Schmidt, Nagiza F. Samatova:
On the parameterized complexity of the Multi-MCT and Multi-MCST problems. J. Comb. Optim. 21(2): 151-158 (2011) - Guantao Chen, Xingxing Yu, Wenan Zang:
Approximating the chromatic index of multigraphs. J. Comb. Optim. 21(2): 219-246 (2011) - Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté:
Compact labelings for efficient first-order model-checking. J. Comb. Optim. 21(1): 19-46 (2011) - György Dósa, Maria Grazia Speranza
, Zsolt Tuza:
Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling. J. Comb. Optim. 21(4): 458-480 (2011) - Luis A. Dupont, Rafael H. Villarreal
:
Algebraic and combinatorial properties of ideals and algebras of uniform clutters of TDI systems. J. Comb. Optim. 21(3): 269-292 (2011) - Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami
:
Bounding the total domination subdivision number of a graph in terms of its order. J. Comb. Optim. 21(2): 209-218 (2011) - Hiroshi Fujiwara, Kazuo Iwama, Yoshiyuki Sekiguchi:
Average-case competitive analyses for one-way trading. J. Comb. Optim. 21(1): 83-107 (2011) - Xiaodong Hu, Jie Wang:
Preface. J. Comb. Optim. 21(1): 1 (2011) - Frank K. Hwang, Uriel G. Rothblum:
On the number of separable partitions. J. Comb. Optim. 21(4): 423-433 (2011) - Naoyuki Kamiyama, Naoki Katoh:
Covering directed graphs by in-trees. J. Comb. Optim. 21(1): 2-18 (2011) - Deying Li, Qinghua Zhu:
Approximation algorithms for multicast routing in ad hoc wireless networks. J. Comb. Optim. 21(3): 293-305 (2011) - Chen Liao, Shiyan Hu:
Approximation scheme for restricted discrete gate sizing targeting delay minimization. J. Comb. Optim. 21(4): 497-510 (2011) - Ming Liu
, Chengbin Chu
, Yinfeng Xu, Feifeng Zheng:
Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times. J. Comb. Optim. 21(1): 138-149 (2011) - Longcheng Liu, Biao Wu, Enyu Yao:
Minimizing the sum cost in linear extensions of a poset. J. Comb. Optim. 21(2): 247-253 (2011) - Steve Lu, Daniel Manchala, Rafail Ostrovsky:
Visual cryptography on graphs. J. Comb. Optim. 21(1): 47-66 (2011) - Bin Ma, Louxin Zhang:
Efficient estimation of the accuracy of the maximum likelihood method for ancestral state reconstruction. J. Comb. Optim. 21(4): 409-422 (2011) - Ehab Morsy
, Hiroshi Nagamochi:
Approximating capacitated tree-routings in networks. J. Comb. Optim. 21(2): 254-267 (2011) - Hung Q. Ngo, Anh Le, Yang Wang:
A linear programming duality approach to analyzing strictly nonblocking d-ary multilog networks under general crosstalk constraints. J. Comb. Optim. 21(1): 108-123 (2011) - Steffen Rebennack
, Marcus Oswald, Dirk Oliver Theis, Hanna Seitz, Gerhard Reinelt, Panos M. Pardalos:
A Branch and Cut solver for the maximum stable set problem. J. Comb. Optim. 21(4): 434-457 (2011) - Danny Segev:
Approximating k-generalized connectivity via collapsing HSTs. J. Comb. Optim. 21(3): 364-382 (2011) - Haitao Wang, Amitabh Chaudhary, Danny Z. Chen:
New algorithms for online rectangle filling with k-lookahead. J. Comb. Optim. 21(1): 67-82 (2011) - Haoli Wang, Xirong Xu, Yuansheng Yang, Kai Lü:
On the distance paired domination of generalized Petersen graphs P(n, 1) and P(n, 2). J. Comb. Optim. 21(4): 481-496 (2011) - Peng Zhang, Jin-yi Cai, Linqing Tang, Wenbo Zhao:
Approximation and hardness results for label cut and related problems. J. Comb. Optim. 21(2): 192-208 (2011) - Shuo Zhang, Xiaofeng Gao, Weili Wu, Jianzhong Li, Hong Gao:
Efficient algorithms for supergraph query processing on graph databases. J. Comb. Optim. 21(2): 159-191 (2011)
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-08-26 16:29 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