Jianer Chen

According to our database1, Jianer Chen authored at least 302 papers between 1987 and 2019.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

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

Scheduling two-stage jobs on multiple flowshops.
Theor. Comput. Sci., 2019

Preface to the special issue on computing and combinatorics.
J. Comb. Optim., 2019

EATCS-IPEC Nerode Prize 2019 - Call for Nominations.
Bulletin of the EATCS, 2019

Stereoscopic Image Saliency Detection Optimization: A Multi-Cue-Driven Approach.
IEEE Access, 2019

2018
Meta-metric for saliency detection evaluation metrics based on application preference.
Multimedia Tools Appl., 2018

A parameterized algorithm for the Maximum Agreement Forest problem on multiple rooted multifurcating trees.
J. Comput. Syst. Sci., 2018

An improved FPT algorithm for Almost Forest Deletion problem.
Inf. Process. Lett., 2018

Detection of hierarchical intrinsic symmetry structure in 3D models.
Computers & Graphics, 2018

Response to "On G1 stitched bi-cubic Bézier patches with arbitrary topology".
Computers & Graphics, 2018

Performance Evaluation of Hypervisors and the Effect of Virtual CPU on Performance.
Proceedings of the 2018 IEEE SmartWorld, 2018

A Service Oriented Healthcare Architecture (SOHA-CC) Based on Cloud Computing.
Proceedings of the Security, Privacy, and Anonymity in Computation, Communication, and Storage, 2018

Designing Fast and Friendly TCP to Fit High Speed Data Center Networks.
Proceedings of the 38th IEEE International Conference on Distributed Computing Systems, 2018

Approximation Algorithms on Multiple Two-Stage Flowshops.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
Tuning the Aggressive TCP Behavior for Highly Concurrent HTTP Connections in Intra-Datacenter.
IEEE/ACM Trans. Netw., 2017

Quality-Guaranteed Event-Sensitive Data Collection and Monitoring in Vibration Sensor Networks.
IEEE Trans. Industrial Informatics, 2017

Partition on trees with supply and demand: Kernelization and algorithms.
Theor. Comput. Sci., 2017

Improved kernel results for some FPT problems based on simple observations.
Theor. Comput. Sci., 2017

Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree.
Inf. Comput., 2017

Transparent Computing: A Promising Network Computing Paradigm.
Computing in Science and Engineering, 2017

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

A Lightweight Privacy Aware Friend Locator in Mobile Social Networks.
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.
Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

2016
Vertex Cover Search Trees.
Encyclopedia of Algorithms, 2016

Vertex Cover Kernelization.
Encyclopedia of Algorithms, 2016

Lifetime and Energy Hole Evolution Analysis in Data-Gathering Wireless Sensor Networks.
IEEE Trans. Industrial Informatics, 2016

Adaptive marking threshold method for delay-sensitive TCP in data center network.
J. Network and Computer Applications, 2016

Special Issue for FAW 2014.
J. Comb. Optim., 2016

A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees.
SCIENCE CHINA Information Sciences, 2016

Construction with physical version of quad-edge data structures.
Computers & Graphics, 2016

Approximating Maximum Agreement Forest on Multiple Binary Trees.
Algorithmica, 2016

Tuning the Aggressive TCP Behavior for Highly Concurrent HTTP Connections in Data Center.
Proceedings of the 36th IEEE International Conference on Distributed Computing Systems, 2016

2015
Parameterized complexity of control and bribery for d-approval elections.
Theor. Comput. Sci., 2015

Edge deletion problems: Branching facilitated by modular decomposition.
Theor. Comput. Sci., 2015

Frontiers of Algorithmics.
Theor. Comput. Sci., 2015

Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees.
Theor. Comput. Sci., 2015

Adaptive-Acceleration Data Center TCP.
IEEE Trans. Computers, 2015

An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs.
J. Comb. Optim., 2015

Randomized parameterized algorithms for P2-Packing and Co-Path Packing problems.
J. Comb. Optim., 2015

