| Publication | Date of Publication | Type |
|---|
Super Edge-Connected Linear Hypergraphs
Parallel Processing Letters | 2022-07-08 | Paper |
Learning-based compositional parameter synthesis for event-recording automata
Formal Techniques for Distributed Objects, Components, and Systems | 2022-06-15 | Paper |
Formal analysis of composable DeFi protocols
(available as arXiv preprint) | 2022-06-01 | Paper |
The 1-good neighbor connectivity of unidirectional star graph networks
Discrete Applied Mathematics | 2021-09-30 | Paper |
Compositional reasoning for shared-variable concurrent programs
(available as arXiv preprint) | 2021-05-04 | Paper |
| Compositional reasoning for shared-variable concurrent programs | 2021-05-04 | Paper |
Hamiltonian cycle embeddings in faulty hypercubes under the forbidden faulty set model
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
Quasi-open bisimilarity with mismatch is intuitionistic
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
The 4-set tree connectivity of \((n, k)\)-star networks
Theoretical Computer Science | 2020-10-21 | Paper |
Structure connectivity and substructure connectivity of star graphs
Discrete Applied Mathematics | 2020-07-07 | Paper |
| Two sufficient conditions for maximally restricted-edge-connected hypergraphs | 2020-01-22 | Paper |
| Good neighbor connectivity of directed Kautz digraphs | 2020-01-22 | Paper |
A distributed method to avoid higher-order deadlocks in multi-robot systems
Automatica | 2020-01-20 | Paper |
| The fault tolerance of \(k\)-ary \(n\)-cubes with respect to maximally local connectivity | 2019-09-20 | Paper |
Restricted arc connectivity of unidirectional hypercubes and unidirectional folded hypercubes
Taiwanese Journal of Mathematics | 2019-06-20 | Paper |
Path and cycle fault tolerance of bubble-sort graph networks
Theoretical Computer Science | 2019-06-06 | Paper |
A distributed approach to robust control of multi-robot systems
Automatica | 2019-02-05 | Paper |
The language preservation problem is undecidable for parametric event-recording automata
Information Processing Letters | 2018-05-25 | Paper |
Cartesian product digraphs with optimal restricted arc connectivity
Information Processing Letters | 2018-04-04 | Paper |
| Generalized connectivity of generalized hypercubes | 2017-10-20 | Paper |
3-restricted arc connectivity of digraphs
Discrete Mathematics | 2017-08-01 | Paper |
Counterexample-Guided Assume-Guarantee Synthesis through Learning
IEEE Transactions on Computers | 2017-07-27 | Paper |
Model Checking Prioritized Timed Systems
IEEE Transactions on Computers | 2017-07-12 | Paper |
Arc fault tolerance of Kautz digraphs
Theoretical Computer Science | 2017-06-13 | Paper |
The generalized 4-connectivity of hypercubes
Discrete Applied Mathematics | 2017-02-06 | Paper |
| scientific article; zbMATH DE number 6672459 (Why is no real title available?) | 2017-01-06 | Paper |
\(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs
Discrete Applied Mathematics | 2014-12-05 | Paper |
Fault-tolerant embedding of cycles of various lengths in \(k\)-ary \(n\)-cubes
Information and Computation | 2014-01-10 | Paper |
The isolated scattering number of graphs
Acta Mathematica Sinica. Chinese Series | 2012-06-01 | Paper |
The number of arcs of a strongly connected oriented graph with two noncritical vertices
Operations Research Transactions | 2012-06-01 | Paper |
A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected
Information Processing Letters | 2012-03-09 | Paper |
Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes
Discrete Applied Mathematics | 2011-10-27 | Paper |
An efficient algorithm for learning event-recording automata
Automated Technology for Verification and Analysis | 2011-10-07 | Paper |
| Ordered and ordered Hamilton digraphs | 2011-07-19 | Paper |
Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges
Information Sciences | 2011-06-22 | Paper |
Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements
Discrete Applied Mathematics | 2011-03-09 | Paper |
Matching preclusion for \(k\)-ary \(n\)-cubes
Discrete Applied Mathematics | 2010-11-25 | Paper |
Neighborhood conditions for graphs to be super restricted edge connected
Networks | 2010-11-24 | Paper |
The base sets of quasi-primitive zero-symmetric sign pattern matrices with zero trace
Linear Algebra and its Applications | 2010-06-22 | Paper |
\(\lambda ^{\prime}\)-optimal digraphs
Information Processing Letters | 2010-06-09 | Paper |
| The upper bound on \(k\)-restricted edge connectivity of a class of Kautz graphs | 2010-02-12 | Paper |
Path embeddings in faulty 3-ary \(n\)-cubes
Information Sciences | 2010-01-28 | Paper |
The \(k\)-restricted edge connectivity of undirected Kautz graphs
Discrete Mathematics | 2009-12-10 | Paper |
Super \(p\)-restricted edge connectivity of line graphs
Information Sciences | 2009-10-01 | Paper |
Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
Discrete Mathematics | 2009-04-09 | Paper |
Model Checking Timed Systems with Urgencies
Automated Technology for Verification and Analysis | 2008-09-04 | Paper |
DNA labelled graphs with DNA computing
Science in China. Series A | 2008-06-25 | Paper |
Sufficient conditions for a graph to be super restricted edge-connected
Networks | 2008-06-20 | Paper |
The maximal restricted edge connectivity of Kautz undirected graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
| The superrestricted edge connectivity of Kautz undirected graphs | 2007-02-05 | Paper |
Automated Technology for Verification and Analysis
Lecture Notes in Computer Science | 2006-10-10 | Paper |
Programming Languages and Systems
Lecture Notes in Computer Science | 2005-08-17 | Paper |
