Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 29
Volume 29, Number 1, January 2015
- Shiho Morishita, Takao Nishizeki:
Parametric power supply networks. 1-15 - Zongxu Mu, Minming Li
:
DVS scheduling in a line or a star network of processors. 16-35 - Kameng Nip, Zhenbo Wang, Fabrice Talla Nobibon, Roel Leus:
A combination of flow shop scheduling and the shortest path problem. 36-52 - Chenchen Wu, Donglei Du, Dachuan Xu:
An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems. 53-66 - Hiroshi Fujiwara, Koji M. Kobayashi:
Improved lower bounds for the online bin packing problem with cardinality constraints. 67-87 - Andrzej Kisielewicz, Jakub Kowalski, Marek Szykula:
Computing the shortest reset words of synchronizing automata. 88-124 - Qilong Feng, Jianxin Wang, Shaohua Li, Jianer Chen:
Randomized parameterized algorithms for P2-Packing and Co-Path Packing problems. 125-140 - Jan Baumbach, Jiong Guo, Rashid Ibragimov:
Covering tree with stars. 141-152 - Longkun Guo, Hong Shen, Kewen Liao:
Improved approximation algorithms for computing k disjoint paths subject to two constraints. 153-164 - Anna Angelucci, Vittorio Bilò, Michele Flammini, Luca Moscardelli:
On the sequential price of anarchy of isolation games. 165-181 - Davide Bilò, Vittorio Bilò:
New bounds for the balloon popping problem. 182-196 - Yiping Lu, Danny Z. Chen, Jianzhong Cha:
Packing cubes into a cube is NP-complete in the strong sense. 197-215 - Chao Peng, Jie Zhou, Binhai Zhu, Hong Zhu:
Complexity analysis and algorithms for the Program Download Problem. 216-227 - Peihai Liu, Xiwen Lu:
Online unbounded batch scheduling on parallel machines with delivery times. 228-236 - Eric Angel, Kim Thang Nguyen, Damien Regnault:
Improved local search for universal facility location. 237-246 - Tian Liu, Zhao Lu, Ke Xu:
Tractable connected domination for restricted bipartite graphs. 247-256 - Yunlong Liu, Jianxin Wang, Chao Xu, Jiong Guo, Jianer Chen:
An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs. 257-275 - Walid Ben-Ameur, Mohamed-Ahmed Mohamed-Sidi, José Neto:
The $$k$$ k -separator problem: polyhedra, complexity and approximation results. 276-307 - Ling Luo, Zhenhua Duan, Cong Tian, Xiaobing Wang:
A structural transformation from p-π to MSVL. 308-329
Volume 29, Number 2, February 2015
- Sheng-Long Hu, Liqun Qi:
The Laplacian of a uniform hypergraph. 331-366 - Andrzej Zak:
General lower bound on the size of (H;k)-stable graphs. 367-372 - Yuehua Bu, Kai Lu, Sheng Yang:
Two smaller upper bounds of list injective chromatic number. 373-388 - You Lu, Fu-Tao Hu, Jun-Ming Xu:
On the p-reinforcement and the complexity. 389-405 - Cong Tian, Zhenhua Duan, Mengfei Yang:
Transformation from PLTL to automata via NFGs. 406-417 - Dana Angluin, James Aspnes, Lev Reyzin:
Network construction with subgraph connectivity constraints. 418-432 - Boris I. Goldengorin, Dmitriy S. Malyshev, Panos M. Pardalos, Victor Zamaraev:
A tolerance-based heuristic approach for the weighted independent set problem. 433-450 - Eduardo G. Pardo, Mauricio Soto, Christopher Thraves:
Embedding signed graphs in the line - Heuristics to solve MinSA problem. 451-471 - Hongyu Liang, Tiancheng Lou, Haisheng Tan, Yuexuan Wang, Dongxiao Yu:
On the complexity of connectivity in cognitive radio networks through spectrum assignment. 472-487 - Xianmin Liu, Jianzhong Li:
Algorithms and complexity results for labeled correlation clustering problem. 488-501 - Damei Lü, Juan Du, Nianfeng Lin, Ke Zhang, Dan Yi:
Nordhaus-Gaddum-type results for path covering and L(2, 1)-labeling numbers. 502-510
Volume 29, Number 3, April 2015
- Huili Zhang, Yin-Feng Xu, Xingang Wen:
Optimal shortest path set problem in undirected graphs. 511-530 - Tian Liu, Chaoyi Wang, Ke Xu:
Large hypertree width for sparse random hypergraphs. 531-540 - Dariusz Dereniowski, Danny Dyer, Ryan M. Tifenbach, Boting Yang:
Zero-visibility cops and robber and the pathwidth of a graph. 541-564 - Jinghao Sun, Yakun Meng, Guozhen Tan:
An integer programming approach for the Chinese postman problem with time-dependent travel time. 565-588 - Chao Li, Chenglin Fan, Jun Luo, Farong Zhong, Binhai Zhu:
Expected computations on color spanning sets. 589-604 - Zhi-Zhong Chen, Ying Fan, Lusheng Wang:
Faster exact computation of rSPR distance. 605-635 - Masoud Yaghini, Mohammad Karimi, Mohadeseh Rahbar:
A set covering approach for multi-depot train driver scheduling. 636-654 - Wensong Lin, Benqiu Dai:
On (s, t)-relaxed L(2, 1)-labelings of the triangular lattice. 655-669 - Xianmin Liu, Jianzhong Li:
On the hardness of learning queries from tree structured data. 670-684
Volume 29, Number 4, May 2015
- Huan Ma, Yuqing Zhu, Deying Li, Songsong Li, Weili Wu:
Loyalty improvement beyond the seeds in social networks. 685-700 - Chung-Shou Liao, Yamming Huang:
Generalized Canadian traveller problems. 701-712 - Guanghui Wang, Guiying Yan, Jiguo Yu, Xin Zhang:
The r-acyclic chromatic number of planar graphs. 713-722 - Mohammad A. Raayatpanah, H. Salehi Fathabadi, H. Bahramgiri, Panos M. Pardalos:
Optimal-constrained multicast sub-graph over coded packet networks. 723-738 - Paul C. Bell, Prudence W. H. Wong:
Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines. 739-749 - Mirko Ruokokoski, Harri Ehtamo, Panos M. Pardalos:
Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results. 750-780 - An Zhang, Yiwei Jiang, Lidan Fan, Jueliang Hu:
Optimal online algorithms on two hierarchical machines with tightly-grouped processing times. 781-795 - Ruixue Zhang, Ping Zhao, Kefeng Diao, Fuliang Lu:
The minimum chromatic spectrum of 3-uniform C-hypergraphs. 796-802 - Shou-Jun Xu, Heping Zhang, Jinzhuan Cai:
Complete forcing numbers of catacondensed hexagonal systems. 803-814 - Zhipeng Cai, Yueming Duan, Anu G. Bourgeois:
Delay efficient opportunistic routing in asynchronous multi-channel cognitive radio networks. 815-835 - Yinfeng Xu, Hongmei Li, Changzheng He, Li Luo:
The online k-server problem with max-distance objective. 836-846 - Peter Damaschke:
Parameterizations of hitting set of bundles and inverse scope. 847-858 - Theodoros P. Gevezes, Leonidas S. Pitsoulis:
A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem. 859-883
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:
