Result 1 to 20 of 77 total
A tight upper bound on the ($2,1$)-total labeling number of outerplanar graphs. (English)
J. Discrete Algorithms 14, 189-206 (2012).
1
Solving Tantrix via integer programming. (English)
Kranakis, Evangelos (ed.) et al., Fun with algorithms. 6th international conference, FUN 2012, Venice, Italy, June 4‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30346-3/pbk). Lecture Notes in Computer Science 7288, 245-257 (2012).
2
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares. (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, 24-35 (2012).
3
The $(p,q)$-total labeling problem for trees. (English)
Discrete Math. 312, No. 8, 1407-1420 (2012).
4
Approximability of the path-distance-width for AT-free graphs. (English)
Kolman, Petr (ed.) et al., Graph-theoretic concepts in computer science. 37th international workshop, WG 2011, Teplá Monastery, Czech Republic, June 21‒24, 2011. Revised papers. Berlin: Springer (ISBN 978-3-642-25869-5/pbk). Lecture Notes in Computer Science 6986, 271-282 (2011).
5
Contracted webgraphs: Structure mining and scale-freeness. (English)
Atallah, Mikhail (ed.) et al., Frontiers in algorithmics and algorithmic aspects in information and management. Joint international conference, FAW-AAIM 2011, Jinhua, China, May 28‒31, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21203-1/pbk). Lecture Notes in Computer Science 6681, 287-299 (2011).
6
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).
7
On the complexity of reconfiguration problems. (English)
Theor. Comput. Sci. 412, No. 12-14, 1054-1065 (2011).
8
Parametric excitation-based inverse bending gait generation (English)
Robotica 29, No. 6, 831-841 (2011).
9
Approximability of the path-distance-width for AT-free graphs (English)
WG, 271-282 (2011).
10
Contracted webgraphs: structure mining and scale-freeness (English)
FAW-AAIM, 287-299 (2011).
11
Development and experiment of a kneed biped walking robot based on parametric excitation principle (English)
IROS, 2735-2740 (2011).
12
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).
13
The complexity of UNO. (English)
Comput. Res. Repos. 2010, Article No. 1003.2851 (2010).
14
UNO is hard, even for a single player. (English)
Boldi, Paolo (ed.), Fun with algorithms. 5th international conference, FUN 2010, Ischia, Italy, June 2‒4, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13121-9/pbk). Lecture Notes in Computer Science 6099, 133-144 (2010).
15
A new model for a scale-free hierarchical structure of isolated cliques. (English)
Rahman, Md. Saidur (ed.) et al., WALCOM: Algorithms and computation. 4th international workshop, WALCOM 2010, Dhaka, Bangladesh, February 10‒12, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-11439-7/pbk). Lecture Notes in Computer Science 5942, 216-227 (2010).
16
A new model for a scale-free hierarchical structure of isolated cliques (English)
WALCOM, 216-227 (2010).
17
UNO is hard, even for a single player (English)
FUN, 133-144 (2010).
18
The $(p, q)$-total labeling problem for trees (English)
ISAAC (2), 49-60 (2010).
19
The (2, 1)-total labeling number of outerplanar graphs is at most $Δ+ 2$ (English)
IWOCA, 103-106 (2010).
20
Result 1 to 20 of 77 total
Start
Contact
Print
General Help
