Jianer Chen

Somyung Oh

Youyou Wang

Bekir Tevfik Akgün

CoRR, 2024

A Modified de Casteljau Subdivision that Supports Smooth Stitching with Hierarchically Organized Bicubic Bezier Patches.

[BibT_eX]

[DOI]

Saied Zarrinmehr

CoRR, 2024

Attention-based convolutional neural network with multi-modal temporal information fusion for motor imagery EEG decoding.

[BibT_eX]

[DOI]

Comput. Biol. Medicine, 2024

A novel deep transfer learning framework integrating general and domain-specific features for EEG-based brain-computer interface.

[BibT_eX]

[DOI]

Biomed. Signal Process. Control., 2024

2023

STMI: Stiffness Estimation Method Based on sEMG-Driven Model for Elbow Joint.

[BibT_eX]

[DOI]

IEEE Trans. Instrum. Meas., 2023

Novel neuromuscular controller application method to improve the balance recovery ability of lower limb exoskeletons.

[BibT_eX]

[DOI]

J. Frankl. Inst., 2023

A blockchain-based mobile crowdsensing scheme with enhanced privacy.

[BibT_eX]

[DOI]

Concurr. Comput. Pract. Exp., 2023

Simultaneous Gait Event Intention Detection Using Single sEMG Sensor for Lower Limb Exoskeleton.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Conference of the IEEE Industrial Electronics Society, 2023

2022

Scheduling multiple two-stage flowshops with a deadline.

[BibT_eX]

[DOI]

Minjie Huang

Yin Guo

Theor. Comput. Sci., 2022

Preface.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2022

Near-optimal algorithms for point-line fitting problems.

[BibT_eX]

[DOI]

J. Comput. Geom., 2022

Cognitive population initialization for swarm intelligence and evolutionary computing.

[BibT_eX]

[DOI]

J. Ambient Intell. Humaniz. Comput., 2022

AI bot to detect fake COVID-19 vaccine certificate.

[BibT_eX]

[DOI]

IET Inf. Secur., 2022

Linear-time parameterized algorithms with limited local resources.

[BibT_eX]

[DOI]

Ying Guo

Qin Huang

Inf. Comput., 2022

Approximating Closest Vector Problem in ℓ∞-Norm Revisited.

[BibT_eX]

[DOI]

Wenbin Chen

Comput. J., 2022

A Refined Branching Algorithm for the Maximum Satisfiability Problem.

[BibT_eX]

[DOI]

Algorithmica, 2022

Near-Optimal Algorithms for Point-Line Covering Problems.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Space Limited Graph Algorithms on Big Data.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021

In-network generalized trustworthy data collection for event detection in cyber-physical systems.

[BibT_eX]

[DOI]

PeerJ Comput. Sci., 2021

AAC: Adaptively Adjusting Concurrency by Exploiting Path Diversity in Datacenter Networks.

[BibT_eX]

[DOI]

J. Netw. Syst. Manag., 2021

Optimal Streaming Algorithms for Graph Matching.

[BibT_eX]

[DOI]

CoRR, 2021

Boosting-LDA algriothm with multi-domain feature fusion for motor imagery EEG decoding.

[BibT_eX]

[DOI]

Biomed. Signal Process. Control., 2021

Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Manifold Trial Selection to Reduce Negative Transfer in Motor Imagery-based Brain-Computer Interface.

[BibT_eX]

[DOI]

Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2021

2020

SDN based communications privacy-preserving architecture for VANETs using fog computing.

[BibT_eX]

[DOI]

Muhammad Arif

Valentina Emilia Balas

Oana Geman

Aniello Castiglione

Veh. Commun., 2020

Rethinking Fast and Friendly Transport in Data Center Networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2020

On scheduling multiple two-stage flowshops.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Improved approximation algorithms for two-stage flowshops scheduling problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

A User-Defined Location-Sharing Scheme with Efficiency and Privacy in Mobile Social Networks.

[BibT_eX]

[DOI]

Sci. Program., 2020

A Topologically Complete Theory of Weaving.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Pleasure or pain? An evaluation of the costs and utilities of bloatware applications in android smartphones.

[BibT_eX]

[DOI]

Haroon Elahi

J. Netw. Comput. Appl., 2020

Optimization of communication in VANETs using fuzzy logic and artificial Bee colony.

[BibT_eX]

[DOI]

Muhammad Arif

Tao Peng

Valentina Emilia Balas

Oana Geman

J. Intell. Fuzzy Syst., 2020

A Privacy-Preserving Crowdsensing System with Muti-Blockchain.

[BibT_eX]

[DOI]

Proceedings of the 19th IEEE International Conference on Trust, 2020

Location Based Communication Privacy in Internet of Vehicles Using Fog Computing.

[BibT_eX]

[DOI]

Proceedings of the Security, Privacy, and Anonymity in Computation, Communication, and Storage, 2020

Trustworthy Data Acquisition and Faulty Sensor Detection using Gray Code in Cyber-Physical System.

[BibT_eX]

[DOI]

Guihua Duan

Proceedings of the 23rd IEEE International Conference on Computational Science and Engineering, 2020

2019

A survey on security attacks in VANETs: Communication, applications and challenges.

[BibT_eX]

[DOI]

Muhammad Arif

Tian Wang

Veh. Commun., 2019

Resolution and linear CNF formulas: Improved (n, 3)-MaxSAT algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

On scheduling inclined jobs on multiple two-stage flowshops.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Scheduling two-stage jobs on multiple flowshops.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Kernels for packing and covering problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

EATCS-IPEC Nerode Prize 2019 - Call for Nominations.

[BibT_eX]

[DOI]

Virginia Vassilevska Williams

Hans L. Bodlaender

Bull. EATCS, 2019

Preface to the Special Issue on Computing and Combinatorics.

[BibT_eX]

[DOI]

Algorithmica, 2019

Stereoscopic Image Saliency Detection Optimization: A Multi-Cue-Driven Approach.

[BibT_eX]

[DOI]

IEEE Access, 2019

Trustworthy Data Collection for Cyber Systems: A Taxonomy and Future Directions.

[BibT_eX]

[DOI]

Proceedings of the Smart City and Informatization - 7th International Conference, 2019

Resolution and Domination: An Improved Exact MaxSAT Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Towards In-Network Generalized Trustworthy Data Collection for Trustworthy Cyber-Physical Systems.

[BibT_eX]

[DOI]

Proceedings of the Dependability in Sensor, Cloud, and Big Data Systems and Applications, 2019

AI and Its Risks in Android Smartphones: A Case of Google Smart Assistant.

[BibT_eX]

[DOI]

Proceedings of the Dependability in Sensor, Cloud, and Big Data Systems and Applications, 2019

Medical Image Segmentation by Combining Adaptive Artificial Bee Colony and Wavelet Packet Decomposition.

[BibT_eX]

[DOI]

Proceedings of the Dependability in Sensor, Cloud, and Big Data Systems and Applications, 2019

Approximating Closest Vector Problem in ℓ∞ Norm Revisited.

[BibT_eX]

[DOI]

Wenbin Chen

Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018

Meta-metric for saliency detection evaluation metrics based on application preference.

[BibT_eX]

[DOI]

Yuzhen Niu

Wenzhong Guo

Multim. Tools Appl., 2018

A parameterized algorithm for the Maximum Agreement Forest problem on multiple rooted multifurcating trees.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

An improved FPT algorithm for Almost Forest Deletion problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

On Scheduling Two-Stage Jobs on Multiple Two-Stage Flowshops.

[BibT_eX]

[DOI]

CoRR, 2018

Detection of hierarchical intrinsic symmetry structure in 3D models.

[BibT_eX]

[DOI]

Comput. Graph., 2018

Response to "On G1 stitched bi-cubic Bézier patches with arbitrary topology".

[BibT_eX]

[DOI]

Comput. Graph., 2018

Performance Evaluation of Hypervisors and the Effect of Virtual CPU on Performance.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE SmartWorld, 2018

A Service Oriented Healthcare Architecture (SOHA-CC) Based on Cloud Computing.

[BibT_eX]

[DOI]

Syed Qasim Afser Rizvi

Proceedings of the Security, Privacy, and Anonymity in Computation, Communication, and Storage, 2018

A Survey of Modern Gene Expression Based Techniques for Cancer Detection and Diagnosis.

[BibT_eX]

[DOI]

Proceedings of the Soft Computing Applications, 2018

Designing Fast and Friendly TCP to Fit High Speed Data Center Networks.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Distributed Computing Systems, 2018

Approximation Algorithms on Multiple Two-Stage Flowshops.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

Tuning the Aggressive TCP Behavior for Highly Concurrent HTTP Connections in Intra-Datacenter.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2017

Quality-Guaranteed Event-Sensitive Data Collection and Monitoring in Vibration Sensor Networks.

[BibT_eX]

[DOI]

IEEE Trans. Ind. Informatics, 2017

Partition on trees with supply and demand: Kernelization and algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Improved kernel results for some FPT problems based on simple observations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Dealing with 4-variables by resolution: An improved MaxSAT algorithm.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Transparent Computing: A Promising Network Computing Paradigm.

[BibT_eX]

[DOI]

Comput. Sci. Eng., 2017

An O*(1.84sk) Parameterized Algorithm for the Multiterminal Cut Problem.

[BibT_eX]

[DOI]

CoRR, 2017

Interactive modeling of smooth manifold meshes with arbitrary topology: G1 stitched bi-cubic Bézier patches.

[BibT_eX]

[DOI]

Comput. Graph., 2017

A Lightweight Privacy Aware Friend Locator in Mobile Social Networks.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Parallel and Distributed Processing with Applications and 2017 IEEE International Conference on Ubiquitous Computing and Communications (ISPA/IUCC), 2017

On Approximation Algorithms for Two-Stage Scheduling Problems.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

2016

Vertex Cover Search Trees.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Vertex Cover Kernelization.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Lifetime and Energy Hole Evolution Analysis in Data-Gathering Wireless Sensor Networks.

[BibT_eX]

[DOI]

