| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Xu Zhu, Wei Wang 0032, Shan Shan, Zhong Wang, Weili Wu |
A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs.  |
J. Comb. Optim.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Wenming Zhang, Yinfeng Xu, Feifeng Zheng, Yucheng Dong |
Optimal algorithms for online time series search and one-way trading with interrelated prices. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Wayne Goddard, Jeremy Lyle |
Independent dominating sets in triangle-free graphs. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yingshu Li, Yiwei Wu, Chunyu Ai, Raheem A. Beyah |
On the construction of k-connected m-dominating sets in wireless networks. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin McClosky, Illya V. Hicks |
Combinatorial algorithms for the maximum k-plex problem. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Huilan Chang, Frank K. Hwang, Uriel G. Rothblum |
A new approach to solve open-partition problems. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Imran A. Pirwani |
Shifting strategy for geometric graphs without geometry. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Wenkai Ma, Deying Li, Zhao Zhang |
Algorithms for the minimum weight k-fold (connected) dominating set problem. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Shenwei Huang, Erfang Shan, Liying Kang |
Perfect matchings in paired domination vertex critical graphs. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Minming Li, Tiantian Liu, Chun Jason Xue, Yingchao Zhao |
Analysis and approximation for bank selection instruction minimization on partitioned memory architecture. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sándor P. Fekete, Joseph S. B. Mitchell, Christiane Schmidt |
Minimum covering with travel cost. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Wei Zhang, Zhao Zhang, Wei Wang, Feng Zou, Wonjun Lee |
Polynomial time approximation scheme for t-latency bounded information propagation problem in wireless networks. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yijie Han |
Tight bound for matching. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ming Liu, Chengbin Chu, Yinfeng Xu, Jiazhen Huo |
An optimal online algorithm for single machine scheduling to minimize total general completion time. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié |
The max quasi-independent set problem. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Bo-Jr Li, Gerard J. Chang |
The competition number of a graph with exactly two holes. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hongjie Du, Weili Wu, Shan Shan, Donghyun Kim, Wonjun Lee |
Constructing weakly connected dominating set for secure clustering in distributed sensor network. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dvir Shabtay, Nufar Gaspar, Liron Yedidsion |
A bicriteria approach to scheduling a single machine with job rejection and positional penalties. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sumit Ganguly, Mohit Bansal, Shruti Dube |
Estimating hybrid frequency moments of data streams. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ming Liu, Feifeng Zheng, Chengbin Chu, Jiantong Zhang |
An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Federico Della Croce, Dominique Quadri |
Improving an exact approach for solving separable integer quadratic knapsack problems. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Ting-Pang Chang, Li-Da Tong |
Hamiltonian numbers of Möbius double loop networks. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Haitao Jiang, Binhai Zhu, Daming Zhu, Hong Zhu |
Minimum common string partition revisited. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud |
On backbone coloring of graphs. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tian-Ming Bu, Xiaotie Deng, Qi Qi |
Multi-bidding strategy in sponsored search auctions. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Z. Chen, Ewa Misiolek |
Flattening topologically spherical surface. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstantin Moiseev, Avinoam Kolodny, Shmuel Wimer |
The complexity of VLSI power-delay optimization by interconnect resizing. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Elisabeth Gassner |
An inverse approach to convex ordered median problems in trees. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiang-Sun Zhang, Zhen-Ping Li, Rui-Sheng Wang, Yong Wang |
A combinatorial model and algorithm for globally searching community structure in complex networks. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha, Julián Mestre |
Max-coloring paths: tight bounds and extensions. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Guoqiang Bai 0002, Henning Fernau |
Constraint bipartite vertex cover: simpler exact algorithms and implementations. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub |
Models for the single-vehicle preemptive pickup and delivery problem. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Michael Lampis |
Online maximum directed cut. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tongliang Shi, Mei Lu |
Fault-tolerant diameter for three family interconnection networks. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Qiaojun Shu, Weifan Wang |
Acyclic chromatic indices of planar graphs with girth at least five. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Haitao Jiang, Zhong Li, Guohui Lin, Lusheng Wang, Binhai Zhu |
Exact and approximation algorithms for the complementary maximal strip recovery problem. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Qin Chen, Xujin Chen |
Packing cycles exactly in polynomial time. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Seyed Mahmoud Sheikholeslami, Lutz Volkmann |
The total {k}-domatic number of a graph. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Neng Fan, Panos M. Pardalos |
Multi-way clustering and biclustering by the Ratio cut and Normalized cut in graphs. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yongxi Cheng, Guohui Lin |
Solving haplotype inference problem with non-genotyped founders via integer linear programming. |
J. Comb. Optim. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Rainer E. Burkard, Roswitha Rissner |
Polynomially solvable special cases of the quadratic bottleneck assignment problem. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dongdong Ge, Simai He, Yinyu Ye, Jiawei Zhang |
Geometric rounding: a dependent randomized rounding scheme. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Huaming Zhang, Sadish Sadasivam |
Improved floor-planning of graphs via adjacency-preserving transformations. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté |
Compact labelings for efficient first-order model-checking. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaodong Hu, Jie Wang |
Preface. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Wenbin Chen, Matthew C. Schmidt, Nagiza F. Samatova |
On the parameterized complexity of the Multi-MCT and Multi-MCST problems. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Diana Fanghänel |
Optimality conditions for a bilevel matroid problem. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Segev |
Approximating k-generalized connectivity via collapsing HSTs. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Haoli Wang, Xirong Xu, Yuansheng Yang, Kai Lü |
On the distance paired domination of generalized Petersen graphs P(n, 1) and P(n, 2). |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Chen Liao, Shiyan Hu |
Approximation scheme for restricted discrete gate sizing targeting delay minimization. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivona Bezáková, Nayantara Bhatnagar, Dana Randall |
On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin McClosky, Anthony Simms, Illya V. Hicks |
Co-2-plex polynomials. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo |
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes H. Hattingh, Ernst J. Joubert |
Restrained domination in cubic graphs. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, T. C. Vijayaraghavan |
The orbit problem is in the GapL hierarchy. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Naoyuki Kamiyama, Naoki Katoh |
Covering directed graphs by in-trees. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheng-Yi Cai, Qi-Fan Yang |
Semi-online scheduling on two uniform machines with the known largest size. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster |
Hardness and algorithms for rainbow connection. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Heinz Gröflin, Dinh-Nguyen Pham, Reinhard Bürgy |
The flexible blocking job shop with transfer and set-up times. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Wei-Chu Weng |
A special combinatorial problem: pitch arrangement for pneumatic tires. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ehab Morsy, Hiroshi Nagamochi |
Approximating capacitated tree-routings in networks. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan S. Dantchev, Tom Friedetzky, Lars Nagel |
Sublinear-time algorithms for tournament graphs. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Fujiwara, Kazuo Iwama, Yoshiyuki Sekiguchi |
Average-case competitive analyses for one-way trading. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bin Fu, Angsheng Li, Liyu Zhang |
Separating NE from some nonuniform nondeterministic complexity classes. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuo Zhang, Xiaofeng Gao, Weili Wu, Jianzhong Li, Hong Gao |
Efficient algorithms for supergraph query processing on graph databases. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Guangjun Xu, Liying Kang |
On the power domination number of the generalized Petersen graphs. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Byung-Cheon Choi, Joseph Y.-T. Leung, Michael L. Pinedo |
Minimizing makespan in an ordered flow shop with machine-dependent processing times. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Peng Zhang, Jin-yi Cai, Linqing Tang, Wenbo Zhao |
Approximation and hardness results for label cut and related problems. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hend Bouziri, Khaled Mellouli, El-Ghazali Talbi |
The k-coloring fitness landscape. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric McDermid, Robert W. Irving |
Popular matchings: structure and algorithms. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | José Fernando Gonçalves, Mauricio G. C. Resende |
A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf |
On the readability of monotone Boolean formulae. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Justin Southey, Michael A. Henning |
A characterization of graphs with disjoint dominating and paired-dominating sets. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenneth A. Berman, Chad Yoshikawa |
Why locally-fair maximal flows in client-server networks perform well. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilias S. Kotsireas, Christos Koukouvinos, Panos M. Pardalos |
A modified power spectral density test applied to weighing matrices with small weight. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Steffen Rebennack, Marcus Oswald, Dirk Oliver Theis, Hanna Seitz, Gerhard Reinelt, Panos M. Pardalos |
A Branch and Cut solver for the maximum stable set problem. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli |
On the performances of Nash equilibria in isolation games. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Masaki Yamamoto, Shuji Kijima, Yasuko Matsui |
A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jin-yi Cai, Vinod Yegneswaran, Chris Alfeld, Paul Barford |
Honeynet games: a game theoretic approach to defending network monitors. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Karine Deschinkel, Sid Ahmed Ali Touati, Sébastien Briais |
SIRALINA: efficient two-steps heuristic for storage optimisation in single period task scheduling. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | György Dósa, Maria Grazia Speranza, Zsolt Tuza |
Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikita Boyko, Timofey Turko, Vladimir Boginski, David E. Jeffcoat, Stanislav Uryasev, Grigoriy Zrazhevsky, Panos M. Pardalos |
Robust multi-sensor scheduling for multi-site surveillance. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi |
Anonymizing binary and small tables is hard to approximate. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yu-Ki Chan, Minming Li, Weiwei Wu |
Optimal tree structure with loyal users and batch updates. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Guohui Lin |
On the Bandpass problem. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hongying Li, Chunjie Su |
An optimal semi-online algorithm for 2-machine scheduling with an availability constraint. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Wanpracha Art Chaovalitwongse, Carlos A. S. Oliveira, Bruno Chiarini, Panos M. Pardalos, Mauricio G. C. Resende |
Revised GRASP with path-relinking for the linear ordering problem. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fei-huang Chang, Huilan Chang, Frank K. Hwang |
Pooling designs for clone library screening in the inhibitor complex model. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Wu-Hsiung Lin, Gerard J. Chang |
Resource-sharing systems and hypergraph colorings. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhao Zhang, Bing Wang |
Super cyclically edge connected transitive graphs. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Juan Liu, Xindong Zhang, Jixiang Meng |
On domination number of Cartesian product of directed paths. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bader F. AlBdaiwi, Diptesh Ghosh, Boris Goldengorin |
Data aggregation for p-median problems. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank K. Hwang, Uriel G. Rothblum |
On the number of separable partitions. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yam Ki Cheung, Ovidiu Daescu |
Line facility location in weighted regions. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Deying Li, Qinghua Zhu |
Approximation algorithms for multicast routing in ad hoc wireless networks. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bin Ma, Louxin Zhang |
Efficient estimation of the accuracy of the maximum likelihood method for ancestral state reconstruction. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Carlos J. Luz |
Improving an upper bound on the size of k-regular induced subgraphs. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Dorbec, Michael A. Henning |
Upper paired-domination in claw-free graphs. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Henning, John McCoy |
Which trees have a differentiating-paired dominating set? |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Donald Stanley, Boting Yang |
Fast searching games on graphs. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")