Bojan Basic

Orcid: 0000-0002-1607-7139

Affiliations:
  • University of Novi Sad, Serbia


According to our database1, Bojan Basic authored at least 20 papers between 2012 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Hackenforb the chameleon: A game capable of mimicking (practically) any misère game.
Theor. Comput. Sci., 2026

The optimal upper bound on the MP-ratio for quaternary words.
Adv. Appl. Math., 2026

2025
Seeing is not believing in limited visibility cops and robbers.
CoRR, July, 2025

The existence of hypersolids in $\mathbb{E}^d$ whose Heesch number is $d-1$.
Contributions Discret. Math., 2025

On emulational equivalence of impartial games and the game Hackenforb.
Contributions Discret. Math., 2025

And Now There Are Four: Another Brick in the Wall of the Optimal Upper Bound on the MP-Ratio.
Proceedings of the Combinatorics on Words - 15th International Conference, 2025

2024
Categories of impartial rulegraphs and gamegraphs.
Int. J. Game Theory, December, 2024

On finite models of Hilbert's incidence geometry.
Discret. Math., 2024

2023
Solutions to Seven and a Half Problems on Tilings.
Electron. J. Comb., 2023

2022
Asymptotical Unboundedness of the Heesch Number in ${\mathbb {E}}^d$ for $d\rightarrow \infty $.
Discret. Comput. Geom., 2022

On a theorem concerning partially overlapping subpalindromes of a binary word.
Adv. Appl. Math., 2022

2021
On generalized highly potential words.
Theor. Comput. Sci., 2021

On highly palindromic words: The n-ary case.
Discret. Appl. Math., 2021

2020
On highly palindromic words: The ternary case.
Discret. Appl. Math., 2020

2018
On optimal piercing of a square.
Discret. Appl. Math., 2018

2015
On absorption in semigroups and n-ary semigroups.
Log. Methods Comput. Sci., 2015

2013
On highly potential words.
Eur. J. Comb., 2013

2012
Palindromes in finite and infinite words ; Palindromi u konačnim i beskonačnim rečima.
PhD thesis, 2012

A note on the paper "On Brlek-Reutenauer conjecture".
Theor. Comput. Sci., 2012

Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words.
Discret. Appl. Math., 2012


  Loading...