IEEE Trans. Ind. Informatics, 2016

Adaptive marking threshold method for delay-sensitive TCP in data center network.

[BibT_eX]

[DOI]

J. Netw. Comput. Appl., 2016

Special Issue for FAW 2014.

[BibT_eX]

[DOI]

John E. Hopcroft

J. Comb. Optim., 2016

Parameterized Algorithms for the Maximum Agreement Forest Problem on Multiple Rooted Multifurcating Trees.

[BibT_eX]

[DOI]

CoRR, 2016

A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2016

Construction with physical version of quad-edge data structures.

[BibT_eX]

[DOI]

Comput. Graph., 2016

Approximating Maximum Agreement Forest on Multiple Binary Trees.

[BibT_eX]

[DOI]

Feng Shi

Algorithmica, 2016

Tuning the Aggressive TCP Behavior for Highly Concurrent HTTP Connections in Data Center.

[BibT_eX]

[DOI]

Proceedings of the 36th IEEE International Conference on Distributed Computing Systems, 2016

2015

Parameterized complexity of control and bribery for d-approval elections.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Edge deletion problems: Branching facilitated by modular decomposition.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Frontiers of Algorithmics.

[BibT_eX]

[DOI]

John E. Hopcroft

Theor. Comput. Sci., 2015

Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Adaptive-Acceleration Data Center TCP.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2015

An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

Randomized parameterized algorithms for P2-Packing and Co-Path Packing problems.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

Extended graph rotation systems as a model for cyclic weaving on orientable surfaces.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Dealing With 4-Variables by Resolution: An Improved MaxSAT Algorithm.

[BibT_eX]

[DOI]

CoRR, 2015

Block meshes: Topologically robust shape modeling with graphs embedded on 3-manifolds.

[BibT_eX]

[DOI]

Comput. Graph., 2015

On Feedback Vertex Set: New Measure and New Structures.

[BibT_eX]

[DOI]

Algorithmica, 2015

A 2k-vertex Kernel for Maximum Internal Spanning Tree.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Improved MaxSAT Algorithms for Instances of Degree 3.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Algorithms for parameterized maximum agreement forest problem on multiple trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Improved parameterized algorithms for minimum link-length rectilinear spanning path problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Matching and Weighted P2-Packing: Algorithms and Kernels.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

On the Minimum Link-Length Rectilinear Spanning Path Problem: Complexity and Algorithms.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2014

On Unknown Small Subsets and Implicit Measures: New Techniques for Parameterized Algorithms.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2014

An O(1.84k) parameterized algorithm for the multiterminal cut problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

Algorithms for Maximum Agreement Forest of Multiple General Trees.

[BibT_eX]

[DOI]

CoRR, 2014

On the parameterized vertex cover problem for graphs with perfect matching.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2014

Security from the transparent computing aspect.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computing, Networking and Communications, 2014

Deeper Local Search for Better Approximation on Maximum Internal Spanning Trees.

[BibT_eX]

[DOI]

Wenjun Li

Proceedings of the Algorithms - ESA 2014, 2014

Approximation Algorithms for Maximum Agreement Forest on Multiple Trees.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013

Improved linear problem kernel for planar connected dominating set.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Parameterized top-K algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Reliable networks with unreliable sensors.

[BibT_eX]

[DOI]

Pervasive Mob. Comput., 2013

Planar graph vertex partition for linear problem kernels.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2013

A heuristic algorithm for haplotype reconstruction from aligned weighted SNP fragments.

[BibT_eX]

[DOI]

Int. J. Bioinform. Res. Appl., 2013

Hamiltonian cycle art: Surface covering wire sculptures and duotone surfaces.

[BibT_eX]

[DOI]

Comput. Graph., 2013

Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

On Parameterized and Kernelization Algorithms for the Hierarchical Clustering Problem.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2013

Analysis on the Scheduling Problem in Transparent Computing.

[BibT_eX]

[DOI]

Ju Ren

Yaoxue Zhang

Proceedings of the 10th IEEE International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing, 2013

An O *(1.84 k ) Parameterized Algorithm for the Multiterminal Cut Problem.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

Random Methods for Parameterized Problems.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

Parameterized Complexity of Control and Bribery for d-Approval Elections.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2013

2012

Complexity and parameterized algorithms for Cograph Editing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Guest Editors' Introduction to the Special Section on Bioinformatics Research and Applications.

[BibT_eX]

[DOI]

Alexander Zelikovsky

IEEE ACM Trans. Comput. Biol. Bioinform., 2012

Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

A 2k kernel for the cluster editing problem.

[BibT_eX]

[DOI]

Jie Meng

J. Comput. Syst. Sci., 2012

Multicut in trees viewed through the eyes of vertex cover.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

Identifying Complexes from Protein Interaction Networks According to Different Types of Neighborhood Density.

[BibT_eX]

[DOI]

J. Comput. Biol., 2012

Pattern mapping with quad-pattern-coverable quad-meshes.

[BibT_eX]

[DOI]

Comput. Graph., 2012

Guest Editors' Introduction.

[BibT_eX]

