Partitioning the Boolean lattice into chains of large minimum size
Journal of Combinatorial Theory Series A
A Debugging Scheme for Declarative Equation Based Modeling Languages
PADL '02 Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages
Upper bounds on ATSP neighborhood size
Discrete Applied Mathematics
Graphs determined by polynomial invariants
Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
Towards Fast Vickrey Pricing using Constraint Programming
Artificial Intelligence Review
Proceedings of the conference on Design, Automation and Test in Europe - Volume 2
Compact scheduling of zero-one time operations in multi-stage systems
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Yield enhancement of reconfigurable microfluidics-based biochips using interstitial redundancy
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Journal of Computer Science and Technology - Special section on China AVS standard
Level of repair analysis and minimum cost homomorphisms of graphs
Discrete Applied Mathematics
Computer Networks: The International Journal of Computer and Telecommunications Networking
Consecutive edge-coloring of the generalized θ-graph
Discrete Applied Mathematics
Cycle double covers and spanning minors I
Journal of Combinatorial Theory Series B
The computational complexity of the parallel knock-out problem
Theoretical Computer Science
A new method for generating compressed representation of transitive closure
Proceedings of the 2008 C3S2E conference
An improved constant-time approximation algorithm for maximum~matchings
Proceedings of the forty-first annual ACM symposium on Theory of computing
General spanning trees and reachability query evaluation
C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering
FPT algorithms and kernels for the Directedk- Leaf problem
Journal of Computer and System Sciences
Communication: Level of repair analysis and minimum cost homomorphisms of graphs
Discrete Applied Mathematics
Twister networks and their applications to load-balanced switches
INFOCOM'10 Proceedings of the 29th conference on Information communications
A generalization of interval edge-colorings of graphs
Discrete Applied Mathematics
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
An accurate system-wide anonymity metric for probabilistic attacks
PETS'11 Proceedings of the 11th international conference on Privacy enhancing technologies
Minimum d-blockers and d-transversals in graphs
Journal of Combinatorial Optimization
Process Flexibility Revisited: The Graph Expander and Its Applications
Operations Research
On bounded block decomposition problems for under-specified systems of equations
Journal of Computer and System Sciences
Network game with attacker and protector entities
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Level of repair analysis and minimum cost homomorphisms of graphs
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Consecutive edge-colorings of generalized θ-graphs
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
Decomposing DAGs into disjoint chains
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Determining miRNA-disease associations using bipartite graph modelling
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
On sum edge-coloring of regular, bipartite and split graphs
Discrete Applied Mathematics
Hi-index | 0.00 |