Minimum path basesHARTVIGSEN, D.Journal of algorithms (Print). 1993, Vol 15, Num 1, pp 125-142, issn 0196-6774Article

Augmenting graphs for independent setsALEKSEEV, Vladimir E; LOZIN, Vadim V.Discrete applied mathematics. 2004, Vol 145, Num 1, pp 3-10, issn 0166-218X, 8 p.Conference Paper

On Stein's paper: resolving ambiguity in nonmonotonic inheritance hierarchiesSIMONET, G; DUCOURNAU, R.Artificial intelligence. 1994, Vol 71, Num 1, pp 183-193, issn 0004-3702Article

Fractional packing of T-joinsBARAHONA, Francisco.SIAM journal on discrete mathematics (Print). 2004, Vol 17, Num 4, pp 661-669, issn 0895-4801, 9 p.Article

An efficient algorithm for the uncapacitated facility location problem with totally balanced matrixBERESNEV, V. L.Discrete applied mathematics. 2001, Vol 114, Num 1-3, pp 13-22, issn 0166-218XArticle

A parallel randomized algorithm for finding a maximal independent set in a linear hypergraphŁUCZAK, T; SZYMANSKA, E.Journal of algorithms (Print). 1997, Vol 25, Num 2, pp 311-320, issn 0196-6774Article

Refined study on structural controllability of descriptor systems by means of matroidsMUROTA, K.SIAM journal on control and optimization. 1987, Vol 25, Num 4, pp 967-989, issn 0363-0129Article

A note on a quadratic algorithm for the 2-cyclic robotic scheduling problemCHE, Ada; KATS, Vladimir; LEVNER, Eugene et al.Theoretical computer science. 2009, Vol 410, Num 47-49, pp 5188-5190, issn 0304-3975, 3 p.Article

The m-machine flowshop problem with unit-time operations and intree precedence constraintsAVERBAKH, Igor; BERMAN, Oded; CHERNYKH, Ilya et al.Operations research letters. 2005, Vol 33, Num 3, pp 263-266, issn 0167-6377, 4 p.Article

Decomposition of a hypergraph by partial-edge separatorsMALVESTUTO, F. M; MOSCARINI, M.Theoretical computer science. 2000, Vol 237, Num 1-2, pp 57-79, issn 0304-3975Article

On computing the latest starting times and floats of activities in a network with imprecise durationsZIELINSKI, Pawel.Fuzzy sets and systems. 2005, Vol 150, Num 1, pp 53-76, issn 0165-0114, 24 p.Article

Degree-constrained decompositions of graphs : Bounded treewidth and planarityBAZGAN, Cristina; TUZA, Zsolt; VANDERPOOTEN, Daniel et al.Theoretical computer science. 2006, Vol 355, Num 3, pp 389-395, issn 0304-3975, 7 p.Article

An introduction to empty lattice simplicesSEBÖ, A.Lecture notes in computer science. 1999, pp 400-414, issn 0302-9743, isbn 3-540-66019-4Conference Paper

A polynomial algorithm for one problem of guillotine cuttingARSLANOV, M. Z.Operations research letters. 2007, Vol 35, Num 5, pp 636-644, issn 0167-6377, 9 p.Article

A polynomial arc-search interior-point algorithm for convex quadratic programmingYAGUANG YANG.European journal of operational research. 2011, Vol 215, Num 1, pp 25-38, issn 0377-2217, 14 p.Article

Polynomial-time algorithm for fixed points of nontrivial morphismsHOLUB, Stepan.Discrete mathematics. 2009, Vol 309, Num 16, pp 5069-5076, issn 0012-365X, 8 p.Article

Edge ranking of weighted treesDERENIOWSKI, Dariusz.Discrete applied mathematics. 2006, Vol 154, Num 8, pp 1198-1209, issn 0166-218X, 12 p.Article

A new large-update interior point algorithm for P* (κ) LCPs based on kernel functionsCHO, Gyeong-Mi; KIM, Min-Kyung.Applied mathematics and computation. 2006, Vol 182, Num 2, pp 1169-1183, issn 0096-3003, 15 p.Article

Log-barrier method for two-stage quadratic stochastic programmingCHO, Gyeong-Mi.Applied mathematics and computation. 2005, Vol 164, Num 1, pp 45-69, issn 0096-3003, 25 p.Article

Algorithms for vertex-partitioning problems on graphs with fixed clique-widthGERBER, Michael U; KOBLER, Daniel.Theoretical computer science. 2003, Vol 299, Num 1-3, pp 719-734, issn 0304-3975, 16 p.Article

P₅-free augmenting graphs and the maximum stable set problemGERBERA, Michael U; HENZ, Alain; SCHINDL, David et al.Discrete applied mathematics. 2003, Vol 132, Num 1-3, pp 109-119, issn 0166-218X, 11 p.Article

Convexity and the Steiner tree problemPROVAN, J. S.Networks (New York, NY). 1988, Vol 18, Num 1, pp 55-72, issn 0028-3045Article

Guarding a set of line segments in the planeBRIMKOV, Valentin E; LEACH, Andrew; MASTROIANNI, Michael et al.Theoretical computer science. 2011, Vol 412, Num 15, pp 1313-1324, issn 0304-3975, 12 p.Article

The complexity of locally injective homomorphismsMACGILLIVRAY, Gary; SWARTS, Jacobus.Discrete mathematics. 2010, Vol 310, Num 20, pp 2685-2696, issn 0012-365X, 12 p.Article

A note on the computational complexity of graph vertex partitionYUANQIU HUANG; YUMING CHU.Discrete applied mathematics. 2007, Vol 155, Num 3, pp 405-409, issn 0166-218X, 5 p.Article