The following pages link to Jianer Chen (Q1599636):
Displaying 50 items.
- General multiprocessor task scheduling (Q4238573) (← links)
- Graph Ear Decompositions and Graph Embeddings (Q4255818) (← links)
- (Q4281636) (← links)
- (Q4281642) (← links)
- A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus (Q4317707) (← links)
- On the Amount of Nondeterminism and the Power of Verifying (Q4337644) (← links)
- Circuit Bottom Fan-in and Computational Power (Q4388876) (← links)
- (Q4427861) (← links)
- A minimal and complete set of operators for the development of robust manifold mesh modelers (Q4429434) (← links)
- (Q4448746) (← links)
- (Q4448766) (← links)
- (Q4449224) (← links)
- (Q4472480) (← links)
- (Q4472486) (← links)
- (Q4472510) (← links)
- (Q4474073) (← links)
- (Q4474212) (← links)
- Improvement on vertex cover for low-degree graphs (Q4506265) (← links)
- Locally subcube-connected hypercube networks: theoretical analysis and experimental results (Q4571293) (← links)
- On Approximation Algorithms for Two-Stage Scheduling Problems (Q4632219) (← links)
- Lower bounds for the average genus (Q4698079) (← links)
- An efficient parameterized algorithm for m-set packing (Q4819697) (← links)
- (Q4823913) (← links)
- (Q4823953) (← links)
- (Q4871140) (← links)
- (Q4871163) (← links)
- Algebraic specification of interconnection network relationships by permutation voltage graph mappings (Q4895814) (← links)
- On Parameterized and Kernelization Algorithms for the Hierarchical Clustering Problem (Q4922138) (← links)
- Random Methods for Parameterized Problems (Q4925228) (← links)
- An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs (Q4925270) (← links)
- Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees (Q4925271) (← links)
- (Q4944990) (← links)
- On the complexity of graph embeddings (Q5060116) (← links)
- A Topologically Complete Theory of Weaving (Q5139663) (← links)
- Algorithms and Computation (Q5191643) (← links)
- Multicut in Trees Viewed through the Eyes of Vertex Cover (Q5199244) (← links)
- On the Minimum Link-Length Rectilinear Spanning Path Problem: Complexity and Algorithms (Q5267334) (← links)
- On the Pseudo-achromatic Number Problem (Q5302045) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311124) (← links)
- An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set (Q5321717) (← links)
- Parameterized Algorithms for Weighted Matching and Packing Problems (Q5425482) (← links)
- An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs (Q5425488) (← links)
- (Q5453224) (← links)
- Algorithmic Applications in Management (Q5710142) (← links)
- STACS 2005 (Q5710681) (← links)
- Computing and Combinatorics (Q5717021) (← links)
- Improved Parameterized Upper Bounds for Vertex Cover (Q5756684) (← links)
- Insight for Practical Subdivision Modeling with Discrete Gauss-Bonnet Theorem (Q5757340) (← links)
- A fixed-parameter-tractable algorithm for set packing (Q5957983) (← links)
- Algorithmic graph embeddings (Q6085703) (← links)
