Jesper Jansson

2007
33	EE	Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo: Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. AAIM 2007: 167-177
32	EE	Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung: Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. FSTTCS 2007: 424-435
31	EE	Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung: Ultra-succinct representation of ordered trees. SODA 2007: 575-584
30	EE	Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell: Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. Algorithmica 48(3): 233-248 (2007)
2006
29	EE	Jesper Jansson, Zeshan Peng: Algorithms for Finding a Most Similar Subforest. CPM 2006: 377-388
28	EE	Jesper Jansson, See-Kiong Ng, Wing-Kin Sung, Hugo Willy: A Faster and More Space-Efficient Algorithm for Inferring Arc-Annotations of RNA Sequences through Alignment. Algorithmica 46(2): 223-245 (2006)
27	EE	Ying-Jun He, Trinh N. D. Huynh, Jesper Jansson, Wing-Kin Sung: Inferring Phylogenetic Relationships Avoiding Forbidden Rooted Triplets. J. Bioinformatics and Computational Biology 4(1): 59-74 (2006)
26	EE	Ho-Leung Chan, Jesper Jansson, Tak Wah Lam, Siu-Ming Yiu: Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix. J. Bioinformatics and Computational Biology 4(4): 807-832 (2006)
25	EE	Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung: Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network. SIAM J. Comput. 35(5): 1098-1121 (2006)
24	EE	Jesper Jansson, Wing-Kin Sung: Inferring a level-1 phylogenetic network from a dense set of rooted triplets. Theor. Comput. Sci. 363(1): 60-68 (2006)
2005
23	EE	Ying-Jun He, Trinh N. D. Huynh, Jesper Jansson, Wing-Kin Sung: Inferring phylogenetic relationships avoiding forbidden rooted triplets. APBC 2005: 339-348
22	EE	Ho-Leung Chan, Jesper Jansson, Tak Wah Lam, Siu-Ming Yiu: Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix. MFCS 2005: 224-235
21	EE	Jesper Jansson, Zeshan Peng: Online and Dynamic Recognition of Squarefree Strings. MFCS 2005: 520-531
20	EE	Trinh N. D. Huynh, Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung: Constructing a Smallest Refining Galled Phylogenetic Network. RECOMB 2005: 265-280
19	EE	Shlomi Dobrev, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung: Finding Short Right-Hand-on-the-Wall Walks in Graphs. SIROCCO 2005: 127-139
18	EE	Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung: Algorithms for combining rooted triplets into a galled phylogenetic network. SODA 2005: 349-358
17	EE	Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung: Rooted Maximum Agreement Supertrees. Algorithmica 43(4): 293-307 (2005)
16	EE	Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung: Computing the maximum agreement of phylogenetic networks. Theor. Comput. Sci. 335(1): 93-107 (2005)
2004
15	EE	Jesper Jansson, Wing-Kin Sung: Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets. COCOON 2004: 462-472
14	EE	Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell: Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. CPM 2004: 220-229
13	EE	Jesper Jansson, Ngo Trung Hieu, Wing-Kin Sung: Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs. ISAAC 2004: 569-580
12	EE	Jesper Jansson, Wing-Kin Sung: The Maximum Agreement of Two Nested Phylogenetic Networks. ISAAC 2004: 581-593
11	EE	Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung: Rooted Maximum Agreement Supertrees. LATIN 2004: 499-508
10	EE	Jesper Jansson, See-Kiong Ng, Wing-Kin Sung, Hugo Willy: A Faster and More Space-Efficient Algorithm for Inferring Arc-Annotations of RNA Sequences Through Alignment. WABI 2004: 302-313
9	EE	Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung: Computing the Maximum Agreement of Phylogenetic Networks. Electr. Notes Theor. Comput. Sci. 91: 134-147 (2004)
8	EE	Jesper Jansson, Takeshi Tokuyama: Semi-Balanced Colorings of Graphs: Generalized 2-Colorings Based on a Relaxed Discrepancy Condition. Graphs and Combinatorics 20(2): 205-222 (2004)
7	EE	Leszek Gasieniec, Jesper Jansson, Andrzej Lingas: Approximation algorithms for Hamming clustering problems. J. Discrete Algorithms 2(2): 289-301 (2004)
2003
6	EE	Jesper Jansson, Andrzej Lingas: A Fast Algorithm for Optimal Alignment between Similar Ordered Trees. Fundam. Inform. 56(1-2): 105-120 (2003)
2001
5	EE	Jesper Jansson, Andrzej Lingas: A Fast Algorithm for Optimal Alignment between Similar Ordered Trees. CPM 2001: 232-240
2000
4	EE	Leszek Gasieniec, Jesper Jansson, Andrzej Lingas: Approximation Algorithms for Hamming Clustering Problems. CPM 2000: 108-118
1999
3	EE	Leszek Gasieniec, Jesper Jansson, Andrzej Lingas: Efficient Approximation Algorithms for the Hamming Center Problem. SODA 1999: 905-906
2		Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin: On the Complexity of Constructing Evolutionary Trees. J. Comb. Optim. 3(2-3): 183-197 (1999)
1997
1		Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin: On the Complexity of Computing Evolutionary Trees. COCOON 1997: 134-145

Coauthor Index

1	Yuichi Asahiro	[33]
2	Ho-Leung Chan	[22] [26]
3	Charles Choy	[9] [16]
4	Anders Dessmark	[14] [30]
5	Shlomi Dobrev	[19]
6	Leszek Gasieniec	[1] [2] [3] [4] [7]
7	Ying-Jun He	[23] [27]
8	Ngo Trung Hieu	[13]
9	Trinh N. D. Huynh	[20] [23] [27]
10	Tak Wah Lam	[22] [26]
11	Andrzej Lingas	[1] [2] [3] [4] [5] [6] [7] [14] [30]
12	Eva-Marta Lundell	[14] [30]
13	Eiji Miyano	[33]
14	Joseph H.-K. Ng	[11] [17]
15	See-Kiong Ng	[10] [28]
16	Nguyen Bao Nguyen	[18] [20] [25]
17	Hirotaka Ono	[33]
18	Anna Pagh (Anna Östlin)	[1] [2]
19	Zeshan Peng	[21] [29]
20	Kunihiko Sadakane	[9] [11] [16] [17] [19] [31] [32]
21	Wing-Kin Sung	[9] [10] [11] [12] [13] [15] [16] [17] [18] [19] [20] [23] [24] [25] [27] [28] [31] [32]
22	Takeshi Tokuyama	[8]
23	Hugo Willy	[10] [28]
24	Siu-Ming Yiu	[22] [26]
25	Kouhei Zenmyo	[33]

Colors in the list of coauthors