Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 32
Volume 32, Number 1, July 2016
- Jianer Chen, John E. Hopcroft:
Special Issue for FAW 2014. 1-2 - David A. Cohen, Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones:
Algorithms for the workflow satisfiability problem engineered for counting constraints. 3-24 - Quan Zu, Miaomiao Zhang, Bin Yu:
Dynamic matchings in left vertex weighted convex bipartite graphs. 25-50 - Wei Xu, Fuzhou Gong:
Performances of pure random walk algorithms on constraint satisfaction problems with growing domains. 51-66 - Qilong Feng, Qian Zhou, Jianxin Wang:
Kernelization and randomized Parameterized algorithms for Co-path Set problem. 67-78 - Yong Zhang, Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting, Deshi Ye, Feng Zhang, Jianyu Shi:
Constrained pairwise and center-star sequences alignment problems. 79-94 - Hao Chen, Zihan Lei, Tian Liu, Ziyang Tang, Chaoyi Wang, Ke Xu:
Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs. 95-110 - Feng Shi, Qilong Feng, Jie You, Jianxin Wang:
Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees. 111-143 - Longkun Guo:
Efficient approximation algorithms for computing k disjoint constrained shortest paths. 144-158 - Pawan Aurora
, Sumit Singh, Shashank K. Mehta:
Partial degree bounded edge packing problem for graphs and k-uniform hypergraphs. 159-173 - B. S. Panda, D. Pushparaj Shetty:
Strong minimum energy hierarchical topology in wireless sensor networks. 174-187 - Huijuan Wang, Bin Liu, Xin Zhang, Lidong Wu, Weili Wu, Hongwei Gao:
List edge and list total coloring of planar graphs with maximum degree 8. 188-197 - Marjan Marzban, Qian-Ping Gu, Xiaohua Jia:
New analysis and computational study for the planar connected dominating set problem. 198-225 - Dmitriy S. Malyshev:
A complexity dichotomy and a new boundary class for the dominating set problem. 226-243 - Yuehua Bu, Xia Lv:
2-Distance coloring of a planar graph without 3, 4, 7-cycles. 244-259 - Hui Jiang, Xueliang Li, Yingying Zhang:
Upper bounds for the total rainbow connection of graphs. 260-266 - Vadim E. Levit, Eugen Mandrescu:
Computing unique maximum matchings in O(m) time for König-Egerváry graphs and unicyclic graphs. 267-277 - Dongxiao Yu, Yuexuan Wang, Qiang-Sheng Hua, Jiguo Yu, Francis C. M. Lau:
Distributed wireless link scheduling in the SINR model. 278-292 - Lidong Wu:
On strongly planar 3SAT. 293-298 - Hossein Abdollahzadeh Ahangar, Leila Asgharsharghi, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Signed mixed Roman domination numbers in graphs. 299-317 - Shou-Jun Xu, Xiu-Song Liu, Wai Hong Chan, Heping Zhang:
Complete forcing numbers of primitive coronoids. 318-330
Volume 32, Number 2, August 2016
- Weidong Chen, Zhixiang Chen:
Introduction: Special issue dedicated to the memory of professor Wenqi Huang. 331-340 - Shayan Ehsani, MohammadAmin Fazli, Mohammad Ghodsi, MohammadAli Safari:
Optimal space coverage with white convex polygons. 341-353 - Nima Anari, MohammadAmin Fazli, Mohammad Ghodsi, MohammadAli Safari:
Euclidean movement minimization. 354-367 - Taoqing Zhou, Zhipeng Lü, Yang Wang, Junwen Ding, Bo Peng:
Multi-start iterated tabu search for the minimum weight vertex cover problem. 368-384 - Qijia Liu, Jinjiang Yuan:
Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness. 385-395 - Zhaoyang Yang, Guojun Zhang, Haiping Zhu:
Multi-neighborhood based path relinking for two-sided assembly line balancing problem. 396-415 - Lei Wang, Aihua Yin:
A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang. 416-444 - Xinyun Wu, Shengfeng Yan, Xin Wan, Zhipeng Lü:
Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem. 445-468 - Yi Zhou, Jin-Kao Hao, Adrien Goëffon:
A three-phased local search approach for the clique partitioning problem. 469-491 - Can Huang, Defu Zhang, Yain-Whar Si, Stephen C. H. Leung:
Tabu search for the real-world carpooling problem. 492-512 - Defu Zhang, Yuxin Che, Furong Ye, Yain-Whar Si, Stephen C. H. Leung:
A hybrid algorithm based on variable neighbourhood for the strip packing problem. 513-530 - Yang Wang, Jin-Kao Hao, Fred W. Glover, Zhipeng Lü, Qinghua Wu:
Solving the maximum vertex weight clique problem via binary quadratic programming. 531-549 - Guihua Huang, Meijun Kuang, Hanyuan Deng:
The expected values of Hosoya index and Merrifield-Simmons index in a random polyphenylene chain. 550-562 - Geng Lin, Wenxing Zhu, M. Montaz Ali:
An effective discrete dynamic convexized method for solving the winner determination problem. 563-593 - Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung:
An O∗(1.4366n)-time exact algorithm for maximum P2-packing in cubic graphs. 594-607 - Fu-Tao Hu, Moo Young Sohn, Xue-Gang Chen:
Total and paired domination numbers of Cm bundles over a cycle Cn. 608-625 - Jihui Wang, Qiaoling Ma, Xue Han, Xiuyun Wang:
A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles. 626-638 - Robert Scheidweiler, Eberhard Triesch:
A note on the duality between matchings and vertex covers in balanced hypergraphs. 639-644 - Wei Dong, Wensong Lin:
An improved bound on 2-distance coloring plane graphs with girth 5. 645-655
Volume 32, Number 3, October 2016
- Ágnes Cseh, Brian C. Dean:
Improved algorithmic results for unsplittable stable allocation problems. 657-671 - Amine Lamine, Mahdi Khemakhem, Brahim Hnich, Habib Chabchoub:
Solving constrained optimization problems by solution-based decomposition search. 672-695 - Huiling Zhang, Yilin Shen, My T. Thai:
Robustness of power-law networks: its assessment and optimization. 696-720 - Ali Dehghan:
On strongly planar not-all-equal 3SAT. 721-724 - Shasha Ma, Liancui Zuo:
Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs. 725-740 - Honghai Li, Jia-Yu Shao, Liqun Qi:
The extremal spectral radii of k -uniform supertrees. 741-764 - Daphne Der-Fen Liu, Xuding Zhu:
A combinatorial proof for the circular chromatic number of Kneser graphs. 765-774 - Manouchehr Zaker, Hossein Soltani:
First-Fit colorings of graphs with no cycles of a prescribed even length. 775-783 - Shi-Sheng Li, Ren-Xia Chen, Qi Feng:
Scheduling two job families on a single machine with two competitive agents. 784-799 - Mohammad J. Nadjafi-Arani, Mark H. Siggers, Hossein Soltani:
Characterisation of forests with trivial game domination numbers. 800-811 - Mohan Li, Jianzhong Li:
A minimized-rule based approach for improving data currency. 812-841 - Sabine Büttner, Sven O. Krumke:
The Canadian Tour Operator Problem on paths: tight bounds and resource augmentation. 842-854 - Lutz Volkmann:
Signed total Roman domination in graphs. 855-871 - Kien Trung Nguyen, Ali Reza Sepasian:
The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance. 872-884 - Natashia Boland, Thomas Kalinowski, Simranjit Kaur:
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period. 885-905 - Cunquan Qu, Guanghui Wang, Guiying Yan, Xiaowei Yu:
Neighbor sum distinguishing total choosability of planar graphs. 906-916 - Mehdi Ghiyasvand, Iman Keshtkar:
Finding a contra-risk path between two nodes in undirected graphs. 917-926 - Min Chen, André Raspaud, Weifan Wang:
A (3, 1) ∗-choosable theorem on planar graphs. 927-940 - Huiqiu Lin, Jinlong Shu, Baoyindureng Wu:
Maximum size of digraphs with some parameters. 941-950 - Han Xiao:
Packing feedback arc sets in reducible flow graphs. 951-959 - Qiang Zhu, Guodong Guo, Wenliang Tang, Cun-Quan Zhang:
A diagnosis algorithm by using graph-coloring under the PMC model. 960-969 - Imed Kacem, Hans Kellerer, Maryam Seifaddini:
Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval. 970-981
Volume 32, Number 4, November 2016
- Zhipeng Cai, Chaokun Wang, Anu G. Bourgeois:
Preface: Special issue on computing and combinatorics conference and wireless algorithms, systems, and applications conference. 983-984 - Ran Bi, Jianzhong Li, Hong Gao, Yingshu Li:
(α, τ) -Monitoring for event detection in wireless sensor networks. 985-1001 - Jing Gao, Jianzhong Li, Yingshu Li:
Approximate event detection over multi-modal sensing data. 1002-1016 - Chenchen Wu, Dachuan Xu, Donglei Du, Wen-qing Xu:
An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding. 1017-1035 - Vittorio Bilò, Mauro Paladini:
On the performance of mildly greedy players in cut games. 1036-1051 - Cui Wang, Jiguo Yu, Dongxiao Yu, Baogui Huang, Shanshan Yu:
An improved approximation algorithm for the shortest link scheduling in wireless networks under SINR and hypergraph models. 1052-1067 - Yan Zhang, Hongzhi Wang, Hong Gao, Jianzhong Li:
Efficient accuracy evaluation for multi-modal sensed data. 1068-1088 - Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth:
Directed Steiner trees with diffusion costs. 1089-1106 - Tim Wylie, Michael A. Schuh, Rafal A. Angryk:
Enabling high-dimensional range queries using kNN indexing techniques: approaches and empirical results. 1107-1132 - Farzad Farnoud, Eitan Yaakobi, Jehoshua Bruck:
Approximate sorting of data streams with limited storage. 1133-1164 - Zhaoming Yin, Jijun Tang, Stephen W. Schaeffer, David A. Bader:
Exemplar or matching: modeling DCJ problems with unequal content genome data. 1165-1181 - Akira Suzuki, Amer E. Mouawad, Naomi Nishimura:
Reconfiguration of dominating sets. 1182-1195 - Zhao Zhang:
Editorial for Special Issue: COCOA2014. 1196 - Sebastian Abshoff, Peter Kling, Christine Markarian, Friedhelm Meyer auf der Heide, Peter Pietrzyk:
Towards the price of leasing online. 1197-1216 - Liang Song, Hejiao Huang, Hongwei Du:
Approximation schemes for Euclidean vehicle routing problems with time windows. 1217-1231 - Barbara M. Anthony, Christine Chung:
Serve or skip: the power of rejection in online bottleneck matching. 1232-1253 - Annalisa De Bonis:
Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing. 1254-1287 - Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad, Xiao Zhou:
The minimum vulnerability problem on specific graph classes. 1288-1304 - Naoyuki Kamiyama:
The popular matching and condensation problems under matroid constraints. 1305-1326 - Dimitri Watel, Marc-Antoine Weisser:
A practical greedy approximation for the directed Steiner tree problem. 1327-1370 - Kolos Csaba Ágoston, Péter Biró, Iain McBride:
Integer programming methods for special college admissions problems. 1371-1399
a service of 
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.
last updated on 2024-04-26 18:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
