Result 1 to 20 from 435 total
NP-completeness and APX-completeness of restrained domination in graphs. (English)
Theor. Comput. Sci. 448, 1-8 (2012).
1
Optimal distortion embedding of complete binary trees into lines. (English)
Inf. Process. Lett. 112, No. 10, 365-370 (2012).
2
Group path covering and $L(j,k)$-labelings of diameter two graphs. (English)
Inf. Process. Lett. 112, No. 4, 124-128 (2012).
3
Approximation of geodesics in metabelian groups. (English)
Int. J. Algebra Comput. 22, No. 2, Article ID 1250012, 10 p. (2012).
4
Strong and weak edges of a graph and linkages with the vertex cover problem. (English)
Discrete Appl. Math. 160, No. 3, 197-203 (2012).
5
Towards strong nonapproximability results in the Lovász-Schrijver hierarchy. (English)
Comput. Complexity 20, No. 4, 615-648 (2011).
6
Combinatorial identification problems and graph powers. (English)
4OR 9, No. 4, 417-420 (2011).
7
It is NL-complete to decide whether a hairpin completion of regular languages is regular. (English)
Int. J. Found. Comput. Sci. 22, No. 8, 1813-1828 (2011).
8
The recognition of tolerance and bounded tolerance graphs. (English)
SIAM J. Comput. 40, No. 5, 1234-1257 (2011).
9
Justification of point electrode models in electrical impedance tomography. (English)
Math. Models Methods Appl. Sci. 21, No. 6, 1395-1413 (2011).
10
On the complexity of sandpile critical avalanches. (English)
Theor. Comput. Sci. 412, No. 30, 3964-3974 (2011).
11
The equivalence problem over finite rings. (English)
Int. J. Algebra Comput. 21, No. 3, 449-457 (2011).
12
Solving the generalized subset sum problem with a light based device. (English)
Nat. Comput. 10, No. 1, 541-550 (2011).
13
On computing geodesics in Baumslag-Solitar groups. (English)
Int. J. Algebra Comput. 21, No. 1-2, 119-145 (2011).
14
The Knuth-Bendix algorithm and the conjugacy problem in monoids. (English)
Semigroup Forum 82, No. 1, 181-196 (2011).
15
On the complexity of reconfiguration problems. (English)
Theor. Comput. Sci. 412, No. 12-14, 1054-1065 (2011).
16
A graph polynomial for independent sets of bipartite graphs. (English)
Lodaya, Kamal (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2010), December 15‒18, 2010, Chennai, India. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-23-1). LIPICS ‒ Leibniz International Proceedings in Informatics 8, 240-250, electronic only (2010).
17
A promiseBQP-complete string rewriting problem. (English)
Quantum Inf. Comput. 10, No. 3-4, 234-257 (2010).
18
Structural complexity of AvgBPP. (English)
Ann. Pure Appl. Logic 162, No. 3, 213-223 (2010).
19
Minimum face-spanning subgraphs of plane graphs. (English)
AKCE Int. J. Graphs Comb. 7, No. 2, 133-150 (2010).
20
Result 1 to 20 from 435 total
Start
Contact
Print
General Help
