534 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- The University of Texas at AustinUS63 papers
- University of MessinaIT62 papers
- Aligarh Muslim UniversityIN61 papers
- Central China Normal UniversityCN61 papers
- Czech Technical University in PragueCZ61 papers
- European Organization for Nuclear ResearchCH61 papers
- Goethe University FrankfurtDE61 papers
- Heidelberg UniversityDE61 papers
- Homi Bhabha National InstituteIN61 papers
- Horia Hulubei National Institute for R and D in Physics and Nuclear EngineeringRO61 papers
- Lawrence Berkeley National LaboratoryUS61 papers
- Sungkyunkwan UniversityKR61 papers
3 papers · 1 filter
On long arithmetic progressions in binary Morse-like words
Ibai Aedo, Uwe Grimm, Yasushi Nagai +1
We present results on the existence of long arithmetic progressions in the Thue-Morse word and in a class of generalised Thue-Morse words. Our arguments are inspired by van der Wae…
Infinitely many minimal classes of graphs of unbounded clique-width
A. Collins, J. Foniok, N. Korpelainen +2
The celebrated theorem of Robertson and Seymour states that in the family of minor-closed graph classes, there is a unique minimal class of graphs of unbounded tree-width, namely,…
Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique
Aistis Atminas, Robert Brignall, Nicholas Korpelainen +2
We consider well-quasi-order for classes of permutation graphs which omit both a path and a clique. Our principle result is that the class of permutation graphs omitting and…