Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 36
Volume 36, Number 1, July 2018
- Wai Lam Fong, Wai Hong Chan, Ge Nong:
The game chromatic index of some trees with maximum degree four and adjacent degree-four vertices. 1-12 - Huijuan Wang, Bin Liu, Ling Gai
, Hongwei Du, Jianliang Wu:
Minimum choosability of planar graphs. 13-22 - Miaomiao Han, You Lu, Rong Luo, Zhengke Miao:
Neighbor sum distinguishing total coloring of graphs with bounded treewidth. 23-34 - Lina Chen, Xiaohui Huang, Zhao Zhang:
A simpler PTAS for connected k-path vertex cover in homogeneous wireless sensor network. 35-43 - Guiqing Zhang, Yongxi Cheng, Lan Qin:
An improved online evacuation strategy from a convex region on grid networks. 44-54 - Junlei Zhu, Yuehua Bu:
Minimum 2-distance coloring of planar graphs and channel assignment. 55-64 - Jing Huang, Shuchao Li, Hua Wang:
Relation between the skew-rank of an oriented graph and the independence number of its underlying graph. 65-80 - Jafar Amjadi, Sakineh Nazari-Moghaddam, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
An upper bound on the double Roman domination number. 81-89 - Maurice Queyranne, Laurence A. Wolsey:
Optimum turn-restricted paths, nested compatibility, and optimum convex polygons. 90-107 - Victor Loumngam Kamga, Weifan Wang, Ying Wang, Min Chen:
2-Distance vertex-distinguishing index of subcubic graphs. 108-120 - Mohammad Reza Oboudi:
Majorization and the spectral radius of starlike trees. 121-129 - Mohammad Reza Oboudi:
Correction to: Majorization and the spectral radius of starlike trees. 130 - Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery:
Approximation algorithms for the bus evacuation problem. 131-141 - Jinwei Gu, Manzhan Gu, Xiwen Lu, Ying Zhang:
Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan. 142-161 - Maurizio Bruglieri, Ferdinando Pezzella, Ornella Pisacane:
A two-phase optimization method for a multiobjective vehicle relocation problem in electric carsharing systems. 162-193 - Álvaro Martínez-Pérez, José M. Rodríguez:
New lower bounds for the second variable Zagreb index. 194-210 - Qizhi Fang, Bo Li, Xiaohan Shan, Xiaoming Sun:
Path cooperative games. 211-229 - Yueshi Wu, Mihaela Cardei:
Distributed algorithms for barrier coverage via sensor rotation in wireless sensor networks. 230-251 - Liying Kang, Jianjie Zhou, Erfang Shan:
Algorithms for connected p-centdian problem on block graphs. 252-263 - Yishui Wang, Dachuan Xu, Donglei Du, Chenchen Wu:
An approximation algorithm for k-facility location problem with linear penalties using local search scheme. 264-279 - Gopinath Mishra, Subhra Mazumdar, Arindam Pal:
Improved algorithms for the evacuation route planning problem. 280-306 - Kelin Luo, Yinfeng Xu, Bowen Zhang, Huili Zhang:
Creating an acceptable consensus ranking for group decision making. 307-328
Volume 36, Number 2, August 2018
- Bugra Çaskurlu, Matthew D. Williamson, K. Subramani, Vahan Mkrtchyan:
On approximating optimal weight "no"-certificates in weighted difference constraint systems. 329-345 - Heather Hoskins, Runrun Liu, Jennifer Vandenbussche, Gexin Yu:
Planar graphs without 4-cycles and close triangles are (2, 0, 0)-colorable. 346-364 - Sergey Bereg, Luis Evaristo Caraballo, José Miguel Díaz-Báñez, Mario Alberto López:
Computing the k-resilience of a synchronized multi-robot system. 365-391 - Ling Gai, Hongwei Du, Lidong Wu, Junlei Zhu, Yuehua Bu:
Blocking Rumor by Cut. 392-399 - Tian Xie, Dongdong Ge:
A tractable discrete fractional programming: application to constrained assortment optimization. 400-415 - Teresa W. Haynes, Michael A. Henning:
Perfect graphs involving semitotal and semipaired domination. 416-433 - Xiao Zhang, Haosheng Fan, Victor C. S. Lee, Minming Li, Yingchao Zhao, Chuang Liu:
Minimizing the total cost of barrier coverage in a linear domain. 434-457 - Hong Chang, Xueliang Li, Colton Magnant, Zhongmei Qin:
The (k , ℓ)-proper index of graphs. 458-471 - Xing Chai, Wenhua Li:
Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan. 472-492 - Xin Feng, Yinfeng Xu, Guanqun Ni, Yongwu Dai:
Online leasing problem with price fluctuations under the consumer price index. 493-507 - Leah Epstein, David S. Johnson, Asaf Levin:
Min-Sum Bin Packing. 508-531 - Van Bang Le, Sheng-Lung Peng:
On the complete width and edge clique cover problems. 532-548 - Lili Mei, Deshi Ye, Yong Zhang:
Approximation strategy-proof mechanisms for obnoxious facility location on a line. 549-571 - B. S. Panda, Arti Pandey, Subhabrata Paul:
Algorithmic aspects of b-disjunctive domination in graphs. 572-590 - Marc Hellmuth, Nicolas Wieseke:
On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions. 591-616 - Jiayin Pan, Yinfeng Xu, Guiqing Zhang:
Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead. 617-636 - Walid Ben-Ameur, Antoine Glorieux, José Neto:
On the most imbalanced orientation of a graph. 637-669
Volume 36, Number 3, October 2018
- Tamás Király:
Base polyhedra and the linking property. 671-677 - Yuni Iwamasa:
On a general framework for network representability in discrete optimization. 678-708 - Hiroshi Hirai, Taihei Oki:
A compact representation for minimizers of k-submodular functions. 709-741 - Kazutoshi Ando, Koki Sato:
An algorithm for finding a representation of a subtree distance. 742-762 - Stefano Coniglio, Arie M. C. A. Koster, Nils Spiekermann:
Lot sizing with storage losses under demand uncertainty. 763-788 - Massinissa Merabet, Miklós Molnár, Sylvain Durand:
ILP formulation of the degree-constrained minimum spanning hierarchy problem. 789-811 - Tobias Harks, Veerle Timmermans:
Uniqueness of equilibria in atomic splittable polymatroid congestion games. 812-830 - Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Sum-of-squares rank upper bounds for matching problems. 831-844 - Mustafa Ç. Pinar:
Robust trading mechanisms over 0/1 polytopes. 845-860 - Corinna Gottschalk, Hendrik Lüthen, Britta Peis, Andreas Wierz:
Optimization problems with color-induced budget constraints. 861-870 - Sven Mallach:
Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays. 871-895 - Oliver G. Czibula, Hanyu Gu, Yakov Zinder:
Planning personnel retraining: column generation heuristics. 896-915 - Diego Recalde, Daniel Severín, Ramiro Torres, Polo Vaca:
An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment. 916-936 - Laurent Gourvès, Jérôme Monnot, Lydia Tlilane:
Subset sum problems with digraph constraints. 937-964 - Pawan Aurora, Shashank K. Mehta:
The QAP-polytope and the graph isomorphism problem. 965-1006 - Fatiha Bendali, Jean Mailfert:
The weakly connected independent set polytope in corona and join of graphs. 1007-1023 - Pascale Bendotti, Pierre Fouilhoux, Cécile Rottner:
The min-up/min-down unit commitment polytope. 1024-1058 - Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau:
Approximability and exact resolution of the multidimensional binary vector assignment problem. 1059-1073 - Mohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem, Sébastien Martin, Izzeldin M. Osman:
On the m-clique free interval subgraphs polytope: polyhedral analysis and applications. 1074-1101
Volume 36, Number 4, November 2018
- Photchchara Pisantechakool, Xuehou Tan:
The capture time of a planar graph. 1103-1117 - Erfang Shan, Liying Kang:
The w-centroids and least w-central subtrees in weighted trees. 1118-1127 - Yi Xu, Jigen Peng, Yinfeng Xu:
The mixed center location problem. 1128-1144 - Matthias Feldotto, Lennart Leder, Alexander Skopalik:
Congestion games with mixed objectives. 1145-1167 - Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers:
Cost-efficient scheduling on machines from the cloud. 1168-1194 - Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet:
On residual approximation in solution extension problems. 1195-1220 - Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Hirotaka Ono, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu:
Safe sets in graphs: Graph classes and structural parameters. 1221-1242 - Pawan Aurora, Monalisa Jena, Rajiv Raman:
Constant factor approximation for the weighted partial degree bounded edge packing problem. 1243-1261 - Wei Ding, Ke Qiu:
A quadratic time exact algorithm for continuous connected 2-facility location problem in trees. 1262-1298 - Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
The mixed evacuation problem. 1299-1314 - Riccardo Dondi, Florian Sikora:
Finding disjoint paths on edge-colored graphs: more tractability results. 1315-1332 - Petr Gregor, Riste Skrekovski, Vida Vukasinovic:
Broadcasting multiple messages in the 1-in port model in optimal time. 1333-1355 - Jürgen König, Alexander Mäcker, Friedhelm Meyer auf der Heide, Sören Riechers:
Scheduling with interjob communication on parallel processors. 1356-1379 - Liwei Zhong, Yanqin Bai:
Equivalence of two-sided stable matching. 1380-1387 - Kexiang Xu, Haiqiong Liu, Kinkar Chandra Das, Sandi Klavzar:
Embeddings into almost self-centered graphs of given radius. 1388-1410 - Haiyang Zhu, Yu Gu, Jingjun Sheng, Xinzhong Lü:
List 2-distance $$\varDelta +3$$ Δ + 3 -coloring of planar graphs without 4, 5-cycles. 1411-1424 - Borut Luzar, Jakub Przybylo, Roman Soták:
New bounds for locally irregular chromatic index of bipartite and subcubic graphs. 1425-1438
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-05-14 21:18 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:
