io-port.net

io-port 06093627 Kiyomi, Masashi; Saitoh, Toshiki; Uehara, Ryuhei

Bipartite permutation graphs are reconstructible. (English)

Discrete Math. Algorithms Appl. 4, No. 3, 1250039,14p. (2012).

1

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06089188 Asano, Tetsuo; Jansson, Jesper; Sadakane, Kunihiko; Uehara, Ryuhei; Valiente, Gabriel

Faster computation of the Robinson-Foulds distance between phylogenetic networks. (English)

Inf. Sci. 197, 77-90 (2012).

2

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06065655 Ito, Takehiro; Nakano, Shin-Ichi; Okamoto, Yoshio; Otachi, Yota; Uehara, Ryuhei; Uno, Takeaki; Uno, Yushi

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

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06044015 Uno, Takeaki; Uehara, Ryuhei; Nakano, Shin-ichi

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).

4

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06033168 Saitoh, Toshiki; Otachi, Yota; Yamanaka, Katsuhisa; Uehara, Ryuhei

Random generation and enumeration of bipartite permutation graphs. (English)

J. Discrete Algorithms 10, 84-97 (2012).

5

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 05999841 Cardinal, Jean; Demaine, Erik D.; Demaine, Martin L.; Imahori, Shinji; Ito, Tsuyoshi; Kiyomi, Masashi; Langerman, Stefan; Uehara, Ryuhei; Uno, Takeaki

Algorithmic folding complexity. (English)

Graphs Comb. 27, No. 3, 341-351 (2011).

6

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 05996146 Ito, Hiro (ed.); Uehara, Ryuhei (ed.); Urabe, Masatsugu (ed.)

Special issue: Selected papers based on the presentations at the Japan conference on computational geometry and graphs (JCCGG2009), Kanazawa, Japan, November 11‒13, 2009. (English)

Graphs Comb. 27, No. 3, 305-473 (2011).

7

PDF XML AMS-TeX TEXT BIBTeX

io-port 05938186 Umesato, Takuya; Saitoh, Toshiki; Uehara, Ryuhei; Ito, Hiro

Complexity of the stamp folding problem. (English)

Wang, Weifan (ed.) et al., Combinatorial optimization and applications. 5th international conference, COCOA 2011, Zhangjiajie, China, August 4‒6, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22615-1/pbk). Lecture Notes in Computer Science 6831, 311-321 (2011).

8

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 05916984 Okamoto, Yoshio; Otachi, Yota; Uehara, Ryuhei; Uno, Takeaki

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).

9

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 05865590 Ito, Takehiro; Demaine, Erik D.; Harvey, Nicholas J.A.; Papadimitriou, Christos H.; Sideri, Martha; Uehara, Ryuhei; Uno, Yushi

On the complexity of reconfiguration problems. (English)

Theor. Comput. Sci. 412, No. 12-14, 1054-1065 (2011).

10

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 50119589 Kiyomi, Masashi; Saitoh, Toshiki; Uehara, Ryuhei

Voronoi game on a path (English)

IEICE Transactions 94-D, No. 6, 1185-1189 (2011).

11

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 50213844 Cardinal, Jean; Demaine, Erik D.; Demaine, Martin L.; Imahori, Shinji; Ito, Tsuyoshi; Kiyomi, Masashi; Langerman, Stefan; Uehara, Ryuhei; Uno, Takeaki

Algorithmic folding complexity (English)

Graphs and Combinatorics 27, No. 3, 341-351 (2011).

12

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 70223837 Okamoto, Yoshio; Otachi, Yota; Uehara, Ryuhei; Uno, Takeaki

Hardness results and an exact exponential algorithm for the spanning tree congestion problem (English)

TAMC, 452-462 (2011).

13

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 70684301 Umesato, Takuya; Saitoh, Toshiki; Uehara, Ryuhei; Ito, Hiro

Complexity of the stamp folding problem (English)

COCOA, 311-321 (2011).

14

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 05853490 Cooper, Colin; Uehara, Ryuhei

Scale free properties of random $k$-trees. (English)

Math. Comput. Sci. 3, No. 4, 489-496 (2010).

15

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 05834518 Kiyomi, Masashi; Saitoh, Toshiki; Uehara, Ryuhei

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).

16

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 05834490 Ballinger, Brad; Benbernou, Nadia; Bose, Prosenjit; Damian, Mirela; Demaine, Erik D.; Dujmović, Vida; Flatland, Robin; Hurtado, Ferran; Iacono, John; Lubiw, Anna; Morin, Pat; Sacristán, Vera; Souvaine, Diane; Uehara, Ryuhei

Coverage with $k$-transmitters in the presence of obstacles. (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, 1-15 (2010).

17

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 05815227 Kiyomi, Masashi; Saitoh, Toshiki; Uehara, Ryuhei

Reconstruction of interval graphs. (English)

Theor. Comput. Sci. 411, No. 43, 3859-3866 (2010).

18

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 05798135 Matsui, Yasuko; Uehara, Ryuhei; Uno, Takeaki

Enumeration of the perfect sequences of a chordal graph. (English)

Theor. Comput. Sci. 411, No. 40-42, 3635-3641 (2010).

19

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 05761601 Asano, Tetsuo; Jansson, Jesper; Sadakane, Kunihiko; Uehara, Ryuhei; Valiente, Gabriel

Faster computation of the Robinson-Foulds distance between phylogenetic networks. (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, 190-201 (2010).

20

PDF XML AMS-TeX TEXT BIBTeX DOI