Result 1 to 20 from 101 total
A tight upper bound on the ($2,1$)-total labeling number of outerplanar graphs. (English)
J. Discrete Algorithms 14, 189-206 (2012).
1
The $(p,q)$-total labeling problem for trees. (English)
Discrete Math. 312, No. 8, 1407-1420 (2012).
2
The (2,1)-total labeling number of outerplanar graphs is at most $Δ+ 2$. (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, 103-106 (2011).
3
The bistatic SAR experiment with ALOS / PALSAR and pi-SAR-L (English)
IGARSS, 4221-4224 (2011).
4
The $(p,q)$-total labeling problem for trees. (English)
Cheong, Otfried (ed.) et al., Algorithms and computation. 21st international symposium, ISAAC 2010, Jeju, Korea, December 15‒17, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-17513-8/pbk). Lecture Notes in Computer Science 6507, 49-60 (2010).
5
Posi-modular systems with modulotone requirements under permutation constraints. (English)
Discrete Math. Algorithms Appl. 2, No. 1, 61-76 (2010).
6
Evaluation of feature selection by multiclass kernel discriminant analysis. (English)
Schwenker, Friedhelm (ed.) et al., Artificial neural networks in pattern recognition. 4th IAPR TC3 workshop, ANNPR 2010, Cairo, Egypt, April 11‒13, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-12158-6/pbk). Lecture Notes in Computer Science 5998. Lecture Notes in Artificial Intelligence, 13-24 (2010).
7
Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs. (English)
Algorithmica 56, No. 4, 413-436 (2010).
8
A bouncing droplet on an inclined hydrophobic surface (English)
J. Visualization 13, No. 1, 5-6 (2010).
9
Correction of paradoxical vision by simulated depth cue and inverted mirror image for laparoscopic surgery (English)
ICARCV, 222-224 (2010).
10
Turbo equalization and channel re-estimation in OFDM over doubly-selective channel (English)
WCNIS, 137-141 (2010).
11
The $(p, q)$-total labeling problem for trees (English)
ISAAC (2), 49-60 (2010).
12
The (2, 1)-total labeling number of outerplanar graphs is at most $Δ+ 2$ (English)
IWOCA, 103-106 (2010).
13
Evaluation of feature selection by multiclass kernel discriminant analysis (English)
ANNPR, 13-24 (2010).
14
A tight upper bound on the (2,1)-total labeling number of outerplanar graphs. (English)
Comput. Res. Repos. 2009, Article No. 0911.4590 (2009).
15
Posi-modular systems with modulotone requirements under permutation constraints. (English)
Dong, Yingfei (ed.) et al., Algorithms and computation. 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16‒18, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-10630-9/pbk). Lecture Notes in Computer Science 5878, 473-482 (2009).
16
Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs. (English)
J. Discrete Algorithms 7, No. 4, 570-578 (2009).
17
A linear time algorithm for $L(2,1)$-labeling of trees. (English)
Fiat, Amos (ed.) et al., Algorithms ‒ ESA 2009. 17th annual European symposium, Copenhagen, Denmark, September 7‒9, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04127-3/pbk). Lecture Notes in Computer Science 5757, 35-46 (2009).
18
An O$(n^{1.75})$ algorithm for $L(2,1)$-labeling of trees. (English)
Theor. Comput. Sci. 410, No. 38-40, 3702-3710 (2009).
19
Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs. (English)
Discrete Optim. 6, No. 1, 23-36 (2009).
20
Result 1 to 20 from 101 total
Start
Contact
Print
General Help
