2025
Complexity of Maker-Breaker games on edge sets of graphs.
Discret. Appl. Math., 2025
2024
Bipartite instances of INFLUENCE.
Theor. Comput. Sci., January, 2024
Neighbourhood complexity of graphs of bounded twin-width.
Eur. J. Comb., January, 2024
Smash and grab: The 0 ⋅ 6 scoring game on graphs.
Theor. Comput. Sci., 2024
On Three Domination-based Identification Problems in Block Graphs.
Fundam. Informaticae, 2024
The Maker-Maker domination game in forests.
Discret. Appl. Math., 2024
Partition strategies for the Maker-Breaker domination game.
CoRR, 2024
Proceedings of the 12th International Conference on Fun with Algorithms, 2024
2023
Locating-dominating sets in local tournaments.
Discret. Appl. Math., October, 2023
Locating-dominating sets: From graphs to oriented graphs.
Discret. Math., 2023
Metric Dimension Parameterized by Treewidth in Chordal Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023
2022
The neighbour sum distinguishing relaxed edge colouring.
Appl. Math. Comput., 2022
2021
influence: A partizan scoring game on graphs.
Theor. Comput. Sci., 2021
Metric dimension on sparse graphs and its applications to zero forcing sets.
CoRR, 2021
Partizan Subtraction Games.
CoRR, 2021
2020
Taking-and-merging games as rewrite games.
Discret. Math. Theor. Comput. Sci., 2020
Maker-Breaker domination game.
Discret. Math., 2020
Domination and location in twin-free digraphs.
Discret. Appl. Math., 2020
2019
Connected Subtraction Games on Subdivided Stars.
Integers, 2019
Identification of points using disks.
Discret. Math., 2019
2018
The switch operators and push-the-button games: A sequential compound over rulesets.
Theor. Comput. Sci., 2018
Octal games on graphs: The game 0.33 on subdivided stars and bistars.
Theor. Comput. Sci., 2018
Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension.
SIAM J. Discret. Math., 2018
Int. J. Game Theory, 2018
On three domination numbers in block graphs.
CoRR, 2018
2017
Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds.
Theor. Comput. Sci., 2017
Deciding game invariance.
Inf. Comput., 2017
A Vizing-like theorem for union vertex-distinguishing edge coloring.
Discret. Appl. Math., 2017
Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity.
Algorithmica, 2017
Token Jumping in Minor-Closed Classes.
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017
2015
Identifying Codes in Hereditary Classes of Graphs and VC-Dimension.
SIAM J. Discret. Math., 2015
A New Approach to the 2-Regularity of the ℓ-Abelian Complexity of 2-Automatic Sequences.
Electron. J. Comb., 2015
Identifying Codes in Vertex-Transitive Graphs and Strongly Regular Graphs.
Electron. J. Comb., 2015
Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015
2014
Identifying codes in vertex-transitive graphs.
CoRR, 2014
Identification, location-domination and metric dimension on interval and permutation graphs.
CoRR, 2014
An improved lower bound for (1, ≤ 2)-identifying codes in the king grid.
Adv. Math. Commun., 2014
2013
Tolerant identification with Euclidean balls.
Networks, 2013
Identifying Codes in Line Graphs.
J. Graph Theory, 2013
Characterizing Extremal Digraphs for Identifying Codes and Extremal Cases of Bondy's Theorem on Induced Subsets.
Graphs Comb., 2013
Acyclic edge-coloring using entropy compression.
Eur. J. Comb., 2013
New results on variants of covering codes in Sierpiński graphs.
Des. Codes Cryptogr., 2013
Locally identifying coloring in bounded expansion classes of graphs.
Discret. Appl. Math., 2013
2012
Locally identifying colourings for graphs with given maximum degree.
Discret. Math., 2012
Locally Identifying Coloring of Graphs.
Electron. J. Comb., 2012
Codes for locating objects in sensor networks.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012
2011
Electron. Notes Discret. Math., 2011
Extremal graphs for the identifying code problem.
Eur. J. Comb., 2011
On two variations of identifying codes.
Discret. Math., 2011
2010
Extremal problems on identifying codes in digraphs and Bondy's theorem on induced subsets
CoRR, 2010