Result 1 to 20 from 131 total
An algorithmic analysis of the Honey-Bee game. (English)
Theor. Comput. Sci. 452, 75-87 (2012).
1
Train marshalling is fixed parameter tractable. (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, 51-56 (2012).
2
A new parameterized kernelization algorithm for the planar clique cover problem. (Chinese)
J. Wuhan Univ., Nat. Sci. Ed. 57, No. 6, 461-464 (2011).
3
Edge clique partition of $K _{4}$-free and planar graphs. (English)
Akiyama, Jin (ed.) et al., Computational geometry, graphs and applications. 9th international conference, CGGA 2010, Dalian, China, November 3‒6, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-24982-2/pbk). Lecture Notes in Computer Science 7033, 84-95 (2011).
4
An algorithmic analysis of the honey-bee game. (English)
Comput. Res. Repos. 2011, Article No. 1102.3025 (2011).
5
Densest $k$-subgraph approximation on intersection graphs. (English)
Jansen, Klaus (ed.) et al., Approximation and online algorithms. 8th international workshop, WAOA 2010, Liverpool, UK, September 9‒10, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-18317-1/pbk). Lecture Notes in Computer Science 6534, 83-93 (2011).
6
The tourist in the shopping arcade. (English)
J. UCS 16, No. 5, 676-685, electronic only (2010).
7
Computing minimum diameter color-spanning sets. (English)
Lee, Der-Tsai (ed.) et al., Frontiers in algorithmics. 4th international workshop, FAW 2010, Wuhan, China, August 11‒13, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14552-0/pbk). Lecture Notes in Computer Science 6213, 285-292 (2010).
8
Extended islands of tractability for parsimony haplotyping. (English)
Amir, Amihood (ed.) et al., Combinatorial pattern matching. 21st annual symposium, CPM 2010, New York, NY, USA, June 21‒23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13508-8/pbk). Lecture Notes in Computer Science 6129, 214-226 (2010).
9
An algorithmic analysis of the Honey-Bee game. (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, 178-189 (2010).
10
Algorithms for core stability, core largeness, exactness, and extendability of flow games. (English)
Front. Math. China 5, No. 1, 47-63 (2010).
11
Low-resolution gait recognition (English)
IEEE Transactions on Systems, Man, and Cybernetics, Part B 40, No. 4, 986-996 (2010).
12
Distance approximating dimension reduction of Riemannian manifolds (English)
IEEE Transactions on Systems, Man, and Cybernetics, Part B 40, No. 1, 208-217 (2010).
13
Computing minimum diameter color-spanning sets (English)
FAW, 285-292 (2010).
14
Edge clique partition of K 4-free and planar graphs (English)
CGGA, 84-95 (2010).
15
An algorithmic analysis of the honey-bee game (English)
FUN, 178-189 (2010).
16
Extended islands of tractability for parsimony haplotyping (English)
CPM, 214-226 (2010).
17
Densest $k$-subgraph approximation on intersection graphs (English)
WAOA, 83-93 (2010).
18
The complexity of Dyson telescopes puzzle. (English)
Albert, Michael H. (ed.) et al., Games of no chance 3. Cambridge: Cambridge University Press (ISBN 978-0-521-86134-2/hbk; 978-0-521-67854-4/pbk). Mathematical Sciences Research Institute Publications 56, 271-285 (2009).
19
On the camera placement problem. (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, 255-264 (2009).
20
Result 1 to 20 from 131 total
Start
Contact
Print
General Help