Extended graph rotation systems as a model for cyclic weaving on orientable surfaces.
Discrete Applied Mathematics, 2015

Block meshes: Topologically robust shape modeling with graphs embedded on 3-manifolds.
Computers & Graphics, 2015

On Feedback Vertex Set: New Measure and New Structures.
Algorithmica, 2015

A 2k-vertex Kernel for Maximum Internal Spanning Tree.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Dealing with 4-Variables by Resolution: An Improved MaxSAT Algorithm.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Improved MaxSAT Algorithms for Instances of Degree 3.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
Algorithms for parameterized maximum agreement forest problem on multiple trees.
Theor. Comput. Sci., 2014

Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks.
Theor. Comput. Sci., 2014

Improved parameterized algorithms for minimum link-length rectilinear spanning path problem.
Theor. Comput. Sci., 2014

Matching and Weighted P2-Packing: Algorithms and Kernels.
Theor. Comput. Sci., 2014

On the Minimum Link-Length Rectilinear Spanning Path Problem: Complexity and Algorithms.
IEEE Trans. Computers, 2014

On Unknown Small Subsets and Implicit Measures: New Techniques for Parameterized Algorithms.
J. Comput. Sci. Technol., 2014

An O(1.84k) parameterized algorithm for the multiterminal cut problem.
Inf. Process. Lett., 2014

On the parameterized vertex cover problem for graphs with perfect matching.
SCIENCE CHINA Information Sciences, 2014

Security from the transparent computing aspect.
Proceedings of the International Conference on Computing, Networking and Communications, 2014

Deeper Local Search for Better Approximation on Maximum Internal Spanning Trees.
Proceedings of the Algorithms - ESA 2014, 2014

Approximation Algorithms for Maximum Agreement Forest on Multiple Trees.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013
Improved linear problem kernel for planar connected dominating set.
Theor. Comput. Sci., 2013

Parameterized top-K algorithms.
Theor. Comput. Sci., 2013

Planar graph vertex partition for linear problem kernels.
J. Comput. Syst. Sci., 2013

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

Hamiltonian cycle art: Surface covering wire sculptures and duotone surfaces.
Computers & Graphics, 2013

Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

On Parameterized and Kernelization Algorithms for the Hierarchical Clustering Problem.
Proceedings of the Theory and Applications of Models of Computation, 2013

Analysis on the Scheduling Problem in Transparent Computing.
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.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees.
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.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

Random Methods for Parameterized Problems.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

Parameterized Complexity of Control and Bribery for d-Approval Elections.
Proceedings of the Combinatorial Optimization and Applications, 2013

2012
Complexity and parameterized algorithms for Cograph Editing.
Theor. Comput. Sci., 2012

Guest Editors' Introduction to the Special Section on Bioinformatics Research and Applications.
IEEE/ACM Trans. Comput. Biology Bioinform., 2012

Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching.
ACM Trans. Algorithms, 2012

A 2k kernel for the cluster editing problem.
J. Comput. Syst. Sci., 2012

Identifying Complexes from Protein Interaction Networks According to Different Types of Neighborhood Density.
Journal of Computational Biology, 2012

Pattern mapping with quad-pattern-coverable quad-meshes.
Computers & Graphics, 2012

Guest Editors' Introduction.
BMC Bioinformatics, 2012

FPT Results for Signed Domination.
Proceedings of the Theory and Applications of Models of Computation, 2012

Improved FPT Algorithms for Rectilinear k-Links Spanning Path.
Proceedings of the Theory and Applications of Models of Computation, 2012

Surface Covering Curves.
Proceedings of the Computational Aesthetics 2012: Eurographics Workshop on Computational Aesthetics, 2012

Parameterized Complexity and Subexponential-Time Computability.
Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

Kernels for Packing and Covering Problems - (Extended Abstract).
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011
An O*(3.533k)-time parameterized algorithm for the 3-set packing problem.
Theor. Comput. Sci., 2011

Improved deterministic algorithms for weighted matching and packing problems.
Theor. Comput. Sci., 2011

Algorithms, complexity and computational models.
Theor. Comput. Sci., 2011

A Fast Hierarchical Clustering Algorithm for Functional Modules Discovery in Protein Interaction Networks.
IEEE/ACM Trans. Comput. Biology Bioinform., 2011

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

Color-Coding and its Applications: A Survey.
Int. J. Software and Informatics, 2011

Cyclic twill-woven objects.
Computers & Graphics, 2011

On the Planarization of Wireless Sensor Networks.
Algorithmica, 2011

Efficient flooding in Wireless Sensor Networks secured with neighborhood keys.
Proceedings of the IEEE 7th International Conference on Wireless and Mobile Computing, 2011

Multicut in Trees Viewed through the Eyes of Vertex Cover.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

An Improved Kernel for Planar Connected Dominating Set.
Proceedings of the Theory and Applications of Models of Computation, 2011

Band decomposition of 2-manifold meshes for physical construction of large structures.
Proceedings of the International Conference on Computer Graphics and Interactive Techniques, 2011

Band decomposition of 2-manifold meshes for physical construction of large structures.
Proceedings of the International Conference on Computer Graphics and Interactive Techniques, 2011

Pattern mapping with quad-pattern-coverable quad-meshes.
Proceedings of the International Conference on Computer Graphics and Interactive Techniques, 2011

Linear Problem Kernels for Planar Graph Problems with Small Distance Property.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Reliable Networks with Unreliable Sensors.
Proceedings of the Distributed Computing and Networking - 12th International Conference, 2011

An Adaptive Probability Broadcast-Based Data Preservation Protocol in Wireless Sensor Networks.
Proceedings of IEEE International Conference on Communications, 2011

Cograph Editing: Complexity and Parameterized Algorithms.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

Matching and P 2-Packing: Weighted Versions.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

Identification of Breast Cancer Gene Signature in Protein Interaction Network Using Graph Centrality.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2011

2010
A parameterized algorithm for the hyperplane-cover problem.
Theor. Comput. Sci., 2010

Improved upper bounds for vertex cover.
Theor. Comput. Sci., 2010

A practical parameterised algorithm for the individual haplotyping problem MLF.
Mathematical Structures in Computer Science, 2010

A New Fault-Tolerant Broadcast Routing Algorithm on Mesh Networks.
Journal of Interconnection Networks, 2010

An improved kernelization for P2-packing.
Inf. Process. Lett., 2010

Identifying the overlapping complexes in protein interaction networks.
IJDMB, 2010

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

On Feedback Vertex Set New Measure and New Structures.
Proceedings of the Algorithm Theory, 2010

Single-Cycle Plain-Woven Objects.
Proceedings of the SMI 2010, 2010

Paper-Strip Sculptures.
Proceedings of the SMI 2010, 2010

Cyclic twill-woven objects.
Proceedings of the International Conference on Computer Graphics and Interactive Techniques, 2010

Cyclic twill-woven objects.
Proceedings of the International Conference on Computer Graphics and Interactive Techniques, 2010

Cluster Editing: Kernelization Based on Edge Cuts.
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

An Agglomerate Algorithm for Mining Overlapping and Hierarchical Functional Modules in Protein Interaction Networks.
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.
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.
Proceedings of IEEE International Conference on Communications, 2010

Probabilistic Analysis on Mesh Network Fault Tolerance: Deterministic vs. Stochastic.
Proceedings of the IEEE/IFIP 8th International Conference on Embedded and Ubiquitous Computing, 2010

A 2k Kernel for the Cluster Editing Problem.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009
Maximum Partition Matching.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Cyclic plain-weaving on polygonal mesh surfaces with graph rotation systems.
ACM Trans. Graph., 2009

A practical algorithm for multiplex PCR primer set selection.
IJBRA, 2009

A parthenogenetic algorithm for single individual SNP haplotyping.
Eng. Appl. of AI, 2009

A practical algorithm based on particle swarm optimization for haplotype reconstruction.
Applied Mathematics and Computation, 2009

On Counting 3-D Matchings of Size k.
Algorithmica, 2009

Improved Parameterized Set Splitting Algorithms: A Probabilistic Approach.
Algorithmica, 2009

An Improved SAT Algorithm in Terms of Formula Length.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

On Parameterized Exponential Time Complexity.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

A Delay-Constrained and Maximum Lifetime Data Gathering Algorithm for Wireless Sensor Networks.
Proceedings of the MSN 2009, 2009

Hierarchical Organization of Functional Modules in Weighted Protein Interaction Networks Using Clustering Coefficient.
Proceedings of the Bioinformatics Research and Applications, 5th International Symposium, 2009

An Automated Signature Generation Approach for Polymorphic Worm Based on Color Coding.
Proceedings of IEEE International Conference on Communications, 2009

Polymorphic Worm Detection Using Signatures Based on Neighborhood Relation.
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.
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.
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.
Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

2008
Vertex Cover Search Trees.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Vertex Cover Kernelization.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Application-oriented purely semantic precision and recall for ontology mapping evaluation.
Knowl.-Based Syst., 2008

Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs.
J. Comput. Sci. Technol., 2008

Improved algorithms for feedback vertex set problems.
J. Comput. Syst. Sci., 2008

An improved lower bound on approximation algorithms for the Closest Substring problem.
Inf. Process. Lett., 2008

On Parameterized Intractability: Hardness and Completeness.
Comput. J., 2008

Modifying the DPClus algorithm for identifying protein complexes based on new topological structures.
BMC Bioinformatics, 2008

Foreword from the Guest Editors.
Algorithmica, 2008

On the Pseudo-achromatic Number Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

A Practical Parameterized Algorithm for the Individual Haplotyping Problem MLF.
Proceedings of the Theory and Applications of Models of Computation, 2008

An Improved Parameterized Algorithm for a Generalized Matching Problem.
Proceedings of the Theory and Applications of Models of Computation, 2008

A fixed-parameter algorithm for the directed feedback vertex set problem.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Sorting Based Data Centric Storage.
Proceedings of The Seventh IEEE International Symposium on Networking Computing and Applications, 2008

Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters.
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.
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.
Proceedings of the Bioinformatics Research and Applications, 2008

Robust Planarization of Unlocalized Wireless Sensor Networks.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

A Novel Anonymous Communication Strategy with Respect to Payment Mechanism.
Proceedings of the 9th International Conference for Young Computer Scientists, 2008

A Genetic Algorithm for Single Individual SNP Haplotype Assembly.
Proceedings of the 9th International Conference for Young Computer Scientists, 2008

Greedily Mining l-dense Subgraphs in Protein Interaction Networks.
Proceedings of the 9th International Conference for Young Computer Scientists, 2008

A Virtual Laboratory Platform Based on Integration of Java and Matlab.
Proceedings of the Advances in Web Based Learning, 2008

A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem.
Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

A Practical Exact Algorithm for the Individual Haplotyping Problem MEC.
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.
Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics, 2008

A Fast Agglomerate Algorithm for Mining Functional Modules in Protein Interaction Networks.
Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics, 2008

2007
Probabilistic analysis on mesh network fault tolerance.
J. Parallel Distrib. Comput., 2007

Genus characterizes the complexity of certain graph problems: Some tight results.
J. Comput. Syst. Sci., 2007

A simple linear time approximation algorithm for multi-processor job scheduling on four processors.
J. Comb. Optim., 2007

Research on Parameterized Algorithms of the Individual Haplotyping Problem.
J. Bioinformatics and Computational Biology, 2007

Finding Pathway Structures in Protein Interaction Networks.
Algorithmica, 2007

An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Improved Algorithms for the Feedback Vertex Set Problems.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2007

Parameterized Algorithms for Weighted Matching and Packing Problems.
Proceedings of the Theory and Applications of Models of Computation, 2007

Improved algorithms for path, matching, and packing problems.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Face Tracing Based Geographic Routing in Nonplanar Wireless Networks.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Separability and Topology Control of Quasi Unit Disk Graphs.
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.
Proceedings of the 16th International Conference on Computer Communications and Networks, 2007

Directed Feedback Vertex Set Problem is FPT.
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.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Improved Algorithms for Weighted and Unweighted Set Splitting Problems.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

A Lower Bound on Approximation Algorithms for the Closest Substring Problem.
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].
Theor. Comput. Sci., 2006

Strong computational lower bounds via parameterized complexity.
J. Comput. Syst. Sci., 2006

On the computational hardness based on linear FPT-reductions.
J. Comb. Optim., 2006

Regular Mesh Construction Algorithms using Regular Handles.
Proceedings of the 2006 International Conference on Shape Modeling and Applications (SMI 2006), 2006

Improved Parameterized Upper Bounds for Vertex Cover.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms.
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

On the Effective Enumerability of NP Problems.
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

On PTAS for Planar Graph Problems.
Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

A Prediction-Based AQM Algorithm for DiffServ Networks.
Proceedings of the 14th IEEE International Conference on Networks, 2006

Insight for Practical Subdivision Modeling with Discrete Gauss-Bonnet Theorem.
Proceedings of the Geometric Modeling and Processing, 2006

Research on Multi-valued and Multi-labeled Decision Trees.
Proceedings of the Advanced Data Mining and Applications, Second International Conference, 2006

Link Availability at Any Time in MANET.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 5th International Conference, 2006

2005
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size.
Proceedings of the STACS 2005, 2005

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

Performance Measurements for Privacy Preserving Data Mining.
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.
Proceedings of the 30th Annual IEEE Conference on Local Computer Networks (LCN 2005), 2005

PFED: A Prediction-Based Fair Active Queue Management Algorithm.
Proceedings of the 34th International Conference on Parallel Processing (ICPP 2005), 2005

SAS: A Scalar Anonymous Communication System.
Proceedings of the Networking and Mobile Computing, Third International Conference, 2005

W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications.
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].
Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

2004
On Fault Tolerance of 3-Dimensional Mesh Networks.
J. Comput. Sci. Technol., 2004

An efficient parameterized algorithm for m-set packing.
J. Algorithms, 2004

The cost of becoming anonymous: on the participant payload in Crowds.
Inf. Process. Lett., 2004

On the construction of most reliable networks.
Discrete Applied Mathematics, 2004

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

Improved exact algorithms for MAX-SAT.
Discrete Applied Mathematics, 2004

Using Nondeterminism to Design Efficient Deterministic Algorithms.
Algorithmica, 2004

Integrating Sample-Driven and Pattern-Driven Approaches in Motif Finding.
Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

Linear FPT reductions and computational lower bounds.
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.
Proceedings of the IEEE International Conference on Systems, 2004

Polynomial Time Approximation Schemes and Parameterized Complexity.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

On Fault Tolerance of 3-Dimensional Mesh Networks.
Proceedings of the 7th International Symposium on Parallel Architectures, 2004

Fault Tolerant Routing Algorithm in Hypercube Networks with Load Balancing Support.
Proceedings of the Parallel and Distributed Processing and Applications, 2004

A Probabilistic Approach to Fault-Tolerant Routing Algorithm on Mesh Networks.
Proceedings of the 10th International Conference on Parallel and Distributed Systems, 2004

Performance analysis of distributed adaptive routing algorithm.
Proceedings of the 8th International Conference on Control, 2004

Cardinality-based inference control in OLAP systems: an information theoretic approach.
Proceedings of the DOLAP 2004, 2004

Tight Lower Bounds for Certain Parameterized NP-Hard Problems.
Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004

