Result 1 to 20 of 29 total
Bipartite permutation graphs are reconstructible. (English)
Discrete Math. Algorithms Appl. 4, No. 3, 1250039,14p. (2012).
1
Efficient enumeration of the directed binary perfect phylogenies from incomplete data. (English)
Klasing, Ralf (ed.), Experimental algorithms. 11th international symposium, SEA 2012, Bordeaux, France, June 7‒9, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30849-9/pbk). Lecture Notes in Computer Science 7276, 248-259 (2012).
2
Algorithmic folding complexity. (English)
Graphs Comb. 27, No. 3, 341-351 (2011).
3
Voronoi game on a path (English)
IEICE Transactions 94-D, No. 6, 1185-1189 (2011).
4
Algorithmic folding complexity (English)
Graphs and Combinatorics 27, No. 3, 341-351 (2011).
5
Di-neutron clustering and deuteron-like tensor correlation in nuclear structure focusing on $^{11}$Li. (English)
Beck, Christian (ed.), Clusters in nuclei. Volume 1. Berlin: Springer (ISBN 978-3-642-13898-0/pbk; 978-3-642-13899-7/ebook). Lecture Notes in Physics 818, 165-221 (2010).
6
Bipartite permutation graphs are reconstructible. (English)
Wu, Weili (ed.) et al., Combinatorial optimization and applications. 4th international conference, COCOA 2010, Kailua-Kona, HI, USA, December 18‒20, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-17460-5/pbk). Lecture Notes in Computer Science 6509, 362-373 (2010).
7
Reconstruction of interval graphs. (English)
Theor. Comput. Sci. 411, No. 43, 3859-3866 (2010).
8
On listing, sampling, and counting the chordal graphs with edge constraints. (English)
Theor. Comput. Sci. 411, No. 26-28, 2591-2601 (2010).
9
Reconstruction algorithm for permutation graphs. (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, 125-135 (2010).
10
Random generation and enumeration of proper interval graphs (English)
IEICE Transactions 93-D, No. 7, 1816-1823 (2010).
11
Reconstruction algorithm for permutation graphs (English)
WALCOM, 125-135 (2010).
12
Bipartite permutation graphs are reconstructible (English)
COCOA (2), 362-373 (2010).
13
Reconstruction of interval graphs. (English)
Ngo, Hung Q. (ed.), Computing and combinatorics. 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13‒15, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02881-6/pbk). Lecture Notes in Computer Science 5609, 106-115 (2009).
14
Random generation and enumeration of proper interval graphs. (English)
Das, Sandip (ed.) et al., WALCOM: Algorithms and computation. Third international workshop, WALCOM 2009, Kolkata, India, February 18‒20, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00201-4/pbk). Lecture Notes in Computer Science 5431, 177-189 (2009).
15
Random generation and enumeration of proper interval graphs (English)
WALCOM, 177-189 (2009).
16
An optical access network system without a power supply using blind speech separation and a loopback technique (English)
GLOBECOM, 1-6 (2009).
17
Reconstruction of interval graphs (English)
COCOON, 106-115 (2009).
18
On listing, sampling, and counting the chordal graphs with edge constraints. (English)
Hu, Xiaodong (ed.) et al., Computing and combinatorics. 14th annual international conference, COCOON 2008, Dalian, China, June 27‒29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69732-9/pbk). Lecture Notes in Computer Science 5092, 458-467 (2008).
19
On listing, sampling, and counting the chordal graphs with edge constraints (English)
COCOON, 458-467 (2008).
20
Result 1 to 20 of 29 total
Start
Contact
Print
General Help
