Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Yang, Boting"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The optimal capture time of the one-cop-moves game
Boting Yang
,
William Hamilton
Theoretical Computer Science
588
, 2015, pp. 96-113
On the approximability of the exemplar adjacency number problem for genomes with gene repetitions
Zhixiang Chen
,
Bin Fu
,
Randy Goebel
,
Guohui Lin
,
Weitian Tong
,
Jinhui Xu
,
Boting Yang
,
Zhiyu Zhao
,
Binhai Zhu
Theoretical Computer Science
550
, 2014, pp. 59-65
Algebraic methods proving Sauer's bound for teaching complexity
Rahim Samei
,
Pavel Semukhin
,
Boting Yang
,
Sandra Zilles
Theoretical Computer Science
558
, 2014, pp. 35-50
Euclidean chains and their shortcuts
Boting Yang
Theoretical Computer Science
497
, 2013, pp. 55-67
Fast-mixed searching and related problems on graphs
Boting Yang
Theoretical Computer Science
507
, 2013, pp. 100-113
On the red/blue spanning tree problem
Sergey Bereg
,
Minghui Jiang
,
Boting Yang
,
Binhai Zhu
Theoretical Computer Science
412
(23), 2011, pp. 2459-2467
Fast edge searching and fast searching on graphs
Boting Yang
Theoretical Computer Science
412
(12-14), 2011, pp. 1208-1219
Parameterized complexity of even/odd subgraph problems
Leizhen Cai
,
Boting Yang
Lecture Notes in Computer Science
6078
, 2010, pp. 85-96
Lower bounds on fast searching
Donald Stanley
,
Boting Yang
Lecture Notes in Computer Science
5878
, 2009, pp. 964-973
Time constrained graph searching
Brian Alspach
,
Danny Dyer
,
Denis Hanson
,
Boting Yang
Theoretical Computer Science
399
(3), 2008, pp. 158-168
On the monotonicity of weak searching
Boting Yang
,
Yi Cao
Lecture Notes in Computer Science
5092
, 2008, pp. 52-61
On the monotonicity of weak searching
Boting Yang
,
Yi Cao
Lecture Notes in Computer Science
5092
, 2008, pp. 52-61
Monotonicity in digraph search problems
Boting Yang
,
Yi Cao
Theoretical Computer Science
407
(1-3), 2008, pp. 532-544
Non-breaking similarity of genomes with gene repetitions
Zhixiang Chen
,
Bin Fu
,
Jinhui Xu
,
Boting Yang
,
Zhiyu Zhao
,
Binhai Zhu
Lecture Notes in Computer Science
4580
, 2007, pp. 119-130
On the computation of colored domino tilings of simple and non-simple orthogonal polygons
Chris Worman
,
Boting Yang
Lecture Notes in Computer Science
3827
, 2005, pp. 859-868
Sweeping graphs with large clique number
Boting Yang
,
Danny Dyer
,
Brian Alspach
Lecture Notes in Computer Science
3341
, 2004, pp. 908-920
Detecting tetrahedralizations of a set of line segments
Boting Yang
,
Cao An Wang
Journal of Algorithms
53
(1), 2004, pp. 1-35
Algorithms and complexity for tetrahedralization detections
Boting Yang
,
Cao An Wang
,
Francis Chin
Lecture Notes in Computer Science
2518
, 2002, pp. 296-307
Triangulations without minimum-weight drawing
Cao An Wang
,
Francis Y. Chin
,
Boting Yang
Information Processing Letters
74
(5-6), 2000, pp. 183-189
Triangulations without minimum-weight drawing
Cao An Wang
,
Francis Y. Chin
,
Boting Yang
Lecture Notes in Computer Science
1767
, 2000, pp. 163-173
Tetrahedralization of two nested convex polyhedra
Cao An Wang
,
Boting Yang
Lecture Notes in Computer Science
1858
, 2000, pp. 291-298
The class Steiner minimal tree problem: A lower bound and test problem generation
Boting Yang
,
Paul Gillard
Acta Informatica
37
(3), 2000, pp. 193-211
A tight bound for
\beta
-skeleton of minimum weight triangulations
Cao An Wang
,
Boting Yang
Lecture Notes in Computer Science
1663
, 1999, pp. 265-275