| Publication | Date of Publication | Type |
|---|
| Generalized ARRIVAL problem for rotor walks in path multigraphs | 2024-10-23 | Paper |
Nonatomic non-cooperative neighbourhood balancing games
Fundamenta Informaticae | 2024-10-07 | Paper |
| Polynomial time algorithm for ARRIVAL on tree-like multigraphs | 2024-08-06 | Paper |
A generic strategy improvement method for simple stochastic games
(available as arXiv preprint) | 2023-08-08 | Paper |
scientific article; zbMATH DE number 7559118 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Maximum size of a minimum watching system and the graphs achieving the bound
Discrete Applied Mathematics | 2015-09-22 | Paper |
Watching systems in graphs: an extension of identifying codes
Discrete Applied Mathematics | 2014-04-16 | Paper |
Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Sphere coverings and identifying codes
Designs, Codes and Cryptography | 2014-02-25 | Paper |
Identifying codes in trees and planar graphs
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Watching systems in the King grid
Graphs and Combinatorics | 2013-06-26 | Paper |
The frontier of decidability in partially observable recursive games
International Journal of Foundations of Computer Science | 2013-06-06 | Paper |
Combinatorial identification problems and graph powers
4OR | 2012-03-23 | Paper |
On the sizes of graphs and their powers: the undirected case
Discrete Applied Mathematics | 2011-10-27 | Paper |
| On the sizes of the graphs \(G\), \(G^r\), \(G^r\setminus G\): the directed case | 2011-05-31 | Paper |
Complexity results for identifying codes in planar graphs
International Transactions in Operational Research | 2011-05-20 | Paper |
On the existence of a cycle of length at least 7 in a \((1,\leq 2)\)-twin-free graph
Discussiones Mathematicae Graph Theory | 2011-05-09 | Paper |
Minimal identifying codes in trees and planar graphs with large girth
European Journal of Combinatorics | 2010-06-17 | Paper |
Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs
Advances in Mathematics of Communications | 2010-03-10 | Paper |
Erratum to ``Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs.
Advances in Mathematics of Communications | 2010-03-08 | Paper |
Induced paths in twin-free graphs
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Induced paths in twin-free graphs
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
