Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 26
Volume 26, Number 1, July 2013
- Sergey Polyakovskiy
, Frits C. R. Spieksma, Gerhard J. Woeginger:
The three-dimensional matching problem in Kalmanson matrices. 1-9 - Mohammad Hadi Akhbari, Roslan Hasni, Odile Favaron, Hossein Karami, Seyed Mahmoud Sheikholeslami:
On the outer-connected domination in graphs. 10-18 - Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola:
Parameterized complexity of k-anonymity: hardness and tractability. 19-43 - Weiwei Wu, Minming Li, Enhong Chen:
Optimal key tree structure for two-user replacement and deletion problems. 44-70 - Yanhong Gu, Jing Fan, Guochun Tang, Jiaofei Zhong:
Maximum latency scheduling problem on two-person cooperative games. 71-81 - Xiang Li, Xiaodong Hu, Wonjun Lee:
On the union of intermediate nodes of shortest paths. 82-85 - Qinghua Wu, Jin-Kao Hao:
An adaptive multistart tabu search approach to solve the maximum clique problem. 86-108 - Ulrich Pferschy, Joachim Schauer:
The maximum flow problem with disjunctive constraints. 109-119 - Julie Haviland:
Independent dominating sets in regular graphs. 120-126 - Jie Ma, Xingxing Yu, Wenan Zang:
Approximate min-max relations on plane graphs. 127-134 - Indra Rajasingh, Paul D. Manuel, Micheal Arockiaraj, Bharati Rajan:
Embeddings of circulant networks. 135-151 - Hervé Hocquard, Mickaël Montassier:
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ. 152-160 - Shouling Ji, A. Selcuk Uluagac, Raheem A. Beyah, Zhipeng Cai:
Practical unicast and convergecast scheduling schemes for cognitive radio networks. 161-177 - Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten:
Critical edges/nodes for the minimum spanning tree problem: complexity and approximation. 178-189 - Jun Guo, Kaishun Wang, Fenggao Li:
Metric dimension of some distance-regular graphs. 190-197 - Shlomo Karhi, Dvir Shabtay:
On the optimality of the TLS algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines. 198-222
Volume 26, Number 2, August 2013
- Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Xin Han:
Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing. 223-236 - Martin Birks, Daniel Cole, Stanley P. Y. Fung, Huichao Xue:
Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints. 237-250 - Huili Zhang, Yinfeng Xu, Lan Qin:
The k-Canadian Travelers Problem with communication. 251-265 - Wenqi Ju, Chenglin Fan, Jun Luo, Binhai Zhu, Ovidiu Daescu:
On some geometric problems of color-spanning sets. 266-283 - Kerui Weng:
Approximation algorithm for uniform bounded facility location problem. 284-291 - Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou:
Tight approximation bounds for combinatorial frugal coverage algorithms. 292-309 - Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier:
The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders. 310-332 - Walter Kern, Jacob Jan Paulus:
A tight analysis of Brown-Baker-Katseff sequences for online strip packing. 333-344 - Reinhard Bürgy, Heinz Gröflin:
Optimal job insertion in the no-wait job shop. 345-371 - Fatima Affif Chaouche, Carrie G. Rutherford, Robin Whitty:
Objective functions with redundant domains. 372-384 - Damei Lü:
L(2, 1)-labelings of the edge-path-replacement of a graph. 385-392 - Jin-Xin Zhou, Yan-Quan Feng:
Super-cyclically edge-connected regular graphs. 393-411 - Yijie Han:
Erratum to: Tight bound for matching. 412-414
Volume 26, Number 3, October 2013
- Guangting Chen, Guohui Lin, Zhiyi Tan:
Preface. 415 - György Dósa, Zsolt Tuza, Deshi Ye:
Bin packing with "Largest In Bottom" constraint: tighter bounds and generalizations. 416-436 - Min Ji, Chou-Jung Hsu, Dar-Li Yang:
Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration. 437-447 - Rongheng Li, Liying Yang, Xiaoqiong He, Qiang Chen, Xiayan Cheng:
Semi-online scheduling for jobs with release times. 448-464 - Wenqing Dou:
On the mod sum number of H m, n. 465-471 - Xiao Min, Yuqing Wang, Jing Liu, Min Jiang:
Semi-online scheduling on two identical machines with rejection. 472-479 - Chunjie Su:
Online LPT algorithms for parallel machines scheduling with a single server. 480-488 - Weiya Zhong, Zhiming Huo:
Single machine scheduling problems with subcontracting options. 489-498 - Guangting Chen, Suhui Cui:
Relay node placement in two-tiered wireless sensor networks with base stations. 499-508 - Biao Wu, Longcheng Liu, Enyu Yao:
Minimizing the maximum bump cost in linear extensions of a poset. 509-519 - Shahram Shahinpour, Sergiy Butenko:
Algorithms for the maximum k-club problem in graphs. 520-554 - Wei Niu, Juan Cheng, Guoqing Wang:
Applications of extension grey prediction model for power system forecasting. 555-567 - Diana Fanghänel:
A bilevel programming problem with maximization of a supermodular function in the lower level. 568-584 - Baoyindureng Wu, Xinhui An, Guojie Liu, Guiying Yan, Xiaoping Liu:
Minimum degree, edge-connectivity and radius. 585-591 - Bang Ye Wu:
Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs. 592-607 - Chun-Hung Liu, Gerard J. Chang:
Roman domination on strongly chordal graphs. 608-619
Volume 26, Number 4, November 2013
- Shawn T. O'Neil, Amitabh Chaudhary, Danny Z. Chen, Haitao Wang:
The topology aware file distribution problem. 621-635 - François Le Gall, Yuichi Yoshida:
Property testing for cyclic groups and beyond. 636-654 - Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das:
Optimal strategies for the one-round discrete Voronoi game on a line. 655-669 - Juha Kortelainen, Tuomas Kortelainen, Ari Vesanen:
Unavoidable regularities in long words with bounded number of symbol occurrences. 670-686 - Yuichi Asahiro, Kenta Kanmera, Eiji Miyano:
(1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation. 687-708 - Masoud T. Omran, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh:
Finding paths with minimum shared edges. 709-722 - Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
The density maximization problem in graphs. 723-754 - Minghui Jiang:
Flipping triangles and rectangles. 755-769 - B. S. Panda, Dinabandhu Pradhan:
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs. 770-785 - Boram Park, Suh-Ryung Kim, Hye Kyung Kim:
On the cores of games arising from integer edge covering functions of graphs. 786-798 - Jianming Dong, Yong Chen, An Zhang, Qifan Yang:
A new three-machine shop scheduling: complexity and approximation algorithm. 799-810 - Zhigang Cao, Xiaoguang Yang:
A note on anti-coordination and social interactions. 811-818 - Damei Lü, Nianfeng Lin:
L(d, 1)-labelings of the edge-path-replacement of a graph. 819-831 - Wenqi Ju, Jun Luo, Binhai Zhu, Ovidiu Daescu:
Largest area convex hull of imprecise data based on axis-aligned squares. 832-859
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-19 19:20 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:
