![]() The Electronic Journal of Combinatorics, 20:#P11, 9pp., 2013. Multiple Petersen subdivisions in permutation graphs ( PDF - Journal - BibTeX) SIAM Journal on Discrete Mathematics, 28(1):335-341, 2014.Ī new bound for the 2/3 conjecture ( PDF - Journal - BibTeX)Ĭombinatorics, Probability and Computing, 22(3):384-393, 2013.Ī tight bound on the set chromatic number ( PDF - Journal - BibTeX)ĭiscussiones Mathematicae Graph Theory, 33(2):461-465, 2013. Transversals of longest paths and cycles ( PDF - Journal - BibTeX) Integers, 14A:A4 (The Dick deBruijn Memorial Issue), 2014. Supersaturation in the Boolean lattice ( PDF - Journal - BibTeX) Journal of the London Mathematical Society, 89(3):641-662, 2014. Subcubic triangle-free graphs have fractional chromatic number at most 14/5 ( PDF - Journal - BibTeX) Journal of Graph Algorithms and Applications, 19:1-9, 2015.Įxtensions of fractional precolorings show discontinuous Two-floor building needing eight colors ( PDF - Journal - BibTeX) Journal of Combinatorics, 7(4):725-737, 2016.Ĭloseness centralization measure for two-mode data of prescribed sizes ( PDF - Journal - BibTeX)įractional coloring of triangle-free planar graphs ( PDF - Journal - BibTeX) Journal of Graph Algorithms and Applications, 21(6):1091-1105, 2017.Ī note on acyclic vertex-colorings ( PDF - Journal - BibTeX) The Electronic Journal of Combinatorics, 24(3):#P3.47, 27pp., 2017.Įquitable Colorings of K_4-minor-free Graphs ( PDF - Journal - BibTeX) The Electronic Journal of Combinatorics, 25(3):#P3.1, 28pp., 2018.ĭo triangle-free planar graphs have an exponential number of 3-colorings? ( PDF - Journal - BibTeX) Journal of the Australian Mathematical Society, 105(1):79-102, 2018.Įxtension from precoloured sets of edges ( PDF - Journal - BibTeX) The Electronic Journal of Combinatorics, 26(1):#P1.51, 14pp., 2019.Įxpander graphs and sieving in combinatorial structures ( PDF - Journal - BibTeX) On generalized choice and coloring numbers ( PDF - Journal - BibTeX) Mixed Circular Codes ( PDF - Journal - BibTeX) Isomorphism of Weighted Trees and Stanley's Isomorphism Conjecture for Caterpillars ( PDF - Journal - BibTeX)Īnnales de l’Institut Henri Poincaré D 6(3):357-384, 2019. The Electronic Journal of Combinatorics 27(1):#P1.8, 14 pp., 2020.Ī 4-choosable graph that is not (8:2)-choosable ( PDF - Journal - BibTeX) Variations on the Petersen colouring conjecture ( PDF - Journal - BibTeX) Revisiting a theorem by Folkman on graph colouring ( PDF - Journal - BibTeX) The relation between k-circularity and circularity of codes ( PDF - Journal - BibTeX)īulletin of Mathematical Biology 82:105, 2020.Įccentricity of Networks with Structural Constraints ( PDF - Journal - BibTeX)ĭiscussiones Mathematicae Graph Theory 40:1141-1162, 2020. On fractional fragility rates of graph classes ( PDF - Journal - BibTeX) SIAM Journal on Discrete Mathematics 35(2):1136-1148, 2021.įractional chromatic number, maximum degree and girth ( PDF - Journal - BibTeX) Trinucleotide k-circular codes I: Theory ( PDF - Journal - BibTeX)īipartite independence number in graphs with bounded maximum degree ( PDF - Journal - BibTeX) Trinucleotide k-circular codes II: Biology ( PDF - Journal - BibTeX) Mathematics of Operations Research, à paraître. By a case study using the IEEE 802.11 protocol as the underlying CSMA protocol, the proposed scheme pleads itself as a more efficient alternative to the RTS/CTS based collision avoidance scheme for large and dense multi-hop ad hoc networks with stationary nodes, such as wireless mesh and sensor networks.On the effect of symmetry requirement for rendezvous on the complete graph ( PDF - Archive ouverte - BibTeX) We provide a general framework for the SLICON scheme and compare its performance to the conventional RTS/CTS-based collision avoidance scheme. The contention among neighbors can be handled much more efficiently by a basic CSMA protocol as if operating in a single-hop network. In this work, we propose a novel hybrid channel access scheme that spatially limits the contention in the network such that 2-hop neighbors access the channel contention-free among each other whereas only the immediate neighbors may contend among each other. With rapid developments in the community mesh networks and wireless sensor networks research, the need for more efficient channel access techniques for multi-hop wireless networks has become eminent.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |