:facetid:toc:\"db/journals/jco/jco21.bht\"OK:facetid:toc:db/journals/jco/jco21.bhtBader F. AlBdaiwiDiptesh GhoshBoris GoldengorinData aggregation for p-median problems.J. Comb. Optim.213348-3632011Journal Articlesclosedjournals/jco/AlBdaiwiGG1110.1007/S10878-009-9251-8https://doi.org/10.1007/s10878-009-9251-8https://dblp.org/rec/journals/jco/AlBdaiwiGG11URL#4583302Vikraman ArvindT. C. VijayaraghavanThe orbit problem is in the GapL hierarchy.J. Comb. Optim.211124-1372011Journal Articlesclosedjournals/jco/ArvindV1110.1007/S10878-009-9243-8https://doi.org/10.1007/s10878-009-9243-8https://dblp.org/rec/journals/jco/ArvindV11URL#4583303Hend BouziriKhaled MellouliEl-Ghazali TalbiThe k-coloring fitness landscape.J. Comb. Optim.213306-3292011Journal Articlesclosedjournals/jco/BouziriMT1110.1007/S10878-009-9249-2https://doi.org/10.1007/s10878-009-9249-2https://dblp.org/rec/journals/jco/BouziriMT11URL#4583310Sheng-Yi CaiQi-Fan YangSemi-online scheduling on two uniform machines with the known largest size.J. Comb. Optim.214393-4082011Journal Articlesclosedjournals/jco/CaiY1110.1007/S10878-009-9254-5https://doi.org/10.1007/s10878-009-9254-5https://dblp.org/rec/journals/jco/CaiY11URL#4583313Sourav Chakraborty 0001Eldar FischerArie MatsliahRaphael YusterHardness and algorithms for rainbow connection.J. Comb. Optim.213330-3472011Journal Articlesclosedjournals/jco/ChakrabortyFMY1110.1007/S10878-009-9250-9https://doi.org/10.1007/s10878-009-9250-9https://dblp.org/rec/journals/jco/ChakrabortyFMY11URL#4583315Yi-Ching ChenKun-Mao ChaoOn the generalized constrained longest common subsequence problems.J. Comb. Optim.213383-3922011Journal Articlesclosedjournals/jco/ChenC1110.1007/S10878-009-9262-5https://doi.org/10.1007/s10878-009-9262-5https://dblp.org/rec/journals/jco/ChenC11URL#4583321Wenbin Chen 0003Matthew C. SchmidtNagiza F. SamatovaOn the parameterized complexity of the Multi-MCT and Multi-MCST problems.J. Comb. Optim.212151-1582011Journal Articlesclosedjournals/jco/ChenSS1110.1007/S10878-009-9220-2https://doi.org/10.1007/s10878-009-9220-2https://dblp.org/rec/journals/jco/ChenSS11URL#4583322Guantao ChenXingxing YuWenan ZangApproximating the chromatic index of multigraphs.J. Comb. Optim.212219-2462011Journal Articlesclosedjournals/jco/ChenYZ1110.1007/S10878-009-9232-Yhttps://doi.org/10.1007/s10878-009-9232-yhttps://dblp.org/rec/journals/jco/ChenYZ11URL#4583323Bruno CourcelleCyril GavoilleMamadou Moustapha KantéCompact labelings for efficient first-order model-checking.J. Comb. Optim.21119-462011Journal Articlesclosedjournals/jco/CourcelleGK1110.1007/S10878-009-9260-7https://doi.org/10.1007/s10878-009-9260-7https://dblp.org/rec/journals/jco/CourcelleGK11URL#4583327György DósaMaria Grazia SperanzaZsolt TuzaTwo uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling.J. Comb. Optim.214458-4802011Journal Articlesclosedjournals/jco/DosaST1110.1007/S10878-009-9265-2https://doi.org/10.1007/s10878-009-9265-2https://dblp.org/rec/journals/jco/DosaST11URL#4583332Luis A. DupontRafael H. VillarrealAlgebraic and combinatorial properties of ideals and algebras of uniform clutters of TDI systems.J. Comb. Optim.213269-2922011Journal Articlesclosedjournals/jco/DupontV1110.1007/S10878-009-9244-7https://doi.org/10.1007/s10878-009-9244-7https://dblp.org/rec/journals/jco/DupontV11URL#4583333Odile FavaronHossein Karami 0002Seyed Mahmoud SheikholeslamiBounding the total domination subdivision number of a graph in terms of its order.J. Comb. Optim.212209-2182011Journal Articlesclosedjournals/jco/FavaronKS1110.1007/S10878-009-9224-Yhttps://doi.org/10.1007/s10878-009-9224-yhttps://dblp.org/rec/journals/jco/FavaronKS11URL#4583341Hiroshi FujiwaraKazuo IwamaYoshiyuki SekiguchiAverage-case competitive analyses for one-way trading.J. Comb. Optim.21183-1072011Journal Articlesclosedjournals/jco/FujiwaraIS1110.1007/S10878-009-9239-4https://doi.org/10.1007/s10878-009-9239-4https://dblp.org/rec/journals/jco/FujiwaraIS11URL#4583343Xiaodong Hu 0001Jie WangPreface.J. Comb. Optim.21112011Journal Articlesclosedjournals/jco/HuW1110.1007/S10878-010-9361-3https://doi.org/10.1007/s10878-010-9361-3https://dblp.org/rec/journals/jco/HuW11URL#4583351Frank K. HwangUriel G. RothblumOn the number of separable partitions.J. Comb. Optim.214423-4332011Journal Articlesclosedjournals/jco/HwangR1110.1007/S10878-009-9263-4https://doi.org/10.1007/s10878-009-9263-4https://dblp.org/rec/journals/jco/HwangR11URL#4583352Naoyuki KamiyamaNaoki KatohCovering directed graphs by in-trees.J. Comb. Optim.2112-182011Journal Articlesclosedjournals/jco/KamiyamaK1110.1007/S10878-009-9242-9https://doi.org/10.1007/s10878-009-9242-9https://dblp.org/rec/journals/jco/KamiyamaK11URL#4583353Deying Li 0001Qinghua ZhuApproximation algorithms for multicast routing in ad hoc wireless networks.J. Comb. Optim.213293-3052011Journal Articlesclosedjournals/jco/LiZ1110.1007/S10878-009-9245-6https://doi.org/10.1007/s10878-009-9245-6https://dblp.org/rec/journals/jco/LiZ11URL#4583356Chen LiaoShiyan HuApproximation scheme for restricted discrete gate sizing targeting delay minimization.J. Comb. Optim.214497-5102011Journal Articlesclosedjournals/jco/LiaoH1110.1007/S10878-009-9267-0https://doi.org/10.1007/s10878-009-9267-0https://dblp.org/rec/journals/jco/LiaoH11URL#4583357Ming Liu 0008Chengbin ChuYinfeng XuFeifeng ZhengSemi-online scheduling on 2 machines under a grade of service provision with bounded processing times.J. Comb. Optim.211138-1492011Journal Articlesclosedjournals/jco/LiuCXZ1110.1007/S10878-009-9231-Zhttps://doi.org/10.1007/s10878-009-9231-zhttps://dblp.org/rec/journals/jco/LiuCXZ11URL#4583360Longcheng LiuBiao Wu 0004Enyu YaoMinimizing the sum cost in linear extensions of a poset.J. Comb. Optim.212247-2532011Journal Articlesclosedjournals/jco/LiuWY1110.1007/S10878-009-9237-6https://doi.org/10.1007/s10878-009-9237-6https://dblp.org/rec/journals/jco/LiuWY11URL#4583363Steve Lu 0001Daniel ManchalaRafail OstrovskyVisual cryptography on graphs.J. Comb. Optim.21147-662011Journal Articlesclosedjournals/jco/LuMO1110.1007/S10878-009-9241-Xhttps://doi.org/10.1007/s10878-009-9241-xhttps://dblp.org/rec/journals/jco/LuMO11URL#4583365Bin Ma 0002Louxin ZhangEfficient estimation of the accuracy of the maximum likelihood method for ancestral state reconstruction.J. Comb. Optim.214409-4222011Journal Articlesclosedjournals/jco/MaZ1110.1007/S10878-009-9261-6https://doi.org/10.1007/s10878-009-9261-6https://dblp.org/rec/journals/jco/MaZ11URL#4583367Ehab MorsyHiroshi NagamochiApproximating capacitated tree-routings in networks.J. Comb. Optim.212254-2672011Journal Articlesclosedjournals/jco/MorsyN1110.1007/S10878-009-9238-5https://doi.org/10.1007/s10878-009-9238-5https://dblp.org/rec/journals/jco/MorsyN11URL#4583371Hung Q. Ngo 0001Anh LeYang Wang 0014A linear programming duality approach to analyzing strictly nonblocking d-ary multilog networks under general crosstalk constraints.J. Comb. Optim.211108-1232011Journal Articlesclosedjournals/jco/NgoLW1110.1007/S10878-009-9240-Yhttps://doi.org/10.1007/s10878-009-9240-yhttps://dblp.org/rec/journals/jco/NgoLW11URL#4583372Steffen RebennackMarcus OswaldDirk Oliver TheisHanna SeitzGerhard ReineltPanos M. PardalosA Branch and Cut solver for the maximum stable set problem.J. Comb. Optim.214434-4572011Journal Articlesclosedjournals/jco/RebennackOTSRP1110.1007/S10878-009-9264-3https://doi.org/10.1007/s10878-009-9264-3https://dblp.org/rec/journals/jco/RebennackOTSRP11URL#4583375Danny SegevApproximating k-generalized connectivity via collapsing HSTs.J. Comb. Optim.213364-3822011Journal Articlesclosedjournals/jco/Segev1110.1007/S10878-009-9256-3https://doi.org/10.1007/s10878-009-9256-3https://dblp.org/rec/journals/jco/Segev11URL#4583376Haitao Wang 0001Amitabh ChaudharyDanny Z. ChenNew algorithms for online rectangle filling with k-lookahead.J. Comb. Optim.21167-822011Journal Articlesclosedjournals/jco/WangCC1110.1007/S10878-009-9246-5https://doi.org/10.1007/s10878-009-9246-5https://dblp.org/rec/journals/jco/WangCC11URL#4583379Haoli WangXirong XuYuansheng YangKai LüOn the distance paired domination of generalized Petersen graphs P(n, 1) and P(n, 2).J. Comb. Optim.214481-4962011Journal Articlesclosedjournals/jco/WangXYL1110.1007/S10878-009-9266-1https://doi.org/10.1007/s10878-009-9266-1https://dblp.org/rec/journals/jco/WangXYL11URL#4583380Peng Zhang 0008Jin-yi CaiLinqing TangWenbo Zhao 0001Approximation and hardness results for label cut and related problems.J. Comb. Optim.212192-2082011Journal Articlesclosedjournals/jco/ZhangCTZ1110.1007/S10878-009-9222-0https://doi.org/10.1007/s10878-009-9222-0https://dblp.org/rec/journals/jco/ZhangCTZ11URL#4583384Shuo ZhangXiaofeng Gao 0001Weili Wu 0001Jianzhong Li 0001Hong Gao 0001Efficient algorithms for supergraph query processing on graph databases.J. Comb. Optim.212159-1912011Journal Articlesclosedjournals/jco/ZhangGWLG1110.1007/S10878-009-9221-1https://doi.org/10.1007/s10878-009-9221-1https://dblp.org/rec/journals/jco/ZhangGWLG11URL#4583385