default search action
Journal of Combinatorial Optimization, Volume 34
Volume 34, Number 1, July 2017
- Ron Adar, Leah Epstein:
The k-metric dimension. 1-30 - Nadia Brauner
, Gerd Finke, Yakov M. Shafransky:
Lawler's minmax cost problem under uncertainty. 31-46 - Li-Hsuan Chen
Parameterized algorithms for min-max 2-cluster editing. 47-63 - Jingjing Yao, Xiaowei Yu, Guanghui Wang, Changqing Xu:
Neighbor sum distinguishing total coloring of 2-degenerate graphs. 64-70 - Michele Garraffa
An exact semidefinite programming approach for the max-mean dispersion problem. 71-93 - John P. Georges, David W. Mauro, Kirsti Wash:
On zero-sum ℤ2jk -magic graphs. 94-113 - Daniel W. Cranston
Modified linear programming and class 0 bounds for graph pebbling. 114-132 - Federico Della Croce
Minimizing the number of tardy jobs in two-machine settings with common due date. 133-140 - Shasha Li, Wei Li, Yongtang Shi, Haina Sun:
On minimally 2-connected graphs with generalized connectivity κ3 = 2. 141-164 - Fei Huang, Xueliang Li, Shujing Wang:
Upper bounds of proper connection number of graphs. 165-173 - Petr Gregor
Note on incidence chromatic number of subquartic graphs. 174-181 - Yingbin Ma, Zaiping Lu:
Rainbow connection numbers of Cayley graphs. 182-193 - Yichao Chen, Yan Yang:
The thickness of the complete multipartite graphs and the join of graphs. 194-202 - Mehdi Ghiyasvand:
A faster strongly polynomial time algorithm to solve the minimum cost tension problem. 203-217 - Mehdi Sohrabi Haghighat
The minimum value of geometric-arithmetic index of graphs with minimum degree 2. 218-232 - Zhen-Kun Zhang, Hong-Jian Lai:
Characterizations of k-cutwidth critical trees. 233-244 - Yingmo Jie, Cheng Guo, Zhangjie Fu:
Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields. 245-256 - Huijuan Wang, Bin Liu, Xiaoli Wang, Guangmo Tong, Weili Wu, Hongwei Gao
Total coloring of planar graphs without adjacent chordal 6-cycles. 257-265 - Lucas P. Melo, Flávio Keidi Miyazawa
Approximation algorithms for k-level stochastic facility location problems. 266-278 - Yi Hong, Deying Li, Donghyun Kim, Wenping Chen, Jiguo Yu
Maximizing target-temporal coverage of mission-driven camera sensor networks. 279-301 - Yingli Ran, Yishuo Shi, Zhao Zhang:
Local ratio method on partial set multi-cover. 302-313 - Xin Chen, Qingqin Nong
Centralized and decentralized rumor blocking problems. 314-329
Volume 34, Number 2, August 2017
- Lingfa Lu
Single-machine scheduling with production and rejection costs to minimize the maximum earliness. 331-342 - Glenn Hurlbert:
The Weight Function Lemma for graph pebbling. 343-361 - Cheng He, Joseph Y.-T. Leung:
Two-agent scheduling of time-dependent jobs. 362-377 - Taiyin Zhao
A note on (s, t)-relaxed L(2, 1)-labeling of graphs. 378-382 - Xiaohan Cheng, Guanghui Wang, Jianliang Wu:
The adjacent vertex distinguishing total chromatic numbers of planar graphs Δ = 10. 383-397 - Lan Qin, Yinfeng Xu:
Fibonacci helps to evacuate from a convex region in a grid network. 398-413 - Jianhua Tu
On the vertex cover P3 problem parameterized by treewidth. 414-425 - Guantao Chen, Yuping Gao, Songling Shan
Equitable vertex arboricity of 5-degenerate graphs. 426-432 - Jinjiang Yuan:
Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans. 433-440 - Jiansheng Cai, Xueliang Li, Guiying Yan:
Improved upper bound for the degenerate and star chromatic numbers of graphs. 441-452 - Davood Shiri
On the online multi-agent O-D k-Canadian Traveler Problem. 453-461 - Guang Zhang, Erfang Shan, Liying Kang, Yanxia Dong:
Two efficient values of cooperative games with graph structure based on τ-values. 462-482 - Ran Ma, Jinjiang Yuan:
Online scheduling to minimize the total weighted completion time plus the rejection cost. 483-503 - Qingsong Tang, Yuejian Peng, Xiangde Zhang, Cheng Zhao:
On Motzkin-Straus type results for non-uniform hypergraphs. 504-521 - Yan Liu, Weiwei Liu:
Fractional matching preclusion of graphs. 522-533 - Muhammad Kamran Siddiqui, Deeba Afzal, Muhammad Ramzan Faisal:
Total edge irregularity strength of accordion graphs. 534-544 - Michael A. Henning, Nicolas Lichiardopol:
Distance domination in graphs with given minimum and maximum degree. 545-553 - Mikita Hradovich, Adam Kasperski
Recoverable robust spanning tree problem under interval uncertainty representations. 554-573 - Kinkar Chandra Das, Mohammad J. Nadjafi-Arani
On maximum Wiener index of trees and graphs with given radius. 574-587 - Yi-Ping Cui, Yongwu Zhou, Yaodong Cui:
Triple-solution approach for the strip packing problem with two-staged patterns. 588-604 - Manouchehr Zaker:
A note on orientation and chromatic number of graphs. 605-611 - T. Karthick:
Independent sets in some classes of Si, j, k-free graphs. 612-630 - Cem Evrendilek
Task assignment in tree-like hierarchical structures. 631-655 - Liying Kang, Shan Li, Yanxia Dong, Erfang Shan:
Matching and domination numbers in r-uniform hypergraphs. 656-659
Volume 34, Number 3, October 2017
- Xin Zhang
Total coloring of outer-1-planar graphs with near-independent crossings. 661-675 - Daniel Li Li, Erfang Shan:
Cost sharing on prices for games on graphs. 676-688 - Xiaoming Sun, Jia Zhang, Jialin Zhang
Near optimal algorithms for online weighted bipartite matching in adversary model. 689-705 - Zehui Shao
On the L(2, 1)-labeling conjecture for brick product graphs. 706-724 - Boaz Farbstein, Asaf Levin
Maximum coverage problem with group budget constraints. 725-735 - Daniela Ferrero
Note on power propagation time and lower bounds for the power domination number. 736-741 - Jingjing Huo, Yiqiao Wang, Weifan Wang:
Neighbor-sum-distinguishing edge choosability of subcubic graphs. 742-759 - Arash Ahadi, Ali Dehghan
Is there any polynomial upper bound for the universal labeling of graphs? 760-770 - Xia Zhang
Disconnected gc -critical graphs. 771-780 - George Zioutas, Christos Chatzinakos, Tri-Dung Nguyen
Optimization techniques for multivariate least trimmed absolute deviation estimation. 781-797 - Xiaolan Hu
Neighbor sum distinguishing index of 2-degenerate graphs. 798-809 - Martin Böhm
A two-phase algorithm for bin stretching with stretching factor 1.5. 810-828 - Martin Böhm
Erratum to: A two-phase algorithm for bin stretching with stretching factor 1.5. 829 - Mingyu Xiao
A refined algorithm for maximum independent set in degree-4 graphs. 830-873 - Haiyang Zhu, Sheng Chen, Lianying Miao, Xinzhong Lv:
On list r-hued coloring of planar graphs. 874-890 - Anja Fischer
The traveling salesman problem on grids with forbidden neighborhoods. 891-915 - Huiqiu Lin, Jinlong Shu, Baoyindureng Wu:
Nordhaus-Gaddum type result for the matching number of a graph. 916-930 - Refael Hassin, R. Ravi, F. Sibel Salman:
Multiple facility location on a network with linear reliability order of edges. 931-955 - Yubai Zhang, Yingli Ran, Zhao Zhang
A simple approximation algorithm for minimum weight partial connected set cover. 956-963 - Sascha Wörz:
On global integer extrema of real-valued box-constrained multivariate quadratic functions. 964-986
Volume 34, Number 4, November 2017
- Min Chen, Yingying Fan, Yiqiao Wang, Weifan Wang:
A sufficient condition for planar graphs to be (3, 1)-choosable. 987-1011 - Zemin Jin, Yuefang Sun
Extremal coloring for the anti-Ramsey problem of matchings in complete graphs. 1012-1028 - Tien Tran, Min Kyung An
Establishing symmetric connectivity in directional wireless sensor networks equipped with 2π/3 antennas. 1029-1051 - Dongjing Miao, Zhipeng Cai
Approximation for vertex cover in β-conflict graphs. 1052-1059 - Rafael S. Coelho
The k-hop connected dominating set problem: approximation and hardness. 1060-1083 - Wei Ding
An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs. 1084-1095 - Günter Schmidt
Competitive analysis of bi-directional non-preemptive conversion. 1096-1113 - Kai Cai, Guangyue Han:
On the Langberg-Médard multiple unicast conjecture. 1114-1132 - Wenbin Chen, Fufang Li, Jianxiong Wang, Ke Qi, Maobin Tang, Xiuni Wang:
A primal-dual online algorithm for the k-server problem on weighted HSTs. 1133-1146 - Hong Jie Song, Chang Qing Xu:
Neighbor sum distinguishing total coloring of planar graphs without 4-cycles. 1147-1158 - Corinna Heßler, Kaouthar Deghdak:
Discrete parallel machine makespan ScheLoc problem. 1159-1186 - Ruyan Fu, Ji Tian, Shisheng Li, Jinjiang Yuan
An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities. 1187-1197 - Zhenbo Wang, Kameng Nip:
Bin packing under linear constraints. 1198-1209 - Li-Da Tong, Hao-Yu Yang:
Hamiltonian numbers in oriented graphs. 1210-1217 - Steffen Goebbels, Frank Gurski
Change-making problems revisited: a parameterized point of view. 1218-1236 - Alan Kuhnle, Xiang Li, J. David Smith, My T. Thai
Online set multicover algorithms for dynamic D2D communications. 1237-1264 - Joaquim Gabarró, Sergio Leon Gaixas, Maria J. Serna:
The computational complexity of QoS measures for orchestrations - The computational complexity of QoS measures. 1265-1301 - Wei Dong, Baogang Xu:
2-Distance coloring of planar graphs with girth 5. 1302-1322
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-01-18 00:51 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: