| Trace malicious source to guarantee cyber security for mass monitor critical infrastructure |
10 |
| An elastic and resiliency defense against DDoS attacks on the critical DNS authoritative infrastructure |
7 |
| Reconfiguration in bounded bandwidth and tree-depth |
7 |
| Adapting attackers and defenders patrolling strategies: A reinforcement learning approach for Stackelberg security games |
6 |
| A parameterized algorithm for the Maximum Agreement Forest problem on multiple rooted multifurcating trees |
5 |
| Establishing evolutionary game models for CYBer security information EXchange (CYBEX) |
4 |
| The relationship between extra connectivity and conditional diagnosability of regular graphs under the PMC model |
4 |
| On the complexity of two-dimensional signed majority cellular automata |
4 |
| On the transformation capability of feasible mechanisms for programmable matter |
3 |
| Homotopic properties of an M A-digitization of 2D Euclidean spaces |
3 |
| Bounding clique-width via perfect graphs |
3 |
| Optimal separation in exact query complexities for Simon's problem |
3 |
| Parameterized approximation via fidelity preserving transformations |
3 |
| Practically-self-stabilizing virtual synchrony |
2 |
| On the optimality of exact and approximation algorithms for scheduling problems |
2 |
| Path-contractions, edge deletions and connectivity preservation |
2 |
| Colouring square-free graphs without long induced paths |
2 |
| Robust optimization in the presence of uncertainty: A generic approach |
2 |
| SOS specifications for uniformly continuous operators |
2 |
| Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality |
2 |
| A parallel computing method using blocked format with optimal partitioning for SpMV on GPU |
2 |
| Decomposition of quantum Markov chains and its applications |
2 |
| Reconfiguration on sparse graphs |
2 |
| AC(0) circle MOD(2 )lower bounds for the Boolean Inner Product |
2 |
| Dominant point detection based on discrete curve structure and applications |
2 |
| Packet latency of deterministic broadcasting in adversarial multiple access channels |
2 |
| Classifying invariant structures of step traces |
2 |
| Sorting networks: To the end and back again |
1 |
| HV-planarity: Algorithms and complexity |
1 |
| A game characterisation of tree-like Q-Resolution size |
1 |
| Automated synthesis of application-layer connectors from automata-based specifications |
1 |
| Simple picture processing based on finite automata and regular grammars |
1 |
| Object digitization up to a translation |
1 |
| Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs |
1 |
| Gaussian-Gamma collaborative filtering: A hierarchical Bayesian model for recommender systems |
1 |
| On notions of distortion and an almost minimum spanning tree with constant average distortion |
1 |
| Tree projections and constraint optimization problems: Fixed-parameter tractability and parallel algorithms |
1 |
| Subproblem ordering heuristics for AND/OR best-first search |
1 |
| Task-structured probabilistic I/O automata |
1 |
| Computing marginals using MapReduce |
1 |
| Range-max queries on uncertain data |
1 |
| Does adding more agents make a difference? A case study of cover time for the rotor-router |
1 |
| Parameterized algorithms algorithms for recognizing monopolar and 2-subcolorable graphs |
1 |
| Kernels for deletion to classes of acyclic digraphs |
1 |
| On the complexity of trial and error for constraint satisfaction problems |
1 |
| k-distinct in- and out-branchings in digraphs |
1 |
| Algorithmic identification of probabilities is hard |
1 |
| On discrete preferences and coordination |
1 |
| Expressive power of entity-linking frameworks |
1 |
| Strong bounds for evolution in networks |
1 |
