151 citations · 162 across the 12 of their papers we have counts for
16 papers
An improvement on the bound for the acyclic chromatic index
Lefteris Kirousis, John Livieratos, Alexandros Singh
The acyclic chromatic index (or acyclic edge-chromatic number) of a graph is the least number of colors needed to properly color its edges so that none of its cycles has only two c…
Perception, performance, and detectability of conversational artificial intelligence across 32 university courses
Hazem Ibrahim, Fengyuan Liu, Rohail Asim +36
The emergence of large language models has led to the development of powerful tools such as ChatGPT that can produce text indistinguishable from human-generated work. With the incr…
Improved bounds for acyclic coloring parameters
Lefteris Kirousis, John Livieratos
The {\em acyclic chromatic number} of a graph is the least number of colors needed to properly color its vertices so that none of its cycles has only two colors. The {\em acyclic c…
An Improved Bound of Acyclic Vertex-Coloring
Lefteris Kirousis, John Livieratos
The acyclic chromatic number of a graph is the least number of colors needed to properly color its vertices so that none of its cycles has only two colors. We show that for all $α>…
The Acyclic Chromatic Index is Less than the Double of the Max Degree
Lefteris Kirousis, John Livieratos
The acyclic chromatic index of a graph is the least number of colors needed to properly color its edges so that none of its cycles is bichromatic. In this work, we show that $2…
Algorithmically Efficient Syntactic Characterization of Possibility Domains
Josep Díaz, Lefteris Kirousis, Sofia Kokonezi +1
In the field of Judgment Aggrgation, a domain, that is a subset of a Cartesian power of , is considered to reflect abstract rationality restrictions on vectors of two-valu…