default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 35
Volume 35, Number 1, January 2018
- Xiaohan Cheng, Jianliang Wu:
The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven. 1-13 - Wayne Goddard, Michael A. Henning
:
A note on domination and total domination in prisms. 14-20 - Vahan Mkrtchyan, Hovhannes Sargsyan:
A tight lower bound for the hardness of clutters. 21-25 - Zhengxing Zou, Qiang Zhang:
Harsanyi power solution for games with restricted cooperation. 26-47 - Shufei Wu, Jianfeng Hou:
Partitioning dense uniform hypergraphs. 48-63 - Guoliang Hao, Jianguo Qian:
Bounds on the domination number of a digraph. 64-74 - Zepeng Li, Zehui Shao, Jin Xu:
Weak {2}-domination number of Cartesian products of cycles. 75-85 - Hui Lei, Shasha Li, Henry Liu, Yongtang Shi:
Rainbow vertex connection of digraphs. 86-107 - Weiya Zhong, Yun Shi:
Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility. 108-125 - Jafar Amjadi, Seyed Mahmoud Sheikholeslami, Marzieh Soroudi:
Nordhaus-Gaddum bounds for total Roman domination. 126-133 - J. John, K. Uma Samundesvari:
Total and forcing total edge-to-vertex monophonic number of a graph. 134-147 - Jun Guo, Jun Liu:
Deterministic construction of compressed sensing matrices based on semilattices. 148-161 - Jing Chen, Genghua Fan:
Large even factors of graphs. 162-169 - Dmitry Dagaev, Alex Suzdaltsev:
Competitive intensity and quality maximizing seedings in knock-out tournaments. 170-188 - Yijie Han, Sanjeev Saxena:
Algorithms for testing occurrences of length 4 patterns in permutations. 189-208 - Weili Wu, Hongwei Du, Huijuan Wang, Lidong Wu, Zhenhua Duan, Cong Tian:
On general threshold and general cascade models of social influence. 209-215 - Jidan Huang, Feifeng Zheng, Yinfeng Xu, Ming Liu:
Online MapReduce processing on two identical parallel machines. 216-223 - Raka Jovanovic, Abdelkader Bousselham, Stefan Voß:
Partitioning of supply/demand graphs with capacity limitations: an ant colony approach. 224-249 - Arman Boyaci, Tínaz Ekim, Mordechai Shalom:
The maximum cardinality cut problem in co-bipartite chain graphs. 250-265 - Tianji Yang, Chao Fu, Xinbao Liu, Jun Pei, Lin Liu, Panos M. Pardalos:
Closed-loop supply chain inventory management with recovery information of reusable containers. 266-292 - Yan Zhao, Liping Chen, Gang Xie, Jianjun Zhao, Jianwan Ding:
GPU implementation of a cellular genetic algorithm for scheduling dependent tasks of physical system simulation programs. 293-317 - Xianzhao Zhang, Dachuan Xu, Donglei Du, Chenchen Wu:
Approximation algorithms for precedence-constrained identical machine scheduling with rejection. 318-330
Volume 35, Number 2, February 2018
- Xiaozhou He, Yinfeng Xu:
The longest commonly positioned increasing subsequences problem. 331-340 - Zofia Stepien, Lucjan Szymaszkiewicz:
Arcs in ℤ2p2. 341-349 - József Békési, Gábor Galambos:
Tight bounds for NF-based bounded-space online bin packing algorithms. 350-364 - Hua Cai, Jianliang Wu, Lin Sun:
Vertex arboricity of planar graphs without intersecting 5-cycles. 365-372 - Borut Luzar, Mirko Petrusevski, Riste Skrekovski:
On vertex-parity edge-colorings. 373-388 - K. Subramani, Piotr Wojciechowski:
A certifying algorithm for lattice point feasibility in a system of UTVPI constraints. 389-408 - Lu Han, Dachuan Xu, Donglei Du, Dongmei Zhang:
A local search approximation algorithm for the uniform capacitated k-facility location problem. 409-423 - Changhong Lu, Bing Wang, Kan Wang:
Algorithm complexity of neighborhood total domination and (ρ, γnt)-graphs. 424-435 - Ante Custic, Abraham P. Punnen:
A characterization of linearizable instances of the quadratic minimum spanning tree problem. 436-453 - Junlei Zhu, Yuehua Bu, Yun Dai:
Upper bounds for adjacent vertex-distinguishing edge coloring. 454-462 - Wayne Goddard, Robert Melville:
Properly colored trails, paths, and bridges. 463-472 - Rupaj Kumar Nayak, Mahendra Prasad Biswal:
A low complexity semidefinite relaxation for large-scale MIMO detection. 473-492 - Yanjun Jiang, Dachuan Xu, Donglei Du, Chenchen Wu, Dongmei Zhang:
An approximation algorithm for soft capacitated k-facility location problem. 493-511 - Ananya Christman, William Forcier, Aayam Poudel:
From theory to practice: maximizing revenues for on-line dial-a-ride. 512-529 - Ling Gai, Guochuan Zhang:
Online lazy bureaucrat scheduling with a machine deadline. 530-537 - Yi Xu, Jigen Peng, Wencheng Wang, Binhai Zhu:
The connected disk covering problem. 538-554 - Haiying Wang, Jianliang Wu:
List-edge-coloring of planar graphs without 6-cycles with three chords. 555-562 - Sylvain Béal, Anna B. Khmelnitskaya, Philippe Solal:
Two-step values for games with two-level communication structure. 563-587 - Biao Wu, Yuejian Peng:
Two extremal problems related to orders. 588-612 - Dinabandhu Pradhan, Anupriya Jha:
On computing a minimum secure dominating set in block graphs. 613-631 - Qingqin Nong, Tao Sun, T. C. E. Cheng, Qizhi Fang:
Bin packing game with a price of anarchy of 3/2. 632-640 - Piotr Borowiecki:
Computational aspects of greedy partitioning of graphs. 641-665
Volume 35, Number 3, April 2018
- Guiqing Zhang, Yongxi Cheng, Yinfeng Xu:
A randomized competitive group testing procedure. 667-683 - Costas K. Constantinou, Georgios Ellinas:
Minimal path decomposition of complete bipartite graphs. 684-702 - L. Bayón, Pedro Fortuny Ayuso, J. M. Grau, Antonio M. Oller-Marcén, M. M. Ruiz:
The Best-or-Worst and the Postdoc problems. 703-723 - Qizhong Lin, Yusheng Li:
Sparse multipartite graphs as partition universal for graphs with bounded degree. 724-739 - Xing Feng, Lianzhu Zhang, Mingzu Zhang:
An O(|E(G)|2) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs. 740-753 - Hao Hu, Renata Sotirov:
Special cases of the quadratic shortest path problem. 754-777 - You Lu, Chuandong Xu, Zhengke Miao:
Neighbor sum distinguishing list total coloring of subcubic graphs. 778-793 - Asaf Levin, Aleksander Vainer:
Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem. 794-813 - Chunmei Luo, Liancui Zuo, Philip B. Zhang:
The Wiener index of Sierpiński-like graphs. 814-841 - Ivan Belik, Kurt Jörnsten:
Critical objective function values in linear sum assignment problems. 842-852 - Jan Hackfeld, Arie M. C. A. Koster:
The matching extension problem in general graphs is co-NP-complete. 853-859 - Chenchen Fu, Vincent Chau, Minming Li, Chun Jason Xue:
Race to idle or not: balancing the memory sleep time with DVS for energy minimization. 860-894 - Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti, Pierre-Louis Poirion, Baruch Schieber, Hadas Shachnai:
Complexity and inapproximability results for the Power Edge Set problem. 895-905 - Laihao Ding, Guanghui Wang, Jianliang Wu:
Generalized acyclic edge colorings via entropy compression. 906-920 - Mohammad A. Raayatpanah, Panos M. Pardalos:
Reliability evaluation of a multicast over coded packet networks. 921-940 - Huili Zhang, Yinfeng Xu:
Online covering salesman problem. 941-954 - Zhi-Zhong Chen, Youta Harada, Fei Guo, Lusheng Wang:
An approximation algorithm for maximum internal spanning tree. 955-979 - Weifan Wang, Tingting Wu, Xiaoxue Hu, Yiqiao Wang:
Planar graphs without chordal 5-cycles are 2-good. 980-996
Volume 35, Number 4, May 2018
- Xiaoling Ma, Baoyindureng Wu, Xian'an Jin:
Edge-disjoint spanning trees and the number of maximum state circles of a graph. 997-1008 - Babak Moazzez, Hossein Soltani:
Integer programming approach to static monopolies in graphs. 1009-1041 - Dániel Gerbner, Máté Vizer:
Smart elements in combinatorial group testing problems. 1042-1060 - Francisco J. Aragón Artacho, Rubén Campoy, Ilias S. Kotsireas, Matthew K. Tam:
A feasibility approach for constructing combinatorial designs of circulant type. 1061-1085 - Srinath Doss, Roselyn Kaondera-Shava:
An optimal Tate pairing computation using Jacobi quartic elliptic curves. 1086-1103 - Ming-Zhu Chen, Xiao-Dong Zhang:
The number of edges, spectral radius and Hamilton-connectedness of graphs. 1104-1127 - Dmitry V. Gribanov, Dmitriy S. Malyshev, Panos M. Pardalos, Sergey I. Veselov:
FPT-algorithms for some problems related to integer programming. 1128-1146 - Wensong Lin, Chenli Shen:
Channel assignment problem and n-fold t-separated L(j1, j2, ... , jm) -labeling of graphs. 1147-1167 - Dongmei Zhang, Dachuan Xu, Yishui Wang, Peng Zhang, Zhenning Zhang:
A local search approximation algorithm for a squared metric k-facility location problem. 1168-1184 - Weimin Ma, Wei Shao, Xiaodong Ji:
Dynamic work hour optimization for casual workers. 1185-1201 - Canh V. Pham, My T. Thai, Hieu V. Duong, Bao Q. Bui, Huan X. Hoang:
Maximizing misinformation restriction within time and budget constraints. 1202-1240 - Xinzhong Lv, Rongxing Xu, Xuding Zhu:
Greedy Nimk Game. 1241-1249 - Qingsong Tang, Xiangde Zhang, Guoren Wang, Cheng Zhao:
A continuous characterization of the maximum vertex-weighted clique in hypergraphs. 1250-1260 - Jaromír Kukal, Matej Mojzes:
Quantile and mean value measures of search process complexity. 1261-1285 - Guangyan Zhou, Zongsheng Gao:
On the lower bounds of random Max 3 and 4-SAT. 1286-1299 - Qingqiong Cai, Xueliang Li, Di Wu:
Some extremal results on the colorful monochromatic vertex-connectivity of a graph. 1300-1311 - M. A. Shalu, S. Vijayakumar, S. Devi Yamini, T. P. Sandhya:
On the algorithmic aspects of strong subcoloring. 1312-1329
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 2025-11-02 21:07 CET 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:
