2024
A new value for communication situations.
Math. Methods Oper. Res., October, 2024
Consistency of the Owen value for TU-games with coalition and graph structures.
Ann. Oper. Res., July, 2024
The Turán number of Berge hypergraphs with stable properties.
Discret. Math., January, 2024
2023
Corrigendum to "A new axiomatization of the Shapley-solidarity value for games with a coalition structure" [Oper. Res. Lett. 46 (2018) 163-167].
Oper. Res. Lett., November, 2023
Union-wise egalitarian solutions in cooperative games with a coalition structure.
4OR, September, 2023
Marginality and a Characterization of the Owen Graph value.
Int. J. Game Theory, June, 2023
The two-step average tree value for graph and hypergraph games.
Ann. Oper. Res., April, 2023
The efficient partition surplus Owen graph value.
Ann. Oper. Res., 2023
2022
Consistency and the graph Banzhaf value for communication graph games.
Oper. Res. Lett., 2022
Safety of links with respect to the Myerson value for communication situations.
Oper. Res., 2022
A value for cooperative games with coalition and probabilistic graph structures.
J. Comb. Optim., 2022
Anti-Ramsey number of matchings in <i>r</i>-partite <i>r</i>-uniform hypergraphs.
Discret. Math., 2022
The Turán number of Berge-matching in hypergraphs.
Discret. Math., 2022
2021
Egalitarian allocation and players of certain type.
Oper. Res. Lett., 2021
The average tree value for hypergraph games.
Math. Methods Oper. Res., 2021
The principal eigenvector to α-spectral radius of hypergraphs.
J. Comb. Optim., 2021
The spectral radius and domination number in linear uniform hypergraphs.
J. Comb. Optim., 2021
Cooperative games with partial information.
Int. J. Game Theory, 2021
On a Conjecture for Power Domination.
Graphs Comb., 2021
Decomposing uniform hypergraphs into uniform hypertrees and single edges.
Discret. Math., 2021
Extremal graphs for blow-ups of stars and paths.
Discret. Appl. Math., 2021
The Banzhaf value for generalized probabilistic communication situations.
Ann. Oper. Res., 2021
2020
The Turán Number of Berge-K<sub>4</sub> in 3-Uniform Hypergraphs.
SIAM J. Discret. Math., 2020
The Myerson value for directed graph games.
Oper. Res. Lett., 2020
Marginal contributions and derivatives for set functions in cooperative games.
J. Comb. Optim., 2020
Extremal Graphs for Odd-Ballooning of Paths and Cycles.
Graphs Comb., 2020
Extremal Graphs for Blow-Ups of Keyrings.
Graphs Comb., 2020
Power domination in the generalized Petersen graphs.
Discuss. Math. Graph Theory, 2020
List-coloring clique-hypergraphs of K5-minor-free graphs strongly.
Discret. Math., 2020
Efficient quotient extensions of the Myerson value.
Ann. Oper. Res., 2020
A Note on the Position Value for Hypergraph Communication Situations.
Proceedings of the Complexity and Approximation - In Memory of Ker-I Ko, 2020
2019
The efficient proportional Myerson values.
Oper. Res. Lett., 2019
A linear-time algorithm for clique-coloring planar graphs.
Oper. Res. Lett., 2019
The α-spectral radius of uniform hypergraphs concerning degrees and domination number.
J. Comb. Optim., 2019
The clique-perfectness and clique-coloring of outer-planar graphs.
J. Comb. Optim., 2019
The eigenvectors to the p-spectral radius of general hypergraphs.
J. Comb. Optim., 2019
Maximally connected p-partite uniform hypergraphs.
Discret. Appl. Math., 2019
The extremal <i>α</i>-index of outerplanar and planar graphs.
Appl. Math. Comput., 2019
The position value and the structures of graphs.
Appl. Math. Comput., 2019
2018
The connected <i>p</i>-center problem on cactus graphs.
Theor. Comput. Sci., 2018
The w-centroids and least w-central subtrees in weighted trees.
J. Comb. Optim., 2018
Algorithms for connected p-centdian problem on block graphs.
J. Comb. Optim., 2018
The degree value for games with communication structure.
Int. J. Game Theory, 2018
The Finite Projective Plane and the 5-Uniform Linear Intersecting Hypergraphs with Domination Number Four.
Graphs Comb., 2018
On the irregularity of uniform hypergraphs.
Eur. J. Comb., 2018
Trees with unique least central subtrees.
Discuss. Math. Graph Theory, 2018
Extremal hypergraphs for matching number and domination number.
Discret. Appl. Math., 2018
Domination in intersecting hypergraphs.
Discret. Appl. Math., 2018
The Matching Polynomials and Spectral Radii of Uniform Supertrees.
Electron. J. Comb., 2018
Sharp Lower Bounds on the Spectral Radius of Uniform Hypergraphs Concerning Degrees.
Electron. J. Comb., 2018
2017
Two efficient values of cooperative games with graph structure based on τ-values.
J. Comb. Optim., 2017
A linear-time algorithm for clique-coloring problem in circular-arc graphs.
J. Comb. Optim., 2017
Cost sharing on prices for games on graphs.
J. Comb. Optim., 2017
Matching and domination numbers in r-uniform hypergraphs.
J. Comb. Optim., 2017
The clique-transversal set problem in {claw, K<sub>4</sub>}-free planar graphs.
Inf. Process. Lett., 2017
Asymptotic sharpness of bounds on hypertrees.
Discuss. Math. Graph Theory, 2017
The Spectral Radius and Domination Number of Uniform Hypergraphs.
Proceedings of the Combinatorial Optimization and Applications, 2017
2016
Component-wise proportional solutions for communication graph games.
Math. Soc. Sci., 2016
Batching Scheduling in a Two-Level Supply Chain with Earliness and Tardiness Penalties.
J. Syst. Sci. Complex., 2016
An efficient algorithm for distance total domination in block graphs.
J. Comb. Optim., 2016
3-Factor-Criticality in Double Domination Edge Critical Graphs.
Graphs Comb., 2016
Clique-Perfectness of Claw-Free Planar Graphs.
Graphs Comb., 2016
Clique-Coloring Claw-Free Graphs.
Graphs Comb., 2016
Paired-domination in claw-free graphs with minimum degree at least four.
Ars Comb., 2016
w-Centroids and Least (w, l)-Central Subtrees in Weighted Trees.
Proceedings of the Combinatorial Optimization and Applications, 2016
The Connected p-Center Problem on Cactus Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2016
2015
Two paths location of a tree with positive or negative weights.
Theor. Comput. Sci., 2015
Coloring clique-hypergraphs of graphs with no subdivision of <sub>K</sub><sub>5</sub>.
Theor. Comput. Sci., 2015
The clique-transversal set problem in claw-free graphs with degree at most 4.
Inf. Process. Lett., 2015
Signed mixed dominating functions in complete bipartite graphs.
Int. J. Comput. Math., 2015
Constructing the minimum dominating sets of generalized de Bruijn digraphs.
Discret. Math., 2015
Upper signed k-domination number in graphs.
Ars Comb., 2015
The Connected p-Centdian Problem on Block Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2015
2014
A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs.
Theor. Comput. Sci., 2014
Clique-transversal sets and clique-coloring in planar graphs.
Eur. J. Comb., 2014
On the numbers of cut-vertices and end-blocks in 4-regular graphs.
Discuss. Math. Graph Theory, 2014
Independent sets in {claw, K<sub>4</sub>}-free 4-regular graphs.
Discret. Math., 2014
The 2-maxian problem on cactus graphs.
Discret. Optim., 2014
2013
Paired-Domination in Claw-Free Graphs.
Graphs Comb., 2013
Signed total k-domination in graphs.
Ars Comb., 2013
Signed total domination on Kronecker products of two complete graphs.
Australas. J Comb., 2013
2012
Perfect matchings in paired domination vertex critical graphs.
J. Comb. Optim., 2012
On the super connectivity of Kronecker products of graphs.
Inf. Process. Lett., 2012
The signed maximum-clique transversal number of regular graphs.
Int. J. Comput. Math., 2012
The k-tuple twin domination in generalized de Bruijn and Kautz networks.
Comput. Math. Appl., 2012
2011
A note on the upper bound for the paired-domination number of a graph with minimum degree at least two.
Networks, 2011
Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs.
Inf. Process. Lett., 2011
The Signed Total Domination Number of Graphs.
Ars Comb., 2011
Claw-free cubic graphs with clique-transversal number half of their order.
Appl. Math. Lett., 2011
2010
On the k-tuple domination of generalized de Brujin and Kautz digraphs.
Inf. Sci., 2010
Signed clique-transversal functions in graphs.
Int. J. Comput. Math., 2010
On characterization of uniquely 3-list colorable complete multipartite graphs.
Discuss. Math. Graph Theory, 2010
Some matching properties in 4-gamma<sub>×2</sub>-critical graphs.
Comput. Math. Appl., 2010
2009
The twin domination number in generalized de Bruijn digraphs.
Inf. Process. Lett., 2009
Matching Properties in Total Domination Vertex Critical Graphs.
Graphs Comb., 2009
Total Restrained Domination in Cubic Graphs.
Graphs Comb., 2009
Upper bounds on the upper signed total domination number of graphs.
Discret. Appl. Math., 2009
A polynomial-time algorithm for the paired-domination problem on permutation graphs.
Discret. Appl. Math., 2009
Minus Edge Domination in Graphs.
Ars Comb., 2009
Upper minus total domination of a 5-regular graph.
Ars Comb., 2009
An upper bound on the restrained domination number of graphs.
Ars Comb., 2009
2008
Clique-transversal Number in Cubic Graphs.
Discret. Math. Theor. Comput. Sci., 2008
Remarks on the minus (signed) total domination in graphs.
Discret. Math., 2008
On matching and total domination in graphs.
Discret. Math., 2008
An application of the Turán theorem to domination in graphs.
Discret. Appl. Math., 2008
Proof of a conjecture on k-tuple domination in graphs.
Appl. Math. Lett., 2008
2007
Erratum to: "A linear vizing-like relation relating the size and total domination number of a graph".
J. Graph Theory, 2007
Absorbant of generalized de Bruijn digraphs.
Inf. Process. Lett., 2007
Upper minus total domination in small-degree regular graphs.
Discret. Math., 2007
Bondage number in oriented graphs.
Ars Comb., 2007
The algorithmic complexity of the minus clique-transversal problem.
Appl. Math. Comput., 2007
Clique-Transversal Sets in Cubic Graphs.
Proceedings of the Combinatorics, 2007
2006
Power domination in block graphs.
Theor. Comput. Sci., 2006
Acyclic domination on bipartite permutation graphs.
Inf. Process. Lett., 2006
Total minus domination in k-partite graphs.
Discret. Math., 2006
2005
A note on domination and minus domination numbers in cubic graphs.
Appl. Math. Lett., 2005
2004
A note on balance vertices in trees.
Discret. Math., 2004
A note on Nordhaus-Gaddum inequalities for domination.
Discret. Appl. Math., 2004
A characterization of trees with equal total domination and paired-domination numbers.
Australas. J Comb., 2004
2003
Lower bounds on the minus domination and k-subdomination numbers.
Theor. Comput. Sci., 2003
Upper bounds on signed 2-independence number of graphs.
Ars Comb., 2003
2002
Upper bounds for the <i>k</i>-subdomination number of graphs.
Discret. Math., 2002
2000
Lower bounds on dominating functions in graphs.
Ars Comb., 2000