2003
Strong Fault-Tolerance: Parallel Routing in Star Networks with Faults.
Journal of Interconnection Networks, 2003

Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms.
J. Comput. Syst. Sci., 2003

Foreword from the guest editors.
J. Comput. Syst. Sci., 2003

A minimal and complete set of operators for the development of robust manifold mesh modelers.
Graphical Models, 2003

Interactive Rind Modeling.
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.
Proceedings of the IEEE International Conference on Systems, 2003

A New Fault-Tolerant Multicast Communication in Multicomputers.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2003

Probabilistic Analysis of Connectivity on Mesh Networks.
Proceedings of the 2003 International Symposium on Information Technology (ITCC 2003), 2003

Payload analysis of anonymous communication system with host-based rerouting mechanism.
Proceedings of the Eighth IEEE Symposium on Computers and Communications (ISCC 2003), 30 June, 2003

Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

A Probabilistic Approach to Fault Tolerant Broadcast Routing Algorithms on Mesh Networks.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

An analysis of forwarding mechanism in crowds.
Proceedings of IEEE International Conference on Communications, 2003

Genus Characterizes the Complexity of Graph Problems: Some Tight Results.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Probability Model for Faults in Large-Scale Multicomputer Systems.
Proceedings of the 12th Asian Test Symposium (ATS 2003), 17-19 November 2003, Xian, China, 2003

2002
Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results.
IEEE Trans. Computers, 2002

An Effective Randomized QoS Routing Algorithm on Networks with Inaccurate Parameters.
J. Comput. Sci. Technol., 2002

A note on practical construction of maximum bandwidth paths.
Inf. Process. Lett., 2002

A Prototype System for Robust, Interactive and User-Friendly Modeling of Orientable 2-Manifold Meshes.
Proceedings of the 2002 International Conference on Shape Modeling and Applications (SMI 2002), 2002

Interactive Construction of Multi-Segment Curved Handles .
Proceedings of the 10th Pacific Conference on Computer Graphics and Applications (PG 2002), 2002

Two Methods for Creating Chinese Painting.
Proceedings of the 10th Pacific Conference on Computer Graphics and Applications (PG 2002), 2002

Probabilistic Analysis on Mesh Network Fault Tolerance.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002

Improved Exact Algorithms for MAX-SAT.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

On the Approximability of Multiprocessor Task Scheduling Problems.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Hypercube Network Fault Tolerance: A Probabilistic Approach.
Proceedings of the 31st International Conference on Parallel Processing (ICPP 2002), 2002

2001
A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling.
SIAM J. Comput., 2001

Routing in Hypercube Networks with a Constant Fraction of Faulty Nodes.
Journal of Interconnection Networks, 2001

A New Corner cutting Scheme with tension and Handle-Face Reconstruction.
International Journal of Shape Modeling, 2001

On Strong Menger-Connectivity of Star Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

Handle and Hole Improvement by Using New Corner Cutting Subdivision Scheme with Tension.
Proceedings of the 2001 International Conference on Shape Modeling and Applications (SMI 2001), 2001

Semi-normal Schedulings: Improvement on Goemans' Algorithm.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Parallel Routing in Hypercube Networks with Faulty Nodes.
Proceedings of the Eigth International Conference on Parallel and Distributed Systems, 2001

Strong Fault-Tolerance: Parallel Routing in Networks with Faults.
Proceedings of the Computational Science - ICCS 2001, 2001

Using Nondeterminism to Design Deterministic Algorithms.
Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

2000
Improvement on vertex cover for low-degree graphs.
Networks, 2000

A New Paradigm for Changing Topology during Subdivision Modeling.
Proceedings of the 8th Pacific Conference on Computer Graphics and Applications (PG 2000), 2000

Web-based intuitive and effective design of symmetric tiles.
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.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

An Intuitive and Effective New Representation for Interconnection Network Structures.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

