| Publication | Date of Publication | Type |
|---|
Exchange, adopt, evolve: modeling the spreading of opinions through cognition and interaction in a social network
Information Sciences | 2022-04-14 | Paper |
Infinite and bi-infinite words with decidable monadic theories
(available as arXiv preprint) | 2018-09-06 | Paper |
| Infinite and bi-infinite words with decidable monadic theories | 2017-08-31 | Paper |
Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals
Algorithmica | 2016-12-21 | Paper |
Decision Problems for Finite Automata over Infinite Algebraic Structures
Implementation and Application of Automata | 2016-11-09 | Paper |
A game of attribute decomposition for software architecture design
Theoretical Aspects of Computing - ICTAC 2015 | 2016-02-25 | Paper |
Dynamic interval scheduling for multiple machines
Algorithms and Computation | 2015-09-11 | Paper |
Dynamic algorithms for monotonic interval scheduling problem
Theoretical Computer Science | 2014-12-02 | Paper |
Dynamising Interval Scheduling: The Monotonic Case
Lecture Notes in Computer Science | 2014-01-17 | Paper |
A polychromatic Ramsey theory for ordinals
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
The isomorphism problem on classes of automatic structures with transitive relations
Transactions of the American Mathematical Society | 2013-09-04 | Paper |
Tree-automatic well-founded trees
Logical Methods in Computer Science | 2013-07-09 | Paper |
The isomorphism problem for \(\omega \)-automatic trees
Annals of Pure and Applied Logic | 2012-11-20 | Paper |
On state complexity of finite word and tree languages
Developments in Language Theory | 2012-11-02 | Paper |
Tree-automatic well-founded trees
Lecture Notes in Computer Science | 2012-08-14 | Paper |
Finite automata over structures (extended abstract)
Lecture Notes in Computer Science | 2012-07-16 | Paper |
| Efficient algorithms for games played on trees with back-edges | 2012-03-22 | Paper |
Extracting winning strategies in update games
Models of Computation in Context | 2011-09-09 | Paper |
On complexity of Ehrenfeucht-Fraïssé games
Annals of Pure and Applied Logic | 2011-08-26 | Paper |
Deciding the isomorphism problem in classes of unary automatic structures
Theoretical Computer Science | 2011-04-05 | Paper |
The isomorphism problem for \(\omega \)-automatic trees
Computer Science Logic | 2010-09-03 | Paper |
A Dynamic Algorithm for Reachability Games Played on Trees
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Analysing Complexity in Classes of Unary Automatic Structures
Language and Automata Theory and Applications | 2009-04-02 | Paper |
Unary automatic graphs: an algorithmic perspective
Mathematical Structures in Computer Science | 2009-03-24 | Paper |
Computable Categoricity of Graphs with Finite Components
Logic and Theory of Algorithms | 2008-06-19 | Paper |
Unary Automatic Graphs: An Algorithmic Perspective
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Unary Automatic Graphs: An Algorithmic Perspective
Lecture Notes in Computer Science | 2008-05-27 | Paper |
On Complexity of Ehrenfeucht-Fraïssé Games
Logical Foundations of Computer Science | 2008-01-04 | Paper |
