Ryuhei Uehara

2008
29	EE	Ryuhei Uehara: Simple Geometrical Intersection Graphs. WALCOM 2008: 25-33
28	EE	Yoshihiro Takahara, Sachio Teramoto, Ryuhei Uehara: Longest Path Problems on Ptolemaic Graphs. IEICE Transactions 91-D(2): 170-177 (2008)
2007
27	EE	Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno: A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. TAMC 2007: 115-127
26	EE	Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno: Efficient Algorithms for Airline Problem. TAMC 2007: 428-439
25	EE	Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara: Tree Spanners for Bipartite Graphs and Probe Interval Graphs. Algorithmica 47(1): 27-51 (2007)
24	EE	Ryuhei Uehara, Gabriel Valiente: Linear structure of bipartite permutation graphs and the longest path problem. Inf. Process. Lett. 103(2): 71-77 (2007)
2006
23	EE	Ryuhei Uehara, Sachio Teramoto: The Complexity of a Pop-Up Book. CCCG 2006
22	EE	Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara: Voronoi game on graphs and its complexity. CIG 2006: 265-271
2005
21	EE	Ryuhei Uehara, Yushi Uno: Laminar Structure of Ptolemaic Graphs and Its Applications. ISAAC 2005: 186-195
20	EE	Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara: Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. WG 2005: 433-444
19	EE	Ryuhei Uehara, Seinosuke Toda, Takayuki Nagoya: Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs. Discrete Applied Mathematics 145(3): 479-482 (2005)
2004
18	EE	Ryuhei Uehara: Canonical Data Structure for Interval Probe Graphs. ISAAC 2004: 859-870
17	EE	Ryuhei Uehara, Yushi Uno: Efficient Algorithms for the Longest Path Problem. ISAAC 2004: 871-883
16	EE	Peisen Zhang, Huitao Sheng, Ryuhei Uehara: A double classification tree search algorithm for index SNP selection. BMC Bioinformatics 5: 89 (2004)
2003
15	EE	Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara: Tree Spanners for Bipartite Graphs and Probe Interval Graphs. WG 2003: 106-118
2002
14	EE	Therese C. Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, Ming-wei Wang: Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles. CCCG 2002: 105-108
13	EE	Ryuhei Uehara: Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs. ICALP 2002: 993-1004
2000
12	EE	Ryuhei Uehara, Zhi-Zhong Chen: Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs. IFIP TCS 2000: 84-98
11	EE	Ryuhei Uehara, Zhi-Zhong Chen: Parallel approximation algorithms for maximum weighted matching in general graphs. Inf. Process. Lett. 76(1-2): 13-17 (2000)
10	EE	Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener: Identification of Partial Disjunction, Parity, and Threshold Functions. Theor. Comput. Sci. 230(1-2): 131-147 (2000)
1999
9	EE	Ryuhei Uehara: Another Measure for the Lexicographically First Maximal Subgraph Problems and Its Threshold Value on a Random Graph. ISPAN 1999: 350-355
8		Ryuhei Uehara: A Measure for the Lexicographically First Maximal Independent Set Problem and Its Limits. Int. J. Found. Comput. Sci. 10(4): 473-482 (1999)
7	EE	Ryuhei Uehara, Zhi-Zhong Chen, Xin He: Fast RNC and NC Algorithms for Maximal Path Sets. Theor. Comput. Sci. 215(1-2): 89-98 (1999)
1997
6		Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener: Optimal Attribute-Efficient Learning of Disjunction, Parity and Threshold Functions. EuroCOLT 1997: 171-184
5		Ryuhei Uehara: A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problems. WG 1997: 333-341
4	EE	Ryuhei Uehara: Collapse of PP with a Semi-Random Source to BPP. Inf. Process. Lett. 61(2): 83-87 (1997)
1996
3		Ryuhei Uehara, Zhi-Zhong Chen, Xin He: Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application. COCOON 1996: 209-218
2	EE	Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener: Optimal attribute-efficient learning of disjunction, parity, and threshold functions Electronic Colloquium on Computational Complexity (ECCC) 3(61): (1996)
1995
1	EE	Ryuhei Uehara: Efficient Simulations by a Biased Coin. Inf. Process. Lett. 56(5): 245-248 (1995)

Coauthor Index

1	Therese C. Biedl	[14]
2	Andreas Brandstädt	[15] [25]
3	Timothy M. Chan	[14]
4	Zhi-Zhong Chen	[3] [7] [11] [12]
5	Erik D. Demaine	[14] [22]
6	Martin L. Demaine	[14]
7	Feodor F. Dragan	[15] [25]
8	Xin He	[3] [7]
9	Hoàng-Oanh Le	[15] [25]
10	Van Bang Le	[15] [25]
11	Takayuki Nagoya	[19]
12	Shin-Ichi Nakano	[26] [27]
13	Paul Nijjar	[14]
14	Yoshio Okamoto	[20]
15	Huitao Sheng	[16]
16	Yoshihiro Takahara	[28]
17	Sachio Teramoto	[22] [23] [28]
18	Seinosuke Toda	[19]
19	Kensei Tsuchida	[2] [6] [10]
20	Takeaki Uno	[20] [26] [27]
21	Yushi Uno	[17] [21]
22	Gabriel Valiente	[24]
23	Ming-wei Wang	[14]
24	Ingo Wegener	[2] [6] [10]
25	Peisen Zhang	[16]

Colors in the list of coauthors