[DOI]

BMC Bioinform., 2012

Cluster Editing: Kernelization Based on Edge Cuts.

[BibT_eX]

[DOI]

Algorithmica, 2012

FPT Results for Signed Domination.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2012

Improved FPT Algorithms for Rectilinear k-Links Spanning Path.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2012

Surface Covering Curves.

[BibT_eX]

[DOI]

Proceedings of the 8th International Symposium on Computational Aesthetics in Graphics, 2012

Parameterized Complexity and Subexponential-Time Computability.

[BibT_eX]

[DOI]

Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

Kernels for Packing and Covering Problems - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011

Separability and topology control of quasi unit disk graphs.

[BibT_eX]

[DOI]

Wirel. Networks, 2011

An O*(3.533k)-time parameterized algorithm for the 3-set packing problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Improved deterministic algorithms for weighted matching and packing problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Algorithms, complexity and computational models.

[BibT_eX]

[DOI]

S. Barry Cooper

Theor. Comput. Sci., 2011

A Fast Hierarchical Clustering Algorithm for Functional Modules Discovery in Protein Interaction Networks.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2011

An Algorithm for Minimum Vertex Cover Based on Max-I Share Degree.

[BibT_eX]

[DOI]

J. Comput., 2011

Color-Coding and its Applications: A Survey.

[BibT_eX]

[DOI]

Int. J. Softw. Informatics, 2011

Cyclic twill-woven objects.

[BibT_eX]

[DOI]

Comput. Graph., 2011

On the Planarization of Wireless Sensor Networks.

[BibT_eX]

[DOI]

Anxiao Jiang

Algorithmica, 2011

Efficient flooding in Wireless Sensor Networks secured with neighborhood keys.

[BibT_eX]

[DOI]

Amin Hassanzadeh

Radu Stoleru

Proceedings of the IEEE 7th International Conference on Wireless and Mobile Computing, 2011

An Improved Kernel for Planar Connected Dominating Set.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2011

Band decomposition of 2-manifold meshes for physical construction of large structures.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computer Graphics and Interactive Techniques, 2011

Pattern mapping with quad-pattern-coverable quad-meshes.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computer Graphics and Interactive Techniques, 2011

Linear Problem Kernels for Planar Graph Problems with Small Distance Property.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

An Adaptive Probability Broadcast-Based Data Preservation Protocol in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2011

Cograph Editing: Complexity and Parameterized Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

Matching and P 2-Packing: Weighted Versions.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

Identification of Breast Cancer Gene Signature in Protein Interaction Network Using Graph Centrality.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2011

2010

A parameterized algorithm for the hyperplane-cover problem.

[BibT_eX]

[DOI]

Wenjun Li

Theor. Comput. Sci., 2010

Improved upper bounds for vertex cover.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

A practical parameterised algorithm for the individual haplotyping problem MLF.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2010

A New Fault-Tolerant Broadcast Routing Algorithm on Mesh Networks.

[BibT_eX]

[DOI]

Chuang Lin

J. Interconnect. Networks, 2010

An improved kernelization for P2-packing.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Identifying the overlapping complexes in protein interaction networks.

[BibT_eX]

[DOI]

Int. J. Data Min. Bioinform., 2010

Weighted Cluster Editing: Kernelization based on Edge Cuts

[BibT_eX]

[DOI]

CoRR, 2010

A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI.

[BibT_eX]

[DOI]

Algorithmica, 2010

Single-Cycle Plain-Woven Objects.

[BibT_eX]

[DOI]

Proceedings of the SMI 2010, 2010

Paper-Strip Sculptures.

[BibT_eX]

[DOI]

Proceedings of the SMI 2010, 2010

Cyclic twill-woven objects.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computer Graphics and Interactive Techniques, 2010

An Agglomerate Algorithm for Mining Overlapping and Hierarchical Functional Modules in Protein Interaction Networks.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics Research and Applications, 6th International Symposium, 2010

An Efficient Algorithm for Constructing Maximum lifetime Tree for Data Gathering Without Aggregation in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

An Overhearing-Based Scheme for Improving Data Persistence in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Junbin Liang

Proceedings of IEEE International Conference on Communications, 2010

Probabilistic Analysis on Mesh Network Fault Tolerance: Deterministic vs. Stochastic.

[BibT_eX]

[DOI]

Taoshen Li

Proceedings of the IEEE/IFIP 8th International Conference on Embedded and Ubiquitous Computing, 2010

A 2k Kernel for the Cluster Editing Problem.

[BibT_eX]

[DOI]

Jie Meng

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009

Maximum Partition Matching.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Cyclic plain-weaving on polygonal mesh surfaces with graph rotation systems.

[BibT_eX]

[DOI]

ACM Trans. Graph., 2009

On parameterized exponential time complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

On the pseudo-achromatic number problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

A practical algorithm for multiplex PCR primer set selection.

[BibT_eX]

[DOI]

Int. J. Bioinform. Res. Appl., 2009

A parthenogenetic algorithm for single individual SNP haplotyping.

[BibT_eX]

[DOI]

Eng. Appl. Artif. Intell., 2009

