The SCEAS System
| |||||||

## Search the dblp DataBase
Boting Yang:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Jamiru Luttamaguzi, Michael J. Pelsmajer, Zhizhang Shen, Boting Yang
**Integer Programming Methods for Several Optimization Problems in Graph Theory.**[Citation Graph (0, 0)][DBLP] Computers and Their Applications, 2005, pp:50-55 [Conf] - Chris Worman, Boting Yang
**On the Computation and Chromatic Number of Colored Domino Tilings.**[Citation Graph (0, 0)][DBLP] CCCG, 2005, pp:203-206 [Conf] - Boting Yang, Cao An Wang
**Minimal Tetrahedralizations of a Class of Polyhedra.**[Citation Graph (0, 0)][DBLP] CCCG, 2000, pp:- [Conf] - Cao An Wang, Boting Yang
**Optimal Tetrahedralizations of Some Convex Polyhedra.**[Citation Graph (0, 0)][DBLP] EWCG, 2000, pp:5-9 [Conf] - Boting Yang, Danny Dyer, Brian Alspach
**Sweeping Graphs with Large Clique Number.**[Citation Graph (0, 0)][DBLP] ISAAC, 2004, pp:908-920 [Conf] - Boting Yang, Cao An Wang, Francis Y. L. Chin
**Algorithms and Complexity for Tetrahedralization Detections.**[Citation Graph (0, 0)][DBLP] ISAAC, 2002, pp:296-307 [Conf] - Chris Worman, Boting Yang
**On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons.**[Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:859-868 [Conf] - Cory J. Butz, Wen Yan, Boting Yang
**The Computational Complexity of Inference Using Rough Set Flow Graphs.**[Citation Graph (0, 0)][DBLP] RSFDGrC (1), 2005, pp:335-344 [Conf] - Cao An Wang, Boting Yang
**A lower bound for beta-skeleton belonging to minimum weight triangulations.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2001, v:19, n:1, pp:35-46 [Journal] - Brett Stevens, Paul Buskell, Paule Ecimovic, Cristian Ivanescu, Abid Muslim Malik, Anamaria Savu, Tzvetalin S. Vassilev, Helen Verrall, Boting Yang, Zhiduo Zhao
**Solution of an outstanding conjecture: the non-existence of universal cycles with**[Citation Graph (0, 0)][DBLP]*k*=*n*-2. Discrete Mathematics, 2002, v:258, n:1-3, pp:193-204 [Journal] - Cao An Wang, Francis Y. L. Chin, Boting Yang
**Triangulations without minimum-weight drawing.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:74, n:5-6, pp:183-189 [Journal] - Boting Yang, Cao An Wang
**Detecting tetrahedralizations of a set of line segments.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2004, v:53, n:1, pp:1-35 [Journal] - Boting Yang, Cao An Wang
**Minimal Tetrahedralizations of a Class of Polyhedra.**[Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2004, v:8, n:3, pp:241-265 [Journal] - Boting Yang
**Strong-mixed searching and pathwidth.**[Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2007, v:13, n:1, pp:47-59 [Journal] - Cory J. Butz, Wen Yan, Boting Yang
**An Efficient Algorithm for Inference in Rough Set Flow Graphs.**[Citation Graph (0, 0)][DBLP] , 2006, v:, n:, pp:102-122 [Journal] - Boting Yang, Yi Cao
**Digraph Strong Searching: Monotonicity and Complexity.**[Citation Graph (0, 0)][DBLP] AAIM, 2007, pp:37-46 [Conf] - Boting Yang, Yi Cao
**Directed Searching Digraphs: Monotonicity and Complexity.**[Citation Graph (0, 0)][DBLP] TAMC, 2007, pp:136-147 [Conf] - Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang
**Arc Searching Digraphs Without Jumping.**[Citation Graph (0, 0)][DBLP] COCOA, 2007, pp:354-365 [Conf] - Boting Yang, Runtao Zhang, Yi Cao
**Searching Cycle-Disjoint Graphs.**[Citation Graph (0, 0)][DBLP] COCOA, 2007, pp:32-43 [Conf] - Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang
**Lower Bounds on Edge Searching.**[Citation Graph (0, 0)][DBLP] ESCAPE, 2007, pp:516-527 [Conf] **On the Fast Searching Problem.**[Citation Graph (, )][DBLP]**Linear Time Probabilistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments.**[Citation Graph (, )][DBLP]**Parameterized Complexity of Even/Odd Subgraph Problems.**[Citation Graph (, )][DBLP]**On the Monotonicity of Weak Searching.**[Citation Graph (, )][DBLP]**Lower Bounds on Fast Searching.**[Citation Graph (, )][DBLP]**Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance.**[Citation Graph (, )][DBLP]**On the Red/Blue Spanning Tree Problem.**[Citation Graph (, )][DBLP]**Searching Trees with Sources and Targets.**[Citation Graph (, )][DBLP]**Digraph searching, directed vertex separation and directed pathwidth.**[Citation Graph (, )][DBLP]**Sweeping graphs with large clique number.**[Citation Graph (, )][DBLP]**On the Tileability of Polygons with Colored Dominoes.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |