Projects
Reading
People
Chat
SU\G
(šø)
/KĀ·U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
Xiaojun Shen
Follow
Share
Generating author description...
All published works
Action
Title
Year
Authors
+
An efficient parallel algorithm for building the separating tree
2010
Yijie Han
Sanjeev Saxena
Xiaojun Shen
+
The development of newfixed bearing dismantler for freight
2010
Xiaojun Shen
+
Rearrangeability of 7-stage 16 Ć 16 shuffle exchange networks
2008
H. Y. Dai
Xiaojun Shen
+
Generalized Latin squares II
1995
Xiaojun Shen
+
Optimal routing of permutations on rings
1994
Xiaojun Shen
Qing Hu
Hao Dai
Xiangzu Wang
+
Covering convex sets with non-overlapping polygons
1990
Herbert Edelsbrunner
Arch D. Robison
Xiaojun Shen
Common Coauthors
Coauthor
Papers Together
Hao Dai
1
Xiangzu Wang
1
Herbert Edelsbrunner
1
Qing Hu
1
Arch D. Robison
1
H. Y. Dai
1
Yijie Han
1
Sanjeev Saxena
1
Commonly Cited References
Action
Title
Year
Authors
# of times referenced
+
Generalized latin rectangles II: Embedding
1980
Lars Andersen
A. J. W. Hilton
1
+
PDF
Chat
Geometric permutations and common transversals
1986
Meir Katchalski
Teresa Lewis
A. Liu
1
+
PDF
Chat
Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph
1992
Samir Khuller
S.G. Mitchell
Vijay V. Vazirani
1
+
Parallel algorithms for separable permutations
2004
V. Yugandhar
Sanjeev Saxena
1
+
Geometric permutations for convex sets
1985
Meir Katchalski
T. Lewis
Joseph Zaks
1
+
PDF
Chat
The maximum number of ways to stabn convex nonintersecting sets in the plane is 2nā2
1990
Herbert Edelsbrunner
Micha Sharir
1
+
Routing, merging and sorting on parallel models of computation
1982
Allan Borodin
John E. Hopcroft
1
+
Zerlegung von Dreiecken in Dreiecke mit Nebenbedingung
1987
A. Florian
Wolfgang M. Schmidt
1
+
PDF
Chat
A unifying look at data structures
1980
Jean Vuillemin
1
+
The Looping Algorithm Extended to Base 2<sup>t</sup>Rearrangeable Switching Networks
1977
S. Andresen
1
+
Introductory combinatorics
1977
Kenneth P. Bogart
1
+
On rearrangeable networks of the shuffle-exchange type
1988
FrantiŔek SoviŔ
1
+
Non-orthogonal graeco-latin designs
1976
D. A. Preece
1