A practical algorithm based on particle swarm optimization for haplotype reconstruction.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2009

On Counting 3-D Matchings of Size k.

[BibT_eX]

[DOI]

Yunlong Liu

Algorithmica, 2009

An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem.

[BibT_eX]

[DOI]

Algorithmica, 2009

Improved Parameterized Set Splitting Algorithms: A Probabilistic Approach.

[BibT_eX]

[DOI]

Algorithmica, 2009

An Improved SAT Algorithm in Terms of Formula Length.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

A Delay-Constrained and Maximum Lifetime Data Gathering Algorithm for Wireless Sensor Networks.

[BibT_eX]

[DOI]

Junbin Liang

Proceedings of the MSN 2009, 2009

Hierarchical Organization of Functional Modules in Weighted Protein Interaction Networks Using Clustering Coefficient.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics Research and Applications, 5th International Symposium, 2009

An Automated Signature Generation Approach for Polymorphic Worm Based on Color Coding.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2009

Polymorphic Worm Detection Using Signatures Based on Neighborhood Relation.

[BibT_eX]

[DOI]

Proceedings of the 11th IEEE International Conference on High Performance Computing and Communications, 2009

ARROW-TCP: Accelerating Transmission toward Efficiency and Fairness for High-Speed Networks.

[BibT_eX]

[DOI]

Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009

An Anonymous Communication Mechanism without Key Infrastructure Based on Multi-Paths Network Coding.

[BibT_eX]

[DOI]

Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009

An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

2008

Vertex Cover Search Trees.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Vertex Cover Kernelization.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Application-oriented purely semantic precision and recall for ontology mapping evaluation.

[BibT_eX]

[DOI]

Tian Zhang

Dezhi Xu

Knowl. Based Syst., 2008

Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs.

[BibT_eX]

[DOI]

Xiaoshuang Xu

J. Comput. Sci. Technol., 2008

Improved algorithms for feedback vertex set problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2008

A fixed-parameter algorithm for the directed feedback vertex set problem.

[BibT_eX]

[DOI]

J. ACM, 2008

An improved lower bound on approximation algorithms for the Closest Substring problem.

[BibT_eX]

[DOI]

Min Huang

Inf. Process. Lett., 2008

A Parameterized Perspective on P2-Packings

[BibT_eX]

[DOI]

CoRR, 2008

On Parameterized Intractability: Hardness and Completeness.

[BibT_eX]

[DOI]

Jie Meng

Comput. J., 2008

Modifying the DPClus algorithm for identifying protein complexes based on new topological structures.

[BibT_eX]

[DOI]

BMC Bioinform., 2008

Foreword from the Guest Editors.

[BibT_eX]

[DOI]

Algorithmica, 2008

A Practical Parameterized Algorithm for the Individual Haplotyping Problem MLF.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2008

An Improved Parameterized Algorithm for a Generalized Matching Problem.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2008

Sorting Based Data Centric Storage.

[BibT_eX]

[DOI]

Anxiao Jiang

Proceedings of The Seventh IEEE International Symposium on Networking Computing and Applications, 2008

Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008

A model of higher accuracy for the individual haplotyping problem based on weighted SNP fragments and genotype with errors.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 16th International Conference on Intelligent Systems for Molecular Biology (ISMB), 2008

A Graph-Theoretic Method for Mining Overlapping Functional Modules in Protein Interaction Networks.

[BibT_eX]

[DOI]

Min Li

Proceedings of the Bioinformatics Research and Applications, 2008

Robust Planarization of Unlocalized Wireless Sensor Networks.

[BibT_eX]

[DOI]

Anxiao Jiang

Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

A Novel Anonymous Communication Strategy with Respect to Payment Mechanism.

[BibT_eX]

[DOI]

Yanhui Wu

Weiping Wang

Proceedings of the 9th International Conference for Young Computer Scientists, 2008

A Genetic Algorithm for Single Individual SNP Haplotype Assembly.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference for Young Computer Scientists, 2008

Greedily Mining l-dense Subgraphs in Protein Interaction Networks.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference for Young Computer Scientists, 2008

A Virtual Laboratory Platform Based on Integration of Java and Matlab.

[BibT_eX]

[DOI]

Proceedings of the Advances in Web Based Learning, 2008

A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

A Practical Exact Algorithm for the Individual Haplotyping Problem MEC.

[BibT_eX]

[DOI]

Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics, 2008

A Particle Swarm Optimization Algorithm Based on Optimal Result Set for Haplotyping a Single Individual.

[BibT_eX]

[DOI]

Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics, 2008

A Fast Agglomerate Algorithm for Mining Functional Modules in Protein Interaction Networks.

[BibT_eX]

[DOI]

Min Li

Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics, 2008

2007

Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

Probabilistic analysis on mesh network fault tolerance.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2007

Genus characterizes the complexity of certain graph problems: Some tight results.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2007

A simple linear time approximation algorithm for multi-processor job scheduling on four processors.

[BibT_eX]

[DOI]

J. Comb. Optim., 2007

Research on Parameterized Algorithms of the Individual Haplotyping Problem.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2007

