Pascal and Francis Bibliographic Databases

Help

Search results

Your search

is.\*:("1382-6905")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 678

  • Page / 28
Export

Selection :

  • and

Exact and approximation algorithms for the complementary maximal strip recovery problemHAITAO JIANG; ZHONG LI; GUOHUI LIN et al.Journal of combinatorial optimization. 2012, Vol 23, Num 4, pp 493-506, issn 1382-6905, 14 p.Article

Solving haplotype inference problem with non-genotyped founders via integer linear programmingYONGXI CHENG; GUOHUI LIN.Journal of combinatorial optimization. 2012, Vol 23, Num 1, pp 50-60, issn 1382-6905, 11 p.Article

The complexity of VLSI power-delay optimization by interconnect resizingMOISEEV, Konstantin; KOLODNY, Avinoam; WIMER, Shmuel et al.Journal of combinatorial optimization. 2012, Vol 23, Num 2, pp 292-300, issn 1382-6905, 9 p.Article

An optimal square coloring of planar graphsYUEHUA BU; XUBO ZHU.Journal of combinatorial optimization. 2012, Vol 24, Num 4, pp 580-592, issn 1382-6905, 13 p.Article

Min-cost multiflows in node-capacitated undirected networksBABENKO, Maxim A; KARZANOV, Alexander V.Journal of combinatorial optimization. 2012, Vol 24, Num 3, pp 202-228, issn 1382-6905, 27 p.Article

Min-energy broadcast in mobile ad hoc networks with restricted motionDIAZ-BANEZ, J. M; FABILA-MONROY, R; FLORES-PENALOZA, D et al.Journal of combinatorial optimization. 2012, Vol 24, Num 4, pp 413-426, issn 1382-6905, 14 p.Article

Parity and strong parity edge-colorings of graphsHSU, Hsiang-Chun; CHANG, Gerard J.Journal of combinatorial optimization. 2012, Vol 24, Num 4, pp 427-436, issn 1382-6905, 10 p.Article

The total {k}-domatic number of wheels and complete graphsJING CHEN; XINMIN HOU NING LI.Journal of combinatorial optimization. 2012, Vol 24, Num 3, pp 162-175, issn 1382-6905, 14 p.Article

Acyclically 3-colorable planar graphsANGELINI, Patrizio; FRATI, Fabrizio.Journal of combinatorial optimization. 2012, Vol 24, Num 2, pp 116-130, issn 1382-6905, 15 p.Conference Paper

Small grid drawings of planar graphs with balanced partitionXIAO ZHOU; HIKINO, Takashi; NISHIZEKI, Takao et al.Journal of combinatorial optimization. 2012, Vol 24, Num 2, pp 99-115, issn 1382-6905, 17 p.Conference Paper

A Branch and Cut solver for the maximum stable set problemREBENNACK, Steffen; OSWALD, Marcus; OLIVER THEIS, Dirk et al.Journal of combinatorial optimization. 2011, Vol 21, Num 4, pp 434-457, issn 1382-6905, 24 p.Article

Approximating capacitated tree-routings in networksMORSY, Ehab; NAGAMOCHI, Hiroshi.Journal of combinatorial optimization. 2011, Vol 21, Num 2, pp 254-267, issn 1382-6905, 14 p.Article

Approximation scheme for restricted discrete gate sizing targeting delay minimizationCHEN LIAO; SHIYAN HU.Journal of combinatorial optimization. 2011, Vol 21, Num 4, pp 497-510, issn 1382-6905, 14 p.Article

Efficient estimation of the accuracy of the maximum likelihood method for ancestral state reconstructionBIN MA; LOUXIN ZHANG.Journal of combinatorial optimization. 2011, Vol 21, Num 4, pp 409-422, issn 1382-6905, 14 p.Article

Reconstruction of hidden graphs and threshold group testingHUILAN CHANG; CHEN, Hong-Bin; FU, Hung-Lin et al.Journal of combinatorial optimization. 2011, Vol 22, Num 2, pp 270-281, issn 1382-6905, 12 p.Article

Sharp bounds for Zagreb indices of maximal outerplanar graphsAILIN HOU; SHUCHAO LI; LANZHEN SONG et al.Journal of combinatorial optimization. 2011, Vol 22, Num 2, pp 252-269, issn 1382-6905, 18 p.Article

Upper paired-domination in claw-free graphsDORBEC, Paul; HENNING, Michael A.Journal of combinatorial optimization. 2011, Vol 22, Num 2, pp 235-251, issn 1382-6905, 17 p.Article

A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noiseYAMAMOTO, Masaki; KIJIMA, Shuji; MATSUI, Yasuko et al.Journal of combinatorial optimization. 2011, Vol 22, Num 3, pp 392-408, issn 1382-6905, 17 p.Conference Paper

Why locally-fair maximal flows in client-server networks perform wellBERMAN, Kenneth A; YOSHIKAWA, Chad.Journal of combinatorial optimization. 2011, Vol 22, Num 3, pp 426-437, issn 1382-6905, 12 p.Conference Paper

A tighter formulation of the p-median problemELLOUMI, Sourour.Journal of combinatorial optimization. 2010, Vol 19, Num 1, pp 69-83, issn 1382-6905, 15 p.Article

Adjacent vertex distinguishing total colorings of outerplanar graphsYIQIAO WANG; WEIFAN WANG.Journal of combinatorial optimization. 2010, Vol 19, Num 2, pp 123-133, issn 1382-6905, 11 p.Article

Capacity inverse minimum cost flow problemGÜLER, Ciğdem; HAMACHER, Horst W.Journal of combinatorial optimization. 2010, Vol 19, Num 1, pp 43-59, issn 1382-6905, 17 p.Article

Complexity analysis for maximum flow problems with arc reversalsREBENNACK, Steffen; ARULSELVAN, Ashwin; ELEFTERIADOU, Lily et al.Journal of combinatorial optimization. 2010, Vol 19, Num 2, pp 200-216, issn 1382-6905, 17 p.Article

Linear time construction of 5-phylogenetic roots for tree chordal graphsKENNEDY, William S; HUI KONG; GUOHUI LIN et al.Journal of combinatorial optimization. 2010, Vol 19, Num 1, pp 94-106, issn 1382-6905, 13 p.Article

Subhypergraph counts in extremal and random hypergraphs and the fractional q-independenceDUDEK, Andrzej; POLCYN, Joanna; RUCINSKI, Andrzej et al.Journal of combinatorial optimization. 2010, Vol 19, Num 2, pp 184-199, issn 1382-6905, 16 p.Article

  • Page / 28