Printed from https://ideas.repec.org/s/spr/jcomop10.html
Content
May 2013, Volume 25, Issue 4
- 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 - 373-394 Estimating hybrid frequency moments of data streams
by Sumit Ganguly & Mohit Bansal & Shruti Dube
February 2012, Volume 23, Issue 2
- 159-166 Optimal algorithms for online time series search and one-way trading with interrelated prices
by Wenming Zhang & Yinfeng Xu & Feifeng Zheng & Yucheng Dong - 167-188 Packing cycles exactly in polynomial time
by Qin Chen & Xujin Chen - 189-195 An optimal online algorithm for single machine scheduling to minimize total general completion time
by Ming Liu & Chengbin Chu & Yinfeng Xu & Jiazhen Huo - 196-223 Models for the single-vehicle preemptive pickup and delivery problem
by H. L. M. Kerivin & M. Lacroix & A. R. Mahjoub - 224-251 Multi-way clustering and biclustering by the Ratio cut and Normalized cut in graphs
by Neng Fan & Panos M. Pardalos - 252-260 The total {k}-domatic number of a graph
by S. M. Sheikholeslami & L. Volkmann - 261-273 An inverse approach to convex ordered median problems in trees
by Elisabeth Gassner - 274-291 Analysis and approximation for bank selection instruction minimization on partitioned memory architecture
by Minming Li & Tiantian Liu & Chun Jason Xue & Yingchao Zhao - 292-300 The complexity of VLSI power-delay optimization by interconnect resizing
by Konstantin Moiseev & Avinoam Kolodny & Shmuel Wimer - 301-307 Constructing weakly connected dominating set for secure clustering in distributed sensor network
by Hongjie Du & Weili Wu & Shan Shan & Donghyun Kim & Wonjun Lee
January 2012, Volume 23, Issue 1
- 1-8 The competition number of a graph with exactly two holes
by Bo-Jr Li & Gerard J. Chang - 9-20 Independent dominating sets in triangle-free graphs
by Wayne Goddard & Jeremy Lyle - 21-28 Improving an exact approach for solving separable integer quadratic knapsack problems
by Federico Della Croce & Dominique Quadri - 29-49 Combinatorial algorithms for the maximum k-plex problem
by Benjamin McClosky & Illya V. Hicks - 50-60 Solving haplotype inference problem with non-genotyped founders via integer linear programming
by Yongxi Cheng & Guohui Lin - 61-78 A new approach to solve open-partition problems
by Huilan Chang & Frank K. Hwang & Uriel G. Rothblum - 79-93 On backbone coloring of graphs
by Weifan Wang & Yuehua Bu & Mickaël Montassier & André Raspaud - 94-117 The max quasi-independent set problem
by N. Bourgeois & A. Giannakos & G. Lucarelli & I. Milis & V. T. Paschos & O. Pottié - 118-139 On the construction of k-connected m-dominating sets in wireless networks
by Yingshu Li & Yiwei Wu & Chunyu Ai & Raheem Beyah - 140-157 Acyclic chromatic indices of planar graphs with girth at least five
by Qiaojun Shu & Weifan Wang
November 2011, Volume 22, Issue 4
- 495-498 A generalization of Macula’s disjunct matrices
by Ping Zhao & Kefeng Diao & Kaishun Wang - 499-508 Resource-sharing systems and hypergraph colorings
by Wu-Hsiung Lin & Gerard J. Chang - 509-516 Optimal on-line algorithms for one batch machine with grouped processing times
by Yang Fang & Peihai Liu & Xiwen Lu - 517-530 The Maximum Box Problem for moving points in the plane
by S. Bereg & J. M. Díaz-Báñez & P. Pérez-Lantero & I. Ventura - 531-548 Selfish bin coloring
by Leah Epstein & Sven O. Krumke & Asaf Levin & Heike Sperber - 549-562 Super cyclically edge connected transitive graphs
by Zhao Zhang & Bing Wang - 563-571 On the vertex characterization of single-shape partition polytopes
by Yu-Chi Liu & Jun-Jie Pan - 572-593 Revised GRASP with path-relinking for the linear ordering problem
by W. Art Chaovalitwongse & Carlos A. S. Oliveira & Bruno Chiarini & Panos M. Pardalos & Mauricio G. C. Resende - 594-608 Optimality conditions for a bilevel matroid problem
by Diana Fanghänel - 609-629 A closest vector problem arising in radiation therapy planning
by Céline Engelbeen & Samuel Fiorini & Antje Kiesel - 630-639 Optimal tree structure with loyal users and batch updates
by Yu-Ki Chan & Minming Li & Weiwei Wu - 640-650 Co-2-plex polynomials
by Benjamin McClosky & Anthony Simms & Illya V. Hicks - 651-662 On domination number of Cartesian product of directed paths
by Juan Liu & Xindong Zhang & Jixiang Meng - 663-673 PTAS for minimum weighted connected vertex cover problem with c-local condition in unit disk graphs
by Lidan Fan & Zhao Zhang & Wei Wang - 674-683 Optimal semi-online algorithm for scheduling with rejection on two uniform machines
by Xiao Min & Jing Liu & Yuqing Wang - 684-698 Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs
by Chunmei Liu & Yinglei Song - 699-725 Geometric rounding: a dependent randomized rounding scheme
by Dongdong Ge & Simai He & Yinyu Ye & Jiawei Zhang - 726-746 Improved floor-planning of graphs via adjacency-preserving transformations
by Huaming Zhang & Sadish Sadasivam - 747-762 A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
by Neng Fan & Panos M. Pardalos - 763-777 Fast searching games on graphs
by Donald Stanley & Boting Yang - 778-796 The multiple sequence sets: problem and heuristic algorithms
by Kang Ning & Hon Wai Leong - 797-818 Minimizing makespan in an ordered flow shop with machine-dependent processing times
by Byung-Cheon Choi & Joseph Y.-T. Leung & Michael L. Pinedo - 819-844 SIRALINA: efficient two-steps heuristic for storage optimisation in single period task scheduling
by Karine Deschinkel & Sid-Ahmed-Ali Touati & Sébastien Briais - 845-856 Polynomially solvable special cases of the quadratic bottleneck assignment problem
by Rainer E. Burkard & Roswitha Rissner - 857-872 Minimum d-blockers and d-transversals in graphs
by Marie-Christine Costa & Dominique Werra & Christophe Picouleau - 873-881 A modified power spectral density test applied to weighing matrices with small weight
by Ilias S. Kotsireas & Christos Koukouvinos & Panos M. Pardalos - 882-894 Improving an upper bound on the size of k-regular induced subgraphs
by Carlos J. Luz
October 2011, Volume 22, Issue 3
- 293-304 On the readability of monotone Boolean formulae
by Khaled Elbassioni & Kazuhisa Makino & Imran Rauf - 305-324 Honeynet games: a game theoretic approach to defending network monitors
by Jin-Yi Cai & Vinod Yegneswaran & Chris Alfeld & Paul Barford - 325-338 An improved time-space lower bound for tautologies
by Scott Diehl & Dieter Melkebeek & Ryan Williams - 339-358 Popular matchings: structure and algorithms
by Eric McDermid & Robert W. Irving - 359-377 Online tree node assignment with resource augmentation
by Joseph Wun-Tat Chan & Francis Y. L. Chin & Hing-Fung Ting & Yong Zhang - 378-391 On the performances of Nash equilibria in isolation games
by Vittorio Bilò & Michele Flammini & Gianpiero Monaco & Luca Moscardelli - 392-408 A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise
by Masaki Yamamoto & Shuji Kijima & Yasuko Matsui - 409-425 Convex partitions with 2-edge connected dual graphs
by Marwan Al-Jubeh & Michael Hoffmann & Mashhood Ishaque & Diane L. Souvaine & Csaba D. Tóth - 426-437 Why locally-fair maximal flows in client-server networks perform well
by Kenneth A. Berman & Chad Yoshikawa - 438-456 Strongly chordal and chordal bipartite graphs are sandwich monotone
by Pinar Heggernes & Federico Mancini & Charis Papadopoulos & R. Sritharan - 457-468 On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries
by Ivona Bezáková & Nayantara Bhatnagar & Dana Randall - 469-481 Sublinear-time algorithms for tournament graphs
by Stefan Dantchev & Tom Friedetzky & Lars Nagel - 482-493 Separating NE from some nonuniform nondeterministic complexity classes
by Bin Fu & Angsheng Li & Liyu Zhang
August 2011, Volume 22, Issue 2
- 121-144 The flexible blocking job shop with transfer and set-up times
by Heinz Gröflin & Dinh Nguyen Pham & Reinhard Bürgy - 145-152 Pooling designs for clone library screening in the inhibitor complex model
by Fei-huang Chang & Huilan Chang & Frank K. Hwang - 153-165 An optimal semi-online algorithm for 2-machine scheduling with an availability constraint
by Hongying Li & Chunjie Su - 166-179 Restrained domination in cubic graphs
by Johannes H. Hattingh & Ernst J. Joubert - 180-201 A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem
by José Fernando Gonçalves & Mauricio G. C. Resende - 202-216 Optimal wafer cutting in shuttle layout problems
by Lasse Nisted & David Pisinger & Avri Altman - 217-234 A characterization of graphs with disjoint dominating and paired-dominating sets
by Justin Southey & Michael A. Henning - 235-251 Upper paired-domination in claw-free graphs
by Paul Dorbec & Michael A. Henning - 252-269 Sharp bounds for Zagreb indices of maximal outerplanar graphs
by Ailin Hou & Shuchao Li & Lanzhen Song & Bing Wei - 270-281 Reconstruction of hidden graphs and threshold group testing
by Huilan Chang & Hong-Bin Chen & Hung-Lin Fu & Chie-Huai Shi - 282-291 On the power domination number of the generalized Petersen graphs
by Guangjun Xu & Liying Kang
July 2011, Volume 22, Issue 1
- 1-18 Which trees have a differentiating-paired dominating set?
by Michael A. Henning & John McCoy - 19-34 A special combinatorial problem: pitch arrangement for pneumatic tires
by Wei-Chu Weng - 35-51 Robust multi-sensor scheduling for multi-site surveillance
by Nikita Boyko & Timofey Turko & Vladimir Boginski & David E. Jeffcoat & Stanislav Uryasev & Grigoriy Zrazhevsky & Panos M. Pardalos - 52-70 Line facility location in weighted regions
by Yam Ki Cheung & Ovidiu Daescu - 71-77 On the Bandpass problem
by Guohui Lin - 78-96 Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
by Yuichi Asahiro & Jesper Jansson & Eiji Miyano & Hirotaka Ono & Kouhei Zenmyo - 97-119 Anonymizing binary and small tables is hard to approximate
by Paola Bonizzoni & Gianluca Della Vedova & Riccardo Dondi
May 2011, Volume 21, Issue 4
- 393-408 Semi-online scheduling on two uniform machines with the known largest size
by Sheng-Yi Cai & Qi-Fan Yang - 409-422 Efficient estimation of the accuracy of the maximum likelihood method for ancestral state reconstruction
by Bin Ma & Louxin Zhang - 423-433 On the number of separable partitions
by Frank K. Hwang & Uriel G. Rothblum - 434-457 A Branch and Cut solver for the maximum stable set problem
by Steffen Rebennack & Marcus Oswald & Dirk Oliver Theis & Hanna Seitz & Gerhard Reinelt & Panos M. Pardalos - 458-480 Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling
by György Dósa & M. Grazia Speranza & Zsolt Tuza - 481-496 On the distance paired domination of generalized Petersen graphs P(n,1) and P(n,2)
by Haoli Wang & Xirong Xu & Yuansheng Yang & Kai Lü - 497-510 Approximation scheme for restricted discrete gate sizing targeting delay minimization
by Chen Liao & Shiyan Hu
April 2011, Volume 21, Issue 3
- 269-292 Algebraic and combinatorial properties of ideals and algebras of uniform clutters of TDI systems
by Luis A. Dupont & Rafael H. Villarreal - 293-305 Approximation algorithms for multicast routing in ad hoc wireless networks
by Deying Li & Qinghua Zhu - 306-329 The k-coloring fitness landscape
by Hend Bouziri & Khaled Mellouli & El-Ghazali Talbi - 330-347 Hardness and algorithms for rainbow connection
by Sourav Chakraborty & Eldar Fischer & Arie Matsliah & Raphael Yuster - 348-363 Data aggregation for p-median problems
by Bader F. AlBdaiwi & Diptesh Ghosh & Boris Goldengorin - 364-382 Approximating k-generalized connectivity via collapsing HSTs
by Danny Segev - 383-392 On the generalized constrained longest common subsequence problems
by Yi-Ching Chen & Kun-Mao Chao
February 2011, Volume 21, Issue 2
- 151-158 On the parameterized complexity of the Multi-MCT and Multi-MCST problems
by Wenbin Chen & Matthew C. Schmidt & Nagiza F. Samatova - 159-191 Efficient algorithms for supergraph query processing on graph databases
by Shuo Zhang & Xiaofeng Gao & Weili Wu & Jianzhong Li & Hong Gao - 192-208 Approximation and hardness results for label cut and related problems
by Peng Zhang & Jin-Yi Cai & Lin-Qing Tang & Wen-Bo Zhao - 209-218 Bounding the total domination subdivision number of a graph in terms of its order
by Odile Favaron & Hossein Karami & Seyyed Mahmoud Sheikholeslami - 219-246 Approximating the chromatic index of multigraphs
by Guantao Chen & Xingxing Yu & Wenan Zang - 247-253 Minimizing the sum cost in linear extensions of a poset
by Longcheng Liu & Biao Wu & Enyu Yao - 254-267 Approximating capacitated tree-routings in networks
by Ehab Morsy & Hiroshi Nagamochi
January 2011, Volume 21, Issue 1
- 1-1 Preface
by Xiaodong Hu & Jie Wang - 2-18 Covering directed graphs by in-trees
by Naoyuki Kamiyama & Naoki Katoh - 19-46 Compact labelings for efficient first-order model-checking
by Bruno Courcelle & Cyril Gavoille & Mamadou Moustapha Kanté - 47-66 Visual cryptography on graphs
by Steve Lu & Daniel Manchala & Rafail Ostrovsky - 67-82 New algorithms for online rectangle filling with k-lookahead
by Haitao Wang & Amitabh Chaudhary & Danny Z. Chen