Polynomial time approximation schemes and parameterized complexity.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Finding Pathway Structures in Protein Interaction Networks.

[BibT_eX]

[DOI]

Algorithmica, 2007

An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs.

[BibT_eX]

[DOI]

Xiaoshuang Xu

Proceedings of the Theory and Applications of Models of Computation, 2007

Parameterized Algorithms for Weighted Matching and Packing Problems.

[BibT_eX]

[DOI]

Yunlong Liu

Proceedings of the Theory and Applications of Models of Computation, 2007

Improved algorithms for path, matching, and packing problems.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Face Tracing Based Geographic Routing in Nonplanar Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

C3P: A Cooperant Congestion Control Protocol in High Bandwidth-Delay Product Networks.

[BibT_eX]

[DOI]

Hao Gong

Proceedings of the 16th International Conference on Computer Communications and Networks, 2007

Directed Feedback Vertex Set Problem is FPT.

[BibT_eX]

[DOI]

Proceedings of the Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07., 2007

A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem.

[BibT_eX]

[DOI]

Yunlong Liu

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Improved Algorithms for Weighted and Unweighted Set Splitting Problems.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

A Lower Bound on Approximation Algorithms for the Closest Substring Problem.

[BibT_eX]

[DOI]

Min Huang

Proceedings of the Combinatorial Optimization and Applications, 2007

2006

On product covering in 3-tier supply chain models: Natural complete problems for W[3] and W[4].

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Strong computational lower bounds via parameterized complexity.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2006

On the computational hardness based on linear FPT-reductions.

[BibT_eX]

[DOI]

J. Comb. Optim., 2006

Regular Mesh Construction Algorithms using Regular Handles.

[BibT_eX]

[DOI]

Proceedings of the 2006 International Conference on Shape Modeling and Applications (SMI 2006), 2006

Improved Parameterized Upper Bounds for Vertex Cover.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

On the Effective Enumerability of NP Problems.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

On PTAS for Planar Graph Problems.

[BibT_eX]

[DOI]

Xiuzhen Huang

Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

A Prediction-Based AQM Algorithm for DiffServ Networks.

[BibT_eX]

[DOI]

Donglei Chen

Proceedings of the 14th IEEE International Conference on Networks, 2006

Insight for Practical Subdivision Modeling with Discrete Gauss-Bonnet Theorem.

[BibT_eX]

[DOI]

Proceedings of the Geometric Modeling and Processing, 2006

Research on Multi-valued and Multi-labeled Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the Advanced Data Mining and Applications, Second International Conference, 2006

Link Availability at Any Time in MANET.

[BibT_eX]

[DOI]

Xianman Zhu

Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 5th International Conference, 2006

2005

On approximating minimum vertex cover for graphs with perfect matching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Hypercube Network Fault Tolerance: A Probabilistic Approach.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2005

Tight lower bounds for certain parameterized NP-hard problems.

[BibT_eX]

[DOI]

Inf. Comput., 2005

Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems.

[BibT_eX]

[DOI]

Algorithmica, 2005

Regular meshes.

[BibT_eX]

[DOI]

Proceedings of the Tenth ACM Symposium on Solid and Physical Modeling 2005, 2005

Performance Measurements for Privacy Preserving Data Mining.

[BibT_eX]

[DOI]

Nan Zhang

Wei Zhao

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2005

A Distributed Algorithm based on Probability for Refining Energy-Efficiency of Multicast Trees in Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual IEEE Conference on Local Computer Networks (LCN 2005), 2005

PFED: A Prediction-Based Fair Active Queue Management Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 34th International Conference on Parallel Processing (ICPP 2005), 2005

SAS: A Scalar Anonymous Communication System.

[BibT_eX]

[DOI]

Proceedings of the Networking and Mobile Computing, Third International Conference, 2005

W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

On Product Covering in Supply Chain Models: Natural Complete Problems for W[3] and W[4].

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

2004

On Fault Tolerance of 3-Dimensional Mesh Networks.

[BibT_eX]

[DOI]

Gao-Cai Wang

Guo-Jun Wang

J. Comput. Sci. Technol., 2004

An efficient parameterized algorithm for m-set packing.

[BibT_eX]

[DOI]

Weijia Jia

Chuanlin Zhang

J. Algorithms, 2004

The cost of becoming anonymous: on the participant payload in Crowds.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

On the construction of most reliable networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Preface: Discrete Mathematics and Theoretical Computer Science (DMTCS).

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Improved exact algorithms for MAX-SAT.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Using Nondeterminism to Design Efficient Deterministic Algorithms.

[BibT_eX]

[DOI]

Algorithmica, 2004

Integrating Sample-Driven and Pattern-Driven Approaches in Motif Finding.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

Linear FPT reductions and computational lower bounds.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Some results on the simply separable function sets in partial k-valued logic.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Systems, 2004

Fault Tolerant Routing Algorithm in Hypercube Networks with Load Balancing Support.

[BibT_eX]

[DOI]

Xiaolin Xiao

Proceedings of the Parallel and Distributed Processing and Applications, 2004

