# :newspaper:[lt]Naujienos[/lt][en]News[/en] [spoiler=open: :loudspeaker: [lt]Dirbtinio intelekto metodų laboratorija ieško postdoc[/lt][en]Artificial Intelligence Methods Lab is looking for postdocs[/en]] :loudspeaker: Artificial Intelligence Methods Lab is looking for [MSCA-PF Candidates](n/11dc8a61a9810762f93c52a11d94e7e69275c68e) :calendar: *Date posted*: 2026-05-19 [/spoiler] [spoiler=open: :loudspeaker: [lt]Kibernetinio saugumo laboratorija ieško postdoc[/lt][en]Cybersecurity Lab is looking for postdocs [/en]] :loudspeaker: Cybersecurity Lab is looking for postdocs [MSCA-PF Candidates](n/44a2d6522e7e241e6fce76ae56c15228f6a6c7f7) :calendar: *Date posted*: 2026-05-01 [/spoiler] [spoiler=open: :calendar: 2026-05-21, 10:30 [lt]Informatikos mokslo mugė[/lt][en]Science Fair: Exchange of ideas in Computer Science[/en]] :::en **Research Conference/Fair** :compass: Institute of Computer Science, Didlaukio 47, Vilnius, aula: D101 The Institute of Computer Science is inviting you to visit a Science Fair: Exchange of ideas in Computer Science on May 21st at Didlaukio str. 47, 10:30-16:00. :loudspeaker: This year, we have more than 20 student posters and two keynote lectures. Most of them relate to current concerns within the computer science community: cybersecurity, LLMs, and AI agents. **Agenda:** - 10:30 Student posters. Session I (1st floor) - 12:00 - 12:40 Machine Psychology in the age of LLM, Prof. Stefan Sütterlin, Germany. (room 101) - Coffee break - 13:00 - 13:40 Hacker Stories. Industrial partner (Faculty Alumni). - 13:45-15:15 Student posters. Session II (1st floor) - 15:40 - Best poster award Stakeholders, students, the academic and professional communities, and all interested parties are invited to discuss the topics and participate in the public lectures. ::: :::lt **Mokslo mugė** :compass: Informatikos institutas, Didlaukio 47, Vilnius, D101 Informatikos institutas kviečia jus apsilankyti mokslo mugėje „Idėjų mainai informatikos srityje“, kuri vyks gegužės 21 d. Didlaukio g. 47, 10:30–16:00 val. :loudspeaker: Šiais metais turime daugiau nei 20 studentų plakatų ir dvi kviestines paskaitas. Dauguma jų susiję su informatikų bendruomenei aktualiais klausimais: kibernetiniu saugumu, didžiaisiais kalbų modeliais (LLM) ir dirbtinio intelekto agentais. Renginio kalba - anglų. **Programa:** - 10:30 Studentų plakatai. I sesija (1 aukštas) - 12:00–12:40 Mašinų psichologija didžiųjų kalbos modelių (LLM) amžiuje, prof. Stefan Sütterlin, Vokietija. (101 auditorija) - Kavos pertrauka - 13:00–13:40 Hakerio istorijos. Verslo partneris (fakulteto alumni). - 13:45–15:15 Studentų plakatai. II sesija (1 aukštas) - 15:40 – Geriausių darbų apdovanojimas Socialiniai partreniai, studentai, akademinė ir profesinė bendruomenės bei visi suinteresuoti asmenys kviečiami neformalioms diskusijoms su dalyviais ir dalyvauti viešosiose paskaitose. ::: [/spoiler] ## [lt]Instituto seminarai[/lt][en]Institute seminars[/en] [spoiler= :calendar: 2026-05-13 16:00- 17:00 [lt]Informatikos instituto mokslo seminaras[/lt][en]Research seminar[/en]] :compass: Institute of Computer Science, Didlaukio 47, Vilnius, aula: D103 :clapper_board: [Teams](https://teams.microsoft.com/l/message/19:052a76392e014268b7a312486dee8842@thread.tacv2/1778607184997?tenantId=82c51a82-548d-43ca-bcf9-bf4b7eb1d012&groupId=4c9ae7ba-91ca-44ad-ae64-98afb0563095&parentMessageId=1778607184997&teamName=II%20Seminaras&channelName=General&createdTime=1778607184997) **[lt]Pranešėjas[/lt][en]Presenter[/en]:** Léa Bou Dagher (Université Claude Bernard Lyon 1, :flag_france:) **[lt]Tema[/lt][en]Topic[/en]:** *Biogeometric analysis of 3D protein structures using persistent homology* **[lt]Santrauka[/lt][en]Abstract[/en]:** > With the development of digital tools and the tremendous increase in storage resources and computational power, data production is exploding in many fields such as science, engineering, and healthcare. The challenge lies in analyzing these data both qualitatively and quantitatively, using a variety of approaches. One such approach is topological data analysis, which makes it possible to process very large datasets and highlight the most significant aspects of their structure. In particular, persistent homology, derived from algebraic topology, provides efficient and robust algorithms for the exploration, topological analysis, and comparison of high-dimensional datasets, represented by point clouds, by associating them with topological invariants. In this talk, I will present the principles of persistent homology and its applications to the study of proteins. Specifically, I will explain how persistent homology can be used to investigate the 3D structures of proteins and the information they contain, including their evolutionary history and their adaptation to environmental conditions. [Stebėkite kitus seminarus / Follow for more ...](https://klevas.mif.vu.lt/~bloznelis/seminarai/II_seminaras_2020+.htm) [/spoiler] [spoiler=:calendar: 2026-04-15, 16:00- 17:00. [lt] Informatikos instituto mokslo seminaras[/lt][en]Research seminar [/en]] :compass: Institute of Computer Science, Didlaukio 47, Vilnius, aula: D103 :clapper_board: [Teams](https://teams.microsoft.com/l/team/19%3A052a76392e014268b7a312486dee8842%40thread.tacv2/conversations?groupId=4c9ae7ba-91ca-44ad-ae64-98afb0563095&tenantId=82c51a82-548d-43ca-bcf9-bf4b7eb1d012) **[lt]Pranešėjas[/lt][en]Presenter[/en]:** Tomáš Masařík (Warsaw university, :flag_poland:) **[lt]Tema[/lt][en]Topic[/en]:** *Separator Theorem for Minor-free Graphs in Linear Time* **[lt]Santrauka[/lt][en]Abstract[/en]:** > The planar separator theorem by Lipton and Tarjan [FOCS '77, SIAM Journal on Applied Mathematics '79] states that any planar graph with $n$ vertices has a balanced separator of size $O(\sqrt{n})$ that can be found in linear time. This landmark result kicked off decades of research on designing linear or nearly linear-time algorithms on planar graphs. In an attempt to generalize Lipton-Tarjan's theorem to nonplanar graphs, Alon, Seymour, and Thomas [STOC '90, Journal of the AMS '90] showed that any minor-free graph admits a balanced separator of size $O(\sqrt{n})$ that can be found in $O(n^{3/2})$ time. The superlinear running time in their separator theorem is a key bottleneck for generalizing algorithmic results from planar to minor-free graphs. Despite extensive research for more than two decades, finding a balanced separator of size $O(\sqrt{n})$ in (linear) $O(n)$ time for minor-free graphs remains a major open problem. Known algorithms either give a separator of size much larger than $O(\sqrt{n})$ or have superlinear running time, or both. In this paper, we answer the open problem affirmatively. Our algorithm is very simple: it runs a vertex-weighted variant of breadth-first search (BFS) a constant number of times on the input graph. Our key technical contribution is a weighting scheme on the vertices to guide the search for a balanced separator, offering a new connection between the size of a balanced separator and the existence of a clique-minor model. We believe that our weighting scheme may be of independent interest. This is a joint work with Édouard Bonnet, Tuukka Korhonen, Hung Le, and Jason Li. [Stebėkite kitus seminarus / Follow for more ...](https://klevas.mif.vu.lt/~bloznelis/seminarai/II_seminaras_2020+.htm) [/spoiler]