On Approximating Minimum Vertex Cover for Graphs with Perfect Matching.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Utilization-Based Admission Control for Real-Time Applications.
Proceedings of the 2000 International Conference on Parallel Processing, 2000

1999
Discrete And Computational Geometry.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

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

Graph Ear Decompositions and Graph Embeddings.
SIAM J. Discrete Math., 1999

The Maximum Partition Matching Problem with Applications.
SIAM J. Comput., 1999

Tight Bound on Johnson's Algorithm for Maximum Satisfiability.
J. Comput. Syst. Sci., 1999

Guaranteeing the 2-Manifold Property for Meshes with doubly Linked Face List.
International Journal of Shape Modeling, 1999

Vertex Cover: Further Observations and Further Improvements.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling (Extended Abstract).
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Generalized Distance Functions.
Proceedings of the 1999 Shape Modeling International (SMI '99), 1999

Guaranteeing 2-Manifold Property for Meshes.
Proceedings of the 1999 Shape Modeling International (SMI '99), 1999

1997
Algorithmic Graph Embeddings.
Theor. Comput. Sci., 1997

Optimal Parallel Routing in Star Networks.
IEEE Trans. Computers, 1997

On the Amount of Nondeterminism and the Power of Verifying.
SIAM J. Comput., 1997

On Fixed-Parameter Tractability and Approximability of NP Optimization Problems.
J. Comput. Syst. Sci., 1997

A Note on Approximating Graph Genus.
Inf. Process. Lett., 1997

Advice Classes of Parameterized Tractability.
Ann. Pure Appl. Logic, 1997

On the parameterized complexity of short computation and factorization.
Arch. Math. Log., 1997

Nearly Optimal One-To-Many Parallel Routing in Star Networks.
Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

Tight Bound on Johnson's Algoritihm for Max-SAT.
Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

Circuit Bottom Fan-in and Computational Power.
Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

1996
Algebraic Specification of Interconnection Network Relationships by Permutation Voltage Graph Mappings.
Mathematical Systems Theory, 1996

A tight lower bound on the maximum genus of a simplicial graph.
Discrete Mathematics, 1996

Maximum genus and connectivity.
Discrete Mathematics, 1996

Optimal Parallel Routing in Star Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

1995
On Input Read-Modes of Alternating Turing Machines.
Theor. Comput. Sci., 1995

Lower bounds for the average genus.
Journal of Graph Theory, 1995

On the Structure of Parameterized Problems in NP.
Inf. Comput., 1995

Algorithmic Graph Embeddings (Extended Abstract).
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

On log-Time Alternating Turing Machines of Alternation Depth k (Extended Abstract).
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994
Overlap matrices and total imbedding distributions.
Discrete Mathematics, 1994

On the Structure of Parameterized Problems in NP (Extended Abstract).
Proceedings of the STACS 94, 1994

1993
Kuratowski-Type Theorems for Average Genus.
J. Comb. Theory, Ser. B, 1993

Graph Ear Decompositions and Graph Embeddings (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

On the Complexity of Graph Embeddings (Extended Abstract).
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

On the Amount of Nondeterminism and the Power of Verifying (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

On Fixed-Parameter Tractability and Approximability of NP-Hard Optimization Problems.
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.
J. Comb. Theory, Ser. B, 1992

Limit points for average genus II. 2-Connected non-simplicial graphs.
J. Comb. Theory, Ser. B, 1992

On Assembly of Four-Connected Graphs (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1992

A Linear Time Algorithm for Isomorphism of Graphs of Bounded Average Genus.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1992

1991
An NL Hierarchy.
Inf. Process. Lett., 1991

Characterizing Parallel Hierarchies by Reducibilities.
Inf. Process. Lett., 1991

On-Line Maintenance of the Four-Connected Components of a Graph (Extended Abstract)
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.
Theor. Comput. Sci., 1990

1987
Reversal complexity.
Proceedings of the Second Annual Conference on Structure in Complexity Theory, 1987


  Loading...