default search action
Journal of Combinatorial Optimization, Volume 25
Volume 25, Number 1, January 2013
- Guang-Siang Lee:
An extension of Stein-Lovász theorem and some of its applications. 1-18 - Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann
:
The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs. 19-46 - Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning:
Edge lifting and total domination in graphs. 47-59 - Ioannis Caragiannis
A 6/5-approximation algorithm for the maximum 3-cover problem. 60-77 - Caterina De Simone, Anna Galluccio:
Edge-colouring of joins of regular graphs II. 78-90 - Hossein Karami, Rana Khoeilar, Seyed Mahmoud Sheikholeslami
The total domination subdivision number in graphs with no induced 3-cycle and 5-cycle. 91-98 - Alexey Sorokin, Vladimir Boginski, Artyom G. Nahapetyan, Panos M. Pardalos:
Computational risk management techniques for fixed charge network flow problems with uncertain arc failures. 99-122 - Byung-Cheon Choi
Two-stage proportionate flexible flow shop to minimize the makespan. 123-134 - Yanhong Gu, Mark Goh
A new two-party bargaining mechanism. 135-163
Volume 25, Number 2, February 2013
- Fei Li:
Scheduling Packets with Values and Deadlines in Size-Bounded Buffers. 165-175 - Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya:
Some variations on constrained minimum enclosing circle problem. 176-190 - Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten
Complexity of determining the most vital elements for the p-median and p-center location problems. 191-207 - Brad Ballinger, Nadia M. Benbernou, Prosenjit Bose
Coverage with k-transmitters in the presence of obstacles. 208-233 - Zhixiang Chen, Bin Fu:
Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials. 234-254 - Jing He, Hongyu Liang:
Improved approximation for spanning star forest in dense graphs. 255-264 - Viet Hung Nguyen:
A primal-dual approximation algorithm for the Asymmetric Prize-Collecting TSP. 265-278 - Hans Kellerer, Alan J. Soper, Vitaly A. Strusevich:
Preemptive scheduling on two identical parallel machines with a single transporter. 279-307 - Yakov Zinder
Discrete optimization with polynomially detectable boundaries and restricted level sets. 308-325 - Tadao Takaoka:
A simplified algorithm for the all pairs shortest path problem with O(n 2logn) expected time. 326-337
Volume 25, Number 3, April 2013
- Xin Chen:
On sorting unsigned permutations by double-cut-and-joins. 339-351 - Bin Fu, Lusheng Wang
Constant time approximation scheme for largest well predicted subset. 352-367 - Aimal Rextin, Patrick Healy:
Computing maximum upward planar subgraphs of single-source embedded digraphs. 368-392 - Frans Schalekamp, Michael Yu, Anke van Zuylen:
Clustering with or without the approximation. 393-429 - Sayaka Kamei
A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks. 430-459 - Debajyoti Mondal, Rahnuma Islam Nishat
Minimum-segment convex drawings of 3-connected cubic plane graphs. 460-480 - Lusheng Wang
Near optimal solutions for maximum quasi-bicliques. 481-497
Volume 25, Number 4, May 2013
- D. J. Guan, Ko-Wei Lih, Xuding Zhu:
Preface: optimization in graphs. 499-500 - Bor-Liang Chen, Ko-Wei Lih, Chih-Hung Yen:
Equivalence of two conjectures on equitable coloring of graphs. 501-504 - Sandi Klavzar
Structure of Fibonacci cubes: a survey. 505-522 - Stéphane Bessy, Frédéric Havet:
Enumerating the edge-colourings and total colourings of a regular graph. 523-535 - Huilan Chang, Hung-Lin Fu, Min-Yun Lien:
The decycling number of outerplanar graphs. 536-542 - Ma-Lian Chia, David Kuo, Jing-Ho Yan, Siou-Ru Yang:
(p, q)-total labeling of complete graphs. 543-561 - Weifan Wang, Qiaojun Shu, Yiqiao Wang:
Acyclic edge coloring of planar graphs without 4-cycles. 562-586 - Jerrold R. Griggs, Wei-Tian Li
The partition method for poset-free families. 587-596 - Hung-Lin Fu, Kuo-Ching Huang, Chin-Lin Shiue:
A note on optimal pebbling of hypercubes. 597-601 - Cheng-Hsiao Tsou, Gen-Huey Chen, Hung-I Yu, Ching-Chi Lin:
The broadcast median problem in heterogeneous postal model. 602-616 - Sen-Peng Eu
A combinatorial proof of the cyclic sieving phenomenon for faces of Coxeterhedra. 617-638 - Jian Guan, Xiaoyan Liu, Changhong Lu, Zhengke Miao:
Three conjectures on the signed cycle domination in graphs. 639-645 - Clément Charpentier, Mickaël Montassier, André Raspaud:
L(p, q)-labeling of sparse graphs. 646-660 - Wensong Lin, Jianzhuan Wu:
Distance two edge labelings of lattices. 661-679 - Daphne Der-Fen Liu, Aileen Sutedja:
Chromatic number of distance graphs generated by the sets {2, 3, x, y}. 680-693 - Ting-Pang Chang, Li-Da Tong:
The hamiltonian numbers in digraphs. 694-701 - Chun-Ying Chiang, Liang-Hao Huang, Bo-Jr Li, Jiaojiao Wu, Hong-Gwa Yeh:
Some results on the target set selection problem. 702-715 - Xiangwen Li, Vicky H. Mak-Hau
The L(2, 1)-labelling problem for cubic Cayley graphs on dihedral groups. 716-736 - Máté Hegyháti, Zsolt Tuza:
Colorability of mixed hypergraphs and their chromatic inversions. 737-751 - Frédéric Havet, Xuding Zhu:
The game Grundy number of graphs. 752-765 - Haili Pan, Daqing Yang:
On total weight choosability of graphs. 766-783
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-09-28 01:17 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: