CONSTRUCTION OF STEINER QUASIGROUPS CONTAINING A SPECIFIED NUMBER OF SUBQUASIGROUPS OF A GIVEN ORDERSTRALEY TH.1972; J. COMBINATOR. THEORY, A; U.S.A.; DA. 1972; VOL. 13; NO 3; PP. 374-382; BIBL. 5 REF.Serial Issue

Incorporating compactness to generate term-association view snippets for ontology searchWEIYI GE; GONG CHENG; HUIYING LI et al.Information processing & management. 2013, Vol 49, Num 2, pp 513-528, issn 0306-4573, 16 p.Article

Practical and effective IR-style keyword search over semantic webXIAOMIN NING; HAI JIN; WEIJIA JIA et al.Information processing & management. 2009, Vol 45, Num 2, pp 263-271, issn 0306-4573, 9 p.Article

Approximation algorithm for the group steiner network problemPENN, Michal; ROZENFELD, Stas.Networks (New York, NY). 2007, Vol 49, Num 2, pp 160-167, issn 0028-3045, 8 p.Article

Integrality ratio for group steiner trees and directed steiner treesHALPERIN, Eran; KORTSARZ, Guy; KRAUTHGAMER, Robert et al.SIAM journal on computing (Print). 2007, Vol 36, Num 5, pp 1494-1511, issn 0097-5397, 18 p.Article

A greedy approximation algorithm for the group Steiner problemCHEKURI, Chandra; EVEN, Guy; KORTSARZ, Guy et al.Discrete applied mathematics. 2006, Vol 154, Num 1, pp 15-34, issn 0166-218X, 20 p.Article

Approximating k-generalized connectivity via collapsing HSTsSEGEV, Danny.Journal of combinatorial optimization. 2011, Vol 21, Num 3, pp 364-382, issn 1382-6905, 19 p.Article

FPT algorithms for Connected Feedback Vertex SetMISRA, Neeldhara; PHILIP, Geevarghese; RAMAN, Venkatesh et al.Journal of combinatorial optimization. 2012, Vol 24, Num 2, pp 131-146, issn 1382-6905, 16 p.Conference Paper