:facetid:toc:\"db/journals/jco/jco22.bht\"OK:facetid:toc:db/journals/jco/jco22.bhtMarwan Al-JubehMichael Hoffmann 0001Mashhood IshaqueDiane L. SouvaineCsaba D. TóthConvex partitions with 2-edge connected dual graphs.J. Comb. Optim.223409-4252011Journal Articlesclosedjournals/jco/Al-JubehHIST1110.1007/S10878-010-9310-1https://doi.org/10.1007/s10878-010-9310-1https://dblp.org/rec/journals/jco/Al-JubehHIST11URL#4581380Yuichi AsahiroJesper Jansson 0001Eiji MiyanoHirotaka Ono 0001Kouhei ZenmyoApproximation algorithms for the graph orientation minimizing the maximum weighted outdegree.J. Comb. Optim.22178-962011Journal Articlesclosedjournals/jco/AsahiroJMOZ1110.1007/S10878-009-9276-Zhttps://doi.org/10.1007/s10878-009-9276-zhttps://dblp.org/rec/journals/jco/AsahiroJMOZ11URL#4581383Sergey BeregJosé Miguel Díaz-BáñezPablo Pérez-LanteroInmaculada VenturaThe Maximum Box Problem for moving points in the plane.J. Comb. Optim.224517-5302011Journal Articlesclosedjournals/jco/BeregDPV1110.1007/S10878-010-9301-2https://doi.org/10.1007/s10878-010-9301-2https://dblp.org/rec/journals/jco/BeregDPV11URL#4581384Kenneth A. BermanChad YoshikawaWhy locally-fair maximal flows in client-server networks perform well.J. Comb. Optim.223426-4372011Journal Articlesclosedjournals/jco/BermanY1110.1007/S10878-010-9321-Yhttps://doi.org/10.1007/s10878-010-9321-yhttps://dblp.org/rec/journals/jco/BermanY11URL#4581385Ivona BezákováNayantara BhatnagarDana RandallOn the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries.J. Comb. Optim.223457-4682011Journal Articlesclosedjournals/jco/BezakovaBR1110.1007/S10878-010-9323-9https://doi.org/10.1007/s10878-010-9323-9https://dblp.org/rec/journals/jco/BezakovaBR11URL#4581386Vittorio BilòMichele FlamminiGianpiero MonacoLuca MoscardelliOn the performances of Nash equilibria in isolation games.J. Comb. Optim.223378-3912011Journal Articlesclosedjournals/jco/BiloFMM1110.1007/S10878-010-9300-3https://doi.org/10.1007/s10878-010-9300-3https://dblp.org/rec/journals/jco/BiloFMM11URL#4581387Paola BonizzoniGianluca Della VedovaRiccardo DondiAnonymizing binary and small tables is hard to approximate.J. Comb. Optim.22197-1192011Journal Articlesclosedjournals/jco/BonizzoniVD1110.1007/S10878-009-9277-Yhttps://doi.org/10.1007/s10878-009-9277-yhttps://dblp.org/rec/journals/jco/BonizzoniVD11URL#4581388Nikita BoykoTimofey TurkoVladimir BoginskiDavid E. JeffcoatStanislav UryasevGrigoriy ZrazhevskyPanos M. PardalosRobust multi-sensor scheduling for multi-site surveillance.J. Comb. Optim.22135-512011Journal Articlesclosedjournals/jco/BoykoTBJUZP1110.1007/S10878-009-9271-4https://doi.org/10.1007/s10878-009-9271-4https://dblp.org/rec/journals/jco/BoykoTBJUZP11URL#4581390Rainer E. BurkardRoswitha RissnerPolynomially solvable special cases of the quadratic bottleneck assignment problem.J. Comb. Optim.224845-8562011Journal Articlesclosedjournals/jco/BurkardR1110.1007/S10878-010-9333-7https://doi.org/10.1007/s10878-010-9333-7https://dblp.org/rec/journals/jco/BurkardR11URL#4581391Jin-yi CaiVinod YegneswaranChris AlfeldPaul BarfordHoneynet games: a game theoretic approach to defending network monitors.J. Comb. Optim.223305-3242011Journal Articlesclosedjournals/jco/CaiYAB1110.1007/S10878-009-9285-Yhttps://doi.org/10.1007/s10878-009-9285-yhttps://dblp.org/rec/journals/jco/CaiYAB11URL#4581393Joseph Wun-Tat ChanFrancis Y. L. ChinHing-Fung TingYong Zhang 0001Online tree node assignment with resource augmentation.J. Comb. Optim.223359-3772011Journal Articlesclosedjournals/jco/ChanCTZ1110.1007/S10878-010-9292-Zhttps://doi.org/10.1007/s10878-010-9292-zhttps://dblp.org/rec/journals/jco/ChanCTZ11URL#4581395Yu-Ki ChanMinming LiWeiwei Wu 0001Optimal tree structure with loyal users and batch updates.J. Comb. Optim.224630-6392011Journal Articlesclosedjournals/jco/ChanLW1110.1007/S10878-010-9312-Zhttps://doi.org/10.1007/s10878-010-9312-zhttps://dblp.org/rec/journals/jco/ChanLW11URL#4581396Huilan ChangHong-Bin ChenHung-Lin FuChie-Huai ShiReconstruction of hidden graphs and threshold group testing.J. Comb. Optim.222270-2812011Journal Articlesclosedjournals/jco/ChangCFS1110.1007/S10878-010-9291-0https://doi.org/10.1007/s10878-010-9291-0https://dblp.org/rec/journals/jco/ChangCFS11URL#4581397Fei-Huang ChangHuilan ChangFrank K. HwangPooling designs for clone library screening in the inhibitor complex model.J. Comb. Optim.222145-1522011Journal Articlesclosedjournals/jco/ChangCH1110.1007/S10878-009-9279-9https://doi.org/10.1007/s10878-009-9279-9https://dblp.org/rec/journals/jco/ChangCH11URL#4581398Wanpracha Art ChaovalitwongseCarlos A. S. OliveiraBruno ChiariniPanos M. PardalosMauricio G. C. ResendeRevised GRASP with path-relinking for the linear ordering problem.J. Comb. Optim.224572-5932011Journal Articlesclosedjournals/jco/ChaovalitwongseOCPR1110.1007/S10878-010-9306-Xhttps://doi.org/10.1007/s10878-010-9306-xhttps://dblp.org/rec/journals/jco/ChaovalitwongseOCPR11URL#4581399Yam Ki CheungOvidiu DaescuLine facility location in weighted regions.J. Comb. Optim.22152-702011Journal Articlesclosedjournals/jco/CheungD1110.1007/S10878-009-9272-3https://doi.org/10.1007/s10878-009-9272-3https://dblp.org/rec/journals/jco/CheungD11URL#4581403Byung-Cheon ChoiJoseph Y.-T. LeungMichael L. PinedoMinimizing makespan in an ordered flow shop with machine-dependent processing times.J. Comb. Optim.224797-8182011Journal Articlesclosedjournals/jco/ChoiLP1110.1007/S10878-010-9330-Xhttps://doi.org/10.1007/s10878-010-9330-xhttps://dblp.org/rec/journals/jco/ChoiLP11URL#4581404Marie-Christine CostaDominique de WerraChristophe PicouleauMinimum d-blockers and d-transversals in graphs.J. Comb. Optim.224857-8722011Journal Articlesclosedjournals/jco/CostaWP1110.1007/S10878-010-9334-6https://doi.org/10.1007/s10878-010-9334-6https://dblp.org/rec/journals/jco/CostaWP11URL#4581405Stefan S. DantchevTom FriedetzkyLars Nagel 0001Sublinear-time algorithms for tournament graphs.J. Comb. Optim.223469-4812011Journal Articlesclosedjournals/jco/DantchevFN1110.1007/S10878-010-9325-7https://doi.org/10.1007/s10878-010-9325-7https://dblp.org/rec/journals/jco/DantchevFN11URL#4581407Karine DeschinkelSid Ahmed Ali TouatiSébastien BriaisSIRALINA: efficient two-steps heuristic for storage optimisation in single period task scheduling.J. Comb. Optim.224819-8442011Journal Articlesclosedjournals/jco/DeschinkelTB1110.1007/S10878-010-9332-8https://doi.org/10.1007/s10878-010-9332-8https://dblp.org/rec/journals/jco/DeschinkelTB11URL#4581408Scott DiehlDieter van MelkebeekRyan Williams 0001An improved time-space lower bound for tautologies.J. Comb. Optim.223325-3382011Journal Articlesclosedjournals/jco/DiehlMW1110.1007/S10878-009-9286-Xhttps://doi.org/10.1007/s10878-009-9286-xhttps://dblp.org/rec/journals/jco/DiehlMW11URL#4581409Paul DorbecMichael A. HenningUpper paired-domination in claw-free graphs.J. Comb. Optim.222235-2512011Journal Articlesclosedjournals/jco/DorbecH1110.1007/S10878-009-9275-0https://doi.org/10.1007/s10878-009-9275-0https://dblp.org/rec/journals/jco/DorbecH11URL#4581410Khaled M. ElbassioniKazuhisa MakinoImran RaufOn the readability of monotone Boolean formulae.J. Comb. Optim.223293-3042011Journal Articlesopenjournals/jco/ElbassioniMR1110.1007/S10878-009-9283-0https://doi.org/10.1007/s10878-009-9283-0https://dblp.org/rec/journals/jco/ElbassioniMR11URL#4581413Céline EngelbeenSamuel FioriniAntje KieselA closest vector problem arising in radiation therapy planning.J. Comb. Optim.224609-6292011Journal Articlesclosedjournals/jco/EngelbeenFK1110.1007/S10878-010-9308-8https://doi.org/10.1007/s10878-010-9308-8https://dblp.org/rec/journals/jco/EngelbeenFK11URL#4581414Leah EpsteinSven Oliver KrumkeAsaf LevinHeike SperberSelfish bin coloring.J. Comb. Optim.224531-5482011Journal Articlesclosedjournals/jco/EpsteinKLS1110.1007/S10878-010-9302-1https://doi.org/10.1007/s10878-010-9302-1https://dblp.org/rec/journals/jco/EpsteinKLS11URL#4581415Neng FanPanos M. PardalosA rearrangement of adjacency matrix based approach for solving the crossing minimization problem.J. Comb. Optim.224747-7622011Journal Articlesclosedjournals/jco/FanP1110.1007/S10878-010-9326-6https://doi.org/10.1007/s10878-010-9326-6https://dblp.org/rec/journals/jco/FanP11URL#4581416Lidan FanZhao Zhang 0002Wei Wang 0032PTAS for minimum weighted connected vertex cover problem with c-local condition in unit disk graphs.J. Comb. Optim.224663-6732011Journal Articlesclosedjournals/jco/FanZW1110.1007/S10878-010-9315-9https://doi.org/10.1007/s10878-010-9315-9https://dblp.org/rec/journals/jco/FanZW11URL#4581417Yang FangPeihai LiuXiwen LuOptimal on-line algorithms for one batch machine with grouped processing times.J. Comb. Optim.224509-5162011Journal Articlesclosedjournals/jco/FangLL1110.1007/S10878-010-9298-6https://doi.org/10.1007/s10878-010-9298-6https://dblp.org/rec/journals/jco/FangLL11URL#4581418Diana FanghänelOptimality conditions for a bilevel matroid problem.J. Comb. Optim.224594-6082011Journal Articlesclosedjournals/jco/Fanghanel1110.1007/S10878-010-9307-9https://doi.org/10.1007/s10878-010-9307-9https://dblp.org/rec/journals/jco/Fanghanel11URL#4581419Bin FuAngsheng LiLiyu ZhangSeparating NE from some nonuniform nondeterministic complexity classes.J. Comb. Optim.223482-4932011Journal Articlesclosedjournals/jco/FuLZ1110.1007/S10878-010-9327-5https://doi.org/10.1007/s10878-010-9327-5https://dblp.org/rec/journals/jco/FuLZ11URL#4581421