Result 1 to 20 of 119 total
Three approaches to data analysis. Test theory, rough sets and logical analysis of data. (English)
Intelligent Systems Reference Library 41. Berlin: Springer (ISBN 978-3-642-28666-7/hbk; 978-3-642-28667-4/ebook). xviii, 202~p. EUR~99.95/net; SFR~133.50; \sterling~90.00/hbk (2013).
1
On hereditary properties of the class of graphs with convex quadratic stability number. (English)
J. Math. Sci., New York 182, No. 2, 227-232 (2012); translation from Sovrem. Mat. Prilozh. 71 (2011).
2
Maximum regular induced subgraphs in $2P_3$-free graphs. (English)
Theor. Comput. Sci. 460, 26-33 (2012).
3
Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number. (English)
J. Discrete Algorithms 14, 207-213 (2012).
4
Linear time algorithm for computing a small biclique in graphs without long induced paths. (English)
Fomin, Fedor V. (ed.) et al., Algorithm theory ‒ SWAT 2012. 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31154-3/pbk). Lecture Notes in Computer Science 7357, 142-152 (2012).
5
On factorial properties of chordal bipartite graphs. (English)
Discrete Math. 312, No. 16, 2457-2465 (2012).
6
Locally bounded coverings and factorial properties of graphs. (English)
Eur. J. Comb. 33, No. 4, 534-543 (2012).
7
Colouring vertices of triangle-free graphs without forests. (English)
Discrete Math. 312, No. 7, 1372-1385 (2012).
8
Minimal classes of graphs of unbounded clique-width. (English)
Ann. Comb. 15, No. 4, 707-722 (2011).
9
Canonical antichains of unit interval and bipartite permutation graphs. (English)
Order 28, No. 3, 513-522 (2011).
10
Stability preserving transformations of graphs. (English)
Ann. Oper. Res. 188, 331-341 (2011).
11
A note on the speed of hereditary graph properties. (English)
Electron. J. Comb. 18, No. 1, Research Paper P157, 14 p., electronic only (2011).
12
Two forbidden induced subgraphs and well-quasi-ordering. (English)
Discrete Math. 311, No. 16, 1813-1822 (2011).
13
Bipartite induced subgraphs and well-quasi-ordering. (English)
J. Graph Theory 67, No. 3, 235-249 (2011).
14
Boundary properties of graphs for algorithmic graph problems. (English)
Theor. Comput. Sci. 412, No. 29, 3545-3554 (2011).
15
Parameterized algorithms for the independent set problem in some hereditary graph classes. (English)
Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 21st international workshop, IWOCA 2010, London, UK, July 26‒28, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-19221-0/pbk). Lecture Notes in Computer Science 6460, 1-9 (2011).
16
On the complexity of the dominating induced matching problem in hereditary classes of graphs. (English)
Discrete Appl. Math. 159, No. 7, 521-531 (2011).
17
Canonical antichains of unit interval and bipartite permutation graphs (English)
Order 28, No. 3, 513-522 (2011).
18
Bipartite induced subgraphs and well-quasi-ordering (English)
Journal of Graph Theory 67, No. 3, 235-249 (2011).
19
A decidability result for the dominating set problem. (English)
Theor. Comput. Sci. 411, No. 44-46, 4023-4027 (2010).
20
Result 1 to 20 of 119 total
Start
Contact
Print
General Help
