Jianer Chen
According to our database^{1},
Jianer Chen
authored at least 327 papers
between 1990 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on zbmath.org

on cs.tamu.edu
On csauthors.net:
Bibliography
2021
CoRR, 2021
2020
SDN based communications privacypreserving architecture for VANETs using fog computing.
Veh. Commun., 2020
IEEE/ACM Trans. Netw., 2020
Theor. Comput. Sci., 2020
Theor. Comput. Sci., 2020
A UserDefined LocationSharing Scheme with Efficiency and Privacy in Mobile Social Networks.
Sci. Program., 2020
SIAM J. Discret. Math., 2020
Pleasure or pain? An evaluation of the costs and utilities of bloatware applications in android smartphones.
J. Netw. Comput. Appl., 2020
Optimization of communication in VANETs using fuzzy logic and artificial Bee colony.
J. Intell. Fuzzy Syst., 2020
CoRR, 2020
CoRR, 2020
Proceedings of the 19th IEEE International Conference on Trust, 2020
Proceedings of the Security, Privacy, and Anonymity in Computation, Communication, and Storage, 2020
Trustworthy Data Acquisition and Faulty Sensor Detection using Gray Code in CyberPhysical System.
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.
Veh. Commun., 2019
Theor. Comput. Sci., 2019
Theor. Comput. Sci., 2019
Theor. Comput. Sci., 2019
Theor. Comput. Sci., 2019
Bull. EATCS, 2019
Algorithmica, 2019
IEEE Access, 2019
Proceedings of the Smart City and Informatization  7th International Conference, 2019
Proceedings of the TwentyEighth International Joint Conference on Artificial Intelligence, 2019
Towards InNetwork Generalized Trustworthy Data Collection for Trustworthy CyberPhysical Systems.
Proceedings of the Dependability in Sensor, Cloud, and Big Data Systems and Applications, 2019
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.
Proceedings of the Dependability in Sensor, Cloud, and Big Data Systems and Applications, 2019
Proceedings of the Algorithmic Aspects in Information and Management, 2019
2018
Metametric for saliency detection evaluation metrics based on application preference.
Multim. Tools Appl., 2018
A parameterized algorithm for the Maximum Agreement Forest problem on multiple rooted multifurcating trees.
J. Comput. Syst. Sci., 2018
Inf. Process. Lett., 2018
CoRR, 2018
Comput. Graph., 2018
Response to "On G<sup>1</sup> stitched bicubic Bézier patches with arbitrary topology".
Comput. Graph., 2018
Performance Evaluation of Hypervisors and the Effect of Virtual CPU on Performance.
Proceedings of the 2018 IEEE SmartWorld, 2018
Proceedings of the Security, Privacy, and Anonymity in Computation, Communication, and Storage, 2018
Proceedings of the 38th IEEE International Conference on Distributed Computing Systems, 2018
Proceedings of the Computing and Combinatorics  24th International Conference, 2018
2017
Tuning the Aggressive TCP Behavior for Highly Concurrent HTTP Connections in IntraDatacenter.
IEEE/ACM Trans. Netw., 2017
QualityGuaranteed EventSensitive Data Collection and Monitoring in Vibration Sensor Networks.
IEEE Trans. Ind. Informatics, 2017
Theor. Comput. Sci., 2017
Theor. Comput. Sci., 2017
Theor. Comput. Sci., 2017
Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree.
Inf. Comput., 2017
Comput. Sci. Eng., 2017
An O<sup>*</sup>(1.84s<sup>k</sup>) Parameterized Algorithm for the Multiterminal Cut Problem.
CoRR, 2017
Interactive modeling of smooth manifold meshes with arbitrary topology: G<sup>1</sup> stitched bicubic Bézier patches.
Comput. Graph., 2017
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
Proceedings of the Frontiers in Algorithmics  11th International Workshop, 2017
2016
Encyclopedia of Algorithms, 2016
Encyclopedia of Algorithms, 2016
Lifetime and Energy Hole Evolution Analysis in DataGathering Wireless Sensor Networks.
IEEE Trans. Ind. Informatics, 2016
J. Netw. Comput. Appl., 2016
J. Comb. Optim., 2016
Parameterized Algorithms for the Maximum Agreement Forest Problem on Multiple Rooted Multifurcating Trees.
CoRR, 2016
A fixedparameter algorithm for the maximum agreement forest problem on multifurcating trees.
Sci. China Inf. Sci., 2016
Comput. Graph., 2016
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
Theor. Comput. Sci., 2015
Theor. Comput. Sci., 2015
Theor. Comput. Sci., 2015
Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees.
Theor. Comput. Sci., 2015
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 P<sub>2</sub>Packing and CoPath Packing problems.
J. Comb. Optim., 2015
Extended graph rotation systems as a model for cyclic weaving on orientable surfaces.
Discret. Appl. Math., 2015
CoRR, 2015
Block meshes: Topologically robust shape modeling with graphs embedded on 3manifolds.
Comput. Graph., 2015
Algorithmica, 2015
Proceedings of the Algorithms and Data Structures  14th International Symposium, 2015
Proceedings of the Combinatorial Optimization and Applications, 2015
2014
Theor. Comput. Sci., 2014
Parameterized complexity of Maxlifetime Target Coverage in wireless sensor networks.
Theor. Comput. Sci., 2014
Improved parameterized algorithms for minimum linklength rectilinear spanning path problem.
Theor. Comput. Sci., 2014
Theor. Comput. Sci., 2014
On the Minimum LinkLength 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
Inf. Process. Lett., 2014
CoRR, 2014
Sci. China Inf. Sci., 2014
Proceedings of the International Conference on Computing, Networking and Communications, 2014
Proceedings of the Algorithms  ESA 2014, 2014
Proceedings of the Computing and Combinatorics  20th International Conference, 2014
2013
Theor. Comput. Sci., 2013
Theor. Comput. Sci., 2013
Pervasive Mob. Comput., 2013
J. Comput. Syst. Sci., 2013
A heuristic algorithm for haplotype reconstruction from aligned weighted SNP fragments.
Int. J. Bioinform. Res. Appl., 2013
Comput. Graph., 2013
Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees.
Proceedings of the GraphTheoretic 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
Proceedings of the 10th IEEE International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing, 2013
Proceedings of the Fundamentals of Computation Theory  19th International Symposium, 2013
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
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013
Proceedings of the Combinatorial Optimization and Applications, 2013
2012
Theor. Comput. Sci., 2012
Guest Editors' Introduction to the Special Section on Bioinformatics Research and Applications.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012
ACM Trans. Algorithms, 2012
J. Comput. Syst. Sci., 2012
J. Comput. Syst. Sci., 2012
Identifying Complexes from Protein Interaction Networks According to Different Types of Neighborhood Density.
J. Comput. Biol., 2012
Comput. Graph., 2012
BMC Bioinform., 2012
Algorithmica, 2012
Proceedings of the Theory and Applications of Models of Computation, 2012
Proceedings of the Theory and Applications of Models of Computation, 2012
Proceedings of the 8th International Symposium on Computational Aesthetics in Graphics, 2012
Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012
2011
Wirel. Networks, 2011
An O<sup>*</sup>(3.53<sup>3k</sup>)time parameterized algorithm for the 3set packing problem.
Theor. Comput. Sci., 2011
Theor. Comput. Sci., 2011
Theor. Comput. Sci., 2011
A Fast Hierarchical Clustering Algorithm for Functional Modules Discovery in Protein Interaction Networks.
IEEE ACM Trans. Comput. Biol. Bioinform., 2011
J. Comput., 2011
Int. J. Softw. Informatics, 2011
Comput. Graph., 2011
Algorithmica, 2011
Proceedings of the IEEE 7th International Conference on Wireless and Mobile Computing, 2011
Proceedings of the Theory and Applications of Models of Computation, 2011
Band decomposition of 2manifold meshes for physical construction of large structures.
Proceedings of the International Conference on Computer Graphics and Interactive Techniques, 2011
Proceedings of the International Conference on Computer Graphics and Interactive Techniques, 2011
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011
An Adaptive Probability BroadcastBased Data Preservation Protocol in Wireless Sensor Networks.
Proceedings of IEEE International Conference on Communications, 2011
Proceedings of the Computing and Combinatorics  17th Annual International Conference, 2011
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
Theor. Comput. Sci., 2010
Theor. Comput. Sci., 2010
Math. Struct. Comput. Sci., 2010
J. Interconnect. Networks, 2010
Inf. Process. Lett., 2010
Int. J. Data Min. Bioinform., 2010
CoRR, 2010
Algorithmica, 2010
Proceedings of the SMI 2010, 2010
Proceedings of the SMI 2010, 2010
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.
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 OverhearingBased 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
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
ACM Trans. Graph., 2009
Theor. Comput. Sci., 2009
Theor. Comput. Sci., 2009
Int. J. Bioinform. Res. Appl., 2009
Eng. Appl. Artif. Intell., 2009
A practical algorithm based on particle swarm optimization for haplotype reconstruction.
Appl. Math. Comput., 2009
Algorithmica, 2009
Algorithmica, 2009
Algorithmica, 2009
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009
A DelayConstrained 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
Proceedings of the 11th IEEE International Conference on High Performance Computing and Communications, 2009
ARROWTCP: Accelerating Transmission toward Efficiency and Fairness for HighSpeed 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 MultiPaths Network Coding.
Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009
An Efficient FixedParameter Enumeration Algorithm for Weighted Edge Dominating Set.
Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009
2008
Proceedings of the Encyclopedia of Algorithms  2008 Edition, 2008
Proceedings of the Encyclopedia of Algorithms  2008 Edition, 2008
Applicationoriented 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
J. Comput. Syst. Sci., 2008
J. ACM, 2008
An improved lower bound on approximation algorithms for the Closest Substring problem.
Inf. Process. Lett., 2008
CoRR, 2008
Comput. J., 2008
Modifying the DPClus algorithm for identifying protein complexes based on new topological structures.
BMC Bioinform., 2008
Algorithmica, 2008
Proceedings of the Theory and Applications of Models of Computation, 2008
Proceedings of the Theory and Applications of Models of Computation, 2008
Proceedings of The Seventh IEEE International Symposium on Networking Computing and Applications, 2008
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 GraphTheoretic Method for Mining Overlapping Functional Modules in Protein Interaction Networks.
Proceedings of the Bioinformatics Research and Applications, 2008
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008
Proceedings of the 9th International Conference for Young Computer Scientists, 2008
Proceedings of the 9th International Conference for Young Computer Scientists, 2008
Proceedings of the 9th International Conference for Young Computer Scientists, 2008
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
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
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size.
SIAM J. Comput., 2007
J. Parallel Distributed Comput., 2007
J. Comput. Syst. Sci., 2007
A simple linear time approximation algorithm for multiprocessor job scheduling on four processors.
J. Comb. Optim., 2007
J. Bioinform. Comput. Biol., 2007
Discret. Appl. Math., 2007
Algorithmica, 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
Proceedings of the Theory and Applications of Models of Computation, 2007
Proceedings of the Eighteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2007
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007
C3P: A Cooperant Congestion Control Protocol in High BandwidthDelay Product Networks.
Proceedings of the 16th International Conference on Computer Communications and Networks, 2007
Proceedings of the Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07., 2007
A Randomized Approximation Algorithm for Parameterized 3D Matching Counting Problem.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007
Proceedings of the Combinatorial Optimization and Applications, 2007
2006
On product covering in 3tier supply chain models: Natural complete problems for <i>W</i>[3] and <i>W</i>[4].
Theor. Comput. Sci., 2006
J. Comput. Syst. Sci., 2006
J. Comb. Optim., 2006
Proceedings of the 2006 International Conference on Shape Modeling and Applications (SMI 2006), 2006
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006
Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006
Proceedings of the 14th IEEE International Conference on Networks, 2006
Proceedings of the Geometric Modeling and Processing, 2006
Proceedings of the Advanced Data Mining and Applications, Second International Conference, 2006
Proceedings of the AdHoc, Mobile, and Wireless Networks, 5th International Conference, 2006
2005
Theor. Comput. Sci., 2005
J. Interconnect. Networks, 2005
Inf. Comput., 2005
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NPHard Problems.
Algorithmica, 2005
Proceedings of the Tenth ACM Symposium on Solid and Physical Modeling 2005, 2005
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2005
A Distributed Algorithm based on Probability for Refining EnergyEfficiency of Multicast Trees in Ad Hoc Networks.
Proceedings of the 30th Annual IEEE Conference on Local Computer Networks (LCN 2005), 2005
Proceedings of the 34th International Conference on Parallel Processing (ICPP 2005), 2005
Proceedings of the Networking and Mobile Computing, Third International Conference, 2005
<i>W</i>Hardness Under Linear FPTReductions: 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
J. Comput. Sci. Technol., 2004
J. Algorithms, 2004
Inf. Process. Lett., 2004
Discret. Appl. Math., 2004
Discret. Appl. Math., 2004
Discret. Appl. Math., 2004
Algorithmica, 2004
Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004
Proceedings of the IEEE International Conference on Systems, 2004
Fault Tolerant Routing Algorithm in Hypercube Networks with Load Balancing Support.
Proceedings of the Parallel and Distributed Processing and Applications, 2004
Proceedings of the 10th International Conference on Parallel and Distributed Systems, 2004
Proceedings of the 8th International Conference on Control, 2004
Cardinalitybased inference control in OLAP systems: an information theoretic approach.
Proceedings of the DOLAP 2004, 2004
2003
J. Interconnect. Networks, 2003
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms.
J. Comput. Syst. Sci., 2003
J. Comput. Syst. Sci., 2003
Discret. Appl. Math., 2003
A minimal and complete set of operators for the development of robust manifold mesh modelers.
Graph. Model., 2003
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 Kvalued logic functions.
Proceedings of the IEEE International Conference on Systems, 2003
A New FaultTolerant Multicast Communication in Multicomputers.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2003
Proceedings of the 2003 International Symposium on Information Technology (ITCC 2003), 2003
Payload analysis of anonymous communication system with hostbased rerouting mechanism.
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.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003
Proceedings of IEEE International Conference on Communications, 2003
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
Proceedings of the 12th Asian Test Symposium (ATS 2003), 1719 November 2003, Xian, China, 2003
Proceedings of the Handbook of Graph Theory., 2003
2002
Locally SubcubeConnected 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
Inf. Process. Lett., 2002
A Prototype System for Robust, Interactive and UserFriendly Modeling of Orientable 2Manifold Meshes.
Proceedings of the 2002 International Conference on Shape Modeling and Applications (SMI 2002), 2002
Proceedings of the 10th Pacific Conference on Computer Graphics and Applications, 2002
Proceedings of the 10th Pacific Conference on Computer Graphics and Applications, 2002
Probabilistic Analysis on Mesh Network Fault Tolerance.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002
Proceedings of the LATIN 2002: Theoretical Informatics, 2002
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002
2001
SIAM J. Comput., 2001
J. Interconnect. Networks, 2001
J. Algorithms, 2001
Int. J. Shape Model., 2001
Proceedings of the GraphTheoretic 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
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001
Proceedings of the Eigth International Conference on Parallel and Distributed Systems, 2001
Proceedings of the Computational Science  ICCS 2001, 2001
Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001
2000
Networks, 2000
Proceedings of the 8th Pacific Conference on Computer Graphics and Applications, 2000
Proceedings of the ACM Multimedia 2000 Workshops, Los Angeles, CA, USA, October 30, 2000
A Simple LinearTime Approximation Algorithm for Multiprocessor 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
Proceedings of the 2000 International Conference on Parallel Processing, 2000
1999
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999
SIAM J. Discret. Math., 1999
SIAM J. Comput., 1999
J. Comput. Syst. Sci., 1999
Int. J. Shape Model., 1999
A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling (Extended Abstract).
Proceedings of the ThirtyFirst Annual ACM Symposium on Theory of Computing, 1999
Proceedings of the 1999 Shape Modeling International (SMI '99), 1999
Proceedings of the 1999 Shape Modeling International (SMI '99), 1999
1998
SIAM J. Comput., 1998
1997
IEEE Trans. Parallel Distributed Syst., 1997
Theor. Comput. Sci., 1997
IEEE Trans. Computers, 1997
SIAM J. Comput., 1997
J. Comput. Syst. Sci., 1997
Inf. Process. Lett., 1997
Ann. Pure Appl. Log., 1997
Arch. Math. Log., 1997
Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997
1996
Algebraic Specification of Interconnection Network Relationships by Permutation Voltage Graph Mappings.
Math. Syst. Theory, 1996
Discret. Math., 1996
Discret. Math., 1996
Proceedings of the GraphTheoretic Concepts in Computer Science, 1996
1995
Theor. Comput. Sci., 1995
J. Graph Theory, 1995
Inf. Comput., 1995
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995
On logTime Alternating Turing Machines of Alternation Depth k (Extended Abstract).
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995
1994
SIAM J. Discret. Math., 1994
Discret. Math., 1994
Proceedings of the STACS 94, 1994
1993
J. Comb. Theory, Ser. B, 1993
Proceedings of the GraphTheoretic Concepts in Computer Science, 1993
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993
On FixedParameter Tractability and Approximability of <i>NP</i>Hard Optimization Problems.
Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993
1992
J. Comb. Theory, Ser. B, 1992
J. Comb. Theory, Ser. B, 1992
Proceedings of the GraphTheoretic Concepts in Computer Science, 1992
1991
SIAM J. Comput., 1991
Inf. Process. Lett., 1991
Inf. Process. Lett., 1991
OnLine Maintenance of the FourConnected 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