Result 1 to 20 of 174 total
Finding maximum edge bicliques in convex bipartite graphs. (English)
Algorithmica 64, No. 2, 311-325 (2012).
1
Subgraph isomorphism in graph classes. (English)
Discrete Math. 312, No. 21, 3164-3173 (2012).
2
Constant time enumeration of bounded-size subtrees in trees and its application. (English)
Gudmundsson, Joachim (ed.) et al., Computing and combinatorics. 18th annual international conference, COCOON 2012, Sydney, Australia, August 20‒22, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32240-2/pbk). Lecture Notes in Computer Science 7434, 347-359 (2012).
3
Hitori number. (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, 334-345 (2012).
4
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).
5
Bounding the number of reduced trees, cographs, and series-parallel graphs by compression. (English)
Rahman, Md. Saidur (ed.) et al., WALCOM: Algorithms and computation. 6th international workshop, WALCOM 2012, Dhaka, Bangladesh, February 15‒17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-28075-7/pbk). Lecture Notes in Computer Science 7157, 5-16 (2012).
6
Partitioning a weighted tree into subtrees with weights in a given range. (English)
Algorithmica 62, No. 3-4, 823-841 (2012).
7
Algorithmic folding complexity. (English)
Graphs Comb. 27, No. 3, 341-351 (2011).
8
Dominating set counting in graph classes. (English)
Fu, Bin (ed.) et al., Computing and combinatorics. 17th annual international conference, COCOON 2011, Dallas, TX, USA, August 14‒16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22684-7/pbk). Lecture Notes in Computer Science 6842, 13-24 (2011).
9
A doubly exponentially crumbled cake. (English)
Comput. Res. Repos. 2011, Article No. 1104.0122 (2011).
10
Maximal matching and path matching counting in polynomial time for graphs of bounded clique width. (English)
Ogihara, Mitsunori (ed.) et al., Theory and applications of models of computation. 8th annual conference, TAMC 2011, Tokyo, Japan, May 23‒25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20876-8/pbk). Lecture Notes in Computer Science 6648, 483-494 (2011).
11
Hardness results and an exact exponential algorithm for the spanning tree congestion problem. (English)
Ogihara, Mitsunori (ed.) et al., Theory and applications of models of computation. 8th annual conference, TAMC 2011, Tokyo, Japan, May 23‒25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20876-8/pbk). Lecture Notes in Computer Science 6648, 452-462 (2011).
12
Efficient algorithms for dualizing large-scale hypergraphs. (English)
Comput. Res. Repos. 2011, Article No. 1102.3813 (2011).
13
A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization. (English)
Eur. J. Oper. Res. 210, No. 1, 48-56 (2011).
14
Algorithmic folding complexity (English)
Graphs and Combinatorics 27, No. 3, 341-351 (2011).
15
Bond reliability under humid environment for coated copper wire and bare copper wire (English)
Microelectronics Reliability 51, No. 1, 148-156 (2011).
16
Enhancing bondability with coated copper bonding wire (English)
Microelectronics Reliability 51, No. 1, 88-96 (2011).
17
Reducing electromagnetic coupling for bistatic subsurface pulse radar using EBG structures (English)
IGARSS, 854-857 (2011).
18
Hardness results and an exact exponential algorithm for the spanning tree congestion problem (English)
TAMC, 452-462 (2011).
19
Maximal matching and path matching counting in polynomial time for graphs of bounded clique width (English)
TAMC, 483-494 (2011).
20
Result 1 to 20 of 174 total
Start
Contact
Print
General Help
