Jian-er Chen
#149,393
Most Influential Person Now
Jian-er Chen's AcademicInfluence.com Rankings
Jian-er Chenmathematics Degrees
Mathematics
#6934
World Rank
#9520
Historical Rank
Graph Theory
#87
World Rank
#95
Historical Rank
Measure Theory
#1732
World Rank
#2127
Historical Rank

Download Badge
Mathematics
Jian-er Chen's Degrees
- Bachelors Mathematics National Taiwan University
Similar Degrees You Can Earn
Why Is Jian-er Chen Influential?
(Suggest an Edit or Addition)Jian-er Chen's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Topological Graph Theory (1987) (1233)
- Vertex Cover: Further Observations and Further Improvements (1999) (587)
- Improved upper bounds for vertex cover (2010) (361)
- A fixed-parameter algorithm for the directed feedback vertex set problem (2008) (274)
- Strong computational lower bounds via parameterized complexity (2006) (250)
- Tight lower bounds for certain parameterized NP-hard problems (2004) (214)
- Modifying the DPClus algorithm for identifying protein complexes based on new topological structures (2008) (211)
- Lifetime and Energy Hole Evolution Analysis in Data-Gathering Wireless Sensor Networks (2016) (201)
- A Fast Hierarchical Clustering Algorithm for Functional Modules Discovery in Protein Interaction Networks (2011) (191)
- Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size (2005) (182)
- Improved Parameterized Upper Bounds for Vertex Cover (2006) (159)
- Improved algorithms for feedback vertex set problems (2007) (154)
- Improved algorithms for path, matching, and packing problems (2007) (120)
- Advice Classes of Parameterized Tractability (1997) (119)
- Linear FPT reductions and computational lower bounds (2004) (118)
- On fixed-parameter tractability and approximability of NP-hard optimization problems (1993) (117)
- A 2k kernel for the cluster editing problem (2010) (115)
- A survey on security attacks in VANETs: Communication, applications and challenges (2019) (115)
- An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem (2009) (110)
- On Feedback Vertex Set: New Measure and New Structures (2010) (97)
- On the parameterized complexity of short computation and factorization (1997) (95)
- General Multiprocessor Task Scheduling (1999) (87)
- Cluster Editing: Kernelization Based on Edge Cuts (2010) (82)
- Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems (2003) (72)
- Improved exact algorithms for MAX-SAT (2002) (71)
- A Fast Agglomerate Algorithm for Mining Functional Modules in Protein Interaction Networks (2008) (68)
- An Efficient Algorithm for Constructing Maximum lifetime Tree for Data Gathering Without Aggregation in Wireless Sensor Networks (2010) (66)
- Nearly optimal one-to-many parallel routing in star networks (1997) (65)
- Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms (2009) (64)
- An improved kernelization for P2-packing (2010) (61)
- On-line maintenance of the four-connected components of a graph (1991) (61)
- A fixed-parameter algorithm for the directed feedback vertex set problem (2008) (58)
- Overlap matrices and total imbedding distributions (1994) (57)
- Guaranteeing the 2-Manifold Property for Meshes with doubly Linked Face List (1999) (57)
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree (2017) (57)
- On the Amount of Nondeterminism and the Power of Verifying (1997) (55)
- An efficient parameterized algorithm for m-set packing (2004) (55)
- Planar graph vertex partition for linear problem kernels (2013) (54)
- Complexity and parameterized algorithms for Cograph Editing (2012) (52)
- Improved Parameterized Set Splitting Algorithms: A Probabilistic Approach (2009) (52)
- Meta-metric for saliency detection evaluation metrics based on application preference (2018) (48)
- Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms (2006) (46)
- Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms (2003) (45)
- Integrating Sample-Driven and Pattern-Driven Approaches in Motif Finding (2004) (44)
- Hypercube network fault tolerance: a probabilistic approach (2002) (43)
- On the Structure of Parameterized Problems in NP (1995) (43)
- Improvement on vertex cover for low-degree graphs (2000) (42)
- Separability and topology control of quasi unit disk graphs (2007) (42)
- A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling (2001) (42)
- Simplicity is Beauty: Improved Upper Bounds for Vertex Cover (2005) (40)
- Generalized distance functions (1999) (40)
- Quality-Guaranteed Event-Sensitive Data Collection and Monitoring in Vibration Sensor Networks (2017) (39)
- Transparent Computing: A Promising Network Computing Paradigm (2017) (39)
- Maximum genus and connectivity (1996) (37)
- Cyclic plain-weaving on polygonal mesh surfaces with graph rotation systems (2009) (37)
- A minimal and complete set of operators for the development of robust manifold mesh modelers (2003) (37)
- Algorithmic Graph Embeddings (1997) (36)
- Identifying the overlapping complexes in protein interaction networks (2010) (35)
- Two methods for creating chinese painting (2002) (35)
- An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem (2007) (35)
- Tight Bound on Johnson's Algorithm for Maximum Satisfiability (1999) (35)
- A tight lower bound on the maximum genus of a simplicial graph (1996) (33)
- Face Tracing Based Geographic Routing in Nonplanar Wireless Networks (2007) (33)
- Limit points for average genus. I. 3-Connected and 2-connected simplicial graphs (1992) (32)
- Improved deterministic algorithms for weighted matching and packing problems (2011) (32)
- On the computational hardness based on linear FPT-reductions (2006) (32)
- Optimal Parallel Routing in Star Networks (1997) (32)
- A new paradigm for changing topology during subdivision modeling (2000) (31)
- Using Nondeterminism to Design Efficient Deterministic Algorithms (2004) (31)
- SDN-based VANETs, Security Attacks, Applications, and Challenges (2020) (31)
- Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results (2002) (30)
- Reversal Complexity (2015) (29)
- Kuratowski-Type Theorems for Average Genus (1993) (29)
- A note on practical construction of maximum bandwidth paths (2002) (28)
- Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks (2014) (28)
- On strong Menger-connectivity of star graphs (2001) (27)
- Adaptive-Acceleration Data Center TCP (2015) (26)
- Utilization-based admission control for real-time applications (2000) (26)
- Information Structures (1999) (26)
- Polynomial time approximation schemes and parameterized complexity (2007) (26)
- Randomized parameterized algorithms for $$P_2$$P2-Packing and Co-Path Packing problems (2015) (26)
- Tuning the Aggressive TCP Behavior for Highly Concurrent HTTP Connections in Intra-Datacenter (2017) (25)
- Efficient flooding in Wireless Sensor Networks secured with neighborhood keys (2011) (24)
- Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees (2015) (24)
- A New Corner cutting Scheme with tension and Handle-Face Reconstruction (2001) (24)
- A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract) (1999) (24)
- On Feedback Vertex Set: New Measure and New Structures (2010) (24)
- SDN based communications privacy-preserving architecture for VANETs using fog computing (2020) (23)
- A model of higher accuracy for the individual haplotyping problem based on weighted SNP fragments and genotype with errors (2008) (23)
- Limit points for average genus II. 2-Connected non-simplicial graphs (1992) (23)
- Cardinality-based inference control in OLAP systems: an information theoretic approach (2004) (23)
- Insight for Practical Subdivision Modeling with Discrete Gauss-Bonnet Theorem (2006) (22)
- On Parameterized Intractability: Hardness and Completeness (2008) (22)
- Interactive construction of multi-segment curved handles (2002) (21)
- Probabilistic analysis on mesh network fault tolerance (2007) (21)
- A Note on Approximating Graph Genus (1997) (21)
- Bandwidth tree - a data structure for routing in networks with advanced reservations (2002) (20)
- Altered succinylation of mitochondrial proteins, APP and tau in Alzheimer’s disease (2022) (20)
- Application-oriented purely semantic precision and recall for ontology mapping evaluation (2008) (19)
- A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus (1994) (19)
- PFED: a prediction-based fair active queue management algorithm (2005) (19)
- An O(1.84k) parameterized algorithm for the multiterminal cut problem (2013) (18)
- Regular meshes (2005) (18)
- Cograph Editing: Complexity and Parameterized Algorithms (2011) (18)
- Rethinking Fast and Friendly Transport in Data Center Networks (2020) (17)
- On product covering in 3-tier supply chain models: Natural complete problems for W[3] and W[4] (2006) (17)
- Guaranteeing 2-manifold property for meshes (1999) (17)
- Adaptive marking threshold method for delay-sensitive TCP in data center network (2016) (17)
- Matching and Weighted P2-Packing: Algorithms and Kernels (2014) (17)
- Characterizing Parallel Hierarchies by Reducibilities (1991) (16)
- Hierarchical Organization of Functional Modules in Weighted Protein Interaction Networks Using Clustering Coefficient (2009) (16)
- A parameterized algorithm for the hyperplane-cover problem (2010) (16)
- On approximating minimum vertex cover for graphs with perfect matching (2000) (16)
- A 2k-vertex Kernel for Maximum Internal Spanning Tree (2014) (16)
- Regular Mesh Construction Algorithms using Regular Handles (2006) (16)
- Genus characterizes the complexity of certain graph problems: Some tight results (2007) (16)
- On the construction of most reliable networks (2004) (16)
- Dealing with 4-variables by resolution: An improved MaxSAT algorithm (2015) (15)
- On Input Read-Modes of Alternating Turing Machines (1995) (15)
- Robust Planarization of Unlocalized Wireless Sensor Networks (2008) (15)
- Interactive rind modeling (2003) (15)
- Finding Pathway Structures in Protein Interaction Networks (2007) (15)
- A Graph-Theoretic Method for Mining Overlapping Functional Modules in Protein Interaction Networks (2008) (15)
- Improved kernel results for some FPT problems based on simple observations (2017) (15)
- Using Nondeterminism to Design Deterministic Algorithms (2001) (14)
- Tight bound on Johnson's algorithm for Max-SAT (1997) (14)
- Parallel routing in hypercube networks with faulty nodes (2001) (14)
- Strong Fault-Tolerance: Parallel Routing in Star Networks with Faults (2003) (14)
- A Delay-Constrained and Maximum Lifetime Data Gathering Algorithm for Wireless Sensor Networks (2009) (14)
- Kernels for Packing and Covering Problems - (Extended Abstract) (2012) (14)
- A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI (2008) (14)
- On the Minimum Link-Length Rectilinear Spanning Path Problem: Complexity and Algorithms (2014) (14)
- Boosting-LDA algriothm with multi-domain feature fusion for motor imagery EEG decoding (2021) (14)
- Parameterized complexity and polynomial-time approximation schemes (2004) (14)
- Performance Evaluation of Hypervisors and the Effect of Virtual CPU on Performance (2018) (13)
- Multicut in trees viewed through the eyes of vertex cover (2011) (13)
- A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors (2000) (13)
- A prototype system for robust, interactive and user-friendly modeling of orientable 2-manifold meshes (2002) (13)
- On the Amount of Nondeterminism and the Power of Verifying (Extended Abstract) (1993) (13)
- W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications (2005) (13)
- An improved FPT algorithm for Almost Forest Deletion problem (2018) (13)
- Iterative Expansion and Color Coding (2012) (13)
- Approximating Maximum Agreement Forest on Multiple Binary Trees (2016) (13)
- An Overhearing-Based Scheme for Improving Data Persistence in Wireless Sensor Networks (2010) (13)
- A Virtual Laboratory Platform Based on Integration of Java and Matlab (2008) (12)
- Performance Measurements for Privacy Preserving Data Mining (2005) (12)
- Parameterized Algorithms for the Maximum Agreement Forest Problem on Multiple Rooted Multifurcating Trees (2016) (12)
- Hamiltonian cycle art: Surface covering wire sculptures and duotone surfaces (2013) (12)
- Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers (2009) (12)
- A practical algorithm based on particle swarm optimization for haplotype reconstruction (2009) (12)
- On scheduling multiple two-stage flowshops (2020) (11)
- D An Interactive Topological Mesh Modeler (2008) (11)
- Optimization of communication in VANETs using fuzzy logic and artificial Bee colony (2020) (11)
- Edge deletion problems: Branching facilitated by modular decomposition (2015) (11)
- An improved lower bound on approximation algorithms for the Closest Substring problem (2008) (11)
- Theory and Applications of Models of Computation (2014) (11)
- Construction with physical version of quad-edge data structures (2016) (11)
- Security from the transparent computing aspect (2014) (11)
- Practical Polygonal Mesh Modeling with Discrete Gaussian-Bonnet Theorem (2006) (11)
- An Automated Signature Generation Approach for Polymorphic Worm Based on Color Coding (2009) (11)
- Cyclic twill-woven objects (2010) (11)
- Reliable networks with unreliable sensors (2011) (11)
- An Improved Parameterized Algorithm for a Generalized Matching Problem (2008) (11)
- Web-based intuitive and effective design of symmetric tiles (2000) (10)
- The distribution of graph imbeddings on topological surfaces (1991) (10)
- Partition on trees with supply and demand: Kernelization and algorithms (2017) (10)
- Lower bounds for the average genus (1995) (10)
- Routing in Hypercube Networks with a Constant Fraction of Faulty Nodes (2000) (10)
- Endogenous BMP-4/ROS/COX-2 Mediated IPC and Resveratrol Alleviated Brain Damage. (2019) (10)
- On Transparency and Accountability of Smart Assistants in Smart Cities (2019) (10)
- A parthenogenetic algorithm for single individual SNP haplotyping (2009) (10)
- A probabilistic approach to fault-tolerant routing algorithm on mesh networks (2004) (10)
- Pattern mapping with quad-pattern-coverable quad-meshes (2011) (9)
- Deeper Local Search for Better Approximation on Maximum Internal Spanning Trees (2014) (9)
- Vertex cover: exact and approximation algorithms and applications (2001) (9)
- Paper-Strip Sculptures (2010) (9)
- Directed Feedback Vertex Set Problem is FPT (2007) (9)
- On the Complexity of Graph Embeddings (Extended Abstract) (1993) (9)
- Improved Algorithms for Weighted and Unweighted Set Splitting Problems (2007) (9)
- Vertex-disjoint routings in star graphs (1995) (9)
- Computational Models and Algorithms for the Single Individual Haplotyping Problem (2010) (9)
- A Linear Time Algorithm for Isomorphism of Graphs of Bounded Average Genus (1992) (9)
- Single-cycle plain-woven objects (2010) (9)
- Genus Characterizes the Complexity of Graph Problems: Some Tight Results (2003) (9)
- Parameterized complexity of control and bribery for d-approval elections (2013) (8)
- Semi-normal Schedulings: Improvement on Goemans' Algorithm (2001) (8)
- Circuit bottom fan-in and computational power (1997) (8)
- An O*(3.533k)-time parameterized algorithm for the 3-set packing problem (2011) (8)
- An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set (2009) (8)
- An analysis of forwarding mechanism in crowds (2003) (8)
- SAS: A Scalar Anonymous Communication System (2005) (8)
- Surface covering curves (2012) (8)
- The cost of becoming anonymous: on the participant payload in Crowds (2004) (8)
- Combined ischemic preconditioning and resveratrol improves blood-brain barrier breakdown via Hippo/YAP/TAZ signaling pathway. (2020) (8)
- On parameterized exponential time complexity (2009) (8)
- On the Approximability of Multiprocessor Task Scheduling Problems (2002) (8)
- Privacy preserving and data publication for vehicular trajectories with differential privacy (2020) (8)
- On Unknown Small Subsets and Implicit Measures: New Techniques for Parameterized Algorithms (2014) (8)
- Parameterized top-K algorithms (2013) (8)
- Designing Fast and Friendly TCP to Fit High Speed Data Center Networks (2018) (8)
- On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms (2001) (8)
- On the Effective Enumerability of NP Problems (2006) (8)
- An Adaptive Probability Broadcast-Based Data Preservation Protocol in Wireless Sensor Networks (2011) (7)
- Parameterized Complexity and Subexponential-Time Computability (2012) (7)
- Improved linear problem kernel for planar connected dominating set (2013) (7)
- On Scheduling Two-Stage Jobs on Multiple Two-Stage Flowshops (2018) (7)
- Research on Parameterized Algorithms of the Individual Haplotyping Problem (2007) (7)
- Matching and P 2-Packing: Weighted Versions (2011) (7)
- AI and Its Risks in Android Smartphones: A Case of Google Smart Assistant (2019) (7)
- An Improved Kernel for Planar Connected Dominating Set (2011) (7)
- Cyclic Plain-Weaving on Polygonal Mesh Surfaces with Extended Graph Rotation Systems (2009) (7)
- Scheduling two-stage jobs on multiple flowshops (2019) (7)
- Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees (2013) (7)
- On scheduling inclined jobs on multiple two-stage flowshops (2019) (7)
- Block meshes: Topologically robust shape modeling with graphs embedded on 3-manifolds (2015) (7)
- The Maximum Partition Matching Problem with Applications (1999) (7)
- Algorithms for parameterized maximum agreement forest problem on multiple trees (2014) (7)
- A practical algorithm for multiplex PCR primer set selection (2009) (7)
- Extended graph rotation systems as a model for cyclic weaving on orientable surfaces (2015) (7)
- Combinatorial and algebraic methods in star and de bruijn networks (1995) (6)
- Pleasure or pain? An evaluation of the costs and utilities of bloatware applications in android smartphones (2020) (6)
- Graph Ear Decompositions and Graph Embeddings (1999) (6)
- A Service Oriented Healthcare Architecture (SOHA-CC) Based on Cloud Computing (2018) (6)
- Medical Image Segmentation by Combining Adaptive Artificial Bee Colony and Wavelet Packet Decomposition (2019) (6)
- A Genetic Algorithm for Single Individual SNP Haplotype Assembly (2008) (6)
- Identifying Complexes from Protein Interaction Networks According to Different Types of Neighborhood Density (2012) (6)
- Interactive modeling of smooth manifold meshes with arbitrary topology: G1 stitched bi-cubic Bézier patches (2017) (6)
- A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees (2015) (6)
- Improved approximation algorithms for two-stage flowshops scheduling problem (2020) (5)
- Research on Multi-valued and Multi-labeled Decision Trees (2006) (5)
- Linear Problem Kernels for Planar Graph Problems with Small Distance Property (2011) (5)
- On Assembly of Four-Connected Graphs (Extended Abstract) (1992) (5)
- Kernels for packing and covering problems (2019) (5)
- Resolution and linear CNF formulas: Improved (n, 3)-MaxSAT algorithms (2016) (5)
- An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs (2015) (5)
- A new fault-tolerant routing scheme for 2-dimensional mesh networks (2003) (5)
- Approximation Algorithms for Maximum Agreement Forest on Multiple Trees (2014) (5)
- A heuristic algorithm for haplotype reconstruction from aligned weighted SNP fragments (2013) (5)
- Probabilistic analysis of connectivity on mesh networks (2003) (5)
- On the parameterized vertex cover problem for graphs with perfect matching (2014) (5)
- Tuning the Aggressive TCP Behavior for Highly Concurrent HTTP Connections in Data Center (2016) (5)
- A practical parameterised algorithm for the individual haplotyping problem MLF† (2010) (5)
- Band decomposition of 2-manifold meshes for physical construction of large structures (2011) (5)
- Special Issue for FAW 2014 (2016) (4)
- A Privacy-Preserving Crowdsensing System with Muti-Blockchain (2020) (4)
- Constant Time Updateable Operations for Implicit Shape Modeling (2003) (4)
- A homomorphism of the de Bruijn graphs and its applications (1995) (4)
- Approximation Algorithms on Multiple Two-Stage Flowshops (2018) (4)
- An Anonymous Communication Mechanism without Key Infrastructure Based on Multi-Paths Network Coding (2009) (4)
- Band decomposition of 2-manifold meshes for physical construction of large structures (2011) (4)
- A distributed algorithm based on probability for refining energy-efficiency of multicast trees in ad hoc networks (2005) (4)
- Detection of hierarchical intrinsic symmetry structure in 3D models (2018) (4)
- Distances Between Phylogenetic Trees: A Survey (2013) (4)
- A quality of service routing protocol based on mobility prediction in mobile ad hoc networks (2003) (4)
- Handle and hole improvement by using new corner cutting subdivision scheme with tension (2001) (4)
- Strong Fault-Tolerance: Parallel Routing in Networks with Faults (2001) (4)
- A New Fault-Tolerant Broadcast Routing Algorithm on Mesh Networks (2010) (4)
- Resolution and Domination: An Improved Exact MaxSAT Algorithm (2019) (4)
- Some results on the minimal coverings of precomplete classes in partial K-valued logic functions (2003) (4)
- A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem (2007) (4)
- An Interactive Shape Modeling System for Robust Design of Functional 3D Shapes (2001) (4)
- A simple linear time approximation algorithm for multi-processor job scheduling on four processors (2006) (4)
- Polymorphic Worm Detection Using Signatures Based on Neighborhood Relation (2009) (4)
- Payload analysis of anonymous communication system with host-based rerouting mechanism (2003) (4)
- FPT Results for Signed Domination (2012) (4)
- On Product Covering in Supply Chain Models: Natural Complete Problems for W[3] and W[4] (2005) (4)
- Analysis on the Scheduling Problem in Transparent Computing (2013) (3)
- Editorial: foreword from the guest editors (2003) (3)
- Optimal Streaming Algorithms for Graph Matching (2021) (3)
- Linear-Time Parameterized Algorithms with Limited Local Resources (2020) (3)
- Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees (2013) (3)
- Link Availability at Any Time in MANET (2006) (3)
- On Counting 3-D Matchings of Size k (2009) (3)
- Improved FPT Algorithms for Rectilinear k-Links Spanning Path (2012) (3)
- Vertex Cover Kernelization (2008) (3)
- Random Methods for Parameterized Problems (2013) (3)
- An Improved SAT Algorithm in Terms of Formula Length (2009) (3)
- Towards In-Network Generalized Trustworthy Data Collection for Trustworthy Cyber-Physical Systems (2019) (3)
- Approximation algorithm for multiprocessor parallel job scheduling (2002) (3)
- A New Paradigm for Changing Topology of 2-Manifold Polygonal Meshes (2000) (3)
- A User-Defined Location-Sharing Scheme with Efficiency and Privacy in Mobile Social Networks (2020) (3)
- A Lightweight Privacy Aware Friend Locator in Mobile Social Networks (2017) (3)
- QOS ROUTING ALGORITHMS FOR ANYCAST SERVICES (2000) (3)
- Improved parameterized algorithms for minimum link-length rectilinear spanning path problem (2014) (3)
- Trustworthy Data Collection for Cyber Systems: A Taxonomy and Future Directions (2019) (3)
- Some results on the simply separable function sets in partial k-valued logic (2004) (3)
- On the Parameterized Max-Leaf Problems : Digraphs and Undirected Graphs ∗ (2008) (3)
- Probability model for faults in large-scale multicomputer systems (2003) (3)
- On the Structure of Parameterized Problems in NP (Extended Abstract) (1994) (3)
- Scheduling on Multiple Two-Stage Flowshops with a Deadline (2021) (2)
- A meta-analysis of the therapeutic effect of intranasal salmon calcitonin on osteoporosis (2021) (2)
- The Difference Between one Tape and two Tapes: with Respect to Reversal Complexity (1990) (2)
- An effective randomized QoS routing algorithm on networks with inaccurate parameters (2008) (2)
- Preface: Discrete Mathematics and Theoretical Computer Science (DMTCS) (2004) (2)
- Manifold Trial Selection to Reduce Negative Transfer in Motor Imagery-based Brain–Computer Interface (2021) (2)
- Color-Coding and its Applications: A Survey (2011) (2)
- On Approximation Algorithms for Two-Stage Scheduling Problems (2017) (2)
- Theory and Applications of Models of Computation: 16th International Conference, TAMC 2020, Changsha, China, October 18–20, 2020, Proceedings (2020) (2)
- Weighted Cluster Editing: Kernelization based on Edge Cuts (2010) (2)
- A Refined Branching Algorithm for the Maximum Satisfiability Problem (2022) (2)
- An Agglomerate Algorithm for Mining Overlapping and Hierarchical Functional Modules in Protein Interaction Networks (2010) (2)
- A note on parameterized exponential time complexity (2003) (2)
- Efficacy of Intermittent Theta-Burst Stimulation and Transcranial Direct Current Stimulation in Treatment of Post-Stroke Cognitive Impairment. (2022) (2)
- Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters (2008) (2)
- Probabilistic Analysis on Mesh Network Fault Tolerance: Deterministic vs. Stochastic (2010) (2)
- Complexity Issues on PTAS (2013) (2)
- Further Kernelization of Proper Interval Vertex Deletion: New Observations and Refined Analysis (2016) (2)
- An Effective Coloring Algorithm for Close Relationship Between the Scales of Element Set and Color S (2009) (2)
- Preface to the special issue on computing and combinatorics (2019) (2)
- An Algorithm for Minimum Vertex Cover Based on Max-I Share Degree (2011) (2)
- A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem (2008) (2)
- Interactive and User-Friendly Construction of Multi-Segment Curved Handles (2002) (2)
- Fault Tolerant Routing Algorithm in Hypercube Networks with Load Balancing Support (2004) (2)
- Stereoscopic Image Saliency Detection Optimization: A Multi-Cue-Driven Approach (2019) (2)
- On the pseudo-achromatic number problem (2008) (2)
- ARROW-TCP: Accelerating Transmission toward Efficiency and Fairness for High-Speed Networks (2009) (2)
- C3P: A Cooperant Congestion Control Protocol in High Bandwidth-Delay Product Networks (2007) (2)
- On the Planarization of Wireless Sensor Networks (2011) (2)
- Frontiers in Algorithmics (2015) (1)
- A Lower Bound on Approximation Algorithms for the Closest Substring Problem (2007) (1)
- Maximum Partition Matching (2009) (1)
- A probabilistic approach to fault tolerant broadcast routing algorithms on mesh networks (2003) (1)
- Identification of Breast Cancer Gene Signature in Protein Interaction Network Using Graph Centrality (2011) (1)
- Minimum Genus and Maximum Genus (2013) (1)
- Kernelization Techniques and Its Applications to Parameterized Computation: Kernelization Techniques and Its Applications to Parameterized Computation (2009) (1)
- Algorithms, complexity and computational models (2011) (1)
- On fault tolerance of 3-dimensional mesh networks (2004) (1)
- Never-ending Storytelling with Discrete-Time Markov Processes (2012) (1)
- An Intuitive and Effective New Representation for Interconnection Network Structures (2000) (1)
- A Parameterized Perspective on P 2 -Packings (2008) (1)
- Linearly Synthesizing 2-Connected Simplicial Graphs (1995) (1)
- Fault tolerance of multicomputer networks: a probabilistic approach (2002) (1)
- On Parameterized and Kernelization Algorithms for the Hierarchical Clustering Problem (2013) (1)
- A new complete language for DSPACE(log n) (1989) (1)
- Near-Optimal Algorithms for Point-Line Covering Problems (2020) (1)
- STUDY ON TWO OPTIMIZATION PROBLEMS: LINE COVER AND MAXIMUM GENUS EMBEDDING A Thesis by CHENG CAO (2012) (1)
- Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation (2009) (1)
- A Parameterized Perspective on P2-Packings (2008) (1)
- An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs (2013) (1)
- On PTAS for Planar Graph Problems (2006) (1)
- Probabilistic analysis on fault tolerance of 3-Dimensional mesh networks (2004) (1)
- CSCE-658 Randomized Algorithms (2016) (1)
- A Note on Search Trees (2005) (1)
- Efficient memory management and interconnection schemes for cc-numa multiprocessors (2002) (1)
- Algebraic specification of interconnection network relationships by permutation voltage graph mappings (1996) (1)
- AAC: Adaptively Adjusting Concurrency by Exploiting Path Diversity in Datacenter Networks (2021) (1)
- Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time (2021) (1)
- Sorting Based Data Centric Storage (2008) (1)
- Cognitive population initialization for swarm intelligence and evolutionary computing (2021) (1)
- Improved Parameterized Algorithm for P 2 -Packing Problem: Improved Parameterized Algorithm for P 2 -Packing Problem (2009) (1)
- Coupled Modeling of Solid Textures and Implicit Shapes (1999) (1)
- Optimal Parallel Routing in Star Graphs (1996) (1)
- A blockchain‐based mobile crowdsensing scheme with enhanced privacy (2021) (1)
- Fixed Parameter Enumeration Algorithm for Feedback Vertex Set in Weighted Undirected Graphs: Fixed Parameter Enumeration Algorithm for Feedback Vertex Set in Weighted Undirected Graphs (2010) (1)
- Greedily Mining l-dense Subgraphs in Protein Interaction Networks (2008) (1)
- Graph Ear Decompositions and Graph Embeddings (Extended Abstract) (1993) (1)
- On log-Time Alternating Turing Machines of Alternation Depth k (Extended Abstract) (1995) (0)
- Cuts and partitions in graphs/trees with applications (2013) (0)
- A New Fault-Tolerant Multicast Communication in Multicomputers (2003) (0)
- A Topologically Complete Theory of Weaving (2020) (0)
- Preface (2015) (0)
- A Novel Anonymous Communication Strategy with Respect to Payment Mechanism (2008) (0)
- Link and Graph-Imbedding Models for Cyclic Weaving on Surfaces (2009) (0)
- Three-Dimensional Gait Analysis and sEMG Measures for Robotic-Assisted Gait Training in Subacute Stroke: A Randomized Controlled Trial (2023) (0)
- Scheduling multiple two-stage flowshops with a deadline (2022) (0)
- Kernelization and enumeration: new approaches to solving hard problems (2010) (0)
- A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees (2015) (0)
- Cross-subject Trials Reweighting for Enhancing Motor Imagery-based Brain-Computer Interface (2022) (0)
- Foreword from the Guest Editors (2008) (0)
- Progressive Refinement with Topological Simplification : A Theoretical Framework (2002) (0)
- A topological theory of weaving and its applications in computer graphics (2013) (0)
- A Prediction-Based AQM Algorithm for DiffServ Networks (2006) (0)
- Parameterized Algorithms for Total p-Dominating Set: Parameterized Algorithms for Total p-Dominating Set (2014) (0)
- Lower Limb Activity Recognition using sEMG Signals via Weighted Random Forest (2022) (0)
- Synchronous analyses between electroencephalogram and surface electromyogram based on motor imagery and motor execution. (2022) (0)
- Preface (1994) (0)
- Preface to the special issue on computing and combinatorics (2019) (0)
- An NL Hierarchy (1991) (0)
- Improved Algorithms for Weighted 3-Set Packing: Improved Algorithms for Weighted 3-Set Packing (2010) (0)
- A new control topology of information reliable spread (2003) (0)
- Multicut viewed through the eyes of vertex cover (2011) (0)
- Performance analysis of distributed adaptive routing algorithm (2004) (0)
- Trustworthy Data Acquisition and Faulty Sensor Detection using Gray Code in Cyber-Physical System (2020) (0)
- Interactive Deformation with Triangles (2006) (0)
- Measure-driven algorithm design and analysis: a new approach for solving np-hard problems (2009) (0)
- Location Based Communication Privacy in Internet of Vehicles Using Fog Computing (2020) (0)
- 10 Variance and Chebyshev ’ s Inequality (2016) (0)
- Space Limited Graph Algorithms on Big Data (2022) (0)
- Improved kernel size for Planar Dominating Set (2004) (0)
- On Unknown Small Subsets and Implicit Measures: New Techniques for Parameterized Algorithms (2014) (0)
- Design of a Passive Self-Energy-Storage Wearable Elbow-Assisted Exoskeleton (2022) (0)
- An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs (2007) (0)
- An Improved Color Coding Algorithm Based on Hybrid Architecture: An Improved Color Coding Algorithm Based on Hybrid Architecture (2010) (0)
- Vertex Cover Search Trees (2008) (0)
- Overview of my most important publications (2021) (0)
- A Practical Parameterized Algorithm for the Individual Haplotyping Problem MLF (2008) (0)
- Special Issue for FAW 2014 (2016) (0)
- Tape Reversal and Parallel Time (1987) (0)
- Meta-metric for saliency detection evaluation metrics based on application preference (2018) (0)
- Guest Editors' Introduction to the Special Section on Bioinformatics Research and Applications (2012) (0)
- ON DEPENDENT DATA FETCHING IN CLOUD ENVIRONMENT A Thesis by JIACHENG GU Submitted to the Office of Graduate and Professional Studies of Texas A&M University in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE (2015) (0)
- Cluster Editing: Kernelization Based on Edge Cuts (2011) (0)
- Improved MaxSAT Algorithms for Instances of Degree 3 (2015) (0)
- Graph Imbeddings and Overlap Matrices (Preliminary Report) (1989) (0)
- Efficient task offloading with swarm intelligence evolution for edge‐cloud collaboration in vehicular edge computing (2022) (0)
- Reliable Networks With Unreliable Sensors I,II (2012) (0)
- Theory and applications of models of computation : 6th International Conference, TAMC 2009, Changsa, China, May 18-22, 2009 : proceedings (2009) (0)
- Cyclic twill-woven objects (2010) (0)
- An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs (2014) (0)
- CS 70 Discrete Mathematics for CS Fall 2006 Papadimitriou & Vazirani Lecture 31 Two Killer Applications (2013) (0)
- A Topologically Complete Theory of Weaving Ergun Akleman (2012) (0)
- FCST 2011: Welcome message from the program chairs (2011) (0)
- Algorithmic Graph Embeddings (Extended Abstract) (1995) (0)
- A PREDICTION-BASEDAQM ALGORITHM (2006) (0)
- AI bot to detect fake COVID‐19 vaccine certificate (2022) (0)
- FAST: Kernelization based on Graph Modular Decomposition (2010) (0)
- A Survey of Modern Gene Expression Based Techniques for Cancer Detection and Diagnosis (2018) (0)
- On the parameterized vertex cover problem for graphs with perfect matching (2014) (0)
- Discrete And Computational Geometry (1999) (0)
- A Polynomial-Time Algorithm for Phylogeny-Based Haplotype Inference With Allowed and Forbidden Haplotypes (2009) (0)
- EATCS-IPEC Nerode Prize 2019 - Call for Nominations (2019) (0)
- Design of a Cascade Stacking Ensemble Algorithm Based on Multi-domain Feature Fusion of MI-EEG (2022) (0)
- Approximating Closest Vector Problem in ℓ∞ Norm Revisited (2019) (0)
- Preface to the Special Issue on Computing and Combinatorics (2019) (0)
- Near-optimal algorithms for point-line fitting problems (2022) (0)
- Approximating Maximum Agreement Forest on Multiple Binary Trees (2015) (0)
- Response : ” On Interactive Modeling of Smooth Manifold Meshes with Arbitrary Topology : G 1 Stitched Bi-Cubic Bézier Patches ” (2017) (0)
- A Particle Swarm Optimization Algorithm Based on Optimal Result Set for Haplotyping a Single Individual (2008) (0)
- Analysis of algorithm expected complexity (2016) (0)
- Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs (2008) (0)
- In-network generalized trustworthy data collection for event detection in cyber-physical systems (2021) (0)
- A better kernel for treewidth-t modulator (2013) (0)
- Algorithms for Maximum Agreement Forest of Multiple General Trees (2014) (0)
- Response to "On G1 stitched bi-cubic Bézier patches with arbitrary topology" (2017) (0)
- TEXTURE MAPPING USING TILED TEXTURES (2003) (0)
This paper list is powered by the following services:
What Schools Are Affiliated With Jian-er Chen?
Jian-er Chen is affiliated with the following schools: