Smaller Kernels for hitting set problems of constant arityNISHIMURA, Naomi; RAGDE, Prabhakar; THILIKOS, Dimitrios M et al.Lecture notes in computer science. 2004, pp 121-126, issn 0302-9743, isbn 3-540-23071-8, 6 p.Conference Paper

A note on counting connected graph covering projectionsHOFMEISTER, M.SIAM journal on discrete mathematics (Print). 1998, Vol 11, Num 2, pp 286-292, issn 0895-4801Article

A better approximation ratio for the vertex cover problemKARAKOSTAS, George.Lecture notes in computer science. 2005, pp 1043-1050, issn 0302-9743, isbn 3-540-27580-0, 8 p.Conference Paper

Parameterized complexity of generalized vertex cover problemsJIONG GUO; NIEDERMEIER, Rolf; WERNICKE, Sebastian et al.Lecture notes in computer science. 2005, pp 36-48, issn 0302-9743, isbn 3-540-28101-0, 13 p.Conference Paper

Covering vertices of a graph by k disjoint cyclesEGAWA, Yoshimi; HAGITA, Mariko; KAWARABAYASHI, Ken-Ichi et al.Discrete mathematics. 2003, Vol 270, Num 1-3, pp 115-125, issn 0012-365X, 11 p.Article

Finite unfoldings of unbounded Petri netsDESEL, Jörg; JUHAS, Gabriel; NEUMAIR, Christian et al.Lecture notes in computer science. 2004, pp 157-176, issn 0302-9743, isbn 3-540-22236-7, 20 p.Conference Paper

Minimum cost edge subset covering exactly k vertices of a graphPLESNIK, Jan.Journal of combinatorial optimization. 2001, Vol 5, Num 3, pp 275-286, issn 1382-6905Article

New algorithms for k-face cover, k-feedback vertex set, and k-disjoint cycles on plane and planar graphsKLOKS, Ton; LEE, C. M; JIPING LIU et al.Lecture notes in computer science. 2002, pp 282-295, issn 0302-9743, isbn 3-540-00331-2, 14 p.Conference Paper

Isomorphism classes of concrete graph coveringsRONGQUAN FENG; JIN HO KWAK; JUYOUNG KIM et al.SIAM journal on discrete mathematics (Print). 1998, Vol 11, Num 2, pp 265-272, issn 0895-4801Article

Three new distance-regular graphsSOICHER, L. H.European journal of combinatorics. 1993, Vol 14, Num 5, pp 501-505, issn 0195-6698Article

Coverings and structure of crossing familiesFLEINER, T; JORDAN, T.Mathematical programming. 1999, Vol 84, Num 3, pp 505-518, issn 0025-5610Article

Parity subgraph, shortest cycle cover, and postman tourZHANG, CUN-QUAN.SIAM journal on discrete mathematics (Print). 1993, Vol 6, Num 3, pp 428-431, issn 0895-4801Article

Cycle double covers and spanning minors IIHÄGGKVIST, Roland; MARKSTRÖM, Klas.Discrete mathematics. 2006, Vol 306, Num 8-9, pp 762-778, issn 0012-365X, 17 p.Article

#3-rgular bipartite planar vertex cover is #P-completeMINGJI XIA; WENBO ZHAO.Lecture notes in computer science. 2006, pp 356-364, issn 0302-9743, isbn 3-540-34021-1, 1Vol, 9 p.Conference Paper

The lattice of finite convex geometriesCASPARD, Nathalie; MONJARDET, Bernard.Knowledge discovery and discrete mathematics. International conferenceJIM'2003 : journées de l'informatique messine. 2003, pp 105-113, isbn 2-7261-1256-0, 9 p.Conference Paper

Matroids and a forest cover problemORESTES CERDEIRA, J.Mathematical programming. 1994, Vol 66, Num 3, pp 403-405, issn 0025-5610Article

A 21/10-approximation algorithm for a generalization of the weighted edge-dominating set problemCARR, Robert; FUJITO, Toshihiro; KONJEVOD, Goran et al.Journal of combinatorial optimization. 2001, Vol 5, Num 3, pp 317-326, issn 1382-6905Article

Refined memorisation for vertex coverSUNIL CHANDRAN, L; GRANDONI, Fabrizio.Lecture notes in computer science. 2004, pp 61-70, issn 0302-9743, isbn 3-540-23071-8, 10 p.Conference Paper

Parameterized complexity: Exponential speed-up for planar graph problemsALBER, Jochen; FERNAU, Henning; NIEDERMEIER, Rolf et al.Lecture notes in computer science. 2001, pp 261-272, issn 0302-9743, isbn 3-540-42287-0Conference Paper

Methods of finding all minimum coverings of a graph by cliquesBRATTSEVA, YE. V; CHERENIN, V. P.Computational mathematics and mathematical physics. 1994, Vol 34, Num 8-9, pp 1103-1118, issn 0965-5425Article

Generalized vertex covering in interval graphsMARATHE, M. V; RAVI, R; RANGAN, C. P et al.Discrete applied mathematics. 1992, Vol 39, Num 1, pp 87-93, issn 0166-218XArticle

Circulant covers of trivalent circulantsCOUPERUS, Peter.Discrete mathematics. 2007, Vol 307, Num 9-10, pp 1054-1064, issn 0012-365X, 11 p.Article

A classification of cubic bicirculantsPISANSKI, Tomaz.Discrete mathematics. 2007, Vol 307, Num 3-5, pp 567-578, issn 0012-365X, 12 p.Article

Improved parameterized upper bounds for vertex coverCHEN, Jianer; KANJ, Iyad A; GE XIA et al.Lecture notes in computer science. 2006, pp 238-249, issn 0302-9743, isbn 3-540-37791-3, 1Vol, 12 p.Conference Paper

Improvement of Nemhauser-Trotter theorem and its applications in parametrized complexityCHLEBIK, Miroslav; CHLEBIKOVA, Janka.Lecture notes in computer science. 2004, pp 174-186, issn 0302-9743, isbn 3-540-22339-8, 13 p.Conference Paper