A Probabilistic Approach to Fault-Tolerant Routing Algorithm on Mesh Networks.

[BibT_eX]

[DOI]

Taoshen Li

Proceedings of the 10th International Conference on Parallel and Distributed Systems, 2004

Performance analysis of distributed adaptive routing algorithm.

[BibT_eX]

[DOI]

Taoshen Li

Proceedings of the 8th International Conference on Control, 2004

Cardinality-based inference control in OLAP systems: an information theoretic approach.

[BibT_eX]

[DOI]

Nan Zhang

Wei Zhao

Proceedings of the DOLAP 2004, 2004

2003

Strong Fault-Tolerance: Parallel Routing in Star Networks with Faults.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2003

Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2003

Foreword from the guest editors.

[BibT_eX]

[DOI]

Michael R. Fellows

J. Comput. Syst. Sci., 2003

On strong Menger-connectivity of star graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

A minimal and complete set of operators for the development of robust manifold mesh modelers.

[BibT_eX]

[DOI]

Graph. Model., 2003

Interactive Rind Modeling.

[BibT_eX]

[DOI]

Proceedings of the 2003 International Conference on Shape Modeling and Applications (SMI 2003), 2003

Some results on the minimal coverings of precomplete classes in partial K-valued logic functions.

[BibT_eX]

[DOI]

Robin Liu

Proceedings of the IEEE International Conference on Systems, 2003

A New Fault-Tolerant Multicast Communication in Multicomputers.

[BibT_eX]

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2003

Probabilistic Analysis of Connectivity on Mesh Networks.

[BibT_eX]

[DOI]

GaoCai Wang

Proceedings of the 2003 International Symposium on Information Technology (ITCC 2003), 2003

Payload analysis of anonymous communication system with host-based rerouting mechanism.

[BibT_eX]

[DOI]

Proceedings of the Eighth IEEE Symposium on Computers and Communications (ISCC 2003), 30 June, 2003

A Probabilistic Approach to Fault Tolerant Broadcast Routing Algorithms on Mesh Networks.

[BibT_eX]

[DOI]

GaoCai Wang

Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

An analysis of forwarding mechanism in crowds.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2003

Genus Characterizes the Complexity of Graph Problems: Some Tight Results.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Probability Model for Faults in Large-Scale Multicomputer Systems.

[BibT_eX]

[DOI]

Proceedings of the 12th Asian Test Symposium (ATS 2003), 17-19 November 2003, Xian, China, 2003

Topological Graph Theory.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Graph Theory., 2003

2002

Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2002

An Effective Randomized QoS Routing Algorithm on Networks with Inaccurate Parameters.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2002

A note on practical construction of maximum bandwidth paths.

[BibT_eX]

[DOI]

Navneet Malpani

Inf. Process. Lett., 2002

A Prototype System for Robust, Interactive and User-Friendly Modeling of Orientable 2-Manifold Meshes.

[BibT_eX]

[DOI]

Proceedings of the 2002 International Conference on Shape Modeling and Applications (SMI 2002), 2002

Interactive Construction of Multi-Segment Curved Handles .

[BibT_eX]

[DOI]

Proceedings of the 10th Pacific Conference on Computer Graphics and Applications, 2002

Two Methods for Creating Chinese Painting.

[BibT_eX]

[DOI]

Ching (Clara) Chan

Proceedings of the 10th Pacific Conference on Computer Graphics and Applications, 2002

Probabilistic Analysis on Mesh Network Fault Tolerance.

[BibT_eX]

Tao Wang

Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002

Improved Exact Algorithms for MAX-SAT.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

On the Approximability of Multiprocessor Task Scheduling Problems.

[BibT_eX]

[DOI]

Antonio Miranda

Luz Torres

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001

A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling.

[BibT_eX]

[DOI]

Antonio Miranda

SIAM J. Comput., 2001

Routing in Hypercube Networks with a Constant Fraction of Faulty Nodes.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2001

Vertex Cover: Further Observations and Further Improvements.

[BibT_eX]

[DOI]

Weijia Jia

J. Algorithms, 2001

A New Corner cutting Scheme with tension and Handle-Face Reconstruction.

[BibT_eX]

[DOI]

Int. J. Shape Model., 2001

On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

Handle and Hole Improvement by Using New Corner Cutting Subdivision Scheme with Tension.

[BibT_eX]

[DOI]

Proceedings of the 2001 International Conference on Shape Modeling and Applications (SMI 2001), 2001

Semi-normal Schedulings: Improvement on Goemans' Algorithm.

[BibT_eX]

[DOI]

Jingui Huang

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Parallel Routing in Hypercube Networks with Faulty Nodes.

[BibT_eX]

[DOI]

Proceedings of the Eigth International Conference on Parallel and Distributed Systems, 2001

Strong Fault-Tolerance: Parallel Routing in Networks with Faults.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2001, 2001

Using Nondeterminism to Design Deterministic Algorithms.

[BibT_eX]

[DOI]

Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

2000

Improvement on vertex cover for low-degree graphs.

[BibT_eX]

[DOI]

Lihua Liu

Weijia Jia

