Maximum induced matchings of random cubic graphs
Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
Packing Edges in Random Regular Graphs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Maximum Induced Matchings of Random Cubic Graphs
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Induced Matchings in Regular Graphs and Trees
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Partition the vertices of a graph into induced matchings
Discrete Mathematics
A polynomial time algorithm for strong edge coloring of partial k-trees
Discrete Applied Mathematics
Large k-separated matchings of random regular graphs
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
Packing vertices and edges in random regular graphs
Random Structures & Algorithms
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On Distance-3 Matchings and Induced Matchings
Graph Theory, Computational Intelligence and Thought
Induced matchings in subcubic planar graphs
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
On distance-3 matchings and induced matchings
Discrete Applied Mathematics
Note: Strong edge colouring of subcubic graphs
Discrete Applied Mathematics
Tighter approximations for maximum induced matchings in regular graphs
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Survey: Randomly colouring graphs (a combinatorial view)
Computer Science Review
Distance edge-colourings and matchings
Discrete Applied Mathematics
Distance coloring and distance edge-coloring of d- dimensional lattice
ICIC'12 Proceedings of the 8th international conference on Intelligent Computing Theories and Applications
New results on maximum induced matchings in bipartite graphs and beyond
Theoretical Computer Science
Strong edge-colouring and induced matchings
Information Processing Letters
| Hi-index | 0.00 |