Content
April 2014, Volume 27, Issue 3
- 545-556 A two-stage approach for surgery scheduling
by Liwei Zhong & Shoucheng Luo & Lidong Wu & Lin Xu & Jinghui Yang & Guochun Tang - 557-566 On minimum balanced bipartitions of triangle-free graphs
by Haiyan Li & Yanting Liang & Muhuo Liu & Baogang Xu - 567-573 Are there more almost separable partitions than separable partitions?
by Fei-Huang Chang & Hong-Bin Chen & Frank K. Hwang - 574-596 Popularity at minimum cost
by Telikepalli Kavitha & Meghana Nasre & Prajakta Nimbhorkar - 597-608 Order consolidation for hierarchical product lines
by Woo-Lahm Kwak & Soo Y. Chang - 609-620 A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties
by Yu Li & Donglei Du & Naihua Xiu & Dachuan Xu
February 2014, Volume 27, Issue 2
- 209-220 Efficient identifications of structural similarities for graphs
by Zheng Fang & Jie Wang - 221-240 An improved distributed data aggregation scheduling in wireless sensor networks
by Deying Li & Qinghua Zhu & Hongwei Du & Jianzhong Li - 241-255 Signed Roman domination in graphs
by H. Abdollahzadeh Ahangar & Michael A. Henning & Christian Löwenstein & Yancai Zhao & Vladimir Samodivkin - 256-270 A study of search algorithms’ optimization speed
by Andrea Valsecchi & Leonardo Vanneschi & Giancarlo Mauri - 271-291 Sharp bounds of the Zagreb indices of k-trees
by John Estes & Bing Wei - 292-301 Generalized perfect domination in graphs
by B. Chaluvaraju & K. A. Vidya - 302-314 An efficient FPRAS type group testing procedure to approximate the number of defectives
by Yongxi Cheng & Yinfeng Xu - 315-327 Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems
by Zi Xu & Donglei Du & Dachuan Xu - 328-344 On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube
by Tzu-Liang Kung & Cheng-Kuan Lin & Lih-Hsing Hsu - 345-354 Boundary graph classes for some maximum induced subgraph problems
by Dmitriy S. Malyshev - 355-368 Circular L(j,k)-labeling number of direct product of path and cycle
by Qiong Wu & Wai Chee Shiu & Pak Kiu Sun - 369-378 Total and paired domination numbers of toroidal meshes
by Fu-Tao Hu & Jun-Ming Xu - 379-396 The adjacent vertex distinguishing total coloring of planar graphs
by Weifan Wang & Danjun Huang - 397-416 Improvements to MCS algorithm for the maximum clique problem
by Mikhail Batsyn & Boris Goldengorin & Evgeny Maslov & Panos M. Pardalos
January 2014, Volume 27, Issue 1
- 1-2 Preface
by Guohui Lin - 3-13 Radiation hybrid map construction problem parameterized
by Chihao Zhang & Haitao Jiang & Binhai Zhu - 14-31 Algorithms for local similarity between forests
by Zhewei Liang & Kaizhong Zhang - 32-48 Minimum diameter cost-constrained Steiner trees
by Wei Ding & Guoliang Xue - 49-64 The edge-centered surface area of the arrangement graph
by Eddie Cheng & Ke Qiu & Zhizhang Shen - 65-77 On the generalized multiway cut in trees problem
by Hong Liu & Peng Zhang - 78-87 On certain geometric properties of the Yao–Yao graphs
by Iyad A. Kanj & Ge Xia - 88-99 Distance- $$d$$ independent set problems for bipartite and chordal graphs
by Hiroshi Eto & Fengrui Guo & Eiji Miyano - 100-114 Online bottleneck matching
by Barbara M. Anthony & Christine Chung - 115-131 On-line bin packing with restricted repacking
by János Balogh & József Békési & Gábor Galambos & Gerhard Reinelt - 132-143 Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
by Marthe Bonamy & Matthew Johnson & Ioannis Lignos & Viresh Patel & Daniël Paulusma - 144-151 The domination number of Cartesian product of two directed paths
by Michel Mollard - 152-163 The subdivision-constrained routing requests problem
by Jianping Li & Weidong Li & Junran Lichen - 164-181 Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
by Elisabeth Günther & Felix G. König & Nicole Megow - 182-198 Competitive analysis for make-to-order scheduling with reliable lead time quotation
by Feifeng Zheng & E. Zhang & Yinfeng Xu & Wei-Chiang Hong - 199-208 Spanning 3-connected index of graphs
by Wei Xiong & Zhao Zhang & Hong-Jian Lai
November 2013, Volume 26, Issue 4
- 621-635 The topology aware file distribution problem
by Shawn T. O’Neil & Amitabh Chaudhary & Danny Z. Chen & Haitao Wang - 636-654 Property testing for cyclic groups and beyond
by François Le Gall & Yuichi Yoshida - 655-669 Optimal strategies for the one-round discrete Voronoi game on a line
by Aritra Banik & Bhaswar B. Bhattacharya & Sandip Das - 670-686 Unavoidable regularities in long words with bounded number of symbol occurrences
by Juha Kortelainen & Tuomas Kortelainen & Ari Vesanen - 687-708 (1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation
by Yuichi Asahiro & Kenta Kanmera & Eiji Miyano - 709-722 Finding paths with minimum shared edges
by Masoud T. Omran & Jörg-Rüdiger Sack & Hamid Zarrabi-Zadeh - 723-754 The density maximization problem in graphs
by Mong-Jen Kao & Bastian Katz & Marcus Krug & D. T. Lee & Ignaz Rutter & Dorothea Wagner - 755-769 Flipping triangles and rectangles
by Minghui Jiang - 770-785 Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
by B. S. Panda & D. Pradhan - 786-798 On the cores of games arising from integer edge covering functions of graphs
by Boram Park & Suh-Ryung Kim & Hye Kyung Kim - 799-810 A new three-machine shop scheduling: complexity and approximation algorithm
by Jianming Dong & Yong Chen & An Zhang & Qifan Yang - 811-818 A note on anti-coordination and social interactions
by Zhigang Cao & Xiaoguang Yang - 819-831 L(d,1)-labelings of the edge-path-replacement of a graph
by Damei Lü & Nianfeng Lin - 832-859 Largest area convex hull of imprecise data based on axis-aligned squares
by Wenqi Ju & Jun Luo & Binhai Zhu & Ovidiu Daescu
October 2013, Volume 26, Issue 3
- 415-415 Preface
by Guangting Chen & Guohui Lin & Zhiyi Tan - 416-436 Bin packing with “Largest In Bottom” constraint: tighter bounds and generalizations
by Gyorgy Dosa & Zsolt Tuza & Deshi Ye - 437-447 Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration
by Min Ji & Chou-Jung Hsu & Dar-Li Yang - 448-464 Semi-online scheduling for jobs with release times
by Rongheng Li & Liying Yang & Xiaoqiong He & Qiang Chen & Xiayan Cheng - 465-471 On the mod sum number of H m,n
by Wenqing Dou - 472-479 Semi-online scheduling on two identical machines with rejection
by Xiao Min & Yuqing Wang & Jing Liu & Min Jiang - 480-488 Online LPT algorithms for parallel machines scheduling with a single server
by Chunjie Su - 489-498 Single machine scheduling problems with subcontracting options
by Weiya Zhong & Zhiming Huo - 499-508 Relay node placement in two-tiered wireless sensor networks with base stations
by Guangting Chen & Suhui Cui - 509-519 Minimizing the maximum bump cost in linear extensions of a poset
by Biao Wu & Longcheng Liu & Enyu Yao - 520-554 Algorithms for the maximum k-club problem in graphs
by Shahram Shahinpour & Sergiy Butenko - 555-567 Applications of extension grey prediction model for power system forecasting
by Wei Niu & Juan Cheng & Guoqing Wang - 568-584 A bilevel programming problem with maximization of a supermodular function in the lower level
by Diana Fanghänel - 585-591 Minimum degree, edge-connectivity and radius
by Baoyindureng Wu & Xinhui An & Guojie Liu & Guiying Yan & Xiaoping Liu - 592-607 Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs
by Bang Ye Wu - 608-619 Roman domination on strongly chordal graphs
by Chun-Hung Liu & Gerard J. Chang
August 2013, Volume 26, Issue 2
- 223-236 Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing
by Yong Zhang & Francis Y. L. Chin & Hing-Fung Ting & Xin Han - 237-250 Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
by Martin Birks & Daniel Cole & Stanley P. Y. Fung & Huichao Xue - 251-265 The k-Canadian Travelers Problem with communication
by Huili Zhang & Yinfeng Xu & Lan Qin - 266-283 On some geometric problems of color-spanning sets
by Wenqi Ju & Chenglin Fan & Jun Luo & Binhai Zhu & Ovidiu Daescu - 284-291 Approximation algorithm for uniform bounded facility location problem
by Weng Kerui - 292-309 Tight approximation bounds for combinatorial frugal coverage algorithms
by Ioannis Caragiannis & Christos Kaklamanis & Maria Kyropoulou - 310-332 The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
by Franz J. Brandenburg & Andreas Gleißner & Andreas Hofmeier - 333-344 A tight analysis of Brown-Baker-Katseff sequences for online strip packing
by W. Kern & J. J. Paulus - 345-371 Optimal job insertion in the no-wait job shop
by Reinhard Bürgy & Heinz Gröflin - 372-384 Objective functions with redundant domains
by Fatima Affif Chaouche & Carrie Rutherford & Robin Whitty - 385-392 L(2,1)-labelings of the edge-path-replacement of a graph
by Lü Damei - 393-411 Super-cyclically edge-connected regular graphs
by Jin-Xin Zhou & Yan-Quan Feng - 412-414 Erratum to: Tight bound for matching
by Yijie Han
July 2013, Volume 26, Issue 1
- 1-9 The three-dimensional matching problem in Kalmanson matrices
by Sergey Polyakovskiy & Frits C. R. Spieksma & Gerhard J. Woeginger - 10-18 On the outer-connected domination in graphs
by M. H. Akhbari & R. Hasni & O. Favaron & H. Karami & S. M. Sheikholeslami - 19-43 Parameterized complexity of k-anonymity: hardness and tractability
by Paola Bonizzoni & Gianluca Della Vedova & Riccardo Dondi & Yuri Pirola - 44-70 Optimal key tree structure for two-user replacement and deletion problems
by Weiwei Wu & Minming Li & Enhong Chen - 71-81 Maximum latency scheduling problem on two-person cooperative games
by Yanhong Gu & Jing Fan & Guochun Tang & Jiaofei Zhong - 82-85 On the union of intermediate nodes of shortest paths
by Xiang Li & Xiaodong Hu & Wonjun Lee - 86-108 An adaptive multistart tabu search approach to solve the maximum clique problem
by Qinghua Wu & Jin-Kao Hao - 109-119 The maximum flow problem with disjunctive constraints
by Ulrich Pferschy & Joachim Schauer - 120-126 Independent dominating sets in regular graphs
by Julie Haviland - 127-134 Approximate min-max relations on plane graphs
by Jie Ma & Xingxing Yu & Wenan Zang - 135-151 Embeddings of circulant networks
by Indra Rajasingh & Paul Manuel & M. Arockiaraj & Bharati Rajan - 152-160 Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ
by Hervé Hocquard & Mickaël Montassier - 161-177 Practical unicast and convergecast scheduling schemes for cognitive radio networks
by Shouling Ji & Arif Selcuk Uluagac & Raheem Beyah & Zhipeng Cai - 178-189 Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
by Cristina Bazgan & Sonia Toubaline & Daniel Vanderpooten - 190-197 Metric dimension of some distance-regular graphs
by Jun Guo & Kaishun Wang & Fenggao Li - 198-222 On the optimality of the TLS algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines
by Shlomo Karhi & Dvir Shabtay
May 2013, Volume 25, Issue 4
- 499-500 Preface: optimization in graphs
by D. J. Guan & Ko-Wei Lih & Xuding Zhu - 501-504 Equivalence of two conjectures on equitable coloring of graphs
by Bor-Liang Chen & Ko-Wei Lih & Chih-Hung Yen - 505-522 Structure of Fibonacci cubes: a survey
by Sandi Klavžar - 523-535 Enumerating the edge-colourings and total colourings of a regular graph
by S. Bessy & F. Havet - 536-542 The decycling number of outerplanar graphs
by Huilan Chang & Hung-Lin Fu & Min-Yun Lien - 543-561 (p,q)-total labeling of complete graphs
by Ma-Lian Chia & David Kuo & Jing-Ho Yan & Siou-Ru Yang - 562-586 Acyclic edge coloring of planar graphs without 4-cycles
by Weifan Wang & Qiaojun Shu & Yiqiao Wang - 587-596 The partition method for poset-free families
by Jerrold R. Griggs & Wei-Tian Li - 597-601 A note on optimal pebbling of hypercubes
by Hung-Lin Fu & Kuo-Ching Huang & Chin-Lin Shiue - 602-616 The broadcast median problem in heterogeneous postal model
by Cheng-Hsiao Tsou & Gen-Huey Chen & Hung-I Yu & Ching-Chi Lin - 617-638 A combinatorial proof of the cyclic sieving phenomenon for faces of Coxeterhedra
by Sen-Peng Eu & Tung-Shan Fu & Yeh-Jong Pan - 639-645 Three conjectures on the signed cycle domination in graphs
by Jian Guan & Xiaoyan Liu & Changhong Lu & Zhengke Miao - 646-660 L(p,q)-labeling of sparse graphs
by Clément Charpentier & Mickaël Montassier & André Raspaud - 661-679 Distance two edge labelings of lattices
by Wensong Lin & Jianzhuan Wu - 680-693 Chromatic number of distance graphs generated by the sets {2,3,x,y}
by Daphne Der-Fen Liu & Aileen Sutedja - 694-701 The hamiltonian numbers in digraphs
by Ting-Pang Chang & Li-Da Tong - 702-715 Some results on the target set selection problem
by Chun-Ying Chiang & Liang-Hao Huang & Bo-Jr Li & Jiaojiao Wu & Hong-Gwa Yeh - 716-736 The L(2,1)-labelling problem for cubic Cayley graphs on dihedral groups
by Xiangwen Li & Vicky Mak-Hau & Sanming Zhou - 737-751 Colorability of mixed hypergraphs and their chromatic inversions
by Máté Hegyháti & Zsolt Tuza - 752-765 The game Grundy number of graphs
by Frédéric Havet & Xuding Zhu - 766-783 On total weight choosability of graphs
by Haili Pan & Daqing Yang
April 2013, Volume 25, Issue 3
- 339-351 On sorting unsigned permutations by double-cut-and-joins
by Xin Chen - 352-367 Constant time approximation scheme for largest well predicted subset
by Bin Fu & Lusheng Wang - 368-392 Computing maximum upward planar subgraphs of single-source embedded digraphs
by Aimal Rextin & Patrick Healy - 393-429 Clustering with or without the approximation
by Frans Schalekamp & Michael Yu & Anke Zuylen - 430-459 A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
by Sayaka Kamei & Hirotsugu Kakugawa & Stéphane Devismes & Sébastien Tixeuil - 460-480 Minimum-segment convex drawings of 3-connected cubic plane graphs
by Debajyoti Mondal & Rahnuma Islam Nishat & Sudip Biswas & Md. Saidur Rahman - 481-497 Near optimal solutions for maximum quasi-bicliques
by Lusheng Wang
February 2013, Volume 25, Issue 2
- 165-175 Scheduling Packets with Values and Deadlines in Size-Bounded Buffers
by Fei Li - 176-190 Some variations on constrained minimum enclosing circle problem
by Arindam Karmakar & Sandip Das & Subhas C. Nandy & Binay K. Bhattacharya - 191-207 Complexity of determining the most vital elements for the p-median and p-center location problems
by Cristina Bazgan & Sonia Toubaline & Daniel Vanderpooten - 208-233 Coverage with k-transmitters in the presence of obstacles
by Brad Ballinger & Nadia Benbernou & Prosenjit Bose & Mirela Damian & Erik D. Demaine & Vida Dujmović & Robin Flatland & Ferran Hurtado & John Iacono & Anna Lubiw & Pat Morin & Vera Sacristán & Diane Souvaine & Ryuhei Uehara - 234-254 Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials
by Zhixiang Chen & Bin Fu - 255-264 Improved approximation for spanning star forest in dense graphs
by Jing He & Hongyu Liang - 265-278 A primal-dual approximation algorithm for the Asymmetric Prize-Collecting TSP
by Viet Hung Nguyen - 279-307 Preemptive scheduling on two identical parallel machines with a single transporter
by Hans Kellerer & Alan J. Soper & Vitaly A. Strusevich - 308-325 Discrete optimization with polynomially detectable boundaries and restricted level sets
by Yakov Zinder & Julia Memar & Gaurav Singh - 326-337 A simplified algorithm for the all pairs shortest path problem with O(n 2logn) expected time
by Tadao Takaoka
January 2013, Volume 25, Issue 1
- 1-18 An extension of Stein-Lovász theorem and some of its applications
by Guang-Siang Lee - 19-46 The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
by Jean Cardinal & Erik D. Demaine & Samuel Fiorini & Gwenaël Joret & Ilan Newman & Oren Weimann - 47-59 Edge lifting and total domination in graphs
by Wyatt J. Desormeaux & Teresa W. Haynes & Michael A. Henning - 60-77 A 6/5-approximation algorithm for the maximum 3-cover problem
by Ioannis Caragiannis & Gianpiero Monaco - 78-90 Edge-colouring of joins of regular graphs II
by Caterina Simone & Anna Galluccio - 91-98 The total domination subdivision number in graphs with no induced 3-cycle and 5-cycle
by H. Karami & R. Khoeilar & S. M. Sheikholeslami - 99-122 Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
by Alexey Sorokin & Vladimir Boginski & Artyom Nahapetyan & Panos M. Pardalos - 123-134 Two-stage proportionate flexible flow shop to minimize the makespan
by Byung-Cheon Choi & Kangbok Lee - 135-163 A new two-party bargaining mechanism
by Y. H. Gu & M. Goh & Q. L. Chen & R. D. Souza & G. C. Tang
November 2012, Volume 24, Issue 4
- 397-412 Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA
by Julien Schleich & Hoai An Le Thi & Pascal Bouvry - 413-426 Min-energy broadcast in mobile ad hoc networks with restricted motion
by J. M. Díaz-Báñez & R. Fabila-Monroy & D. Flores-Peñaloza & M. A. Heredia & J. Urrutia - 427-436 Parity and strong parity edge-colorings of graphs
by Hsiang-Chun Hsu & Gerard J. Chang - 437-458 Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem
by Jean-Charles Créput & Amir Hajjam & Abderrafiaa Koukam & Olivier Kuhn - 459-467 On the complexity of path problems in properly colored directed graphs
by Donatella Granata & Behnam Behdani & Panos M. Pardalos - 468-484 Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors
by Yang Wang & Hung Q. Ngo & Thanh-Nhan Nguyen - 485-507 Dispatching design for storage-centric wireless sensor networks
by Minming Li & Qin Liu & Jianping Wang & Yingchao Zhao - 508-525 Competent genetic algorithms for weighing matrices
by I. S. Kotsireas & C. Koukouvinos & P. M. Pardalos & D. E. Simos - 526-539 On the fractionality of the path packing problem
by Natalia Vanetik - 540-563 A branch-and-bound algorithm for the minimum cut linear arrangement problem
by Gintaras Palubeckis & Dalius Rubliauskas - 564-579 Algebraic connectivity of an even uniform hypergraph
by Shenglong Hu & Liqun Qi - 580-592 An optimal square coloring of planar graphs
by Yuehua Bu & Xubo Zhu - 593-612 Online scheduling on uniform machines with two hierarchies
by Li-ying Hou & Liying Kang - 613-626 LLL-reduction for integer knapsacks
by Iskander Aliev & Martin Henk - 627-646 The paths embedding of the arrangement graphs with prescribed vertices in given position
by Yuan-Hsiang Teng & Jimmy J. M. Tan & Chey-Woei Tsay & Lih-Hsing Hsu
October 2012, Volume 24, Issue 3
- 147-161 Minimum statuses of connected graphs with fixed maximum degree and order
by Chiang Lin & Wei-Han Tsai & Jen-Ling Shang & Yuan-Jen Zhang - 162-175 The total {k}-domatic number of wheels and complete graphs
by Jing Chen & Xinmin Hou & Ning Li - 176-191 Vertices in all minimum paired-dominating sets of block graphs
by Lei Chen & Changhong Lu & Zhenbing Zeng - 192-201 The second largest number of maximal independent sets in connected graphs with at most one cycle
by Min-Jen Jou - 202-228 Min-cost multiflows in node-capacitated undirected networks
by Maxim A. Babenko & Alexander V. Karzanov - 229-239 Approximation schemes for two-machine flow shop scheduling with two agents
by Wenchang Luo & Lin Chen & Guochuan Zhang - 240-265 Long cycles in hypercubes with optimal number of faulty vertices
by Jiří Fink & Petr Gregor - 266-279 On L(2,1)-labeling of generalized Petersen graphs
by Yuan-Zhen Huang & Chun-Ying Chiang & Liang-Hao Huang & Hong-Gwa Yeh - 280-298 Random restricted matching and lower bounds for combinatorial optimization
by Stefan Steinerberger - 299-318 Some results on the injective chromatic number of graphs
by Min Chen & Geňa Hahn & André Raspaud & Weifan Wang - 319-328 A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring
by Jianping Li & Weidong Li & Lusheng Wang - 329-338 A Nordhaus-Gaddum-type result for the induced path number
by Johannes H. Hattingh & Osama A. Saleh & Lucas C. Merwe & Terry J. Walters - 339-346 k-tuple total domination in cross products of graphs
by Michael A. Henning & Adel P. Kazemi - 347-373 Exact combinatorial algorithms and experiments for finding maximum k-plexes
by Hannes Moser & Rolf Niedermeier & Manuel Sorge - 374-378 The complexity of influence maximization problem in the deterministic linear threshold model
by Zaixin Lu & Wei Zhang & Weili Wu & Joonmo Kim & Bin Fu - 379-388 On cyclic vertex-connectivity of Cartesian product digraphs
by Da Huang & Zhao Zhang - 389-396 Note on the hardness of generalized connectivity
by Shasha Li & Xueliang Li
August 2012, Volume 24, Issue 2
- 65-66 Introduction
by Satoshi Fujita & Md. Saidur Rahman - 67-98 A rooted-forest partition with uniform vertex demand
by Naoki Katoh & Shin-ichi Tanigawa - 99-115 Small grid drawings of planar graphs with balanced partition
by Xiao Zhou & Takashi Hikino & Takao Nishizeki - 116-130 Acyclically 3-colorable planar graphs
by Patrizio Angelini & Fabrizio Frati - 131-146 FPT algorithms for Connected Feedback Vertex Set
by Neeldhara Misra & Geevarghese Philip & Venkatesh Raman & Saket Saurabh & Somnath Sikdar
July 2012, Volume 24, Issue 1
- 1-14 Max-coloring paths: tight bounds and extensions
by Telikepalli Kavitha & Julián Mestre - 15-31 Shifting strategy for geometric graphs without geometry
by Imran A. Pirwani - 32-51 Minimum covering with travel cost
by Sándor P. Fekete & Joseph S. B. Mitchell & Christiane Schmidt - 52-64 Online maximum directed cut
by Amotz Bar-Noy & Michael Lampis
May 2012, Volume 23, Issue 4
- 395-424 A bicriteria approach to scheduling a single machine with job rejection and positional penalties
by Dvir Shabtay & Nufar Gaspar & Liron Yedidsion - 425-442 A combinatorial model and algorithm for globally searching community structure in complex networks
by Xiang-Sun Zhang & Zhenping Li & Rui-Sheng Wang & Yong Wang - 443-450 A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs
by Xu Zhu & Wei Wang & Shan Shan & Zhong Wang & Weili Wu - 451-461 Polynomial time approximation scheme for t-latency bounded information propagation problem in wireless networks
by Wei Zhang & Zhao Zhang & Wei Wang & Feng Zou & Wonjun Lee - 462-470 Hamiltonian numbers of Möbius double loop networks
by Gerard J. Chang & Ting-Pang Chang & Li-Da Tong - 471-482 Fault-tolerant diameter for three family interconnection networks
by Tongliang Shi & Mei Lu - 483-492 An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration
by Ming Liu & Feifeng Zheng & Chengbin Chu & Jiantong Zhang - 493-506 Exact and approximation algorithms for the complementary maximal strip recovery problem
by Haitao Jiang & Zhong Li & Guohui Lin & Lusheng Wang & Binhai Zhu - 507-518 Perfect matchings in paired domination vertex critical graphs
by Shenwei Huang & Erfang Shan & Liying Kang - 519-527 Minimum common string partition revisited
by Haitao Jiang & Binhai Zhu & Daming Zhu & Hong Zhu - 528-540 Algorithms for the minimum weight k-fold (connected) dominating set problem
by Wenkai Ma & Deying Li & Zhao Zhang
April 2012, Volume 23, Issue 3
- 309-321 Flattening topologically spherical surface
by Danny Z. Chen & Ewa Misiołek - 322-330 Tight bound for matching
by Yijie Han - 331-355 Constraint bipartite vertex cover: simpler exact algorithms and implementations
by Guoqiang Bai & Henning Fernau - 356-372 Multi-bidding strategy in sponsored search auctions
by Tian-Ming Bu & Xiaotie Deng & Qi Qi