Networks, 2000

A New Paradigm for Changing Topology during Subdivision Modeling.

[BibT_eX]

[DOI]

Proceedings of the 8th Pacific Conference on Computer Graphics and Applications, 2000

Web-based intuitive and effective design of symmetric tiles.

[BibT_eX]

[DOI]

Burak Meric

Proceedings of the ACM Multimedia 2000 Workshops, Los Angeles, CA, USA, October 30, 2000

A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors.

[BibT_eX]

[DOI]

Jingui Huang

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

An Intuitive and Effective New Representation for Interconnection Network Structures.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Utilization-Based Admission Control for Real-Time Applications.

[BibT_eX]

[DOI]

Proceedings of the 2000 International Conference on Parallel Processing, 2000

1999

Discrete And Computational Geometry.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Information Structures.

[BibT_eX]

[DOI]

Charles H. Goldberg

Viera Krnanová Proulx

Joan Feigenbaum

Sampath Kannan

Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Graph Ear Decompositions and Graph Embeddings.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1999

The Maximum Partition Matching Problem with Applications.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

Tight Bound on Johnson's Algorithm for Maximum Satisfiability.

[BibT_eX]

[DOI]

Donald K. Friesen

Hao Zheng

J. Comput. Syst. Sci., 1999

Guaranteeing the 2-Manifold Property for Meshes with doubly Linked Face List.

[BibT_eX]

[DOI]

Int. J. Shape Model., 1999

A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling (Extended Abstract).

[BibT_eX]

[DOI]

Antonio Miranda

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Generalized Distance Functions.

[BibT_eX]

[DOI]

Proceedings of the 1999 Shape Modeling International (SMI '99), 1999

Guaranteeing 2-Manifold Property for Meshes.

[BibT_eX]

[DOI]

Proceedings of the 1999 Shape Modeling International (SMI '99), 1999

1998

Circuit Bottom Fan-In and Computational Power.

[BibT_eX]

[DOI]

Johan Håstad

SIAM J. Comput., 1998

1997

Nearly Optimal One-to-Many Parallel Routing in Star Networks.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1997

Algorithmic Graph Embeddings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

Optimal Parallel Routing in Star Networks.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1997

On the Amount of Nondeterminism and the Power of Verifying.

[BibT_eX]

[DOI]

SIAM J. Comput., 1997

On Fixed-Parameter Tractability and Approximability of NP Optimization Problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1997

A Note on Approximating Graph Genus.

[BibT_eX]

[DOI]

Arkady Kanevsky

Inf. Process. Lett., 1997

Advice Classes of Parameterized Tractability.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1997

On the parameterized complexity of short computation and factorization.

[BibT_eX]

[DOI]

Arch. Math. Log., 1997

Tight Bound on Johnson's Algoritihm for Max-SAT.

[BibT_eX]

[DOI]

Donald K. Friesen

Hao Zheng

Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

1996

Algebraic Specification of Interconnection Network Relationships by Permutation Voltage Graph Mappings.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1996

A tight lower bound on the maximum genus of a simplicial graph.

[BibT_eX]

[DOI]

Discret. Math., 1996

Maximum genus and connectivity.

[BibT_eX]

[DOI]

Dan Archdeacon

Discret. Math., 1996

Optimal Parallel Routing in Star Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

1995

On Input Read-Modes of Alternating Turing Machines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Lower bounds for the average genus.

[BibT_eX]

[DOI]

Robert G. Rieper

J. Graph Theory, 1995

On the Structure of Parameterized Problems in NP.

[BibT_eX]

[DOI]

Inf. Comput., 1995

Algorithmic Graph Embeddings (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

On log-Time Alternating Turing Machines of Alternation Depth k (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1994

Overlap matrices and total imbedding distributions.

[BibT_eX]

[DOI]

Robert G. Rieper

Discret. Math., 1994

On the Structure of Parameterized Problems in NP (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the STACS 94, 1994

1993

Kuratowski-Type Theorems for Average Genus.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1993

Graph Ear Decompositions and Graph Embeddings (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

On the Complexity of Graph Embeddings (Extended Abstract).

[BibT_eX]

[DOI]

Arkady Kanevsky

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

On the Amount of Nondeterminism and the Power of Verifying (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

On Fixed-Parameter Tractability and Approximability of NP-Hard Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993

1992

Limit points for average genus. I. 3-Connected and 2-connected simplicial graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1992

Limit points for average genus II. 2-Connected non-simplicial graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1992

On Assembly of Four-Connected Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Arkady Kanevsky

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1992

1991

Reversal Complexity.

[BibT_eX]

[DOI]

Chee-Keng Yap

SIAM J. Comput., 1991

An NL Hierarchy.

[BibT_eX]

[DOI]

Jim Cox

Bud Mishra

Inf. Process. Lett., 1991

Characterizing Parallel Hierarchies by Reducibilities.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

On-Line Maintenance of the Four-Connected Components of a Graph (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

The Difference Between one Tape and two Tapes: with Respect to Reversal Complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1990

1987

Tape Reversal and Parallel Time.

[BibT_eX]